./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/loopv3.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5fbdf5bf Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops-crafted-1/loopv3.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9ebaec521ed2c9582e10a9f9cb6fcb8959383ae8 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-09-13 14:12:27,451 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-09-13 14:12:27,453 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-09-13 14:12:27,479 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-09-13 14:12:27,480 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-09-13 14:12:27,483 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-09-13 14:12:27,484 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-09-13 14:12:27,489 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-09-13 14:12:27,490 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-09-13 14:12:27,494 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-09-13 14:12:27,505 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-09-13 14:12:27,510 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-09-13 14:12:27,510 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-09-13 14:12:27,511 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-09-13 14:12:27,511 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-09-13 14:12:27,512 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-09-13 14:12:27,513 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-09-13 14:12:27,516 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-09-13 14:12:27,517 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-09-13 14:12:27,518 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-09-13 14:12:27,519 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-09-13 14:12:27,521 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-09-13 14:12:27,525 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-09-13 14:12:27,526 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-09-13 14:12:27,530 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-09-13 14:12:27,530 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-09-13 14:12:27,531 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-09-13 14:12:27,531 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-09-13 14:12:27,532 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-09-13 14:12:27,532 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-09-13 14:12:27,532 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-09-13 14:12:27,533 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-09-13 14:12:27,533 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-09-13 14:12:27,534 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-09-13 14:12:27,535 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-09-13 14:12:27,535 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-09-13 14:12:27,536 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-09-13 14:12:27,536 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-09-13 14:12:27,536 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-09-13 14:12:27,536 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-09-13 14:12:27,537 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-09-13 14:12:27,538 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-09-13 14:12:27,566 INFO L113 SettingsManager]: Loading preferences was successful [2021-09-13 14:12:27,566 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-09-13 14:12:27,566 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-09-13 14:12:27,566 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-09-13 14:12:27,567 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-09-13 14:12:27,567 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-09-13 14:12:27,568 INFO L138 SettingsManager]: * Use SBE=true [2021-09-13 14:12:27,568 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-09-13 14:12:27,568 INFO L138 SettingsManager]: * sizeof long=4 [2021-09-13 14:12:27,568 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-09-13 14:12:27,568 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-09-13 14:12:27,568 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-09-13 14:12:27,569 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-09-13 14:12:27,569 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-09-13 14:12:27,569 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-09-13 14:12:27,569 INFO L138 SettingsManager]: * sizeof long double=12 [2021-09-13 14:12:27,569 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-09-13 14:12:27,569 INFO L138 SettingsManager]: * Use constant arrays=true [2021-09-13 14:12:27,569 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-09-13 14:12:27,570 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-09-13 14:12:27,570 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-09-13 14:12:27,570 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-09-13 14:12:27,570 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:12:27,570 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-09-13 14:12:27,570 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-09-13 14:12:27,571 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-09-13 14:12:27,571 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-09-13 14:12:27,571 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-09-13 14:12:27,571 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-09-13 14:12:27,571 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-09-13 14:12:27,571 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9ebaec521ed2c9582e10a9f9cb6fcb8959383ae8 [2021-09-13 14:12:27,816 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-09-13 14:12:27,830 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-09-13 14:12:27,832 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-09-13 14:12:27,832 INFO L271 PluginConnector]: Initializing CDTParser... [2021-09-13 14:12:27,833 INFO L275 PluginConnector]: CDTParser initialized [2021-09-13 14:12:27,834 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/loopv3.c [2021-09-13 14:12:27,880 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0529902a5/11b47d24709348b9882893154a539d3a/FLAG3b47761b5 [2021-09-13 14:12:28,218 INFO L306 CDTParser]: Found 1 translation units. [2021-09-13 14:12:28,219 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/loopv3.c [2021-09-13 14:12:28,223 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0529902a5/11b47d24709348b9882893154a539d3a/FLAG3b47761b5 [2021-09-13 14:12:28,672 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0529902a5/11b47d24709348b9882893154a539d3a [2021-09-13 14:12:28,674 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-09-13 14:12:28,676 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-09-13 14:12:28,677 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-09-13 14:12:28,677 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-09-13 14:12:28,679 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-09-13 14:12:28,680 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:12:28" (1/1) ... [2021-09-13 14:12:28,681 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@799f0e84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:12:28, skipping insertion in model container [2021-09-13 14:12:28,681 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:12:28" (1/1) ... [2021-09-13 14:12:28,687 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-09-13 14:12:28,696 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-09-13 14:12:28,814 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/loopv3.c[456,469] [2021-09-13 14:12:28,829 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:12:28,835 INFO L203 MainTranslator]: Completed pre-run [2021-09-13 14:12:28,843 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/loopv3.c[456,469] [2021-09-13 14:12:28,845 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:12:28,855 INFO L208 MainTranslator]: Completed translation [2021-09-13 14:12:28,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:12:28 WrapperNode [2021-09-13 14:12:28,856 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-09-13 14:12:28,856 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-09-13 14:12:28,857 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-09-13 14:12:28,857 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-09-13 14:12:28,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:12:28" (1/1) ... [2021-09-13 14:12:28,866 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:12:28" (1/1) ... [2021-09-13 14:12:28,899 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-09-13 14:12:28,900 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-09-13 14:12:28,900 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-09-13 14:12:28,900 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-09-13 14:12:28,906 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:12:28" (1/1) ... [2021-09-13 14:12:28,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:12:28" (1/1) ... [2021-09-13 14:12:28,907 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:12:28" (1/1) ... [2021-09-13 14:12:28,907 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:12:28" (1/1) ... [2021-09-13 14:12:28,910 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:12:28" (1/1) ... [2021-09-13 14:12:28,912 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:12:28" (1/1) ... [2021-09-13 14:12:28,922 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:12:28" (1/1) ... [2021-09-13 14:12:28,924 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-09-13 14:12:28,925 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-09-13 14:12:28,926 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-09-13 14:12:28,926 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-09-13 14:12:28,927 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:12:28" (1/1) ... [2021-09-13 14:12:28,932 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:12:28,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:12:28,966 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-09-13 14:12:28,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-09-13 14:12:29,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-09-13 14:12:29,006 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-09-13 14:12:29,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-09-13 14:12:29,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-09-13 14:12:29,221 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-09-13 14:12:29,221 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-09-13 14:12:29,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:12:29 BoogieIcfgContainer [2021-09-13 14:12:29,223 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-09-13 14:12:29,224 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-09-13 14:12:29,224 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-09-13 14:12:29,226 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-09-13 14:12:29,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 02:12:28" (1/3) ... [2021-09-13 14:12:29,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@260a9f20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:12:29, skipping insertion in model container [2021-09-13 14:12:29,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:12:28" (2/3) ... [2021-09-13 14:12:29,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@260a9f20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:12:29, skipping insertion in model container [2021-09-13 14:12:29,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:12:29" (3/3) ... [2021-09-13 14:12:29,229 INFO L111 eAbstractionObserver]: Analyzing ICFG loopv3.c [2021-09-13 14:12:29,239 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-09-13 14:12:29,240 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-09-13 14:12:29,295 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-09-13 14:12:29,303 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-09-13 14:12:29,304 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-09-13 14:12:29,316 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:29,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-09-13 14:12:29,319 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:12:29,319 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-09-13 14:12:29,320 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:12:29,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:12:29,323 INFO L82 PathProgramCache]: Analyzing trace with hash 889937703, now seen corresponding path program 1 times [2021-09-13 14:12:29,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:12:29,342 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980050557] [2021-09-13 14:12:29,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:12:29,343 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:12:29,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:12:29,437 INFO L281 TraceCheckUtils]: 0: Hoare triple {15#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(9);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~SIZE~0 := 50000001; {15#true} is VALID [2021-09-13 14:12:29,438 INFO L281 TraceCheckUtils]: 1: Hoare triple {15#true} havoc main_#res;havoc main_#t~nondet7, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0;main_~j~0 := 0; {15#true} is VALID [2021-09-13 14:12:29,438 INFO L281 TraceCheckUtils]: 2: Hoare triple {15#true} assume !true; {16#false} is VALID [2021-09-13 14:12:29,439 INFO L281 TraceCheckUtils]: 3: Hoare triple {16#false} main_~j~0 := (if main_~i~0 < 0 && 0 != main_~i~0 % 4 then 1 + main_~i~0 / 4 else main_~i~0 / 4);__VERIFIER_assert_#in~cond := (if 4 * main_~j~0 == main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {16#false} is VALID [2021-09-13 14:12:29,439 INFO L281 TraceCheckUtils]: 4: Hoare triple {16#false} assume 0 == __VERIFIER_assert_~cond; {16#false} is VALID [2021-09-13 14:12:29,439 INFO L281 TraceCheckUtils]: 5: Hoare triple {16#false} assume !false; {16#false} is VALID [2021-09-13 14:12:29,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:12:29,440 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:12:29,440 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980050557] [2021-09-13 14:12:29,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980050557] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:12:29,441 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:12:29,441 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-09-13 14:12:29,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079060582] [2021-09-13 14:12:29,445 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-09-13 14:12:29,446 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:12:29,448 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:29,457 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:12:29,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-09-13 14:12:29,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:12:29,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-09-13 14:12:29,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-13 14:12:29,471 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:29,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:29,513 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2021-09-13 14:12:29,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-09-13 14:12:29,515 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-09-13 14:12:29,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:12:29,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:29,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 23 transitions. [2021-09-13 14:12:29,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:29,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 23 transitions. [2021-09-13 14:12:29,525 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 23 transitions. [2021-09-13 14:12:29,556 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:12:29,563 INFO L225 Difference]: With dead ends: 20 [2021-09-13 14:12:29,563 INFO L226 Difference]: Without dead ends: 8 [2021-09-13 14:12:29,566 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.03ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-13 14:12:29,571 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.09ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.35ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.54ms IncrementalHoareTripleChecker+Time [2021-09-13 14:12:29,573 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 13 Unknown, 0 Unchecked, 0.35ms Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 11.54ms Time] [2021-09-13 14:12:29,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2021-09-13 14:12:29,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2021-09-13 14:12:29,597 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:12:29,598 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:29,598 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:29,599 INFO L87 Difference]: Start difference. First operand 8 states. Second operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:29,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:29,601 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2021-09-13 14:12:29,601 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2021-09-13 14:12:29,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:12:29,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:12:29,602 INFO L74 IsIncluded]: Start isIncluded. First operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 8 states. [2021-09-13 14:12:29,602 INFO L87 Difference]: Start difference. First operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 8 states. [2021-09-13 14:12:29,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:29,603 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2021-09-13 14:12:29,603 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2021-09-13 14:12:29,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:12:29,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:12:29,604 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:12:29,604 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:12:29,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:29,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2021-09-13 14:12:29,610 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2021-09-13 14:12:29,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:12:29,610 INFO L470 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2021-09-13 14:12:29,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:29,611 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2021-09-13 14:12:29,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-09-13 14:12:29,612 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:12:29,612 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-09-13 14:12:29,612 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-09-13 14:12:29,613 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:12:29,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:12:29,616 INFO L82 PathProgramCache]: Analyzing trace with hash 889639793, now seen corresponding path program 1 times [2021-09-13 14:12:29,617 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:12:29,617 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456220050] [2021-09-13 14:12:29,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:12:29,618 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:12:29,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:12:29,736 INFO L281 TraceCheckUtils]: 0: Hoare triple {69#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(9);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~SIZE~0 := 50000001; {71#(<= 50000001 ~SIZE~0)} is VALID [2021-09-13 14:12:29,737 INFO L281 TraceCheckUtils]: 1: Hoare triple {71#(<= 50000001 ~SIZE~0)} havoc main_#res;havoc main_#t~nondet7, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0;main_~j~0 := 0; {72#(and (= ULTIMATE.start_main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:29,738 INFO L281 TraceCheckUtils]: 2: Hoare triple {72#(and (= ULTIMATE.start_main_~i~0 0) (<= 50000001 ~SIZE~0))} assume !(main_~i~0 < ~SIZE~0); {70#false} is VALID [2021-09-13 14:12:29,738 INFO L281 TraceCheckUtils]: 3: Hoare triple {70#false} main_~j~0 := (if main_~i~0 < 0 && 0 != main_~i~0 % 4 then 1 + main_~i~0 / 4 else main_~i~0 / 4);__VERIFIER_assert_#in~cond := (if 4 * main_~j~0 == main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {70#false} is VALID [2021-09-13 14:12:29,738 INFO L281 TraceCheckUtils]: 4: Hoare triple {70#false} assume 0 == __VERIFIER_assert_~cond; {70#false} is VALID [2021-09-13 14:12:29,738 INFO L281 TraceCheckUtils]: 5: Hoare triple {70#false} assume !false; {70#false} is VALID [2021-09-13 14:12:29,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:12:29,738 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:12:29,739 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456220050] [2021-09-13 14:12:29,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456220050] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:12:29,739 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:12:29,739 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-09-13 14:12:29,739 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019666083] [2021-09-13 14:12:29,740 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-09-13 14:12:29,740 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:12:29,740 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:29,749 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:12:29,750 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-13 14:12:29,750 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:12:29,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-13 14:12:29,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-09-13 14:12:29,751 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:29,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:29,810 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2021-09-13 14:12:29,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-09-13 14:12:29,811 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-09-13 14:12:29,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:12:29,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:29,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2021-09-13 14:12:29,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:29,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2021-09-13 14:12:29,819 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 16 transitions. [2021-09-13 14:12:29,837 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:12:29,838 INFO L225 Difference]: With dead ends: 14 [2021-09-13 14:12:29,838 INFO L226 Difference]: Without dead ends: 10 [2021-09-13 14:12:29,841 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.21ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-09-13 14:12:29,843 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 9 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.84ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.64ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.68ms IncrementalHoareTripleChecker+Time [2021-09-13 14:12:29,843 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 0 Invalid, 19 Unknown, 0 Unchecked, 1.64ms Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 22.68ms Time] [2021-09-13 14:12:29,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2021-09-13 14:12:29,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2021-09-13 14:12:29,851 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:12:29,852 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states. Second operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:29,852 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:29,853 INFO L87 Difference]: Start difference. First operand 10 states. Second operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:29,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:29,854 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2021-09-13 14:12:29,855 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2021-09-13 14:12:29,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:12:29,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:12:29,855 INFO L74 IsIncluded]: Start isIncluded. First operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 10 states. [2021-09-13 14:12:29,856 INFO L87 Difference]: Start difference. First operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 10 states. [2021-09-13 14:12:29,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:29,856 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2021-09-13 14:12:29,857 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2021-09-13 14:12:29,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:12:29,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:12:29,857 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:12:29,857 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:12:29,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:29,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2021-09-13 14:12:29,859 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2021-09-13 14:12:29,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:12:29,859 INFO L470 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2021-09-13 14:12:29,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:29,859 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2021-09-13 14:12:29,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-09-13 14:12:29,860 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:12:29,860 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:12:29,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-09-13 14:12:29,860 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:12:29,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:12:29,861 INFO L82 PathProgramCache]: Analyzing trace with hash 297538966, now seen corresponding path program 1 times [2021-09-13 14:12:29,862 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:12:29,862 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166546260] [2021-09-13 14:12:29,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:12:29,862 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:12:29,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:12:29,950 INFO L281 TraceCheckUtils]: 0: Hoare triple {122#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(9);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~SIZE~0 := 50000001; {124#(<= 50000001 ~SIZE~0)} is VALID [2021-09-13 14:12:29,950 INFO L281 TraceCheckUtils]: 1: Hoare triple {124#(<= 50000001 ~SIZE~0)} havoc main_#res;havoc main_#t~nondet7, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0;main_~j~0 := 0; {125#(and (= ULTIMATE.start_main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:29,951 INFO L281 TraceCheckUtils]: 2: Hoare triple {125#(and (= ULTIMATE.start_main_~i~0 0) (<= 50000001 ~SIZE~0))} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {125#(and (= ULTIMATE.start_main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:29,951 INFO L281 TraceCheckUtils]: 3: Hoare triple {125#(and (= ULTIMATE.start_main_~i~0 0) (<= 50000001 ~SIZE~0))} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {126#(<= (+ 49999997 ULTIMATE.start_main_~i~0) ~SIZE~0)} is VALID [2021-09-13 14:12:29,952 INFO L281 TraceCheckUtils]: 4: Hoare triple {126#(<= (+ 49999997 ULTIMATE.start_main_~i~0) ~SIZE~0)} assume !(main_~i~0 < ~SIZE~0); {123#false} is VALID [2021-09-13 14:12:29,952 INFO L281 TraceCheckUtils]: 5: Hoare triple {123#false} main_~j~0 := (if main_~i~0 < 0 && 0 != main_~i~0 % 4 then 1 + main_~i~0 / 4 else main_~i~0 / 4);__VERIFIER_assert_#in~cond := (if 4 * main_~j~0 == main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {123#false} is VALID [2021-09-13 14:12:29,952 INFO L281 TraceCheckUtils]: 6: Hoare triple {123#false} assume 0 == __VERIFIER_assert_~cond; {123#false} is VALID [2021-09-13 14:12:29,952 INFO L281 TraceCheckUtils]: 7: Hoare triple {123#false} assume !false; {123#false} is VALID [2021-09-13 14:12:29,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:12:29,953 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:12:29,953 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166546260] [2021-09-13 14:12:29,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166546260] provided 0 perfect and 1 imperfect interpolant sequences [2021-09-13 14:12:29,954 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25965970] [2021-09-13 14:12:29,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:12:29,954 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:12:29,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:12:29,969 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 14:12:29,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-09-13 14:12:30,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:12:30,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjunts are in the unsatisfiable core [2021-09-13 14:12:30,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:12:30,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:12:30,227 INFO L281 TraceCheckUtils]: 0: Hoare triple {122#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(9);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~SIZE~0 := 50000001; {124#(<= 50000001 ~SIZE~0)} is VALID [2021-09-13 14:12:30,228 INFO L281 TraceCheckUtils]: 1: Hoare triple {124#(<= 50000001 ~SIZE~0)} havoc main_#res;havoc main_#t~nondet7, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0;main_~j~0 := 0; {133#(and (<= ULTIMATE.start_main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:30,229 INFO L281 TraceCheckUtils]: 2: Hoare triple {133#(and (<= ULTIMATE.start_main_~i~0 0) (<= 50000001 ~SIZE~0))} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {133#(and (<= ULTIMATE.start_main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:30,230 INFO L281 TraceCheckUtils]: 3: Hoare triple {133#(and (<= ULTIMATE.start_main_~i~0 0) (<= 50000001 ~SIZE~0))} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {140#(and (<= ULTIMATE.start_main_~i~0 4) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:30,230 INFO L281 TraceCheckUtils]: 4: Hoare triple {140#(and (<= ULTIMATE.start_main_~i~0 4) (<= 50000001 ~SIZE~0))} assume !(main_~i~0 < ~SIZE~0); {123#false} is VALID [2021-09-13 14:12:30,230 INFO L281 TraceCheckUtils]: 5: Hoare triple {123#false} main_~j~0 := (if main_~i~0 < 0 && 0 != main_~i~0 % 4 then 1 + main_~i~0 / 4 else main_~i~0 / 4);__VERIFIER_assert_#in~cond := (if 4 * main_~j~0 == main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {123#false} is VALID [2021-09-13 14:12:30,230 INFO L281 TraceCheckUtils]: 6: Hoare triple {123#false} assume 0 == __VERIFIER_assert_~cond; {123#false} is VALID [2021-09-13 14:12:30,231 INFO L281 TraceCheckUtils]: 7: Hoare triple {123#false} assume !false; {123#false} is VALID [2021-09-13 14:12:30,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:12:30,231 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:12:30,318 INFO L281 TraceCheckUtils]: 7: Hoare triple {123#false} assume !false; {123#false} is VALID [2021-09-13 14:12:30,319 INFO L281 TraceCheckUtils]: 6: Hoare triple {123#false} assume 0 == __VERIFIER_assert_~cond; {123#false} is VALID [2021-09-13 14:12:30,319 INFO L281 TraceCheckUtils]: 5: Hoare triple {123#false} main_~j~0 := (if main_~i~0 < 0 && 0 != main_~i~0 % 4 then 1 + main_~i~0 / 4 else main_~i~0 / 4);__VERIFIER_assert_#in~cond := (if 4 * main_~j~0 == main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {123#false} is VALID [2021-09-13 14:12:30,319 INFO L281 TraceCheckUtils]: 4: Hoare triple {162#(< ULTIMATE.start_main_~i~0 ~SIZE~0)} assume !(main_~i~0 < ~SIZE~0); {123#false} is VALID [2021-09-13 14:12:30,320 INFO L281 TraceCheckUtils]: 3: Hoare triple {166#(< (+ ULTIMATE.start_main_~i~0 4) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {162#(< ULTIMATE.start_main_~i~0 ~SIZE~0)} is VALID [2021-09-13 14:12:30,321 INFO L281 TraceCheckUtils]: 2: Hoare triple {166#(< (+ ULTIMATE.start_main_~i~0 4) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {166#(< (+ ULTIMATE.start_main_~i~0 4) ~SIZE~0)} is VALID [2021-09-13 14:12:30,321 INFO L281 TraceCheckUtils]: 1: Hoare triple {173#(< 4 ~SIZE~0)} havoc main_#res;havoc main_#t~nondet7, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0;main_~j~0 := 0; {166#(< (+ ULTIMATE.start_main_~i~0 4) ~SIZE~0)} is VALID [2021-09-13 14:12:30,322 INFO L281 TraceCheckUtils]: 0: Hoare triple {122#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(9);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~SIZE~0 := 50000001; {173#(< 4 ~SIZE~0)} is VALID [2021-09-13 14:12:30,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:12:30,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25965970] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:12:30,322 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-09-13 14:12:30,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2021-09-13 14:12:30,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855020785] [2021-09-13 14:12:30,323 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-09-13 14:12:30,323 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:12:30,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:30,336 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:12:30,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-09-13 14:12:30,336 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:12:30,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-09-13 14:12:30,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2021-09-13 14:12:30,337 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:30,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:30,476 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2021-09-13 14:12:30,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-09-13 14:12:30,476 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-09-13 14:12:30,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:12:30,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:30,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 25 transitions. [2021-09-13 14:12:30,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:30,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 25 transitions. [2021-09-13 14:12:30,480 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 25 transitions. [2021-09-13 14:12:30,499 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:12:30,500 INFO L225 Difference]: With dead ends: 19 [2021-09-13 14:12:30,500 INFO L226 Difference]: Without dead ends: 15 [2021-09-13 14:12:30,500 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 85.11ms TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2021-09-13 14:12:30,501 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 14 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 49.79ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.04ms SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 50.87ms IncrementalHoareTripleChecker+Time [2021-09-13 14:12:30,501 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 0 Invalid, 47 Unknown, 0 Unchecked, 1.04ms Time], IncrementalHoareTripleChecker [16 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 50.87ms Time] [2021-09-13 14:12:30,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2021-09-13 14:12:30,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2021-09-13 14:12:30,510 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:12:30,510 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:30,510 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:30,510 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:30,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:30,511 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2021-09-13 14:12:30,511 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2021-09-13 14:12:30,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:12:30,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:12:30,512 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 15 states. [2021-09-13 14:12:30,512 INFO L87 Difference]: Start difference. First operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 15 states. [2021-09-13 14:12:30,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:30,513 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2021-09-13 14:12:30,513 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2021-09-13 14:12:30,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:12:30,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:12:30,513 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:12:30,513 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:12:30,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:30,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2021-09-13 14:12:30,514 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 8 [2021-09-13 14:12:30,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:12:30,514 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 19 transitions. [2021-09-13 14:12:30,521 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:30,521 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2021-09-13 14:12:30,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-09-13 14:12:30,521 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:12:30,521 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2021-09-13 14:12:30,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-09-13 14:12:30,737 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:12:30,737 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:12:30,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:12:30,738 INFO L82 PathProgramCache]: Analyzing trace with hash 742440183, now seen corresponding path program 1 times [2021-09-13 14:12:30,738 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:12:30,739 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897151411] [2021-09-13 14:12:30,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:12:30,739 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:12:30,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:12:30,807 INFO L281 TraceCheckUtils]: 0: Hoare triple {254#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(9);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~SIZE~0 := 50000001; {256#(<= 50000001 ~SIZE~0)} is VALID [2021-09-13 14:12:30,808 INFO L281 TraceCheckUtils]: 1: Hoare triple {256#(<= 50000001 ~SIZE~0)} havoc main_#res;havoc main_#t~nondet7, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0;main_~j~0 := 0; {257#(and (= ULTIMATE.start_main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:30,808 INFO L281 TraceCheckUtils]: 2: Hoare triple {257#(and (= ULTIMATE.start_main_~i~0 0) (<= 50000001 ~SIZE~0))} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {257#(and (= ULTIMATE.start_main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:30,809 INFO L281 TraceCheckUtils]: 3: Hoare triple {257#(and (= ULTIMATE.start_main_~i~0 0) (<= 50000001 ~SIZE~0))} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {258#(<= (+ ULTIMATE.start_main_~i~0 49999993) ~SIZE~0)} is VALID [2021-09-13 14:12:30,810 INFO L281 TraceCheckUtils]: 4: Hoare triple {258#(<= (+ ULTIMATE.start_main_~i~0 49999993) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {258#(<= (+ ULTIMATE.start_main_~i~0 49999993) ~SIZE~0)} is VALID [2021-09-13 14:12:30,810 INFO L281 TraceCheckUtils]: 5: Hoare triple {258#(<= (+ ULTIMATE.start_main_~i~0 49999993) ~SIZE~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {259#(<= (+ ULTIMATE.start_main_~i~0 49999985) ~SIZE~0)} is VALID [2021-09-13 14:12:30,811 INFO L281 TraceCheckUtils]: 6: Hoare triple {259#(<= (+ ULTIMATE.start_main_~i~0 49999985) ~SIZE~0)} assume !(main_~i~0 < ~SIZE~0); {255#false} is VALID [2021-09-13 14:12:30,811 INFO L281 TraceCheckUtils]: 7: Hoare triple {255#false} main_~j~0 := (if main_~i~0 < 0 && 0 != main_~i~0 % 4 then 1 + main_~i~0 / 4 else main_~i~0 / 4);__VERIFIER_assert_#in~cond := (if 4 * main_~j~0 == main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {255#false} is VALID [2021-09-13 14:12:30,811 INFO L281 TraceCheckUtils]: 8: Hoare triple {255#false} assume 0 == __VERIFIER_assert_~cond; {255#false} is VALID [2021-09-13 14:12:30,811 INFO L281 TraceCheckUtils]: 9: Hoare triple {255#false} assume !false; {255#false} is VALID [2021-09-13 14:12:30,811 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:12:30,812 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:12:30,812 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897151411] [2021-09-13 14:12:30,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897151411] provided 0 perfect and 1 imperfect interpolant sequences [2021-09-13 14:12:30,812 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230763249] [2021-09-13 14:12:30,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:12:30,812 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:12:30,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:12:30,813 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 14:12:30,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-09-13 14:12:30,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:12:30,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjunts are in the unsatisfiable core [2021-09-13 14:12:30,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:12:30,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:12:31,072 INFO L281 TraceCheckUtils]: 0: Hoare triple {254#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(9);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~SIZE~0 := 50000001; {256#(<= 50000001 ~SIZE~0)} is VALID [2021-09-13 14:12:31,074 INFO L281 TraceCheckUtils]: 1: Hoare triple {256#(<= 50000001 ~SIZE~0)} havoc main_#res;havoc main_#t~nondet7, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0;main_~j~0 := 0; {266#(and (<= ULTIMATE.start_main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:31,074 INFO L281 TraceCheckUtils]: 2: Hoare triple {266#(and (<= ULTIMATE.start_main_~i~0 0) (<= 50000001 ~SIZE~0))} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {266#(and (<= ULTIMATE.start_main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:31,075 INFO L281 TraceCheckUtils]: 3: Hoare triple {266#(and (<= ULTIMATE.start_main_~i~0 0) (<= 50000001 ~SIZE~0))} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {273#(and (<= ULTIMATE.start_main_~i~0 8) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:31,079 INFO L281 TraceCheckUtils]: 4: Hoare triple {273#(and (<= ULTIMATE.start_main_~i~0 8) (<= 50000001 ~SIZE~0))} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {273#(and (<= ULTIMATE.start_main_~i~0 8) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:31,079 INFO L281 TraceCheckUtils]: 5: Hoare triple {273#(and (<= ULTIMATE.start_main_~i~0 8) (<= 50000001 ~SIZE~0))} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {280#(and (<= ULTIMATE.start_main_~i~0 16) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:31,080 INFO L281 TraceCheckUtils]: 6: Hoare triple {280#(and (<= ULTIMATE.start_main_~i~0 16) (<= 50000001 ~SIZE~0))} assume !(main_~i~0 < ~SIZE~0); {255#false} is VALID [2021-09-13 14:12:31,080 INFO L281 TraceCheckUtils]: 7: Hoare triple {255#false} main_~j~0 := (if main_~i~0 < 0 && 0 != main_~i~0 % 4 then 1 + main_~i~0 / 4 else main_~i~0 / 4);__VERIFIER_assert_#in~cond := (if 4 * main_~j~0 == main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {255#false} is VALID [2021-09-13 14:12:31,080 INFO L281 TraceCheckUtils]: 8: Hoare triple {255#false} assume 0 == __VERIFIER_assert_~cond; {255#false} is VALID [2021-09-13 14:12:31,080 INFO L281 TraceCheckUtils]: 9: Hoare triple {255#false} assume !false; {255#false} is VALID [2021-09-13 14:12:31,081 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:12:31,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:12:31,205 INFO L281 TraceCheckUtils]: 9: Hoare triple {255#false} assume !false; {255#false} is VALID [2021-09-13 14:12:31,205 INFO L281 TraceCheckUtils]: 8: Hoare triple {255#false} assume 0 == __VERIFIER_assert_~cond; {255#false} is VALID [2021-09-13 14:12:31,206 INFO L281 TraceCheckUtils]: 7: Hoare triple {255#false} main_~j~0 := (if main_~i~0 < 0 && 0 != main_~i~0 % 4 then 1 + main_~i~0 / 4 else main_~i~0 / 4);__VERIFIER_assert_#in~cond := (if 4 * main_~j~0 == main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {255#false} is VALID [2021-09-13 14:12:31,206 INFO L281 TraceCheckUtils]: 6: Hoare triple {302#(< ULTIMATE.start_main_~i~0 ~SIZE~0)} assume !(main_~i~0 < ~SIZE~0); {255#false} is VALID [2021-09-13 14:12:31,207 INFO L281 TraceCheckUtils]: 5: Hoare triple {306#(< (+ ULTIMATE.start_main_~i~0 8) ~SIZE~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {302#(< ULTIMATE.start_main_~i~0 ~SIZE~0)} is VALID [2021-09-13 14:12:31,207 INFO L281 TraceCheckUtils]: 4: Hoare triple {306#(< (+ ULTIMATE.start_main_~i~0 8) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {306#(< (+ ULTIMATE.start_main_~i~0 8) ~SIZE~0)} is VALID [2021-09-13 14:12:31,208 INFO L281 TraceCheckUtils]: 3: Hoare triple {313#(< (+ ULTIMATE.start_main_~i~0 16) ~SIZE~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {306#(< (+ ULTIMATE.start_main_~i~0 8) ~SIZE~0)} is VALID [2021-09-13 14:12:31,208 INFO L281 TraceCheckUtils]: 2: Hoare triple {313#(< (+ ULTIMATE.start_main_~i~0 16) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {313#(< (+ ULTIMATE.start_main_~i~0 16) ~SIZE~0)} is VALID [2021-09-13 14:12:31,209 INFO L281 TraceCheckUtils]: 1: Hoare triple {320#(< 16 ~SIZE~0)} havoc main_#res;havoc main_#t~nondet7, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0;main_~j~0 := 0; {313#(< (+ ULTIMATE.start_main_~i~0 16) ~SIZE~0)} is VALID [2021-09-13 14:12:31,209 INFO L281 TraceCheckUtils]: 0: Hoare triple {254#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(9);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~SIZE~0 := 50000001; {320#(< 16 ~SIZE~0)} is VALID [2021-09-13 14:12:31,210 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:12:31,210 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230763249] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:12:31,210 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-09-13 14:12:31,210 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2021-09-13 14:12:31,211 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256487553] [2021-09-13 14:12:31,213 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-09-13 14:12:31,214 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:12:31,214 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:31,232 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:12:31,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-09-13 14:12:31,232 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:12:31,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-09-13 14:12:31,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=89, Unknown=0, NotChecked=0, Total=156 [2021-09-13 14:12:31,235 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. Second operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:31,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:31,412 INFO L93 Difference]: Finished difference Result 29 states and 40 transitions. [2021-09-13 14:12:31,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-09-13 14:12:31,412 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-09-13 14:12:31,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:12:31,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:31,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2021-09-13 14:12:31,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:31,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2021-09-13 14:12:31,418 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 32 transitions. [2021-09-13 14:12:31,442 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:12:31,444 INFO L225 Difference]: With dead ends: 29 [2021-09-13 14:12:31,444 INFO L226 Difference]: Without dead ends: 25 [2021-09-13 14:12:31,446 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 110.55ms TimeCoverageRelationStatistics Valid=100, Invalid=140, Unknown=0, NotChecked=0, Total=240 [2021-09-13 14:12:31,451 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 32 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 54.95ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.62ms SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 63.09ms IncrementalHoareTripleChecker+Time [2021-09-13 14:12:31,452 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 0 Invalid, 79 Unknown, 0 Unchecked, 2.62ms Time], IncrementalHoareTripleChecker [42 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 63.09ms Time] [2021-09-13 14:12:31,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-09-13 14:12:31,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2021-09-13 14:12:31,468 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:12:31,469 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:31,470 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:31,470 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:31,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:31,472 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2021-09-13 14:12:31,472 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2021-09-13 14:12:31,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:12:31,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:12:31,473 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 25 states. [2021-09-13 14:12:31,474 INFO L87 Difference]: Start difference. First operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 25 states. [2021-09-13 14:12:31,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:31,481 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2021-09-13 14:12:31,481 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2021-09-13 14:12:31,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:12:31,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:12:31,482 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:12:31,482 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:12:31,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:31,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2021-09-13 14:12:31,483 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 10 [2021-09-13 14:12:31,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:12:31,483 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2021-09-13 14:12:31,484 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:31,484 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2021-09-13 14:12:31,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-09-13 14:12:31,484 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:12:31,484 INFO L513 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1] [2021-09-13 14:12:31,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-09-13 14:12:31,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-09-13 14:12:31,712 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:12:31,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:12:31,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1714863729, now seen corresponding path program 2 times [2021-09-13 14:12:31,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:12:31,713 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218390390] [2021-09-13 14:12:31,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:12:31,713 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:12:31,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:12:31,824 INFO L281 TraceCheckUtils]: 0: Hoare triple {445#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(9);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~SIZE~0 := 50000001; {447#(<= 50000001 ~SIZE~0)} is VALID [2021-09-13 14:12:31,824 INFO L281 TraceCheckUtils]: 1: Hoare triple {447#(<= 50000001 ~SIZE~0)} havoc main_#res;havoc main_#t~nondet7, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0;main_~j~0 := 0; {448#(and (= ULTIMATE.start_main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:31,828 INFO L281 TraceCheckUtils]: 2: Hoare triple {448#(and (= ULTIMATE.start_main_~i~0 0) (<= 50000001 ~SIZE~0))} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {448#(and (= ULTIMATE.start_main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:31,829 INFO L281 TraceCheckUtils]: 3: Hoare triple {448#(and (= ULTIMATE.start_main_~i~0 0) (<= 50000001 ~SIZE~0))} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {449#(<= (+ 49999997 ULTIMATE.start_main_~i~0) ~SIZE~0)} is VALID [2021-09-13 14:12:31,829 INFO L281 TraceCheckUtils]: 4: Hoare triple {449#(<= (+ 49999997 ULTIMATE.start_main_~i~0) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {449#(<= (+ 49999997 ULTIMATE.start_main_~i~0) ~SIZE~0)} is VALID [2021-09-13 14:12:31,830 INFO L281 TraceCheckUtils]: 5: Hoare triple {449#(<= (+ 49999997 ULTIMATE.start_main_~i~0) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {450#(<= (+ ULTIMATE.start_main_~i~0 49999993) ~SIZE~0)} is VALID [2021-09-13 14:12:31,830 INFO L281 TraceCheckUtils]: 6: Hoare triple {450#(<= (+ ULTIMATE.start_main_~i~0 49999993) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {450#(<= (+ ULTIMATE.start_main_~i~0 49999993) ~SIZE~0)} is VALID [2021-09-13 14:12:31,831 INFO L281 TraceCheckUtils]: 7: Hoare triple {450#(<= (+ ULTIMATE.start_main_~i~0 49999993) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {451#(<= (+ 49999989 ULTIMATE.start_main_~i~0) ~SIZE~0)} is VALID [2021-09-13 14:12:31,831 INFO L281 TraceCheckUtils]: 8: Hoare triple {451#(<= (+ 49999989 ULTIMATE.start_main_~i~0) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {451#(<= (+ 49999989 ULTIMATE.start_main_~i~0) ~SIZE~0)} is VALID [2021-09-13 14:12:31,832 INFO L281 TraceCheckUtils]: 9: Hoare triple {451#(<= (+ 49999989 ULTIMATE.start_main_~i~0) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {452#(<= (+ ULTIMATE.start_main_~i~0 49999985) ~SIZE~0)} is VALID [2021-09-13 14:12:31,832 INFO L281 TraceCheckUtils]: 10: Hoare triple {452#(<= (+ ULTIMATE.start_main_~i~0 49999985) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {452#(<= (+ ULTIMATE.start_main_~i~0 49999985) ~SIZE~0)} is VALID [2021-09-13 14:12:31,833 INFO L281 TraceCheckUtils]: 11: Hoare triple {452#(<= (+ ULTIMATE.start_main_~i~0 49999985) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {453#(<= (+ ULTIMATE.start_main_~i~0 49999981) ~SIZE~0)} is VALID [2021-09-13 14:12:31,833 INFO L281 TraceCheckUtils]: 12: Hoare triple {453#(<= (+ ULTIMATE.start_main_~i~0 49999981) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {453#(<= (+ ULTIMATE.start_main_~i~0 49999981) ~SIZE~0)} is VALID [2021-09-13 14:12:31,834 INFO L281 TraceCheckUtils]: 13: Hoare triple {453#(<= (+ ULTIMATE.start_main_~i~0 49999981) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {454#(<= (+ ULTIMATE.start_main_~i~0 49999977) ~SIZE~0)} is VALID [2021-09-13 14:12:31,834 INFO L281 TraceCheckUtils]: 14: Hoare triple {454#(<= (+ ULTIMATE.start_main_~i~0 49999977) ~SIZE~0)} assume !(main_~i~0 < ~SIZE~0); {446#false} is VALID [2021-09-13 14:12:31,834 INFO L281 TraceCheckUtils]: 15: Hoare triple {446#false} main_~j~0 := (if main_~i~0 < 0 && 0 != main_~i~0 % 4 then 1 + main_~i~0 / 4 else main_~i~0 / 4);__VERIFIER_assert_#in~cond := (if 4 * main_~j~0 == main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {446#false} is VALID [2021-09-13 14:12:31,834 INFO L281 TraceCheckUtils]: 16: Hoare triple {446#false} assume 0 == __VERIFIER_assert_~cond; {446#false} is VALID [2021-09-13 14:12:31,834 INFO L281 TraceCheckUtils]: 17: Hoare triple {446#false} assume !false; {446#false} is VALID [2021-09-13 14:12:31,835 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:12:31,835 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:12:31,835 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218390390] [2021-09-13 14:12:31,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218390390] provided 0 perfect and 1 imperfect interpolant sequences [2021-09-13 14:12:31,835 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913178359] [2021-09-13 14:12:31,835 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-09-13 14:12:31,835 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:12:31,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:12:31,836 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 14:12:31,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-09-13 14:12:31,883 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-09-13 14:12:31,883 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-09-13 14:12:31,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjunts are in the unsatisfiable core [2021-09-13 14:12:31,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:12:31,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:12:32,210 INFO L281 TraceCheckUtils]: 0: Hoare triple {445#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(9);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~SIZE~0 := 50000001; {447#(<= 50000001 ~SIZE~0)} is VALID [2021-09-13 14:12:32,211 INFO L281 TraceCheckUtils]: 1: Hoare triple {447#(<= 50000001 ~SIZE~0)} havoc main_#res;havoc main_#t~nondet7, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0;main_~j~0 := 0; {461#(and (<= ULTIMATE.start_main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:32,212 INFO L281 TraceCheckUtils]: 2: Hoare triple {461#(and (<= ULTIMATE.start_main_~i~0 0) (<= 50000001 ~SIZE~0))} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {461#(and (<= ULTIMATE.start_main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:32,212 INFO L281 TraceCheckUtils]: 3: Hoare triple {461#(and (<= ULTIMATE.start_main_~i~0 0) (<= 50000001 ~SIZE~0))} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {468#(and (<= ULTIMATE.start_main_~i~0 4) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:32,213 INFO L281 TraceCheckUtils]: 4: Hoare triple {468#(and (<= ULTIMATE.start_main_~i~0 4) (<= 50000001 ~SIZE~0))} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {468#(and (<= ULTIMATE.start_main_~i~0 4) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:32,213 INFO L281 TraceCheckUtils]: 5: Hoare triple {468#(and (<= ULTIMATE.start_main_~i~0 4) (<= 50000001 ~SIZE~0))} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {475#(and (<= ULTIMATE.start_main_~i~0 8) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:32,214 INFO L281 TraceCheckUtils]: 6: Hoare triple {475#(and (<= ULTIMATE.start_main_~i~0 8) (<= 50000001 ~SIZE~0))} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {475#(and (<= ULTIMATE.start_main_~i~0 8) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:32,214 INFO L281 TraceCheckUtils]: 7: Hoare triple {475#(and (<= ULTIMATE.start_main_~i~0 8) (<= 50000001 ~SIZE~0))} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {482#(and (<= ULTIMATE.start_main_~i~0 12) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:32,215 INFO L281 TraceCheckUtils]: 8: Hoare triple {482#(and (<= ULTIMATE.start_main_~i~0 12) (<= 50000001 ~SIZE~0))} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {482#(and (<= ULTIMATE.start_main_~i~0 12) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:32,215 INFO L281 TraceCheckUtils]: 9: Hoare triple {482#(and (<= ULTIMATE.start_main_~i~0 12) (<= 50000001 ~SIZE~0))} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {489#(and (<= ULTIMATE.start_main_~i~0 16) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:32,216 INFO L281 TraceCheckUtils]: 10: Hoare triple {489#(and (<= ULTIMATE.start_main_~i~0 16) (<= 50000001 ~SIZE~0))} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {489#(and (<= ULTIMATE.start_main_~i~0 16) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:32,216 INFO L281 TraceCheckUtils]: 11: Hoare triple {489#(and (<= ULTIMATE.start_main_~i~0 16) (<= 50000001 ~SIZE~0))} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {496#(and (<= ULTIMATE.start_main_~i~0 20) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:32,217 INFO L281 TraceCheckUtils]: 12: Hoare triple {496#(and (<= ULTIMATE.start_main_~i~0 20) (<= 50000001 ~SIZE~0))} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {496#(and (<= ULTIMATE.start_main_~i~0 20) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:32,217 INFO L281 TraceCheckUtils]: 13: Hoare triple {496#(and (<= ULTIMATE.start_main_~i~0 20) (<= 50000001 ~SIZE~0))} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {503#(and (<= ULTIMATE.start_main_~i~0 24) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:32,218 INFO L281 TraceCheckUtils]: 14: Hoare triple {503#(and (<= ULTIMATE.start_main_~i~0 24) (<= 50000001 ~SIZE~0))} assume !(main_~i~0 < ~SIZE~0); {446#false} is VALID [2021-09-13 14:12:32,218 INFO L281 TraceCheckUtils]: 15: Hoare triple {446#false} main_~j~0 := (if main_~i~0 < 0 && 0 != main_~i~0 % 4 then 1 + main_~i~0 / 4 else main_~i~0 / 4);__VERIFIER_assert_#in~cond := (if 4 * main_~j~0 == main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {446#false} is VALID [2021-09-13 14:12:32,218 INFO L281 TraceCheckUtils]: 16: Hoare triple {446#false} assume 0 == __VERIFIER_assert_~cond; {446#false} is VALID [2021-09-13 14:12:32,218 INFO L281 TraceCheckUtils]: 17: Hoare triple {446#false} assume !false; {446#false} is VALID [2021-09-13 14:12:32,219 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:12:32,219 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:12:32,510 INFO L281 TraceCheckUtils]: 17: Hoare triple {446#false} assume !false; {446#false} is VALID [2021-09-13 14:12:32,510 INFO L281 TraceCheckUtils]: 16: Hoare triple {446#false} assume 0 == __VERIFIER_assert_~cond; {446#false} is VALID [2021-09-13 14:12:32,510 INFO L281 TraceCheckUtils]: 15: Hoare triple {446#false} main_~j~0 := (if main_~i~0 < 0 && 0 != main_~i~0 % 4 then 1 + main_~i~0 / 4 else main_~i~0 / 4);__VERIFIER_assert_#in~cond := (if 4 * main_~j~0 == main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {446#false} is VALID [2021-09-13 14:12:32,511 INFO L281 TraceCheckUtils]: 14: Hoare triple {525#(< ULTIMATE.start_main_~i~0 ~SIZE~0)} assume !(main_~i~0 < ~SIZE~0); {446#false} is VALID [2021-09-13 14:12:32,514 INFO L281 TraceCheckUtils]: 13: Hoare triple {529#(< (+ ULTIMATE.start_main_~i~0 4) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {525#(< ULTIMATE.start_main_~i~0 ~SIZE~0)} is VALID [2021-09-13 14:12:32,514 INFO L281 TraceCheckUtils]: 12: Hoare triple {529#(< (+ ULTIMATE.start_main_~i~0 4) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {529#(< (+ ULTIMATE.start_main_~i~0 4) ~SIZE~0)} is VALID [2021-09-13 14:12:32,515 INFO L281 TraceCheckUtils]: 11: Hoare triple {536#(< (+ ULTIMATE.start_main_~i~0 8) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {529#(< (+ ULTIMATE.start_main_~i~0 4) ~SIZE~0)} is VALID [2021-09-13 14:12:32,515 INFO L281 TraceCheckUtils]: 10: Hoare triple {536#(< (+ ULTIMATE.start_main_~i~0 8) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {536#(< (+ ULTIMATE.start_main_~i~0 8) ~SIZE~0)} is VALID [2021-09-13 14:12:32,516 INFO L281 TraceCheckUtils]: 9: Hoare triple {543#(< (+ ULTIMATE.start_main_~i~0 12) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {536#(< (+ ULTIMATE.start_main_~i~0 8) ~SIZE~0)} is VALID [2021-09-13 14:12:32,516 INFO L281 TraceCheckUtils]: 8: Hoare triple {543#(< (+ ULTIMATE.start_main_~i~0 12) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {543#(< (+ ULTIMATE.start_main_~i~0 12) ~SIZE~0)} is VALID [2021-09-13 14:12:32,516 INFO L281 TraceCheckUtils]: 7: Hoare triple {550#(< (+ ULTIMATE.start_main_~i~0 16) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {543#(< (+ ULTIMATE.start_main_~i~0 12) ~SIZE~0)} is VALID [2021-09-13 14:12:32,517 INFO L281 TraceCheckUtils]: 6: Hoare triple {550#(< (+ ULTIMATE.start_main_~i~0 16) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {550#(< (+ ULTIMATE.start_main_~i~0 16) ~SIZE~0)} is VALID [2021-09-13 14:12:32,517 INFO L281 TraceCheckUtils]: 5: Hoare triple {557#(< (+ ULTIMATE.start_main_~i~0 20) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {550#(< (+ ULTIMATE.start_main_~i~0 16) ~SIZE~0)} is VALID [2021-09-13 14:12:32,518 INFO L281 TraceCheckUtils]: 4: Hoare triple {557#(< (+ ULTIMATE.start_main_~i~0 20) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {557#(< (+ ULTIMATE.start_main_~i~0 20) ~SIZE~0)} is VALID [2021-09-13 14:12:32,519 INFO L281 TraceCheckUtils]: 3: Hoare triple {564#(< (+ ULTIMATE.start_main_~i~0 24) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {557#(< (+ ULTIMATE.start_main_~i~0 20) ~SIZE~0)} is VALID [2021-09-13 14:12:32,519 INFO L281 TraceCheckUtils]: 2: Hoare triple {564#(< (+ ULTIMATE.start_main_~i~0 24) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {564#(< (+ ULTIMATE.start_main_~i~0 24) ~SIZE~0)} is VALID [2021-09-13 14:12:32,521 INFO L281 TraceCheckUtils]: 1: Hoare triple {571#(< 24 ~SIZE~0)} havoc main_#res;havoc main_#t~nondet7, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0;main_~j~0 := 0; {564#(< (+ ULTIMATE.start_main_~i~0 24) ~SIZE~0)} is VALID [2021-09-13 14:12:32,522 INFO L281 TraceCheckUtils]: 0: Hoare triple {445#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(9);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~SIZE~0 := 50000001; {571#(< 24 ~SIZE~0)} is VALID [2021-09-13 14:12:32,522 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:12:32,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913178359] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:12:32,522 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-09-13 14:12:32,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2021-09-13 14:12:32,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989352235] [2021-09-13 14:12:32,523 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.88) internal successors, (47), 24 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-09-13 14:12:32,523 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:12:32,523 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.88) internal successors, (47), 24 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:32,560 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:12:32,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-09-13 14:12:32,560 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:12:32,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-09-13 14:12:32,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=341, Unknown=0, NotChecked=0, Total=600 [2021-09-13 14:12:32,562 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand has 25 states, 25 states have (on average 1.88) internal successors, (47), 24 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:32,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:32,970 INFO L93 Difference]: Finished difference Result 61 states and 91 transitions. [2021-09-13 14:12:32,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-09-13 14:12:32,972 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.88) internal successors, (47), 24 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-09-13 14:12:32,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:12:32,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.88) internal successors, (47), 24 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:32,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 60 transitions. [2021-09-13 14:12:32,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.88) internal successors, (47), 24 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:32,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 60 transitions. [2021-09-13 14:12:32,975 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 60 transitions. [2021-09-13 14:12:33,024 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:12:33,026 INFO L225 Difference]: With dead ends: 61 [2021-09-13 14:12:33,026 INFO L226 Difference]: Without dead ends: 57 [2021-09-13 14:12:33,027 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 300.22ms TimeCoverageRelationStatistics Valid=392, Invalid=600, Unknown=0, NotChecked=0, Total=992 [2021-09-13 14:12:33,028 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 41 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 125.11ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.61ms SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 126.79ms IncrementalHoareTripleChecker+Time [2021-09-13 14:12:33,028 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 0 Invalid, 153 Unknown, 0 Unchecked, 2.61ms Time], IncrementalHoareTripleChecker [76 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 126.79ms Time] [2021-09-13 14:12:33,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-09-13 14:12:33,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 35. [2021-09-13 14:12:33,060 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:12:33,060 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 35 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 34 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:33,061 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 35 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 34 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:33,061 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 35 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 34 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:33,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:33,063 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2021-09-13 14:12:33,063 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 80 transitions. [2021-09-13 14:12:33,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:12:33,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:12:33,064 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 34 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 57 states. [2021-09-13 14:12:33,064 INFO L87 Difference]: Start difference. First operand has 35 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 34 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 57 states. [2021-09-13 14:12:33,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:33,066 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2021-09-13 14:12:33,067 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 80 transitions. [2021-09-13 14:12:33,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:12:33,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:12:33,067 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:12:33,067 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:12:33,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 34 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:33,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2021-09-13 14:12:33,069 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 18 [2021-09-13 14:12:33,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:12:33,069 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2021-09-13 14:12:33,070 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.88) internal successors, (47), 24 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:33,070 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2021-09-13 14:12:33,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-09-13 14:12:33,070 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:12:33,071 INFO L513 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1, 1, 1, 1] [2021-09-13 14:12:33,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-09-13 14:12:33,293 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:12:33,293 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:12:33,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:12:33,294 INFO L82 PathProgramCache]: Analyzing trace with hash 355037325, now seen corresponding path program 1 times [2021-09-13 14:12:33,294 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:12:33,294 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004817420] [2021-09-13 14:12:33,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:12:33,294 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:12:33,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:12:33,419 INFO L281 TraceCheckUtils]: 0: Hoare triple {841#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(9);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~SIZE~0 := 50000001; {843#(<= 50000001 ~SIZE~0)} is VALID [2021-09-13 14:12:33,421 INFO L281 TraceCheckUtils]: 1: Hoare triple {843#(<= 50000001 ~SIZE~0)} havoc main_#res;havoc main_#t~nondet7, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0;main_~j~0 := 0; {844#(and (= ULTIMATE.start_main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:33,421 INFO L281 TraceCheckUtils]: 2: Hoare triple {844#(and (= ULTIMATE.start_main_~i~0 0) (<= 50000001 ~SIZE~0))} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {844#(and (= ULTIMATE.start_main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:33,422 INFO L281 TraceCheckUtils]: 3: Hoare triple {844#(and (= ULTIMATE.start_main_~i~0 0) (<= 50000001 ~SIZE~0))} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {845#(<= (+ 49999997 ULTIMATE.start_main_~i~0) ~SIZE~0)} is VALID [2021-09-13 14:12:33,422 INFO L281 TraceCheckUtils]: 4: Hoare triple {845#(<= (+ 49999997 ULTIMATE.start_main_~i~0) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {845#(<= (+ 49999997 ULTIMATE.start_main_~i~0) ~SIZE~0)} is VALID [2021-09-13 14:12:33,423 INFO L281 TraceCheckUtils]: 5: Hoare triple {845#(<= (+ 49999997 ULTIMATE.start_main_~i~0) ~SIZE~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {846#(<= (+ 49999989 ULTIMATE.start_main_~i~0) ~SIZE~0)} is VALID [2021-09-13 14:12:33,423 INFO L281 TraceCheckUtils]: 6: Hoare triple {846#(<= (+ 49999989 ULTIMATE.start_main_~i~0) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {846#(<= (+ 49999989 ULTIMATE.start_main_~i~0) ~SIZE~0)} is VALID [2021-09-13 14:12:33,424 INFO L281 TraceCheckUtils]: 7: Hoare triple {846#(<= (+ 49999989 ULTIMATE.start_main_~i~0) ~SIZE~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {847#(<= (+ ULTIMATE.start_main_~i~0 49999981) ~SIZE~0)} is VALID [2021-09-13 14:12:33,425 INFO L281 TraceCheckUtils]: 8: Hoare triple {847#(<= (+ ULTIMATE.start_main_~i~0 49999981) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {847#(<= (+ ULTIMATE.start_main_~i~0 49999981) ~SIZE~0)} is VALID [2021-09-13 14:12:33,425 INFO L281 TraceCheckUtils]: 9: Hoare triple {847#(<= (+ ULTIMATE.start_main_~i~0 49999981) ~SIZE~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {848#(<= (+ ULTIMATE.start_main_~i~0 49999973) ~SIZE~0)} is VALID [2021-09-13 14:12:33,427 INFO L281 TraceCheckUtils]: 10: Hoare triple {848#(<= (+ ULTIMATE.start_main_~i~0 49999973) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {848#(<= (+ ULTIMATE.start_main_~i~0 49999973) ~SIZE~0)} is VALID [2021-09-13 14:12:33,428 INFO L281 TraceCheckUtils]: 11: Hoare triple {848#(<= (+ ULTIMATE.start_main_~i~0 49999973) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {849#(<= (+ ULTIMATE.start_main_~i~0 49999969) ~SIZE~0)} is VALID [2021-09-13 14:12:33,429 INFO L281 TraceCheckUtils]: 12: Hoare triple {849#(<= (+ ULTIMATE.start_main_~i~0 49999969) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {849#(<= (+ ULTIMATE.start_main_~i~0 49999969) ~SIZE~0)} is VALID [2021-09-13 14:12:33,429 INFO L281 TraceCheckUtils]: 13: Hoare triple {849#(<= (+ ULTIMATE.start_main_~i~0 49999969) ~SIZE~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {850#(<= (+ ULTIMATE.start_main_~i~0 49999961) ~SIZE~0)} is VALID [2021-09-13 14:12:33,429 INFO L281 TraceCheckUtils]: 14: Hoare triple {850#(<= (+ ULTIMATE.start_main_~i~0 49999961) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {850#(<= (+ ULTIMATE.start_main_~i~0 49999961) ~SIZE~0)} is VALID [2021-09-13 14:12:33,430 INFO L281 TraceCheckUtils]: 15: Hoare triple {850#(<= (+ ULTIMATE.start_main_~i~0 49999961) ~SIZE~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {851#(<= (+ ULTIMATE.start_main_~i~0 49999953) ~SIZE~0)} is VALID [2021-09-13 14:12:33,430 INFO L281 TraceCheckUtils]: 16: Hoare triple {851#(<= (+ ULTIMATE.start_main_~i~0 49999953) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {851#(<= (+ ULTIMATE.start_main_~i~0 49999953) ~SIZE~0)} is VALID [2021-09-13 14:12:33,431 INFO L281 TraceCheckUtils]: 17: Hoare triple {851#(<= (+ ULTIMATE.start_main_~i~0 49999953) ~SIZE~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {852#(<= (+ ULTIMATE.start_main_~i~0 49999945) ~SIZE~0)} is VALID [2021-09-13 14:12:33,431 INFO L281 TraceCheckUtils]: 18: Hoare triple {852#(<= (+ ULTIMATE.start_main_~i~0 49999945) ~SIZE~0)} assume !(main_~i~0 < ~SIZE~0); {842#false} is VALID [2021-09-13 14:12:33,431 INFO L281 TraceCheckUtils]: 19: Hoare triple {842#false} main_~j~0 := (if main_~i~0 < 0 && 0 != main_~i~0 % 4 then 1 + main_~i~0 / 4 else main_~i~0 / 4);__VERIFIER_assert_#in~cond := (if 4 * main_~j~0 == main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {842#false} is VALID [2021-09-13 14:12:33,432 INFO L281 TraceCheckUtils]: 20: Hoare triple {842#false} assume 0 == __VERIFIER_assert_~cond; {842#false} is VALID [2021-09-13 14:12:33,432 INFO L281 TraceCheckUtils]: 21: Hoare triple {842#false} assume !false; {842#false} is VALID [2021-09-13 14:12:33,432 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:12:33,432 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:12:33,432 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004817420] [2021-09-13 14:12:33,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004817420] provided 0 perfect and 1 imperfect interpolant sequences [2021-09-13 14:12:33,433 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288437183] [2021-09-13 14:12:33,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:12:33,433 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:12:33,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:12:33,439 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 14:12:33,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-09-13 14:12:33,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:12:33,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 11 conjunts are in the unsatisfiable core [2021-09-13 14:12:33,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:12:33,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:12:33,869 INFO L281 TraceCheckUtils]: 0: Hoare triple {841#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(9);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~SIZE~0 := 50000001; {843#(<= 50000001 ~SIZE~0)} is VALID [2021-09-13 14:12:33,870 INFO L281 TraceCheckUtils]: 1: Hoare triple {843#(<= 50000001 ~SIZE~0)} havoc main_#res;havoc main_#t~nondet7, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0;main_~j~0 := 0; {859#(and (<= ULTIMATE.start_main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:33,871 INFO L281 TraceCheckUtils]: 2: Hoare triple {859#(and (<= ULTIMATE.start_main_~i~0 0) (<= 50000001 ~SIZE~0))} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {859#(and (<= ULTIMATE.start_main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:33,871 INFO L281 TraceCheckUtils]: 3: Hoare triple {859#(and (<= ULTIMATE.start_main_~i~0 0) (<= 50000001 ~SIZE~0))} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {866#(and (<= ULTIMATE.start_main_~i~0 4) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:33,872 INFO L281 TraceCheckUtils]: 4: Hoare triple {866#(and (<= ULTIMATE.start_main_~i~0 4) (<= 50000001 ~SIZE~0))} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {866#(and (<= ULTIMATE.start_main_~i~0 4) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:33,873 INFO L281 TraceCheckUtils]: 5: Hoare triple {866#(and (<= ULTIMATE.start_main_~i~0 4) (<= 50000001 ~SIZE~0))} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {873#(and (<= ULTIMATE.start_main_~i~0 12) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:33,873 INFO L281 TraceCheckUtils]: 6: Hoare triple {873#(and (<= ULTIMATE.start_main_~i~0 12) (<= 50000001 ~SIZE~0))} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {873#(and (<= ULTIMATE.start_main_~i~0 12) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:33,874 INFO L281 TraceCheckUtils]: 7: Hoare triple {873#(and (<= ULTIMATE.start_main_~i~0 12) (<= 50000001 ~SIZE~0))} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {880#(and (<= ULTIMATE.start_main_~i~0 20) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:33,874 INFO L281 TraceCheckUtils]: 8: Hoare triple {880#(and (<= ULTIMATE.start_main_~i~0 20) (<= 50000001 ~SIZE~0))} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {880#(and (<= ULTIMATE.start_main_~i~0 20) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:33,875 INFO L281 TraceCheckUtils]: 9: Hoare triple {880#(and (<= ULTIMATE.start_main_~i~0 20) (<= 50000001 ~SIZE~0))} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {887#(and (<= ULTIMATE.start_main_~i~0 28) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:33,875 INFO L281 TraceCheckUtils]: 10: Hoare triple {887#(and (<= ULTIMATE.start_main_~i~0 28) (<= 50000001 ~SIZE~0))} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {887#(and (<= ULTIMATE.start_main_~i~0 28) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:33,876 INFO L281 TraceCheckUtils]: 11: Hoare triple {887#(and (<= ULTIMATE.start_main_~i~0 28) (<= 50000001 ~SIZE~0))} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {894#(and (<= ULTIMATE.start_main_~i~0 32) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:33,877 INFO L281 TraceCheckUtils]: 12: Hoare triple {894#(and (<= ULTIMATE.start_main_~i~0 32) (<= 50000001 ~SIZE~0))} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {894#(and (<= ULTIMATE.start_main_~i~0 32) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:33,877 INFO L281 TraceCheckUtils]: 13: Hoare triple {894#(and (<= ULTIMATE.start_main_~i~0 32) (<= 50000001 ~SIZE~0))} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {901#(and (<= ULTIMATE.start_main_~i~0 40) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:33,878 INFO L281 TraceCheckUtils]: 14: Hoare triple {901#(and (<= ULTIMATE.start_main_~i~0 40) (<= 50000001 ~SIZE~0))} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {901#(and (<= ULTIMATE.start_main_~i~0 40) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:33,878 INFO L281 TraceCheckUtils]: 15: Hoare triple {901#(and (<= ULTIMATE.start_main_~i~0 40) (<= 50000001 ~SIZE~0))} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {908#(and (<= ULTIMATE.start_main_~i~0 48) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:33,879 INFO L281 TraceCheckUtils]: 16: Hoare triple {908#(and (<= ULTIMATE.start_main_~i~0 48) (<= 50000001 ~SIZE~0))} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {908#(and (<= ULTIMATE.start_main_~i~0 48) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:33,880 INFO L281 TraceCheckUtils]: 17: Hoare triple {908#(and (<= ULTIMATE.start_main_~i~0 48) (<= 50000001 ~SIZE~0))} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {915#(and (<= ULTIMATE.start_main_~i~0 56) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:33,880 INFO L281 TraceCheckUtils]: 18: Hoare triple {915#(and (<= ULTIMATE.start_main_~i~0 56) (<= 50000001 ~SIZE~0))} assume !(main_~i~0 < ~SIZE~0); {842#false} is VALID [2021-09-13 14:12:33,880 INFO L281 TraceCheckUtils]: 19: Hoare triple {842#false} main_~j~0 := (if main_~i~0 < 0 && 0 != main_~i~0 % 4 then 1 + main_~i~0 / 4 else main_~i~0 / 4);__VERIFIER_assert_#in~cond := (if 4 * main_~j~0 == main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {842#false} is VALID [2021-09-13 14:12:33,881 INFO L281 TraceCheckUtils]: 20: Hoare triple {842#false} assume 0 == __VERIFIER_assert_~cond; {842#false} is VALID [2021-09-13 14:12:33,881 INFO L281 TraceCheckUtils]: 21: Hoare triple {842#false} assume !false; {842#false} is VALID [2021-09-13 14:12:33,881 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:12:33,882 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:12:34,283 INFO L281 TraceCheckUtils]: 21: Hoare triple {842#false} assume !false; {842#false} is VALID [2021-09-13 14:12:34,284 INFO L281 TraceCheckUtils]: 20: Hoare triple {842#false} assume 0 == __VERIFIER_assert_~cond; {842#false} is VALID [2021-09-13 14:12:34,284 INFO L281 TraceCheckUtils]: 19: Hoare triple {842#false} main_~j~0 := (if main_~i~0 < 0 && 0 != main_~i~0 % 4 then 1 + main_~i~0 / 4 else main_~i~0 / 4);__VERIFIER_assert_#in~cond := (if 4 * main_~j~0 == main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {842#false} is VALID [2021-09-13 14:12:34,284 INFO L281 TraceCheckUtils]: 18: Hoare triple {937#(< ULTIMATE.start_main_~i~0 ~SIZE~0)} assume !(main_~i~0 < ~SIZE~0); {842#false} is VALID [2021-09-13 14:12:34,285 INFO L281 TraceCheckUtils]: 17: Hoare triple {941#(< (+ ULTIMATE.start_main_~i~0 8) ~SIZE~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {937#(< ULTIMATE.start_main_~i~0 ~SIZE~0)} is VALID [2021-09-13 14:12:34,285 INFO L281 TraceCheckUtils]: 16: Hoare triple {941#(< (+ ULTIMATE.start_main_~i~0 8) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {941#(< (+ ULTIMATE.start_main_~i~0 8) ~SIZE~0)} is VALID [2021-09-13 14:12:34,286 INFO L281 TraceCheckUtils]: 15: Hoare triple {948#(< (+ ULTIMATE.start_main_~i~0 16) ~SIZE~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {941#(< (+ ULTIMATE.start_main_~i~0 8) ~SIZE~0)} is VALID [2021-09-13 14:12:34,286 INFO L281 TraceCheckUtils]: 14: Hoare triple {948#(< (+ ULTIMATE.start_main_~i~0 16) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {948#(< (+ ULTIMATE.start_main_~i~0 16) ~SIZE~0)} is VALID [2021-09-13 14:12:34,287 INFO L281 TraceCheckUtils]: 13: Hoare triple {955#(< (+ ULTIMATE.start_main_~i~0 24) ~SIZE~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {948#(< (+ ULTIMATE.start_main_~i~0 16) ~SIZE~0)} is VALID [2021-09-13 14:12:34,287 INFO L281 TraceCheckUtils]: 12: Hoare triple {955#(< (+ ULTIMATE.start_main_~i~0 24) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {955#(< (+ ULTIMATE.start_main_~i~0 24) ~SIZE~0)} is VALID [2021-09-13 14:12:34,287 INFO L281 TraceCheckUtils]: 11: Hoare triple {962#(< (+ ULTIMATE.start_main_~i~0 28) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {955#(< (+ ULTIMATE.start_main_~i~0 24) ~SIZE~0)} is VALID [2021-09-13 14:12:34,288 INFO L281 TraceCheckUtils]: 10: Hoare triple {962#(< (+ ULTIMATE.start_main_~i~0 28) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {962#(< (+ ULTIMATE.start_main_~i~0 28) ~SIZE~0)} is VALID [2021-09-13 14:12:34,288 INFO L281 TraceCheckUtils]: 9: Hoare triple {969#(< (+ ULTIMATE.start_main_~i~0 36) ~SIZE~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {962#(< (+ ULTIMATE.start_main_~i~0 28) ~SIZE~0)} is VALID [2021-09-13 14:12:34,289 INFO L281 TraceCheckUtils]: 8: Hoare triple {969#(< (+ ULTIMATE.start_main_~i~0 36) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {969#(< (+ ULTIMATE.start_main_~i~0 36) ~SIZE~0)} is VALID [2021-09-13 14:12:34,290 INFO L281 TraceCheckUtils]: 7: Hoare triple {976#(< (+ ULTIMATE.start_main_~i~0 44) ~SIZE~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {969#(< (+ ULTIMATE.start_main_~i~0 36) ~SIZE~0)} is VALID [2021-09-13 14:12:34,290 INFO L281 TraceCheckUtils]: 6: Hoare triple {976#(< (+ ULTIMATE.start_main_~i~0 44) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {976#(< (+ ULTIMATE.start_main_~i~0 44) ~SIZE~0)} is VALID [2021-09-13 14:12:34,291 INFO L281 TraceCheckUtils]: 5: Hoare triple {983#(< (+ ULTIMATE.start_main_~i~0 52) ~SIZE~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {976#(< (+ ULTIMATE.start_main_~i~0 44) ~SIZE~0)} is VALID [2021-09-13 14:12:34,291 INFO L281 TraceCheckUtils]: 4: Hoare triple {983#(< (+ ULTIMATE.start_main_~i~0 52) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {983#(< (+ ULTIMATE.start_main_~i~0 52) ~SIZE~0)} is VALID [2021-09-13 14:12:34,292 INFO L281 TraceCheckUtils]: 3: Hoare triple {990#(< (+ 56 ULTIMATE.start_main_~i~0) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {983#(< (+ ULTIMATE.start_main_~i~0 52) ~SIZE~0)} is VALID [2021-09-13 14:12:34,292 INFO L281 TraceCheckUtils]: 2: Hoare triple {990#(< (+ 56 ULTIMATE.start_main_~i~0) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {990#(< (+ 56 ULTIMATE.start_main_~i~0) ~SIZE~0)} is VALID [2021-09-13 14:12:34,293 INFO L281 TraceCheckUtils]: 1: Hoare triple {997#(< 56 ~SIZE~0)} havoc main_#res;havoc main_#t~nondet7, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0;main_~j~0 := 0; {990#(< (+ 56 ULTIMATE.start_main_~i~0) ~SIZE~0)} is VALID [2021-09-13 14:12:34,293 INFO L281 TraceCheckUtils]: 0: Hoare triple {841#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(9);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~SIZE~0 := 50000001; {997#(< 56 ~SIZE~0)} is VALID [2021-09-13 14:12:34,294 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:12:34,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288437183] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:12:34,294 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-09-13 14:12:34,294 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2021-09-13 14:12:34,294 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682959496] [2021-09-13 14:12:34,295 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.903225806451613) internal successors, (59), 30 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-09-13 14:12:34,295 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:12:34,295 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 31 states, 31 states have (on average 1.903225806451613) internal successors, (59), 30 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:34,349 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:12:34,349 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-09-13 14:12:34,349 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:12:34,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-09-13 14:12:34,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=403, Invalid=527, Unknown=0, NotChecked=0, Total=930 [2021-09-13 14:12:34,350 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand has 31 states, 31 states have (on average 1.903225806451613) internal successors, (59), 30 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:34,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:34,894 INFO L93 Difference]: Finished difference Result 119 states and 179 transitions. [2021-09-13 14:12:34,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-09-13 14:12:34,895 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.903225806451613) internal successors, (59), 30 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-09-13 14:12:34,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:12:34,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.903225806451613) internal successors, (59), 30 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:34,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 74 transitions. [2021-09-13 14:12:34,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.903225806451613) internal successors, (59), 30 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:34,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 74 transitions. [2021-09-13 14:12:34,898 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 74 transitions. [2021-09-13 14:12:34,947 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:12:34,950 INFO L225 Difference]: With dead ends: 119 [2021-09-13 14:12:34,950 INFO L226 Difference]: Without dead ends: 115 [2021-09-13 14:12:34,951 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 451.50ms TimeCoverageRelationStatistics Valid=610, Invalid=950, Unknown=0, NotChecked=0, Total=1560 [2021-09-13 14:12:34,951 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 51 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 143.42ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.92ms SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 145.13ms IncrementalHoareTripleChecker+Time [2021-09-13 14:12:34,952 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 0 Invalid, 201 Unknown, 0 Unchecked, 1.92ms Time], IncrementalHoareTripleChecker [111 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 145.13ms Time] [2021-09-13 14:12:34,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-09-13 14:12:35,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 43. [2021-09-13 14:12:35,019 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:12:35,019 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 43 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 42 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:35,020 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 43 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 42 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:35,020 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 43 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 42 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:35,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:35,024 INFO L93 Difference]: Finished difference Result 115 states and 166 transitions. [2021-09-13 14:12:35,024 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 166 transitions. [2021-09-13 14:12:35,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:12:35,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:12:35,030 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 42 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 115 states. [2021-09-13 14:12:35,030 INFO L87 Difference]: Start difference. First operand has 43 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 42 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 115 states. [2021-09-13 14:12:35,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:35,035 INFO L93 Difference]: Finished difference Result 115 states and 166 transitions. [2021-09-13 14:12:35,035 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 166 transitions. [2021-09-13 14:12:35,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:12:35,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:12:35,037 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:12:35,037 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:12:35,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 42 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:35,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 61 transitions. [2021-09-13 14:12:35,038 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 61 transitions. Word has length 22 [2021-09-13 14:12:35,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:12:35,039 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 61 transitions. [2021-09-13 14:12:35,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.903225806451613) internal successors, (59), 30 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:35,039 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2021-09-13 14:12:35,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-09-13 14:12:35,040 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:12:35,040 INFO L513 BasicCegarLoop]: trace histogram [14, 10, 4, 1, 1, 1, 1, 1, 1] [2021-09-13 14:12:35,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-09-13 14:12:35,260 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:12:35,261 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:12:35,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:12:35,261 INFO L82 PathProgramCache]: Analyzing trace with hash -294996049, now seen corresponding path program 2 times [2021-09-13 14:12:35,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:12:35,262 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092426104] [2021-09-13 14:12:35,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:12:35,262 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:12:35,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:12:35,509 INFO L281 TraceCheckUtils]: 0: Hoare triple {1487#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(9);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~SIZE~0 := 50000001; {1489#(<= 50000001 ~SIZE~0)} is VALID [2021-09-13 14:12:35,510 INFO L281 TraceCheckUtils]: 1: Hoare triple {1489#(<= 50000001 ~SIZE~0)} havoc main_#res;havoc main_#t~nondet7, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0;main_~j~0 := 0; {1490#(and (= ULTIMATE.start_main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:35,511 INFO L281 TraceCheckUtils]: 2: Hoare triple {1490#(and (= ULTIMATE.start_main_~i~0 0) (<= 50000001 ~SIZE~0))} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {1490#(and (= ULTIMATE.start_main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:35,511 INFO L281 TraceCheckUtils]: 3: Hoare triple {1490#(and (= ULTIMATE.start_main_~i~0 0) (<= 50000001 ~SIZE~0))} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {1491#(<= (+ ULTIMATE.start_main_~i~0 49999993) ~SIZE~0)} is VALID [2021-09-13 14:12:35,512 INFO L281 TraceCheckUtils]: 4: Hoare triple {1491#(<= (+ ULTIMATE.start_main_~i~0 49999993) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {1491#(<= (+ ULTIMATE.start_main_~i~0 49999993) ~SIZE~0)} is VALID [2021-09-13 14:12:35,512 INFO L281 TraceCheckUtils]: 5: Hoare triple {1491#(<= (+ ULTIMATE.start_main_~i~0 49999993) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {1492#(<= (+ 49999989 ULTIMATE.start_main_~i~0) ~SIZE~0)} is VALID [2021-09-13 14:12:35,513 INFO L281 TraceCheckUtils]: 6: Hoare triple {1492#(<= (+ 49999989 ULTIMATE.start_main_~i~0) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {1492#(<= (+ 49999989 ULTIMATE.start_main_~i~0) ~SIZE~0)} is VALID [2021-09-13 14:12:35,513 INFO L281 TraceCheckUtils]: 7: Hoare triple {1492#(<= (+ 49999989 ULTIMATE.start_main_~i~0) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {1493#(<= (+ ULTIMATE.start_main_~i~0 49999985) ~SIZE~0)} is VALID [2021-09-13 14:12:35,514 INFO L281 TraceCheckUtils]: 8: Hoare triple {1493#(<= (+ ULTIMATE.start_main_~i~0 49999985) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {1493#(<= (+ ULTIMATE.start_main_~i~0 49999985) ~SIZE~0)} is VALID [2021-09-13 14:12:35,514 INFO L281 TraceCheckUtils]: 9: Hoare triple {1493#(<= (+ ULTIMATE.start_main_~i~0 49999985) ~SIZE~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {1494#(<= (+ ULTIMATE.start_main_~i~0 49999977) ~SIZE~0)} is VALID [2021-09-13 14:12:35,515 INFO L281 TraceCheckUtils]: 10: Hoare triple {1494#(<= (+ ULTIMATE.start_main_~i~0 49999977) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {1494#(<= (+ ULTIMATE.start_main_~i~0 49999977) ~SIZE~0)} is VALID [2021-09-13 14:12:35,515 INFO L281 TraceCheckUtils]: 11: Hoare triple {1494#(<= (+ ULTIMATE.start_main_~i~0 49999977) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {1495#(<= (+ ULTIMATE.start_main_~i~0 49999973) ~SIZE~0)} is VALID [2021-09-13 14:12:35,516 INFO L281 TraceCheckUtils]: 12: Hoare triple {1495#(<= (+ ULTIMATE.start_main_~i~0 49999973) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {1495#(<= (+ ULTIMATE.start_main_~i~0 49999973) ~SIZE~0)} is VALID [2021-09-13 14:12:35,516 INFO L281 TraceCheckUtils]: 13: Hoare triple {1495#(<= (+ ULTIMATE.start_main_~i~0 49999973) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {1496#(<= (+ ULTIMATE.start_main_~i~0 49999969) ~SIZE~0)} is VALID [2021-09-13 14:12:35,517 INFO L281 TraceCheckUtils]: 14: Hoare triple {1496#(<= (+ ULTIMATE.start_main_~i~0 49999969) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {1496#(<= (+ ULTIMATE.start_main_~i~0 49999969) ~SIZE~0)} is VALID [2021-09-13 14:12:35,517 INFO L281 TraceCheckUtils]: 15: Hoare triple {1496#(<= (+ ULTIMATE.start_main_~i~0 49999969) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {1497#(<= (+ ULTIMATE.start_main_~i~0 49999965) ~SIZE~0)} is VALID [2021-09-13 14:12:35,518 INFO L281 TraceCheckUtils]: 16: Hoare triple {1497#(<= (+ ULTIMATE.start_main_~i~0 49999965) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {1497#(<= (+ ULTIMATE.start_main_~i~0 49999965) ~SIZE~0)} is VALID [2021-09-13 14:12:35,522 INFO L281 TraceCheckUtils]: 17: Hoare triple {1497#(<= (+ ULTIMATE.start_main_~i~0 49999965) ~SIZE~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {1498#(<= (+ ULTIMATE.start_main_~i~0 49999957) ~SIZE~0)} is VALID [2021-09-13 14:12:35,523 INFO L281 TraceCheckUtils]: 18: Hoare triple {1498#(<= (+ ULTIMATE.start_main_~i~0 49999957) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {1498#(<= (+ ULTIMATE.start_main_~i~0 49999957) ~SIZE~0)} is VALID [2021-09-13 14:12:35,523 INFO L281 TraceCheckUtils]: 19: Hoare triple {1498#(<= (+ ULTIMATE.start_main_~i~0 49999957) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {1499#(<= (+ ULTIMATE.start_main_~i~0 49999953) ~SIZE~0)} is VALID [2021-09-13 14:12:35,524 INFO L281 TraceCheckUtils]: 20: Hoare triple {1499#(<= (+ ULTIMATE.start_main_~i~0 49999953) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {1499#(<= (+ ULTIMATE.start_main_~i~0 49999953) ~SIZE~0)} is VALID [2021-09-13 14:12:35,524 INFO L281 TraceCheckUtils]: 21: Hoare triple {1499#(<= (+ ULTIMATE.start_main_~i~0 49999953) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {1500#(<= (+ 49999949 ULTIMATE.start_main_~i~0) ~SIZE~0)} is VALID [2021-09-13 14:12:35,525 INFO L281 TraceCheckUtils]: 22: Hoare triple {1500#(<= (+ 49999949 ULTIMATE.start_main_~i~0) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {1500#(<= (+ 49999949 ULTIMATE.start_main_~i~0) ~SIZE~0)} is VALID [2021-09-13 14:12:35,525 INFO L281 TraceCheckUtils]: 23: Hoare triple {1500#(<= (+ 49999949 ULTIMATE.start_main_~i~0) ~SIZE~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {1501#(<= (+ ULTIMATE.start_main_~i~0 49999941) ~SIZE~0)} is VALID [2021-09-13 14:12:35,526 INFO L281 TraceCheckUtils]: 24: Hoare triple {1501#(<= (+ ULTIMATE.start_main_~i~0 49999941) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {1501#(<= (+ ULTIMATE.start_main_~i~0 49999941) ~SIZE~0)} is VALID [2021-09-13 14:12:35,526 INFO L281 TraceCheckUtils]: 25: Hoare triple {1501#(<= (+ ULTIMATE.start_main_~i~0 49999941) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {1502#(<= (+ ULTIMATE.start_main_~i~0 49999937) ~SIZE~0)} is VALID [2021-09-13 14:12:35,527 INFO L281 TraceCheckUtils]: 26: Hoare triple {1502#(<= (+ ULTIMATE.start_main_~i~0 49999937) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {1502#(<= (+ ULTIMATE.start_main_~i~0 49999937) ~SIZE~0)} is VALID [2021-09-13 14:12:35,527 INFO L281 TraceCheckUtils]: 27: Hoare triple {1502#(<= (+ ULTIMATE.start_main_~i~0 49999937) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {1503#(<= (+ ULTIMATE.start_main_~i~0 49999933) ~SIZE~0)} is VALID [2021-09-13 14:12:35,528 INFO L281 TraceCheckUtils]: 28: Hoare triple {1503#(<= (+ ULTIMATE.start_main_~i~0 49999933) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {1503#(<= (+ ULTIMATE.start_main_~i~0 49999933) ~SIZE~0)} is VALID [2021-09-13 14:12:35,528 INFO L281 TraceCheckUtils]: 29: Hoare triple {1503#(<= (+ ULTIMATE.start_main_~i~0 49999933) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {1504#(<= (+ 49999929 ULTIMATE.start_main_~i~0) ~SIZE~0)} is VALID [2021-09-13 14:12:35,529 INFO L281 TraceCheckUtils]: 30: Hoare triple {1504#(<= (+ 49999929 ULTIMATE.start_main_~i~0) ~SIZE~0)} assume !(main_~i~0 < ~SIZE~0); {1488#false} is VALID [2021-09-13 14:12:35,529 INFO L281 TraceCheckUtils]: 31: Hoare triple {1488#false} main_~j~0 := (if main_~i~0 < 0 && 0 != main_~i~0 % 4 then 1 + main_~i~0 / 4 else main_~i~0 / 4);__VERIFIER_assert_#in~cond := (if 4 * main_~j~0 == main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1488#false} is VALID [2021-09-13 14:12:35,529 INFO L281 TraceCheckUtils]: 32: Hoare triple {1488#false} assume 0 == __VERIFIER_assert_~cond; {1488#false} is VALID [2021-09-13 14:12:35,529 INFO L281 TraceCheckUtils]: 33: Hoare triple {1488#false} assume !false; {1488#false} is VALID [2021-09-13 14:12:35,530 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:12:35,531 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:12:35,531 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092426104] [2021-09-13 14:12:35,531 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092426104] provided 0 perfect and 1 imperfect interpolant sequences [2021-09-13 14:12:35,531 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016583277] [2021-09-13 14:12:35,531 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-09-13 14:12:35,532 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:12:35,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:12:35,541 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 14:12:35,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-09-13 14:12:35,590 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-09-13 14:12:35,590 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-09-13 14:12:35,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 17 conjunts are in the unsatisfiable core [2021-09-13 14:12:35,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:12:35,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:12:36,236 INFO L281 TraceCheckUtils]: 0: Hoare triple {1487#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(9);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~SIZE~0 := 50000001; {1489#(<= 50000001 ~SIZE~0)} is VALID [2021-09-13 14:12:36,237 INFO L281 TraceCheckUtils]: 1: Hoare triple {1489#(<= 50000001 ~SIZE~0)} havoc main_#res;havoc main_#t~nondet7, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0;main_~j~0 := 0; {1511#(and (<= ULTIMATE.start_main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:36,238 INFO L281 TraceCheckUtils]: 2: Hoare triple {1511#(and (<= ULTIMATE.start_main_~i~0 0) (<= 50000001 ~SIZE~0))} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {1511#(and (<= ULTIMATE.start_main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:36,239 INFO L281 TraceCheckUtils]: 3: Hoare triple {1511#(and (<= ULTIMATE.start_main_~i~0 0) (<= 50000001 ~SIZE~0))} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {1518#(and (<= ULTIMATE.start_main_~i~0 8) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:36,239 INFO L281 TraceCheckUtils]: 4: Hoare triple {1518#(and (<= ULTIMATE.start_main_~i~0 8) (<= 50000001 ~SIZE~0))} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {1518#(and (<= ULTIMATE.start_main_~i~0 8) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:36,240 INFO L281 TraceCheckUtils]: 5: Hoare triple {1518#(and (<= ULTIMATE.start_main_~i~0 8) (<= 50000001 ~SIZE~0))} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {1525#(and (<= ULTIMATE.start_main_~i~0 12) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:36,240 INFO L281 TraceCheckUtils]: 6: Hoare triple {1525#(and (<= ULTIMATE.start_main_~i~0 12) (<= 50000001 ~SIZE~0))} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {1525#(and (<= ULTIMATE.start_main_~i~0 12) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:36,241 INFO L281 TraceCheckUtils]: 7: Hoare triple {1525#(and (<= ULTIMATE.start_main_~i~0 12) (<= 50000001 ~SIZE~0))} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {1532#(and (<= ULTIMATE.start_main_~i~0 16) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:36,242 INFO L281 TraceCheckUtils]: 8: Hoare triple {1532#(and (<= ULTIMATE.start_main_~i~0 16) (<= 50000001 ~SIZE~0))} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {1532#(and (<= ULTIMATE.start_main_~i~0 16) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:36,242 INFO L281 TraceCheckUtils]: 9: Hoare triple {1532#(and (<= ULTIMATE.start_main_~i~0 16) (<= 50000001 ~SIZE~0))} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {1539#(and (<= ULTIMATE.start_main_~i~0 24) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:36,243 INFO L281 TraceCheckUtils]: 10: Hoare triple {1539#(and (<= ULTIMATE.start_main_~i~0 24) (<= 50000001 ~SIZE~0))} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {1539#(and (<= ULTIMATE.start_main_~i~0 24) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:36,244 INFO L281 TraceCheckUtils]: 11: Hoare triple {1539#(and (<= ULTIMATE.start_main_~i~0 24) (<= 50000001 ~SIZE~0))} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {1546#(and (<= ULTIMATE.start_main_~i~0 28) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:36,244 INFO L281 TraceCheckUtils]: 12: Hoare triple {1546#(and (<= ULTIMATE.start_main_~i~0 28) (<= 50000001 ~SIZE~0))} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {1546#(and (<= ULTIMATE.start_main_~i~0 28) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:36,245 INFO L281 TraceCheckUtils]: 13: Hoare triple {1546#(and (<= ULTIMATE.start_main_~i~0 28) (<= 50000001 ~SIZE~0))} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {1553#(and (<= ULTIMATE.start_main_~i~0 32) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:36,245 INFO L281 TraceCheckUtils]: 14: Hoare triple {1553#(and (<= ULTIMATE.start_main_~i~0 32) (<= 50000001 ~SIZE~0))} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {1553#(and (<= ULTIMATE.start_main_~i~0 32) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:36,246 INFO L281 TraceCheckUtils]: 15: Hoare triple {1553#(and (<= ULTIMATE.start_main_~i~0 32) (<= 50000001 ~SIZE~0))} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {1560#(and (<= ULTIMATE.start_main_~i~0 36) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:36,247 INFO L281 TraceCheckUtils]: 16: Hoare triple {1560#(and (<= ULTIMATE.start_main_~i~0 36) (<= 50000001 ~SIZE~0))} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {1560#(and (<= ULTIMATE.start_main_~i~0 36) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:36,247 INFO L281 TraceCheckUtils]: 17: Hoare triple {1560#(and (<= ULTIMATE.start_main_~i~0 36) (<= 50000001 ~SIZE~0))} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {1567#(and (<= ULTIMATE.start_main_~i~0 44) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:36,248 INFO L281 TraceCheckUtils]: 18: Hoare triple {1567#(and (<= ULTIMATE.start_main_~i~0 44) (<= 50000001 ~SIZE~0))} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {1567#(and (<= ULTIMATE.start_main_~i~0 44) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:36,248 INFO L281 TraceCheckUtils]: 19: Hoare triple {1567#(and (<= ULTIMATE.start_main_~i~0 44) (<= 50000001 ~SIZE~0))} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {1574#(and (<= ULTIMATE.start_main_~i~0 48) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:36,249 INFO L281 TraceCheckUtils]: 20: Hoare triple {1574#(and (<= ULTIMATE.start_main_~i~0 48) (<= 50000001 ~SIZE~0))} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {1574#(and (<= ULTIMATE.start_main_~i~0 48) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:36,250 INFO L281 TraceCheckUtils]: 21: Hoare triple {1574#(and (<= ULTIMATE.start_main_~i~0 48) (<= 50000001 ~SIZE~0))} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {1581#(and (<= ULTIMATE.start_main_~i~0 52) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:36,250 INFO L281 TraceCheckUtils]: 22: Hoare triple {1581#(and (<= ULTIMATE.start_main_~i~0 52) (<= 50000001 ~SIZE~0))} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {1581#(and (<= ULTIMATE.start_main_~i~0 52) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:36,251 INFO L281 TraceCheckUtils]: 23: Hoare triple {1581#(and (<= ULTIMATE.start_main_~i~0 52) (<= 50000001 ~SIZE~0))} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {1588#(and (<= ULTIMATE.start_main_~i~0 60) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:36,251 INFO L281 TraceCheckUtils]: 24: Hoare triple {1588#(and (<= ULTIMATE.start_main_~i~0 60) (<= 50000001 ~SIZE~0))} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {1588#(and (<= ULTIMATE.start_main_~i~0 60) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:36,252 INFO L281 TraceCheckUtils]: 25: Hoare triple {1588#(and (<= ULTIMATE.start_main_~i~0 60) (<= 50000001 ~SIZE~0))} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {1595#(and (<= ULTIMATE.start_main_~i~0 64) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:36,253 INFO L281 TraceCheckUtils]: 26: Hoare triple {1595#(and (<= ULTIMATE.start_main_~i~0 64) (<= 50000001 ~SIZE~0))} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {1595#(and (<= ULTIMATE.start_main_~i~0 64) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:36,254 INFO L281 TraceCheckUtils]: 27: Hoare triple {1595#(and (<= ULTIMATE.start_main_~i~0 64) (<= 50000001 ~SIZE~0))} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {1602#(and (<= ULTIMATE.start_main_~i~0 68) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:36,256 INFO L281 TraceCheckUtils]: 28: Hoare triple {1602#(and (<= ULTIMATE.start_main_~i~0 68) (<= 50000001 ~SIZE~0))} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {1602#(and (<= ULTIMATE.start_main_~i~0 68) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:36,258 INFO L281 TraceCheckUtils]: 29: Hoare triple {1602#(and (<= ULTIMATE.start_main_~i~0 68) (<= 50000001 ~SIZE~0))} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {1609#(and (<= ULTIMATE.start_main_~i~0 72) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:36,259 INFO L281 TraceCheckUtils]: 30: Hoare triple {1609#(and (<= ULTIMATE.start_main_~i~0 72) (<= 50000001 ~SIZE~0))} assume !(main_~i~0 < ~SIZE~0); {1488#false} is VALID [2021-09-13 14:12:36,259 INFO L281 TraceCheckUtils]: 31: Hoare triple {1488#false} main_~j~0 := (if main_~i~0 < 0 && 0 != main_~i~0 % 4 then 1 + main_~i~0 / 4 else main_~i~0 / 4);__VERIFIER_assert_#in~cond := (if 4 * main_~j~0 == main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1488#false} is VALID [2021-09-13 14:12:36,259 INFO L281 TraceCheckUtils]: 32: Hoare triple {1488#false} assume 0 == __VERIFIER_assert_~cond; {1488#false} is VALID [2021-09-13 14:12:36,259 INFO L281 TraceCheckUtils]: 33: Hoare triple {1488#false} assume !false; {1488#false} is VALID [2021-09-13 14:12:36,260 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:12:36,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:12:36,945 INFO L281 TraceCheckUtils]: 33: Hoare triple {1488#false} assume !false; {1488#false} is VALID [2021-09-13 14:12:36,946 INFO L281 TraceCheckUtils]: 32: Hoare triple {1488#false} assume 0 == __VERIFIER_assert_~cond; {1488#false} is VALID [2021-09-13 14:12:36,946 INFO L281 TraceCheckUtils]: 31: Hoare triple {1488#false} main_~j~0 := (if main_~i~0 < 0 && 0 != main_~i~0 % 4 then 1 + main_~i~0 / 4 else main_~i~0 / 4);__VERIFIER_assert_#in~cond := (if 4 * main_~j~0 == main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1488#false} is VALID [2021-09-13 14:12:36,946 INFO L281 TraceCheckUtils]: 30: Hoare triple {1631#(< ULTIMATE.start_main_~i~0 ~SIZE~0)} assume !(main_~i~0 < ~SIZE~0); {1488#false} is VALID [2021-09-13 14:12:36,947 INFO L281 TraceCheckUtils]: 29: Hoare triple {1635#(< (+ ULTIMATE.start_main_~i~0 4) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {1631#(< ULTIMATE.start_main_~i~0 ~SIZE~0)} is VALID [2021-09-13 14:12:36,948 INFO L281 TraceCheckUtils]: 28: Hoare triple {1635#(< (+ ULTIMATE.start_main_~i~0 4) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {1635#(< (+ ULTIMATE.start_main_~i~0 4) ~SIZE~0)} is VALID [2021-09-13 14:12:36,948 INFO L281 TraceCheckUtils]: 27: Hoare triple {1642#(< (+ ULTIMATE.start_main_~i~0 8) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {1635#(< (+ ULTIMATE.start_main_~i~0 4) ~SIZE~0)} is VALID [2021-09-13 14:12:36,949 INFO L281 TraceCheckUtils]: 26: Hoare triple {1642#(< (+ ULTIMATE.start_main_~i~0 8) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {1642#(< (+ ULTIMATE.start_main_~i~0 8) ~SIZE~0)} is VALID [2021-09-13 14:12:36,949 INFO L281 TraceCheckUtils]: 25: Hoare triple {1649#(< (+ ULTIMATE.start_main_~i~0 12) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {1642#(< (+ ULTIMATE.start_main_~i~0 8) ~SIZE~0)} is VALID [2021-09-13 14:12:36,950 INFO L281 TraceCheckUtils]: 24: Hoare triple {1649#(< (+ ULTIMATE.start_main_~i~0 12) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {1649#(< (+ ULTIMATE.start_main_~i~0 12) ~SIZE~0)} is VALID [2021-09-13 14:12:36,950 INFO L281 TraceCheckUtils]: 23: Hoare triple {1656#(< (+ ULTIMATE.start_main_~i~0 20) ~SIZE~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {1649#(< (+ ULTIMATE.start_main_~i~0 12) ~SIZE~0)} is VALID [2021-09-13 14:12:36,950 INFO L281 TraceCheckUtils]: 22: Hoare triple {1656#(< (+ ULTIMATE.start_main_~i~0 20) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {1656#(< (+ ULTIMATE.start_main_~i~0 20) ~SIZE~0)} is VALID [2021-09-13 14:12:36,951 INFO L281 TraceCheckUtils]: 21: Hoare triple {1663#(< (+ ULTIMATE.start_main_~i~0 24) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {1656#(< (+ ULTIMATE.start_main_~i~0 20) ~SIZE~0)} is VALID [2021-09-13 14:12:36,951 INFO L281 TraceCheckUtils]: 20: Hoare triple {1663#(< (+ ULTIMATE.start_main_~i~0 24) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {1663#(< (+ ULTIMATE.start_main_~i~0 24) ~SIZE~0)} is VALID [2021-09-13 14:12:36,952 INFO L281 TraceCheckUtils]: 19: Hoare triple {1670#(< (+ ULTIMATE.start_main_~i~0 28) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {1663#(< (+ ULTIMATE.start_main_~i~0 24) ~SIZE~0)} is VALID [2021-09-13 14:12:36,952 INFO L281 TraceCheckUtils]: 18: Hoare triple {1670#(< (+ ULTIMATE.start_main_~i~0 28) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {1670#(< (+ ULTIMATE.start_main_~i~0 28) ~SIZE~0)} is VALID [2021-09-13 14:12:36,953 INFO L281 TraceCheckUtils]: 17: Hoare triple {1677#(< (+ ULTIMATE.start_main_~i~0 36) ~SIZE~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {1670#(< (+ ULTIMATE.start_main_~i~0 28) ~SIZE~0)} is VALID [2021-09-13 14:12:36,953 INFO L281 TraceCheckUtils]: 16: Hoare triple {1677#(< (+ ULTIMATE.start_main_~i~0 36) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {1677#(< (+ ULTIMATE.start_main_~i~0 36) ~SIZE~0)} is VALID [2021-09-13 14:12:36,953 INFO L281 TraceCheckUtils]: 15: Hoare triple {1684#(< (+ 40 ULTIMATE.start_main_~i~0) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {1677#(< (+ ULTIMATE.start_main_~i~0 36) ~SIZE~0)} is VALID [2021-09-13 14:12:36,954 INFO L281 TraceCheckUtils]: 14: Hoare triple {1684#(< (+ 40 ULTIMATE.start_main_~i~0) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {1684#(< (+ 40 ULTIMATE.start_main_~i~0) ~SIZE~0)} is VALID [2021-09-13 14:12:36,955 INFO L281 TraceCheckUtils]: 13: Hoare triple {1691#(< (+ ULTIMATE.start_main_~i~0 44) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {1684#(< (+ 40 ULTIMATE.start_main_~i~0) ~SIZE~0)} is VALID [2021-09-13 14:12:36,955 INFO L281 TraceCheckUtils]: 12: Hoare triple {1691#(< (+ ULTIMATE.start_main_~i~0 44) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {1691#(< (+ ULTIMATE.start_main_~i~0 44) ~SIZE~0)} is VALID [2021-09-13 14:12:36,956 INFO L281 TraceCheckUtils]: 11: Hoare triple {1698#(< (+ ULTIMATE.start_main_~i~0 48) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {1691#(< (+ ULTIMATE.start_main_~i~0 44) ~SIZE~0)} is VALID [2021-09-13 14:12:36,956 INFO L281 TraceCheckUtils]: 10: Hoare triple {1698#(< (+ ULTIMATE.start_main_~i~0 48) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {1698#(< (+ ULTIMATE.start_main_~i~0 48) ~SIZE~0)} is VALID [2021-09-13 14:12:36,957 INFO L281 TraceCheckUtils]: 9: Hoare triple {1705#(< (+ 56 ULTIMATE.start_main_~i~0) ~SIZE~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {1698#(< (+ ULTIMATE.start_main_~i~0 48) ~SIZE~0)} is VALID [2021-09-13 14:12:36,957 INFO L281 TraceCheckUtils]: 8: Hoare triple {1705#(< (+ 56 ULTIMATE.start_main_~i~0) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {1705#(< (+ 56 ULTIMATE.start_main_~i~0) ~SIZE~0)} is VALID [2021-09-13 14:12:36,957 INFO L281 TraceCheckUtils]: 7: Hoare triple {1712#(< (+ ULTIMATE.start_main_~i~0 60) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {1705#(< (+ 56 ULTIMATE.start_main_~i~0) ~SIZE~0)} is VALID [2021-09-13 14:12:36,958 INFO L281 TraceCheckUtils]: 6: Hoare triple {1712#(< (+ ULTIMATE.start_main_~i~0 60) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {1712#(< (+ ULTIMATE.start_main_~i~0 60) ~SIZE~0)} is VALID [2021-09-13 14:12:36,958 INFO L281 TraceCheckUtils]: 5: Hoare triple {1719#(< (+ ULTIMATE.start_main_~i~0 64) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {1712#(< (+ ULTIMATE.start_main_~i~0 60) ~SIZE~0)} is VALID [2021-09-13 14:12:36,959 INFO L281 TraceCheckUtils]: 4: Hoare triple {1719#(< (+ ULTIMATE.start_main_~i~0 64) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {1719#(< (+ ULTIMATE.start_main_~i~0 64) ~SIZE~0)} is VALID [2021-09-13 14:12:36,959 INFO L281 TraceCheckUtils]: 3: Hoare triple {1726#(< (+ ULTIMATE.start_main_~i~0 72) ~SIZE~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {1719#(< (+ ULTIMATE.start_main_~i~0 64) ~SIZE~0)} is VALID [2021-09-13 14:12:36,959 INFO L281 TraceCheckUtils]: 2: Hoare triple {1726#(< (+ ULTIMATE.start_main_~i~0 72) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {1726#(< (+ ULTIMATE.start_main_~i~0 72) ~SIZE~0)} is VALID [2021-09-13 14:12:36,960 INFO L281 TraceCheckUtils]: 1: Hoare triple {1733#(< 72 ~SIZE~0)} havoc main_#res;havoc main_#t~nondet7, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0;main_~j~0 := 0; {1726#(< (+ ULTIMATE.start_main_~i~0 72) ~SIZE~0)} is VALID [2021-09-13 14:12:36,961 INFO L281 TraceCheckUtils]: 0: Hoare triple {1487#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(9);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~SIZE~0 := 50000001; {1733#(< 72 ~SIZE~0)} is VALID [2021-09-13 14:12:36,961 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:12:36,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016583277] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:12:36,961 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-09-13 14:12:36,962 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 48 [2021-09-13 14:12:36,962 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581346614] [2021-09-13 14:12:36,963 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 48 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-09-13 14:12:36,963 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:12:36,963 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 49 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 48 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:37,037 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:12:37,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2021-09-13 14:12:37,037 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:12:37,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-09-13 14:12:37,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1027, Invalid=1325, Unknown=0, NotChecked=0, Total=2352 [2021-09-13 14:12:37,040 INFO L87 Difference]: Start difference. First operand 43 states and 61 transitions. Second operand has 49 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 48 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:38,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:38,226 INFO L93 Difference]: Finished difference Result 265 states and 401 transitions. [2021-09-13 14:12:38,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-09-13 14:12:38,226 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 48 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-09-13 14:12:38,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:12:38,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 48 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:38,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 116 transitions. [2021-09-13 14:12:38,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 48 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:38,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 116 transitions. [2021-09-13 14:12:38,230 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 116 transitions. [2021-09-13 14:12:38,315 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:12:38,321 INFO L225 Difference]: With dead ends: 265 [2021-09-13 14:12:38,322 INFO L226 Difference]: Without dead ends: 261 [2021-09-13 14:12:38,323 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1377 ImplicationChecksByTransitivity, 931.53ms TimeCoverageRelationStatistics Valid=1552, Invalid=2480, Unknown=0, NotChecked=0, Total=4032 [2021-09-13 14:12:38,323 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 100 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 261.53ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.26ms SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 264.46ms IncrementalHoareTripleChecker+Time [2021-09-13 14:12:38,324 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 0 Invalid, 353 Unknown, 0 Unchecked, 3.26ms Time], IncrementalHoareTripleChecker [210 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 264.46ms Time] [2021-09-13 14:12:38,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2021-09-13 14:12:38,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 67. [2021-09-13 14:12:38,431 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:12:38,432 INFO L82 GeneralOperation]: Start isEquivalent. First operand 261 states. Second operand has 67 states, 66 states have (on average 1.4696969696969697) internal successors, (97), 66 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:38,432 INFO L74 IsIncluded]: Start isIncluded. First operand 261 states. Second operand has 67 states, 66 states have (on average 1.4696969696969697) internal successors, (97), 66 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:38,432 INFO L87 Difference]: Start difference. First operand 261 states. Second operand has 67 states, 66 states have (on average 1.4696969696969697) internal successors, (97), 66 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:38,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:38,441 INFO L93 Difference]: Finished difference Result 261 states and 382 transitions. [2021-09-13 14:12:38,441 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 382 transitions. [2021-09-13 14:12:38,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:12:38,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:12:38,442 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 66 states have (on average 1.4696969696969697) internal successors, (97), 66 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 261 states. [2021-09-13 14:12:38,442 INFO L87 Difference]: Start difference. First operand has 67 states, 66 states have (on average 1.4696969696969697) internal successors, (97), 66 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 261 states. [2021-09-13 14:12:38,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:38,451 INFO L93 Difference]: Finished difference Result 261 states and 382 transitions. [2021-09-13 14:12:38,451 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 382 transitions. [2021-09-13 14:12:38,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:12:38,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:12:38,452 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:12:38,452 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:12:38,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.4696969696969697) internal successors, (97), 66 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:38,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 97 transitions. [2021-09-13 14:12:38,454 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 97 transitions. Word has length 34 [2021-09-13 14:12:38,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:12:38,455 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 97 transitions. [2021-09-13 14:12:38,455 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 48 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:38,455 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 97 transitions. [2021-09-13 14:12:38,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-09-13 14:12:38,456 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:12:38,456 INFO L513 BasicCegarLoop]: trace histogram [18, 12, 6, 1, 1, 1, 1, 1, 1] [2021-09-13 14:12:38,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-09-13 14:12:38,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:12:38,681 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:12:38,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:12:38,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1645760435, now seen corresponding path program 3 times [2021-09-13 14:12:38,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:12:38,682 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823158898] [2021-09-13 14:12:38,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:12:38,682 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:12:38,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:12:39,009 INFO L281 TraceCheckUtils]: 0: Hoare triple {2785#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(9);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~SIZE~0 := 50000001; {2787#(<= 50000001 ~SIZE~0)} is VALID [2021-09-13 14:12:39,009 INFO L281 TraceCheckUtils]: 1: Hoare triple {2787#(<= 50000001 ~SIZE~0)} havoc main_#res;havoc main_#t~nondet7, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0;main_~j~0 := 0; {2788#(and (= ULTIMATE.start_main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:39,010 INFO L281 TraceCheckUtils]: 2: Hoare triple {2788#(and (= ULTIMATE.start_main_~i~0 0) (<= 50000001 ~SIZE~0))} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {2788#(and (= ULTIMATE.start_main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:39,010 INFO L281 TraceCheckUtils]: 3: Hoare triple {2788#(and (= ULTIMATE.start_main_~i~0 0) (<= 50000001 ~SIZE~0))} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {2789#(<= (+ 49999997 ULTIMATE.start_main_~i~0) ~SIZE~0)} is VALID [2021-09-13 14:12:39,011 INFO L281 TraceCheckUtils]: 4: Hoare triple {2789#(<= (+ 49999997 ULTIMATE.start_main_~i~0) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {2789#(<= (+ 49999997 ULTIMATE.start_main_~i~0) ~SIZE~0)} is VALID [2021-09-13 14:12:39,011 INFO L281 TraceCheckUtils]: 5: Hoare triple {2789#(<= (+ 49999997 ULTIMATE.start_main_~i~0) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {2790#(<= (+ ULTIMATE.start_main_~i~0 49999993) ~SIZE~0)} is VALID [2021-09-13 14:12:39,012 INFO L281 TraceCheckUtils]: 6: Hoare triple {2790#(<= (+ ULTIMATE.start_main_~i~0 49999993) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {2790#(<= (+ ULTIMATE.start_main_~i~0 49999993) ~SIZE~0)} is VALID [2021-09-13 14:12:39,012 INFO L281 TraceCheckUtils]: 7: Hoare triple {2790#(<= (+ ULTIMATE.start_main_~i~0 49999993) ~SIZE~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {2791#(<= (+ ULTIMATE.start_main_~i~0 49999985) ~SIZE~0)} is VALID [2021-09-13 14:12:39,013 INFO L281 TraceCheckUtils]: 8: Hoare triple {2791#(<= (+ ULTIMATE.start_main_~i~0 49999985) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {2791#(<= (+ ULTIMATE.start_main_~i~0 49999985) ~SIZE~0)} is VALID [2021-09-13 14:12:39,013 INFO L281 TraceCheckUtils]: 9: Hoare triple {2791#(<= (+ ULTIMATE.start_main_~i~0 49999985) ~SIZE~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {2792#(<= (+ ULTIMATE.start_main_~i~0 49999977) ~SIZE~0)} is VALID [2021-09-13 14:12:39,013 INFO L281 TraceCheckUtils]: 10: Hoare triple {2792#(<= (+ ULTIMATE.start_main_~i~0 49999977) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {2792#(<= (+ ULTIMATE.start_main_~i~0 49999977) ~SIZE~0)} is VALID [2021-09-13 14:12:39,014 INFO L281 TraceCheckUtils]: 11: Hoare triple {2792#(<= (+ ULTIMATE.start_main_~i~0 49999977) ~SIZE~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {2793#(<= (+ ULTIMATE.start_main_~i~0 49999969) ~SIZE~0)} is VALID [2021-09-13 14:12:39,014 INFO L281 TraceCheckUtils]: 12: Hoare triple {2793#(<= (+ ULTIMATE.start_main_~i~0 49999969) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {2793#(<= (+ ULTIMATE.start_main_~i~0 49999969) ~SIZE~0)} is VALID [2021-09-13 14:12:39,015 INFO L281 TraceCheckUtils]: 13: Hoare triple {2793#(<= (+ ULTIMATE.start_main_~i~0 49999969) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {2794#(<= (+ ULTIMATE.start_main_~i~0 49999965) ~SIZE~0)} is VALID [2021-09-13 14:12:39,015 INFO L281 TraceCheckUtils]: 14: Hoare triple {2794#(<= (+ ULTIMATE.start_main_~i~0 49999965) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {2794#(<= (+ ULTIMATE.start_main_~i~0 49999965) ~SIZE~0)} is VALID [2021-09-13 14:12:39,016 INFO L281 TraceCheckUtils]: 15: Hoare triple {2794#(<= (+ ULTIMATE.start_main_~i~0 49999965) ~SIZE~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {2795#(<= (+ ULTIMATE.start_main_~i~0 49999957) ~SIZE~0)} is VALID [2021-09-13 14:12:39,016 INFO L281 TraceCheckUtils]: 16: Hoare triple {2795#(<= (+ ULTIMATE.start_main_~i~0 49999957) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {2795#(<= (+ ULTIMATE.start_main_~i~0 49999957) ~SIZE~0)} is VALID [2021-09-13 14:12:39,017 INFO L281 TraceCheckUtils]: 17: Hoare triple {2795#(<= (+ ULTIMATE.start_main_~i~0 49999957) ~SIZE~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {2796#(<= (+ 49999949 ULTIMATE.start_main_~i~0) ~SIZE~0)} is VALID [2021-09-13 14:12:39,017 INFO L281 TraceCheckUtils]: 18: Hoare triple {2796#(<= (+ 49999949 ULTIMATE.start_main_~i~0) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {2796#(<= (+ 49999949 ULTIMATE.start_main_~i~0) ~SIZE~0)} is VALID [2021-09-13 14:12:39,018 INFO L281 TraceCheckUtils]: 19: Hoare triple {2796#(<= (+ 49999949 ULTIMATE.start_main_~i~0) ~SIZE~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {2797#(<= (+ ULTIMATE.start_main_~i~0 49999941) ~SIZE~0)} is VALID [2021-09-13 14:12:39,018 INFO L281 TraceCheckUtils]: 20: Hoare triple {2797#(<= (+ ULTIMATE.start_main_~i~0 49999941) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {2797#(<= (+ ULTIMATE.start_main_~i~0 49999941) ~SIZE~0)} is VALID [2021-09-13 14:12:39,019 INFO L281 TraceCheckUtils]: 21: Hoare triple {2797#(<= (+ ULTIMATE.start_main_~i~0 49999941) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {2798#(<= (+ ULTIMATE.start_main_~i~0 49999937) ~SIZE~0)} is VALID [2021-09-13 14:12:39,019 INFO L281 TraceCheckUtils]: 22: Hoare triple {2798#(<= (+ ULTIMATE.start_main_~i~0 49999937) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {2798#(<= (+ ULTIMATE.start_main_~i~0 49999937) ~SIZE~0)} is VALID [2021-09-13 14:12:39,019 INFO L281 TraceCheckUtils]: 23: Hoare triple {2798#(<= (+ ULTIMATE.start_main_~i~0 49999937) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {2799#(<= (+ ULTIMATE.start_main_~i~0 49999933) ~SIZE~0)} is VALID [2021-09-13 14:12:39,020 INFO L281 TraceCheckUtils]: 24: Hoare triple {2799#(<= (+ ULTIMATE.start_main_~i~0 49999933) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {2799#(<= (+ ULTIMATE.start_main_~i~0 49999933) ~SIZE~0)} is VALID [2021-09-13 14:12:39,020 INFO L281 TraceCheckUtils]: 25: Hoare triple {2799#(<= (+ ULTIMATE.start_main_~i~0 49999933) ~SIZE~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {2800#(<= (+ ULTIMATE.start_main_~i~0 49999925) ~SIZE~0)} is VALID [2021-09-13 14:12:39,021 INFO L281 TraceCheckUtils]: 26: Hoare triple {2800#(<= (+ ULTIMATE.start_main_~i~0 49999925) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {2800#(<= (+ ULTIMATE.start_main_~i~0 49999925) ~SIZE~0)} is VALID [2021-09-13 14:12:39,021 INFO L281 TraceCheckUtils]: 27: Hoare triple {2800#(<= (+ ULTIMATE.start_main_~i~0 49999925) ~SIZE~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {2801#(<= (+ ULTIMATE.start_main_~i~0 49999917) ~SIZE~0)} is VALID [2021-09-13 14:12:39,021 INFO L281 TraceCheckUtils]: 28: Hoare triple {2801#(<= (+ ULTIMATE.start_main_~i~0 49999917) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {2801#(<= (+ ULTIMATE.start_main_~i~0 49999917) ~SIZE~0)} is VALID [2021-09-13 14:12:39,022 INFO L281 TraceCheckUtils]: 29: Hoare triple {2801#(<= (+ ULTIMATE.start_main_~i~0 49999917) ~SIZE~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {2802#(<= (+ ULTIMATE.start_main_~i~0 49999909) ~SIZE~0)} is VALID [2021-09-13 14:12:39,022 INFO L281 TraceCheckUtils]: 30: Hoare triple {2802#(<= (+ ULTIMATE.start_main_~i~0 49999909) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {2802#(<= (+ ULTIMATE.start_main_~i~0 49999909) ~SIZE~0)} is VALID [2021-09-13 14:12:39,033 INFO L281 TraceCheckUtils]: 31: Hoare triple {2802#(<= (+ ULTIMATE.start_main_~i~0 49999909) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {2803#(<= (+ ULTIMATE.start_main_~i~0 49999905) ~SIZE~0)} is VALID [2021-09-13 14:12:39,034 INFO L281 TraceCheckUtils]: 32: Hoare triple {2803#(<= (+ ULTIMATE.start_main_~i~0 49999905) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {2803#(<= (+ ULTIMATE.start_main_~i~0 49999905) ~SIZE~0)} is VALID [2021-09-13 14:12:39,034 INFO L281 TraceCheckUtils]: 33: Hoare triple {2803#(<= (+ ULTIMATE.start_main_~i~0 49999905) ~SIZE~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {2804#(<= (+ ULTIMATE.start_main_~i~0 49999897) ~SIZE~0)} is VALID [2021-09-13 14:12:39,035 INFO L281 TraceCheckUtils]: 34: Hoare triple {2804#(<= (+ ULTIMATE.start_main_~i~0 49999897) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {2804#(<= (+ ULTIMATE.start_main_~i~0 49999897) ~SIZE~0)} is VALID [2021-09-13 14:12:39,035 INFO L281 TraceCheckUtils]: 35: Hoare triple {2804#(<= (+ ULTIMATE.start_main_~i~0 49999897) ~SIZE~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {2805#(<= (+ ULTIMATE.start_main_~i~0 49999889) ~SIZE~0)} is VALID [2021-09-13 14:12:39,036 INFO L281 TraceCheckUtils]: 36: Hoare triple {2805#(<= (+ ULTIMATE.start_main_~i~0 49999889) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {2805#(<= (+ ULTIMATE.start_main_~i~0 49999889) ~SIZE~0)} is VALID [2021-09-13 14:12:39,036 INFO L281 TraceCheckUtils]: 37: Hoare triple {2805#(<= (+ ULTIMATE.start_main_~i~0 49999889) ~SIZE~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {2806#(<= (+ ULTIMATE.start_main_~i~0 49999881) ~SIZE~0)} is VALID [2021-09-13 14:12:39,037 INFO L281 TraceCheckUtils]: 38: Hoare triple {2806#(<= (+ ULTIMATE.start_main_~i~0 49999881) ~SIZE~0)} assume !(main_~i~0 < ~SIZE~0); {2786#false} is VALID [2021-09-13 14:12:39,037 INFO L281 TraceCheckUtils]: 39: Hoare triple {2786#false} main_~j~0 := (if main_~i~0 < 0 && 0 != main_~i~0 % 4 then 1 + main_~i~0 / 4 else main_~i~0 / 4);__VERIFIER_assert_#in~cond := (if 4 * main_~j~0 == main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2786#false} is VALID [2021-09-13 14:12:39,037 INFO L281 TraceCheckUtils]: 40: Hoare triple {2786#false} assume 0 == __VERIFIER_assert_~cond; {2786#false} is VALID [2021-09-13 14:12:39,038 INFO L281 TraceCheckUtils]: 41: Hoare triple {2786#false} assume !false; {2786#false} is VALID [2021-09-13 14:12:39,038 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:12:39,038 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:12:39,039 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823158898] [2021-09-13 14:12:39,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823158898] provided 0 perfect and 1 imperfect interpolant sequences [2021-09-13 14:12:39,039 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494496143] [2021-09-13 14:12:39,039 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-09-13 14:12:39,039 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:12:39,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:12:39,053 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 14:12:39,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-09-13 14:12:39,115 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2021-09-13 14:12:39,116 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-09-13 14:12:39,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 21 conjunts are in the unsatisfiable core [2021-09-13 14:12:39,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:12:39,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:12:40,020 INFO L281 TraceCheckUtils]: 0: Hoare triple {2785#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(9);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~SIZE~0 := 50000001; {2787#(<= 50000001 ~SIZE~0)} is VALID [2021-09-13 14:12:40,021 INFO L281 TraceCheckUtils]: 1: Hoare triple {2787#(<= 50000001 ~SIZE~0)} havoc main_#res;havoc main_#t~nondet7, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0;main_~j~0 := 0; {2813#(and (<= ULTIMATE.start_main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:40,021 INFO L281 TraceCheckUtils]: 2: Hoare triple {2813#(and (<= ULTIMATE.start_main_~i~0 0) (<= 50000001 ~SIZE~0))} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {2813#(and (<= ULTIMATE.start_main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:40,022 INFO L281 TraceCheckUtils]: 3: Hoare triple {2813#(and (<= ULTIMATE.start_main_~i~0 0) (<= 50000001 ~SIZE~0))} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {2820#(and (<= ULTIMATE.start_main_~i~0 4) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:40,022 INFO L281 TraceCheckUtils]: 4: Hoare triple {2820#(and (<= ULTIMATE.start_main_~i~0 4) (<= 50000001 ~SIZE~0))} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {2820#(and (<= ULTIMATE.start_main_~i~0 4) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:40,023 INFO L281 TraceCheckUtils]: 5: Hoare triple {2820#(and (<= ULTIMATE.start_main_~i~0 4) (<= 50000001 ~SIZE~0))} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {2827#(and (<= ULTIMATE.start_main_~i~0 8) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:40,023 INFO L281 TraceCheckUtils]: 6: Hoare triple {2827#(and (<= ULTIMATE.start_main_~i~0 8) (<= 50000001 ~SIZE~0))} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {2827#(and (<= ULTIMATE.start_main_~i~0 8) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:40,024 INFO L281 TraceCheckUtils]: 7: Hoare triple {2827#(and (<= ULTIMATE.start_main_~i~0 8) (<= 50000001 ~SIZE~0))} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {2834#(and (<= ULTIMATE.start_main_~i~0 16) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:40,024 INFO L281 TraceCheckUtils]: 8: Hoare triple {2834#(and (<= ULTIMATE.start_main_~i~0 16) (<= 50000001 ~SIZE~0))} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {2834#(and (<= ULTIMATE.start_main_~i~0 16) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:40,025 INFO L281 TraceCheckUtils]: 9: Hoare triple {2834#(and (<= ULTIMATE.start_main_~i~0 16) (<= 50000001 ~SIZE~0))} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {2841#(and (<= ULTIMATE.start_main_~i~0 24) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:40,025 INFO L281 TraceCheckUtils]: 10: Hoare triple {2841#(and (<= ULTIMATE.start_main_~i~0 24) (<= 50000001 ~SIZE~0))} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {2841#(and (<= ULTIMATE.start_main_~i~0 24) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:40,026 INFO L281 TraceCheckUtils]: 11: Hoare triple {2841#(and (<= ULTIMATE.start_main_~i~0 24) (<= 50000001 ~SIZE~0))} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {2848#(and (<= ULTIMATE.start_main_~i~0 32) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:40,026 INFO L281 TraceCheckUtils]: 12: Hoare triple {2848#(and (<= ULTIMATE.start_main_~i~0 32) (<= 50000001 ~SIZE~0))} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {2848#(and (<= ULTIMATE.start_main_~i~0 32) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:40,027 INFO L281 TraceCheckUtils]: 13: Hoare triple {2848#(and (<= ULTIMATE.start_main_~i~0 32) (<= 50000001 ~SIZE~0))} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {2855#(and (<= ULTIMATE.start_main_~i~0 36) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:40,027 INFO L281 TraceCheckUtils]: 14: Hoare triple {2855#(and (<= ULTIMATE.start_main_~i~0 36) (<= 50000001 ~SIZE~0))} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {2855#(and (<= ULTIMATE.start_main_~i~0 36) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:40,028 INFO L281 TraceCheckUtils]: 15: Hoare triple {2855#(and (<= ULTIMATE.start_main_~i~0 36) (<= 50000001 ~SIZE~0))} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {2862#(and (<= ULTIMATE.start_main_~i~0 44) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:40,028 INFO L281 TraceCheckUtils]: 16: Hoare triple {2862#(and (<= ULTIMATE.start_main_~i~0 44) (<= 50000001 ~SIZE~0))} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {2862#(and (<= ULTIMATE.start_main_~i~0 44) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:40,029 INFO L281 TraceCheckUtils]: 17: Hoare triple {2862#(and (<= ULTIMATE.start_main_~i~0 44) (<= 50000001 ~SIZE~0))} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {2869#(and (<= ULTIMATE.start_main_~i~0 52) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:40,029 INFO L281 TraceCheckUtils]: 18: Hoare triple {2869#(and (<= ULTIMATE.start_main_~i~0 52) (<= 50000001 ~SIZE~0))} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {2869#(and (<= ULTIMATE.start_main_~i~0 52) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:40,030 INFO L281 TraceCheckUtils]: 19: Hoare triple {2869#(and (<= ULTIMATE.start_main_~i~0 52) (<= 50000001 ~SIZE~0))} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {2876#(and (<= ULTIMATE.start_main_~i~0 60) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:40,030 INFO L281 TraceCheckUtils]: 20: Hoare triple {2876#(and (<= ULTIMATE.start_main_~i~0 60) (<= 50000001 ~SIZE~0))} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {2876#(and (<= ULTIMATE.start_main_~i~0 60) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:40,031 INFO L281 TraceCheckUtils]: 21: Hoare triple {2876#(and (<= ULTIMATE.start_main_~i~0 60) (<= 50000001 ~SIZE~0))} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {2883#(and (<= ULTIMATE.start_main_~i~0 64) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:40,031 INFO L281 TraceCheckUtils]: 22: Hoare triple {2883#(and (<= ULTIMATE.start_main_~i~0 64) (<= 50000001 ~SIZE~0))} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {2883#(and (<= ULTIMATE.start_main_~i~0 64) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:40,032 INFO L281 TraceCheckUtils]: 23: Hoare triple {2883#(and (<= ULTIMATE.start_main_~i~0 64) (<= 50000001 ~SIZE~0))} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {2890#(and (<= ULTIMATE.start_main_~i~0 68) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:40,032 INFO L281 TraceCheckUtils]: 24: Hoare triple {2890#(and (<= ULTIMATE.start_main_~i~0 68) (<= 50000001 ~SIZE~0))} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {2890#(and (<= ULTIMATE.start_main_~i~0 68) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:40,033 INFO L281 TraceCheckUtils]: 25: Hoare triple {2890#(and (<= ULTIMATE.start_main_~i~0 68) (<= 50000001 ~SIZE~0))} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {2897#(and (<= ULTIMATE.start_main_~i~0 76) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:40,033 INFO L281 TraceCheckUtils]: 26: Hoare triple {2897#(and (<= ULTIMATE.start_main_~i~0 76) (<= 50000001 ~SIZE~0))} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {2897#(and (<= ULTIMATE.start_main_~i~0 76) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:40,034 INFO L281 TraceCheckUtils]: 27: Hoare triple {2897#(and (<= ULTIMATE.start_main_~i~0 76) (<= 50000001 ~SIZE~0))} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {2904#(and (<= ULTIMATE.start_main_~i~0 84) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:40,034 INFO L281 TraceCheckUtils]: 28: Hoare triple {2904#(and (<= ULTIMATE.start_main_~i~0 84) (<= 50000001 ~SIZE~0))} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {2904#(and (<= ULTIMATE.start_main_~i~0 84) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:40,035 INFO L281 TraceCheckUtils]: 29: Hoare triple {2904#(and (<= ULTIMATE.start_main_~i~0 84) (<= 50000001 ~SIZE~0))} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {2911#(and (<= ULTIMATE.start_main_~i~0 92) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:40,035 INFO L281 TraceCheckUtils]: 30: Hoare triple {2911#(and (<= ULTIMATE.start_main_~i~0 92) (<= 50000001 ~SIZE~0))} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {2911#(and (<= ULTIMATE.start_main_~i~0 92) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:40,036 INFO L281 TraceCheckUtils]: 31: Hoare triple {2911#(and (<= ULTIMATE.start_main_~i~0 92) (<= 50000001 ~SIZE~0))} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {2918#(and (<= ULTIMATE.start_main_~i~0 96) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:40,036 INFO L281 TraceCheckUtils]: 32: Hoare triple {2918#(and (<= ULTIMATE.start_main_~i~0 96) (<= 50000001 ~SIZE~0))} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {2918#(and (<= ULTIMATE.start_main_~i~0 96) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:40,037 INFO L281 TraceCheckUtils]: 33: Hoare triple {2918#(and (<= ULTIMATE.start_main_~i~0 96) (<= 50000001 ~SIZE~0))} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {2925#(and (<= ULTIMATE.start_main_~i~0 104) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:40,037 INFO L281 TraceCheckUtils]: 34: Hoare triple {2925#(and (<= ULTIMATE.start_main_~i~0 104) (<= 50000001 ~SIZE~0))} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {2925#(and (<= ULTIMATE.start_main_~i~0 104) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:40,037 INFO L281 TraceCheckUtils]: 35: Hoare triple {2925#(and (<= ULTIMATE.start_main_~i~0 104) (<= 50000001 ~SIZE~0))} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {2932#(and (<= ULTIMATE.start_main_~i~0 112) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:40,038 INFO L281 TraceCheckUtils]: 36: Hoare triple {2932#(and (<= ULTIMATE.start_main_~i~0 112) (<= 50000001 ~SIZE~0))} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {2932#(and (<= ULTIMATE.start_main_~i~0 112) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:40,038 INFO L281 TraceCheckUtils]: 37: Hoare triple {2932#(and (<= ULTIMATE.start_main_~i~0 112) (<= 50000001 ~SIZE~0))} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {2939#(and (<= ULTIMATE.start_main_~i~0 120) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:40,039 INFO L281 TraceCheckUtils]: 38: Hoare triple {2939#(and (<= ULTIMATE.start_main_~i~0 120) (<= 50000001 ~SIZE~0))} assume !(main_~i~0 < ~SIZE~0); {2786#false} is VALID [2021-09-13 14:12:40,039 INFO L281 TraceCheckUtils]: 39: Hoare triple {2786#false} main_~j~0 := (if main_~i~0 < 0 && 0 != main_~i~0 % 4 then 1 + main_~i~0 / 4 else main_~i~0 / 4);__VERIFIER_assert_#in~cond := (if 4 * main_~j~0 == main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2786#false} is VALID [2021-09-13 14:12:40,039 INFO L281 TraceCheckUtils]: 40: Hoare triple {2786#false} assume 0 == __VERIFIER_assert_~cond; {2786#false} is VALID [2021-09-13 14:12:40,039 INFO L281 TraceCheckUtils]: 41: Hoare triple {2786#false} assume !false; {2786#false} is VALID [2021-09-13 14:12:40,040 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:12:40,040 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:12:40,913 INFO L281 TraceCheckUtils]: 41: Hoare triple {2786#false} assume !false; {2786#false} is VALID [2021-09-13 14:12:40,913 INFO L281 TraceCheckUtils]: 40: Hoare triple {2786#false} assume 0 == __VERIFIER_assert_~cond; {2786#false} is VALID [2021-09-13 14:12:40,913 INFO L281 TraceCheckUtils]: 39: Hoare triple {2786#false} main_~j~0 := (if main_~i~0 < 0 && 0 != main_~i~0 % 4 then 1 + main_~i~0 / 4 else main_~i~0 / 4);__VERIFIER_assert_#in~cond := (if 4 * main_~j~0 == main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2786#false} is VALID [2021-09-13 14:12:40,919 INFO L281 TraceCheckUtils]: 38: Hoare triple {2961#(< ULTIMATE.start_main_~i~0 ~SIZE~0)} assume !(main_~i~0 < ~SIZE~0); {2786#false} is VALID [2021-09-13 14:12:40,920 INFO L281 TraceCheckUtils]: 37: Hoare triple {2965#(< (+ ULTIMATE.start_main_~i~0 8) ~SIZE~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {2961#(< ULTIMATE.start_main_~i~0 ~SIZE~0)} is VALID [2021-09-13 14:12:40,920 INFO L281 TraceCheckUtils]: 36: Hoare triple {2965#(< (+ ULTIMATE.start_main_~i~0 8) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {2965#(< (+ ULTIMATE.start_main_~i~0 8) ~SIZE~0)} is VALID [2021-09-13 14:12:40,921 INFO L281 TraceCheckUtils]: 35: Hoare triple {2972#(< (+ ULTIMATE.start_main_~i~0 16) ~SIZE~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {2965#(< (+ ULTIMATE.start_main_~i~0 8) ~SIZE~0)} is VALID [2021-09-13 14:12:40,921 INFO L281 TraceCheckUtils]: 34: Hoare triple {2972#(< (+ ULTIMATE.start_main_~i~0 16) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {2972#(< (+ ULTIMATE.start_main_~i~0 16) ~SIZE~0)} is VALID [2021-09-13 14:12:40,922 INFO L281 TraceCheckUtils]: 33: Hoare triple {2979#(< (+ ULTIMATE.start_main_~i~0 24) ~SIZE~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {2972#(< (+ ULTIMATE.start_main_~i~0 16) ~SIZE~0)} is VALID [2021-09-13 14:12:40,922 INFO L281 TraceCheckUtils]: 32: Hoare triple {2979#(< (+ ULTIMATE.start_main_~i~0 24) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {2979#(< (+ ULTIMATE.start_main_~i~0 24) ~SIZE~0)} is VALID [2021-09-13 14:12:40,922 INFO L281 TraceCheckUtils]: 31: Hoare triple {2986#(< (+ ULTIMATE.start_main_~i~0 28) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {2979#(< (+ ULTIMATE.start_main_~i~0 24) ~SIZE~0)} is VALID [2021-09-13 14:12:40,923 INFO L281 TraceCheckUtils]: 30: Hoare triple {2986#(< (+ ULTIMATE.start_main_~i~0 28) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {2986#(< (+ ULTIMATE.start_main_~i~0 28) ~SIZE~0)} is VALID [2021-09-13 14:12:40,923 INFO L281 TraceCheckUtils]: 29: Hoare triple {2993#(< (+ ULTIMATE.start_main_~i~0 36) ~SIZE~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {2986#(< (+ ULTIMATE.start_main_~i~0 28) ~SIZE~0)} is VALID [2021-09-13 14:12:40,924 INFO L281 TraceCheckUtils]: 28: Hoare triple {2993#(< (+ ULTIMATE.start_main_~i~0 36) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {2993#(< (+ ULTIMATE.start_main_~i~0 36) ~SIZE~0)} is VALID [2021-09-13 14:12:40,924 INFO L281 TraceCheckUtils]: 27: Hoare triple {3000#(< (+ ULTIMATE.start_main_~i~0 44) ~SIZE~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {2993#(< (+ ULTIMATE.start_main_~i~0 36) ~SIZE~0)} is VALID [2021-09-13 14:12:40,925 INFO L281 TraceCheckUtils]: 26: Hoare triple {3000#(< (+ ULTIMATE.start_main_~i~0 44) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {3000#(< (+ ULTIMATE.start_main_~i~0 44) ~SIZE~0)} is VALID [2021-09-13 14:12:40,925 INFO L281 TraceCheckUtils]: 25: Hoare triple {3007#(< (+ ULTIMATE.start_main_~i~0 52) ~SIZE~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {3000#(< (+ ULTIMATE.start_main_~i~0 44) ~SIZE~0)} is VALID [2021-09-13 14:12:40,925 INFO L281 TraceCheckUtils]: 24: Hoare triple {3007#(< (+ ULTIMATE.start_main_~i~0 52) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {3007#(< (+ ULTIMATE.start_main_~i~0 52) ~SIZE~0)} is VALID [2021-09-13 14:12:40,926 INFO L281 TraceCheckUtils]: 23: Hoare triple {3014#(< (+ 56 ULTIMATE.start_main_~i~0) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {3007#(< (+ ULTIMATE.start_main_~i~0 52) ~SIZE~0)} is VALID [2021-09-13 14:12:40,926 INFO L281 TraceCheckUtils]: 22: Hoare triple {3014#(< (+ 56 ULTIMATE.start_main_~i~0) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {3014#(< (+ 56 ULTIMATE.start_main_~i~0) ~SIZE~0)} is VALID [2021-09-13 14:12:40,927 INFO L281 TraceCheckUtils]: 21: Hoare triple {3021#(< (+ ULTIMATE.start_main_~i~0 60) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {3014#(< (+ 56 ULTIMATE.start_main_~i~0) ~SIZE~0)} is VALID [2021-09-13 14:12:40,927 INFO L281 TraceCheckUtils]: 20: Hoare triple {3021#(< (+ ULTIMATE.start_main_~i~0 60) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {3021#(< (+ ULTIMATE.start_main_~i~0 60) ~SIZE~0)} is VALID [2021-09-13 14:12:40,928 INFO L281 TraceCheckUtils]: 19: Hoare triple {3028#(< (+ ULTIMATE.start_main_~i~0 68) ~SIZE~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {3021#(< (+ ULTIMATE.start_main_~i~0 60) ~SIZE~0)} is VALID [2021-09-13 14:12:40,928 INFO L281 TraceCheckUtils]: 18: Hoare triple {3028#(< (+ ULTIMATE.start_main_~i~0 68) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {3028#(< (+ ULTIMATE.start_main_~i~0 68) ~SIZE~0)} is VALID [2021-09-13 14:12:40,929 INFO L281 TraceCheckUtils]: 17: Hoare triple {3035#(< (+ ULTIMATE.start_main_~i~0 76) ~SIZE~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {3028#(< (+ ULTIMATE.start_main_~i~0 68) ~SIZE~0)} is VALID [2021-09-13 14:12:40,929 INFO L281 TraceCheckUtils]: 16: Hoare triple {3035#(< (+ ULTIMATE.start_main_~i~0 76) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {3035#(< (+ ULTIMATE.start_main_~i~0 76) ~SIZE~0)} is VALID [2021-09-13 14:12:40,929 INFO L281 TraceCheckUtils]: 15: Hoare triple {3042#(< (+ ULTIMATE.start_main_~i~0 84) ~SIZE~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {3035#(< (+ ULTIMATE.start_main_~i~0 76) ~SIZE~0)} is VALID [2021-09-13 14:12:40,930 INFO L281 TraceCheckUtils]: 14: Hoare triple {3042#(< (+ ULTIMATE.start_main_~i~0 84) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {3042#(< (+ ULTIMATE.start_main_~i~0 84) ~SIZE~0)} is VALID [2021-09-13 14:12:40,930 INFO L281 TraceCheckUtils]: 13: Hoare triple {3049#(< (+ 88 ULTIMATE.start_main_~i~0) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {3042#(< (+ ULTIMATE.start_main_~i~0 84) ~SIZE~0)} is VALID [2021-09-13 14:12:40,931 INFO L281 TraceCheckUtils]: 12: Hoare triple {3049#(< (+ 88 ULTIMATE.start_main_~i~0) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {3049#(< (+ 88 ULTIMATE.start_main_~i~0) ~SIZE~0)} is VALID [2021-09-13 14:12:40,931 INFO L281 TraceCheckUtils]: 11: Hoare triple {3056#(< (+ ULTIMATE.start_main_~i~0 96) ~SIZE~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {3049#(< (+ 88 ULTIMATE.start_main_~i~0) ~SIZE~0)} is VALID [2021-09-13 14:12:40,931 INFO L281 TraceCheckUtils]: 10: Hoare triple {3056#(< (+ ULTIMATE.start_main_~i~0 96) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {3056#(< (+ ULTIMATE.start_main_~i~0 96) ~SIZE~0)} is VALID [2021-09-13 14:12:40,932 INFO L281 TraceCheckUtils]: 9: Hoare triple {3063#(< (+ ULTIMATE.start_main_~i~0 104) ~SIZE~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {3056#(< (+ ULTIMATE.start_main_~i~0 96) ~SIZE~0)} is VALID [2021-09-13 14:12:40,932 INFO L281 TraceCheckUtils]: 8: Hoare triple {3063#(< (+ ULTIMATE.start_main_~i~0 104) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {3063#(< (+ ULTIMATE.start_main_~i~0 104) ~SIZE~0)} is VALID [2021-09-13 14:12:40,933 INFO L281 TraceCheckUtils]: 7: Hoare triple {3070#(< (+ 112 ULTIMATE.start_main_~i~0) ~SIZE~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {3063#(< (+ ULTIMATE.start_main_~i~0 104) ~SIZE~0)} is VALID [2021-09-13 14:12:40,933 INFO L281 TraceCheckUtils]: 6: Hoare triple {3070#(< (+ 112 ULTIMATE.start_main_~i~0) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {3070#(< (+ 112 ULTIMATE.start_main_~i~0) ~SIZE~0)} is VALID [2021-09-13 14:12:40,933 INFO L281 TraceCheckUtils]: 5: Hoare triple {3077#(< (+ 116 ULTIMATE.start_main_~i~0) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {3070#(< (+ 112 ULTIMATE.start_main_~i~0) ~SIZE~0)} is VALID [2021-09-13 14:12:40,934 INFO L281 TraceCheckUtils]: 4: Hoare triple {3077#(< (+ 116 ULTIMATE.start_main_~i~0) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {3077#(< (+ 116 ULTIMATE.start_main_~i~0) ~SIZE~0)} is VALID [2021-09-13 14:12:40,934 INFO L281 TraceCheckUtils]: 3: Hoare triple {3084#(< (+ ULTIMATE.start_main_~i~0 120) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {3077#(< (+ 116 ULTIMATE.start_main_~i~0) ~SIZE~0)} is VALID [2021-09-13 14:12:40,935 INFO L281 TraceCheckUtils]: 2: Hoare triple {3084#(< (+ ULTIMATE.start_main_~i~0 120) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {3084#(< (+ ULTIMATE.start_main_~i~0 120) ~SIZE~0)} is VALID [2021-09-13 14:12:40,935 INFO L281 TraceCheckUtils]: 1: Hoare triple {3091#(< 120 ~SIZE~0)} havoc main_#res;havoc main_#t~nondet7, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0;main_~j~0 := 0; {3084#(< (+ ULTIMATE.start_main_~i~0 120) ~SIZE~0)} is VALID [2021-09-13 14:12:40,936 INFO L281 TraceCheckUtils]: 0: Hoare triple {2785#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(9);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~SIZE~0 := 50000001; {3091#(< 120 ~SIZE~0)} is VALID [2021-09-13 14:12:40,936 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:12:40,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494496143] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:12:40,937 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-09-13 14:12:40,937 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 60 [2021-09-13 14:12:40,937 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134889186] [2021-09-13 14:12:40,938 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 1.9508196721311475) internal successors, (119), 60 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-09-13 14:12:40,938 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:12:40,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 61 states, 61 states have (on average 1.9508196721311475) internal successors, (119), 60 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:41,057 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:12:41,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2021-09-13 14:12:41,057 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:12:41,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2021-09-13 14:12:41,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1603, Invalid=2057, Unknown=0, NotChecked=0, Total=3660 [2021-09-13 14:12:41,059 INFO L87 Difference]: Start difference. First operand 67 states and 97 transitions. Second operand has 61 states, 61 states have (on average 1.9508196721311475) internal successors, (119), 60 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:42,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:42,944 INFO L93 Difference]: Finished difference Result 509 states and 769 transitions. [2021-09-13 14:12:42,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-09-13 14:12:42,945 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 1.9508196721311475) internal successors, (119), 60 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-09-13 14:12:42,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:12:42,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 1.9508196721311475) internal successors, (119), 60 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:42,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 144 transitions. [2021-09-13 14:12:42,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 1.9508196721311475) internal successors, (119), 60 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:42,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 144 transitions. [2021-09-13 14:12:42,949 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 144 transitions. [2021-09-13 14:12:43,100 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:12:43,120 INFO L225 Difference]: With dead ends: 509 [2021-09-13 14:12:43,120 INFO L226 Difference]: Without dead ends: 505 [2021-09-13 14:12:43,122 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2201 ImplicationChecksByTransitivity, 1381.44ms TimeCoverageRelationStatistics Valid=2420, Invalid=3900, Unknown=0, NotChecked=0, Total=6320 [2021-09-13 14:12:43,123 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 100 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 291.13ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 12.11ms SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 294.57ms IncrementalHoareTripleChecker+Time [2021-09-13 14:12:43,123 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 0 Invalid, 412 Unknown, 0 Unchecked, 12.11ms Time], IncrementalHoareTripleChecker [247 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 294.57ms Time] [2021-09-13 14:12:43,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2021-09-13 14:12:43,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 83. [2021-09-13 14:12:43,325 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:12:43,326 INFO L82 GeneralOperation]: Start isEquivalent. First operand 505 states. Second operand has 83 states, 82 states have (on average 1.475609756097561) internal successors, (121), 82 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:43,326 INFO L74 IsIncluded]: Start isIncluded. First operand 505 states. Second operand has 83 states, 82 states have (on average 1.475609756097561) internal successors, (121), 82 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:43,326 INFO L87 Difference]: Start difference. First operand 505 states. Second operand has 83 states, 82 states have (on average 1.475609756097561) internal successors, (121), 82 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:43,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:43,343 INFO L93 Difference]: Finished difference Result 505 states and 746 transitions. [2021-09-13 14:12:43,343 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 746 transitions. [2021-09-13 14:12:43,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:12:43,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:12:43,345 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 82 states have (on average 1.475609756097561) internal successors, (121), 82 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 505 states. [2021-09-13 14:12:43,345 INFO L87 Difference]: Start difference. First operand has 83 states, 82 states have (on average 1.475609756097561) internal successors, (121), 82 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 505 states. [2021-09-13 14:12:43,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:43,361 INFO L93 Difference]: Finished difference Result 505 states and 746 transitions. [2021-09-13 14:12:43,361 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 746 transitions. [2021-09-13 14:12:43,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:12:43,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:12:43,362 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:12:43,362 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:12:43,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.475609756097561) internal successors, (121), 82 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:43,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 121 transitions. [2021-09-13 14:12:43,365 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 121 transitions. Word has length 42 [2021-09-13 14:12:43,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:12:43,366 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 121 transitions. [2021-09-13 14:12:43,366 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 1.9508196721311475) internal successors, (119), 60 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:43,366 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 121 transitions. [2021-09-13 14:12:43,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-09-13 14:12:43,367 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:12:43,367 INFO L513 BasicCegarLoop]: trace histogram [30, 22, 8, 1, 1, 1, 1, 1, 1] [2021-09-13 14:12:43,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-09-13 14:12:43,586 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:12:43,587 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:12:43,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:12:43,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1585988105, now seen corresponding path program 4 times [2021-09-13 14:12:43,587 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:12:43,587 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393396568] [2021-09-13 14:12:43,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:12:43,588 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:12:43,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:12:44,198 INFO L281 TraceCheckUtils]: 0: Hoare triple {5031#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(9);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~SIZE~0 := 50000001; {5033#(<= 50000001 ~SIZE~0)} is VALID [2021-09-13 14:12:44,199 INFO L281 TraceCheckUtils]: 1: Hoare triple {5033#(<= 50000001 ~SIZE~0)} havoc main_#res;havoc main_#t~nondet7, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0;main_~j~0 := 0; {5034#(and (= ULTIMATE.start_main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:44,200 INFO L281 TraceCheckUtils]: 2: Hoare triple {5034#(and (= ULTIMATE.start_main_~i~0 0) (<= 50000001 ~SIZE~0))} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5034#(and (= ULTIMATE.start_main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2021-09-13 14:12:44,200 INFO L281 TraceCheckUtils]: 3: Hoare triple {5034#(and (= ULTIMATE.start_main_~i~0 0) (<= 50000001 ~SIZE~0))} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5035#(<= (+ 49999997 ULTIMATE.start_main_~i~0) ~SIZE~0)} is VALID [2021-09-13 14:12:44,200 INFO L281 TraceCheckUtils]: 4: Hoare triple {5035#(<= (+ 49999997 ULTIMATE.start_main_~i~0) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5035#(<= (+ 49999997 ULTIMATE.start_main_~i~0) ~SIZE~0)} is VALID [2021-09-13 14:12:44,201 INFO L281 TraceCheckUtils]: 5: Hoare triple {5035#(<= (+ 49999997 ULTIMATE.start_main_~i~0) ~SIZE~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {5036#(<= (+ 49999989 ULTIMATE.start_main_~i~0) ~SIZE~0)} is VALID [2021-09-13 14:12:44,201 INFO L281 TraceCheckUtils]: 6: Hoare triple {5036#(<= (+ 49999989 ULTIMATE.start_main_~i~0) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5036#(<= (+ 49999989 ULTIMATE.start_main_~i~0) ~SIZE~0)} is VALID [2021-09-13 14:12:44,202 INFO L281 TraceCheckUtils]: 7: Hoare triple {5036#(<= (+ 49999989 ULTIMATE.start_main_~i~0) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5037#(<= (+ ULTIMATE.start_main_~i~0 49999985) ~SIZE~0)} is VALID [2021-09-13 14:12:44,202 INFO L281 TraceCheckUtils]: 8: Hoare triple {5037#(<= (+ ULTIMATE.start_main_~i~0 49999985) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5037#(<= (+ ULTIMATE.start_main_~i~0 49999985) ~SIZE~0)} is VALID [2021-09-13 14:12:44,204 INFO L281 TraceCheckUtils]: 9: Hoare triple {5037#(<= (+ ULTIMATE.start_main_~i~0 49999985) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5038#(<= (+ ULTIMATE.start_main_~i~0 49999981) ~SIZE~0)} is VALID [2021-09-13 14:12:44,204 INFO L281 TraceCheckUtils]: 10: Hoare triple {5038#(<= (+ ULTIMATE.start_main_~i~0 49999981) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5038#(<= (+ ULTIMATE.start_main_~i~0 49999981) ~SIZE~0)} is VALID [2021-09-13 14:12:44,205 INFO L281 TraceCheckUtils]: 11: Hoare triple {5038#(<= (+ ULTIMATE.start_main_~i~0 49999981) ~SIZE~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {5039#(<= (+ ULTIMATE.start_main_~i~0 49999973) ~SIZE~0)} is VALID [2021-09-13 14:12:44,205 INFO L281 TraceCheckUtils]: 12: Hoare triple {5039#(<= (+ ULTIMATE.start_main_~i~0 49999973) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5039#(<= (+ ULTIMATE.start_main_~i~0 49999973) ~SIZE~0)} is VALID [2021-09-13 14:12:44,205 INFO L281 TraceCheckUtils]: 13: Hoare triple {5039#(<= (+ ULTIMATE.start_main_~i~0 49999973) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5040#(<= (+ ULTIMATE.start_main_~i~0 49999969) ~SIZE~0)} is VALID [2021-09-13 14:12:44,206 INFO L281 TraceCheckUtils]: 14: Hoare triple {5040#(<= (+ ULTIMATE.start_main_~i~0 49999969) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5040#(<= (+ ULTIMATE.start_main_~i~0 49999969) ~SIZE~0)} is VALID [2021-09-13 14:12:44,206 INFO L281 TraceCheckUtils]: 15: Hoare triple {5040#(<= (+ ULTIMATE.start_main_~i~0 49999969) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5041#(<= (+ ULTIMATE.start_main_~i~0 49999965) ~SIZE~0)} is VALID [2021-09-13 14:12:44,207 INFO L281 TraceCheckUtils]: 16: Hoare triple {5041#(<= (+ ULTIMATE.start_main_~i~0 49999965) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5041#(<= (+ ULTIMATE.start_main_~i~0 49999965) ~SIZE~0)} is VALID [2021-09-13 14:12:44,207 INFO L281 TraceCheckUtils]: 17: Hoare triple {5041#(<= (+ ULTIMATE.start_main_~i~0 49999965) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5042#(<= (+ ULTIMATE.start_main_~i~0 49999961) ~SIZE~0)} is VALID [2021-09-13 14:12:44,208 INFO L281 TraceCheckUtils]: 18: Hoare triple {5042#(<= (+ ULTIMATE.start_main_~i~0 49999961) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5042#(<= (+ ULTIMATE.start_main_~i~0 49999961) ~SIZE~0)} is VALID [2021-09-13 14:12:44,208 INFO L281 TraceCheckUtils]: 19: Hoare triple {5042#(<= (+ ULTIMATE.start_main_~i~0 49999961) ~SIZE~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {5043#(<= (+ ULTIMATE.start_main_~i~0 49999953) ~SIZE~0)} is VALID [2021-09-13 14:12:44,209 INFO L281 TraceCheckUtils]: 20: Hoare triple {5043#(<= (+ ULTIMATE.start_main_~i~0 49999953) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5043#(<= (+ ULTIMATE.start_main_~i~0 49999953) ~SIZE~0)} is VALID [2021-09-13 14:12:44,209 INFO L281 TraceCheckUtils]: 21: Hoare triple {5043#(<= (+ ULTIMATE.start_main_~i~0 49999953) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5044#(<= (+ 49999949 ULTIMATE.start_main_~i~0) ~SIZE~0)} is VALID [2021-09-13 14:12:44,209 INFO L281 TraceCheckUtils]: 22: Hoare triple {5044#(<= (+ 49999949 ULTIMATE.start_main_~i~0) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5044#(<= (+ 49999949 ULTIMATE.start_main_~i~0) ~SIZE~0)} is VALID [2021-09-13 14:12:44,210 INFO L281 TraceCheckUtils]: 23: Hoare triple {5044#(<= (+ 49999949 ULTIMATE.start_main_~i~0) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5045#(<= (+ ULTIMATE.start_main_~i~0 49999945) ~SIZE~0)} is VALID [2021-09-13 14:12:44,210 INFO L281 TraceCheckUtils]: 24: Hoare triple {5045#(<= (+ ULTIMATE.start_main_~i~0 49999945) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5045#(<= (+ ULTIMATE.start_main_~i~0 49999945) ~SIZE~0)} is VALID [2021-09-13 14:12:44,211 INFO L281 TraceCheckUtils]: 25: Hoare triple {5045#(<= (+ ULTIMATE.start_main_~i~0 49999945) ~SIZE~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {5046#(<= (+ ULTIMATE.start_main_~i~0 49999937) ~SIZE~0)} is VALID [2021-09-13 14:12:44,211 INFO L281 TraceCheckUtils]: 26: Hoare triple {5046#(<= (+ ULTIMATE.start_main_~i~0 49999937) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5046#(<= (+ ULTIMATE.start_main_~i~0 49999937) ~SIZE~0)} is VALID [2021-09-13 14:12:44,212 INFO L281 TraceCheckUtils]: 27: Hoare triple {5046#(<= (+ ULTIMATE.start_main_~i~0 49999937) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5047#(<= (+ ULTIMATE.start_main_~i~0 49999933) ~SIZE~0)} is VALID [2021-09-13 14:12:44,212 INFO L281 TraceCheckUtils]: 28: Hoare triple {5047#(<= (+ ULTIMATE.start_main_~i~0 49999933) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5047#(<= (+ ULTIMATE.start_main_~i~0 49999933) ~SIZE~0)} is VALID [2021-09-13 14:12:44,213 INFO L281 TraceCheckUtils]: 29: Hoare triple {5047#(<= (+ ULTIMATE.start_main_~i~0 49999933) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5048#(<= (+ 49999929 ULTIMATE.start_main_~i~0) ~SIZE~0)} is VALID [2021-09-13 14:12:44,213 INFO L281 TraceCheckUtils]: 30: Hoare triple {5048#(<= (+ 49999929 ULTIMATE.start_main_~i~0) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5048#(<= (+ 49999929 ULTIMATE.start_main_~i~0) ~SIZE~0)} is VALID [2021-09-13 14:12:44,214 INFO L281 TraceCheckUtils]: 31: Hoare triple {5048#(<= (+ 49999929 ULTIMATE.start_main_~i~0) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5049#(<= (+ ULTIMATE.start_main_~i~0 49999925) ~SIZE~0)} is VALID [2021-09-13 14:12:44,214 INFO L281 TraceCheckUtils]: 32: Hoare triple {5049#(<= (+ ULTIMATE.start_main_~i~0 49999925) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5049#(<= (+ ULTIMATE.start_main_~i~0 49999925) ~SIZE~0)} is VALID [2021-09-13 14:12:44,215 INFO L281 TraceCheckUtils]: 33: Hoare triple {5049#(<= (+ ULTIMATE.start_main_~i~0 49999925) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5050#(<= (+ 49999921 ULTIMATE.start_main_~i~0) ~SIZE~0)} is VALID [2021-09-13 14:12:44,215 INFO L281 TraceCheckUtils]: 34: Hoare triple {5050#(<= (+ 49999921 ULTIMATE.start_main_~i~0) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5050#(<= (+ 49999921 ULTIMATE.start_main_~i~0) ~SIZE~0)} is VALID [2021-09-13 14:12:44,215 INFO L281 TraceCheckUtils]: 35: Hoare triple {5050#(<= (+ 49999921 ULTIMATE.start_main_~i~0) ~SIZE~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {5051#(<= (+ 49999913 ULTIMATE.start_main_~i~0) ~SIZE~0)} is VALID [2021-09-13 14:12:44,216 INFO L281 TraceCheckUtils]: 36: Hoare triple {5051#(<= (+ 49999913 ULTIMATE.start_main_~i~0) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5051#(<= (+ 49999913 ULTIMATE.start_main_~i~0) ~SIZE~0)} is VALID [2021-09-13 14:12:44,216 INFO L281 TraceCheckUtils]: 37: Hoare triple {5051#(<= (+ 49999913 ULTIMATE.start_main_~i~0) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5052#(<= (+ ULTIMATE.start_main_~i~0 49999909) ~SIZE~0)} is VALID [2021-09-13 14:12:44,217 INFO L281 TraceCheckUtils]: 38: Hoare triple {5052#(<= (+ ULTIMATE.start_main_~i~0 49999909) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5052#(<= (+ ULTIMATE.start_main_~i~0 49999909) ~SIZE~0)} is VALID [2021-09-13 14:12:44,217 INFO L281 TraceCheckUtils]: 39: Hoare triple {5052#(<= (+ ULTIMATE.start_main_~i~0 49999909) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5053#(<= (+ ULTIMATE.start_main_~i~0 49999905) ~SIZE~0)} is VALID [2021-09-13 14:12:44,218 INFO L281 TraceCheckUtils]: 40: Hoare triple {5053#(<= (+ ULTIMATE.start_main_~i~0 49999905) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5053#(<= (+ ULTIMATE.start_main_~i~0 49999905) ~SIZE~0)} is VALID [2021-09-13 14:12:44,218 INFO L281 TraceCheckUtils]: 41: Hoare triple {5053#(<= (+ ULTIMATE.start_main_~i~0 49999905) ~SIZE~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {5054#(<= (+ ULTIMATE.start_main_~i~0 49999897) ~SIZE~0)} is VALID [2021-09-13 14:12:44,219 INFO L281 TraceCheckUtils]: 42: Hoare triple {5054#(<= (+ ULTIMATE.start_main_~i~0 49999897) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5054#(<= (+ ULTIMATE.start_main_~i~0 49999897) ~SIZE~0)} is VALID [2021-09-13 14:12:44,219 INFO L281 TraceCheckUtils]: 43: Hoare triple {5054#(<= (+ ULTIMATE.start_main_~i~0 49999897) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5055#(<= (+ ULTIMATE.start_main_~i~0 49999893) ~SIZE~0)} is VALID [2021-09-13 14:12:44,219 INFO L281 TraceCheckUtils]: 44: Hoare triple {5055#(<= (+ ULTIMATE.start_main_~i~0 49999893) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5055#(<= (+ ULTIMATE.start_main_~i~0 49999893) ~SIZE~0)} is VALID [2021-09-13 14:12:44,220 INFO L281 TraceCheckUtils]: 45: Hoare triple {5055#(<= (+ ULTIMATE.start_main_~i~0 49999893) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5056#(<= (+ ULTIMATE.start_main_~i~0 49999889) ~SIZE~0)} is VALID [2021-09-13 14:12:44,220 INFO L281 TraceCheckUtils]: 46: Hoare triple {5056#(<= (+ ULTIMATE.start_main_~i~0 49999889) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5056#(<= (+ ULTIMATE.start_main_~i~0 49999889) ~SIZE~0)} is VALID [2021-09-13 14:12:44,221 INFO L281 TraceCheckUtils]: 47: Hoare triple {5056#(<= (+ ULTIMATE.start_main_~i~0 49999889) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5057#(<= (+ ULTIMATE.start_main_~i~0 49999885) ~SIZE~0)} is VALID [2021-09-13 14:12:44,221 INFO L281 TraceCheckUtils]: 48: Hoare triple {5057#(<= (+ ULTIMATE.start_main_~i~0 49999885) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5057#(<= (+ ULTIMATE.start_main_~i~0 49999885) ~SIZE~0)} is VALID [2021-09-13 14:12:44,222 INFO L281 TraceCheckUtils]: 49: Hoare triple {5057#(<= (+ ULTIMATE.start_main_~i~0 49999885) ~SIZE~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {5058#(<= (+ ULTIMATE.start_main_~i~0 49999877) ~SIZE~0)} is VALID [2021-09-13 14:12:44,222 INFO L281 TraceCheckUtils]: 50: Hoare triple {5058#(<= (+ ULTIMATE.start_main_~i~0 49999877) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5058#(<= (+ ULTIMATE.start_main_~i~0 49999877) ~SIZE~0)} is VALID [2021-09-13 14:12:44,223 INFO L281 TraceCheckUtils]: 51: Hoare triple {5058#(<= (+ ULTIMATE.start_main_~i~0 49999877) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5059#(<= (+ 49999873 ULTIMATE.start_main_~i~0) ~SIZE~0)} is VALID [2021-09-13 14:12:44,223 INFO L281 TraceCheckUtils]: 52: Hoare triple {5059#(<= (+ 49999873 ULTIMATE.start_main_~i~0) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5059#(<= (+ 49999873 ULTIMATE.start_main_~i~0) ~SIZE~0)} is VALID [2021-09-13 14:12:44,224 INFO L281 TraceCheckUtils]: 53: Hoare triple {5059#(<= (+ 49999873 ULTIMATE.start_main_~i~0) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5060#(<= (+ ULTIMATE.start_main_~i~0 49999869) ~SIZE~0)} is VALID [2021-09-13 14:12:44,224 INFO L281 TraceCheckUtils]: 54: Hoare triple {5060#(<= (+ ULTIMATE.start_main_~i~0 49999869) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5060#(<= (+ ULTIMATE.start_main_~i~0 49999869) ~SIZE~0)} is VALID [2021-09-13 14:12:44,225 INFO L281 TraceCheckUtils]: 55: Hoare triple {5060#(<= (+ ULTIMATE.start_main_~i~0 49999869) ~SIZE~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {5061#(<= (+ ULTIMATE.start_main_~i~0 49999861) ~SIZE~0)} is VALID [2021-09-13 14:12:44,225 INFO L281 TraceCheckUtils]: 56: Hoare triple {5061#(<= (+ ULTIMATE.start_main_~i~0 49999861) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5061#(<= (+ ULTIMATE.start_main_~i~0 49999861) ~SIZE~0)} is VALID [2021-09-13 14:12:44,225 INFO L281 TraceCheckUtils]: 57: Hoare triple {5061#(<= (+ ULTIMATE.start_main_~i~0 49999861) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5062#(<= (+ ULTIMATE.start_main_~i~0 49999857) ~SIZE~0)} is VALID [2021-09-13 14:12:44,226 INFO L281 TraceCheckUtils]: 58: Hoare triple {5062#(<= (+ ULTIMATE.start_main_~i~0 49999857) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5062#(<= (+ ULTIMATE.start_main_~i~0 49999857) ~SIZE~0)} is VALID [2021-09-13 14:12:44,226 INFO L281 TraceCheckUtils]: 59: Hoare triple {5062#(<= (+ ULTIMATE.start_main_~i~0 49999857) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5063#(<= (+ ULTIMATE.start_main_~i~0 49999853) ~SIZE~0)} is VALID [2021-09-13 14:12:44,227 INFO L281 TraceCheckUtils]: 60: Hoare triple {5063#(<= (+ ULTIMATE.start_main_~i~0 49999853) ~SIZE~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5063#(<= (+ ULTIMATE.start_main_~i~0 49999853) ~SIZE~0)} is VALID [2021-09-13 14:12:44,227 INFO L281 TraceCheckUtils]: 61: Hoare triple {5063#(<= (+ ULTIMATE.start_main_~i~0 49999853) ~SIZE~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5064#(<= (+ ULTIMATE.start_main_~i~0 49999849) ~SIZE~0)} is VALID [2021-09-13 14:12:44,228 INFO L281 TraceCheckUtils]: 62: Hoare triple {5064#(<= (+ ULTIMATE.start_main_~i~0 49999849) ~SIZE~0)} assume !(main_~i~0 < ~SIZE~0); {5032#false} is VALID [2021-09-13 14:12:44,228 INFO L281 TraceCheckUtils]: 63: Hoare triple {5032#false} main_~j~0 := (if main_~i~0 < 0 && 0 != main_~i~0 % 4 then 1 + main_~i~0 / 4 else main_~i~0 / 4);__VERIFIER_assert_#in~cond := (if 4 * main_~j~0 == main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {5032#false} is VALID [2021-09-13 14:12:44,228 INFO L281 TraceCheckUtils]: 64: Hoare triple {5032#false} assume 0 == __VERIFIER_assert_~cond; {5032#false} is VALID [2021-09-13 14:12:44,228 INFO L281 TraceCheckUtils]: 65: Hoare triple {5032#false} assume !false; {5032#false} is VALID [2021-09-13 14:12:44,229 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:12:44,229 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:12:44,229 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393396568] [2021-09-13 14:12:44,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393396568] provided 0 perfect and 1 imperfect interpolant sequences [2021-09-13 14:12:44,230 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892166088] [2021-09-13 14:12:44,230 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-09-13 14:12:44,230 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:12:44,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:12:44,241 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 14:12:44,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-09-13 14:12:44,281 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-09-13 14:12:44,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-09-13 14:12:44,283 WARN L261 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 67 conjunts are in the unsatisfiable core [2021-09-13 14:12:44,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:12:44,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:12:45,505 INFO L281 TraceCheckUtils]: 0: Hoare triple {5031#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(9);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~SIZE~0 := 50000001; {5031#true} is VALID [2021-09-13 14:12:45,505 INFO L281 TraceCheckUtils]: 1: Hoare triple {5031#true} havoc main_#res;havoc main_#t~nondet7, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0;main_~j~0 := 0; {5071#(= ULTIMATE.start_main_~i~0 0)} is VALID [2021-09-13 14:12:45,506 INFO L281 TraceCheckUtils]: 2: Hoare triple {5071#(= ULTIMATE.start_main_~i~0 0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5071#(= ULTIMATE.start_main_~i~0 0)} is VALID [2021-09-13 14:12:45,506 INFO L281 TraceCheckUtils]: 3: Hoare triple {5071#(= ULTIMATE.start_main_~i~0 0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5078#(= ULTIMATE.start_main_~i~0 4)} is VALID [2021-09-13 14:12:45,506 INFO L281 TraceCheckUtils]: 4: Hoare triple {5078#(= ULTIMATE.start_main_~i~0 4)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5078#(= ULTIMATE.start_main_~i~0 4)} is VALID [2021-09-13 14:12:45,507 INFO L281 TraceCheckUtils]: 5: Hoare triple {5078#(= ULTIMATE.start_main_~i~0 4)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {5085#(= ULTIMATE.start_main_~i~0 12)} is VALID [2021-09-13 14:12:45,507 INFO L281 TraceCheckUtils]: 6: Hoare triple {5085#(= ULTIMATE.start_main_~i~0 12)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5085#(= ULTIMATE.start_main_~i~0 12)} is VALID [2021-09-13 14:12:45,507 INFO L281 TraceCheckUtils]: 7: Hoare triple {5085#(= ULTIMATE.start_main_~i~0 12)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5092#(= ULTIMATE.start_main_~i~0 16)} is VALID [2021-09-13 14:12:45,515 INFO L281 TraceCheckUtils]: 8: Hoare triple {5092#(= ULTIMATE.start_main_~i~0 16)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5092#(= ULTIMATE.start_main_~i~0 16)} is VALID [2021-09-13 14:12:45,515 INFO L281 TraceCheckUtils]: 9: Hoare triple {5092#(= ULTIMATE.start_main_~i~0 16)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5099#(= ULTIMATE.start_main_~i~0 20)} is VALID [2021-09-13 14:12:45,516 INFO L281 TraceCheckUtils]: 10: Hoare triple {5099#(= ULTIMATE.start_main_~i~0 20)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5099#(= ULTIMATE.start_main_~i~0 20)} is VALID [2021-09-13 14:12:45,516 INFO L281 TraceCheckUtils]: 11: Hoare triple {5099#(= ULTIMATE.start_main_~i~0 20)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {5106#(= ULTIMATE.start_main_~i~0 28)} is VALID [2021-09-13 14:12:45,516 INFO L281 TraceCheckUtils]: 12: Hoare triple {5106#(= ULTIMATE.start_main_~i~0 28)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5106#(= ULTIMATE.start_main_~i~0 28)} is VALID [2021-09-13 14:12:45,517 INFO L281 TraceCheckUtils]: 13: Hoare triple {5106#(= ULTIMATE.start_main_~i~0 28)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5113#(= ULTIMATE.start_main_~i~0 32)} is VALID [2021-09-13 14:12:45,517 INFO L281 TraceCheckUtils]: 14: Hoare triple {5113#(= ULTIMATE.start_main_~i~0 32)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5113#(= ULTIMATE.start_main_~i~0 32)} is VALID [2021-09-13 14:12:45,518 INFO L281 TraceCheckUtils]: 15: Hoare triple {5113#(= ULTIMATE.start_main_~i~0 32)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5120#(= ULTIMATE.start_main_~i~0 36)} is VALID [2021-09-13 14:12:45,518 INFO L281 TraceCheckUtils]: 16: Hoare triple {5120#(= ULTIMATE.start_main_~i~0 36)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5120#(= ULTIMATE.start_main_~i~0 36)} is VALID [2021-09-13 14:12:45,518 INFO L281 TraceCheckUtils]: 17: Hoare triple {5120#(= ULTIMATE.start_main_~i~0 36)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5127#(= 40 ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:45,519 INFO L281 TraceCheckUtils]: 18: Hoare triple {5127#(= 40 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5127#(= 40 ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:45,519 INFO L281 TraceCheckUtils]: 19: Hoare triple {5127#(= 40 ULTIMATE.start_main_~i~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {5134#(= ULTIMATE.start_main_~i~0 48)} is VALID [2021-09-13 14:12:45,519 INFO L281 TraceCheckUtils]: 20: Hoare triple {5134#(= ULTIMATE.start_main_~i~0 48)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5134#(= ULTIMATE.start_main_~i~0 48)} is VALID [2021-09-13 14:12:45,520 INFO L281 TraceCheckUtils]: 21: Hoare triple {5134#(= ULTIMATE.start_main_~i~0 48)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5141#(= ULTIMATE.start_main_~i~0 52)} is VALID [2021-09-13 14:12:45,520 INFO L281 TraceCheckUtils]: 22: Hoare triple {5141#(= ULTIMATE.start_main_~i~0 52)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5141#(= ULTIMATE.start_main_~i~0 52)} is VALID [2021-09-13 14:12:45,521 INFO L281 TraceCheckUtils]: 23: Hoare triple {5141#(= ULTIMATE.start_main_~i~0 52)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5148#(= 56 ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:45,525 INFO L281 TraceCheckUtils]: 24: Hoare triple {5148#(= 56 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5148#(= 56 ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:45,526 INFO L281 TraceCheckUtils]: 25: Hoare triple {5148#(= 56 ULTIMATE.start_main_~i~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {5155#(= ULTIMATE.start_main_~i~0 64)} is VALID [2021-09-13 14:12:45,526 INFO L281 TraceCheckUtils]: 26: Hoare triple {5155#(= ULTIMATE.start_main_~i~0 64)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5155#(= ULTIMATE.start_main_~i~0 64)} is VALID [2021-09-13 14:12:45,526 INFO L281 TraceCheckUtils]: 27: Hoare triple {5155#(= ULTIMATE.start_main_~i~0 64)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5162#(= ULTIMATE.start_main_~i~0 68)} is VALID [2021-09-13 14:12:45,527 INFO L281 TraceCheckUtils]: 28: Hoare triple {5162#(= ULTIMATE.start_main_~i~0 68)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5162#(= ULTIMATE.start_main_~i~0 68)} is VALID [2021-09-13 14:12:45,527 INFO L281 TraceCheckUtils]: 29: Hoare triple {5162#(= ULTIMATE.start_main_~i~0 68)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5169#(= ULTIMATE.start_main_~i~0 72)} is VALID [2021-09-13 14:12:45,527 INFO L281 TraceCheckUtils]: 30: Hoare triple {5169#(= ULTIMATE.start_main_~i~0 72)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5169#(= ULTIMATE.start_main_~i~0 72)} is VALID [2021-09-13 14:12:45,528 INFO L281 TraceCheckUtils]: 31: Hoare triple {5169#(= ULTIMATE.start_main_~i~0 72)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5176#(= ULTIMATE.start_main_~i~0 76)} is VALID [2021-09-13 14:12:45,528 INFO L281 TraceCheckUtils]: 32: Hoare triple {5176#(= ULTIMATE.start_main_~i~0 76)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5176#(= ULTIMATE.start_main_~i~0 76)} is VALID [2021-09-13 14:12:45,528 INFO L281 TraceCheckUtils]: 33: Hoare triple {5176#(= ULTIMATE.start_main_~i~0 76)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5183#(= ULTIMATE.start_main_~i~0 80)} is VALID [2021-09-13 14:12:45,529 INFO L281 TraceCheckUtils]: 34: Hoare triple {5183#(= ULTIMATE.start_main_~i~0 80)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5183#(= ULTIMATE.start_main_~i~0 80)} is VALID [2021-09-13 14:12:45,529 INFO L281 TraceCheckUtils]: 35: Hoare triple {5183#(= ULTIMATE.start_main_~i~0 80)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {5190#(= 88 ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:45,529 INFO L281 TraceCheckUtils]: 36: Hoare triple {5190#(= 88 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5190#(= 88 ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:45,530 INFO L281 TraceCheckUtils]: 37: Hoare triple {5190#(= 88 ULTIMATE.start_main_~i~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5197#(= 92 ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:45,530 INFO L281 TraceCheckUtils]: 38: Hoare triple {5197#(= 92 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5197#(= 92 ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:45,530 INFO L281 TraceCheckUtils]: 39: Hoare triple {5197#(= 92 ULTIMATE.start_main_~i~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5204#(= ULTIMATE.start_main_~i~0 96)} is VALID [2021-09-13 14:12:45,531 INFO L281 TraceCheckUtils]: 40: Hoare triple {5204#(= ULTIMATE.start_main_~i~0 96)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5204#(= ULTIMATE.start_main_~i~0 96)} is VALID [2021-09-13 14:12:45,531 INFO L281 TraceCheckUtils]: 41: Hoare triple {5204#(= ULTIMATE.start_main_~i~0 96)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {5211#(= ULTIMATE.start_main_~i~0 104)} is VALID [2021-09-13 14:12:45,531 INFO L281 TraceCheckUtils]: 42: Hoare triple {5211#(= ULTIMATE.start_main_~i~0 104)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5211#(= ULTIMATE.start_main_~i~0 104)} is VALID [2021-09-13 14:12:45,532 INFO L281 TraceCheckUtils]: 43: Hoare triple {5211#(= ULTIMATE.start_main_~i~0 104)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5218#(= ULTIMATE.start_main_~i~0 108)} is VALID [2021-09-13 14:12:45,532 INFO L281 TraceCheckUtils]: 44: Hoare triple {5218#(= ULTIMATE.start_main_~i~0 108)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5218#(= ULTIMATE.start_main_~i~0 108)} is VALID [2021-09-13 14:12:45,532 INFO L281 TraceCheckUtils]: 45: Hoare triple {5218#(= ULTIMATE.start_main_~i~0 108)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5225#(= 112 ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:45,533 INFO L281 TraceCheckUtils]: 46: Hoare triple {5225#(= 112 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5225#(= 112 ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:45,533 INFO L281 TraceCheckUtils]: 47: Hoare triple {5225#(= 112 ULTIMATE.start_main_~i~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5232#(= 116 ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:45,533 INFO L281 TraceCheckUtils]: 48: Hoare triple {5232#(= 116 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5232#(= 116 ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:45,534 INFO L281 TraceCheckUtils]: 49: Hoare triple {5232#(= 116 ULTIMATE.start_main_~i~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {5239#(= ULTIMATE.start_main_~i~0 124)} is VALID [2021-09-13 14:12:45,534 INFO L281 TraceCheckUtils]: 50: Hoare triple {5239#(= ULTIMATE.start_main_~i~0 124)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5239#(= ULTIMATE.start_main_~i~0 124)} is VALID [2021-09-13 14:12:45,534 INFO L281 TraceCheckUtils]: 51: Hoare triple {5239#(= ULTIMATE.start_main_~i~0 124)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5246#(= ULTIMATE.start_main_~i~0 128)} is VALID [2021-09-13 14:12:45,535 INFO L281 TraceCheckUtils]: 52: Hoare triple {5246#(= ULTIMATE.start_main_~i~0 128)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5246#(= ULTIMATE.start_main_~i~0 128)} is VALID [2021-09-13 14:12:45,535 INFO L281 TraceCheckUtils]: 53: Hoare triple {5246#(= ULTIMATE.start_main_~i~0 128)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5253#(= ULTIMATE.start_main_~i~0 132)} is VALID [2021-09-13 14:12:45,535 INFO L281 TraceCheckUtils]: 54: Hoare triple {5253#(= ULTIMATE.start_main_~i~0 132)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5253#(= ULTIMATE.start_main_~i~0 132)} is VALID [2021-09-13 14:12:45,536 INFO L281 TraceCheckUtils]: 55: Hoare triple {5253#(= ULTIMATE.start_main_~i~0 132)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {5260#(= ULTIMATE.start_main_~i~0 140)} is VALID [2021-09-13 14:12:45,536 INFO L281 TraceCheckUtils]: 56: Hoare triple {5260#(= ULTIMATE.start_main_~i~0 140)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5260#(= ULTIMATE.start_main_~i~0 140)} is VALID [2021-09-13 14:12:45,536 INFO L281 TraceCheckUtils]: 57: Hoare triple {5260#(= ULTIMATE.start_main_~i~0 140)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5267#(= ULTIMATE.start_main_~i~0 144)} is VALID [2021-09-13 14:12:45,536 INFO L281 TraceCheckUtils]: 58: Hoare triple {5267#(= ULTIMATE.start_main_~i~0 144)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5267#(= ULTIMATE.start_main_~i~0 144)} is VALID [2021-09-13 14:12:45,537 INFO L281 TraceCheckUtils]: 59: Hoare triple {5267#(= ULTIMATE.start_main_~i~0 144)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5274#(= ULTIMATE.start_main_~i~0 148)} is VALID [2021-09-13 14:12:45,537 INFO L281 TraceCheckUtils]: 60: Hoare triple {5274#(= ULTIMATE.start_main_~i~0 148)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5274#(= ULTIMATE.start_main_~i~0 148)} is VALID [2021-09-13 14:12:45,537 INFO L281 TraceCheckUtils]: 61: Hoare triple {5274#(= ULTIMATE.start_main_~i~0 148)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5281#(= ULTIMATE.start_main_~i~0 152)} is VALID [2021-09-13 14:12:45,538 INFO L281 TraceCheckUtils]: 62: Hoare triple {5281#(= ULTIMATE.start_main_~i~0 152)} assume !(main_~i~0 < ~SIZE~0); {5281#(= ULTIMATE.start_main_~i~0 152)} is VALID [2021-09-13 14:12:45,538 INFO L281 TraceCheckUtils]: 63: Hoare triple {5281#(= ULTIMATE.start_main_~i~0 152)} main_~j~0 := (if main_~i~0 < 0 && 0 != main_~i~0 % 4 then 1 + main_~i~0 / 4 else main_~i~0 / 4);__VERIFIER_assert_#in~cond := (if 4 * main_~j~0 == main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {5288#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:12:45,539 INFO L281 TraceCheckUtils]: 64: Hoare triple {5288#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {5032#false} is VALID [2021-09-13 14:12:45,539 INFO L281 TraceCheckUtils]: 65: Hoare triple {5032#false} assume !false; {5032#false} is VALID [2021-09-13 14:12:45,539 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:12:45,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:12:47,136 INFO L281 TraceCheckUtils]: 65: Hoare triple {5032#false} assume !false; {5032#false} is VALID [2021-09-13 14:12:47,137 INFO L281 TraceCheckUtils]: 64: Hoare triple {5288#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {5032#false} is VALID [2021-09-13 14:12:47,138 INFO L281 TraceCheckUtils]: 63: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} main_~j~0 := (if main_~i~0 < 0 && 0 != main_~i~0 % 4 then 1 + main_~i~0 / 4 else main_~i~0 / 4);__VERIFIER_assert_#in~cond := (if 4 * main_~j~0 == main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {5288#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:12:47,138 INFO L281 TraceCheckUtils]: 62: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} assume !(main_~i~0 < ~SIZE~0); {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,139 INFO L281 TraceCheckUtils]: 61: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,139 INFO L281 TraceCheckUtils]: 60: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,140 INFO L281 TraceCheckUtils]: 59: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,140 INFO L281 TraceCheckUtils]: 58: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,141 INFO L281 TraceCheckUtils]: 57: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,141 INFO L281 TraceCheckUtils]: 56: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,141 INFO L281 TraceCheckUtils]: 55: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,142 INFO L281 TraceCheckUtils]: 54: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,142 INFO L281 TraceCheckUtils]: 53: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,142 INFO L281 TraceCheckUtils]: 52: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,143 INFO L281 TraceCheckUtils]: 51: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,143 INFO L281 TraceCheckUtils]: 50: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,144 INFO L281 TraceCheckUtils]: 49: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,144 INFO L281 TraceCheckUtils]: 48: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,145 INFO L281 TraceCheckUtils]: 47: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,145 INFO L281 TraceCheckUtils]: 46: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,146 INFO L281 TraceCheckUtils]: 45: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,146 INFO L281 TraceCheckUtils]: 44: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,146 INFO L281 TraceCheckUtils]: 43: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,147 INFO L281 TraceCheckUtils]: 42: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,155 INFO L281 TraceCheckUtils]: 41: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,155 INFO L281 TraceCheckUtils]: 40: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,155 INFO L281 TraceCheckUtils]: 39: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,156 INFO L281 TraceCheckUtils]: 38: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,156 INFO L281 TraceCheckUtils]: 37: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,157 INFO L281 TraceCheckUtils]: 36: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,157 INFO L281 TraceCheckUtils]: 35: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,157 INFO L281 TraceCheckUtils]: 34: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,158 INFO L281 TraceCheckUtils]: 33: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,158 INFO L281 TraceCheckUtils]: 32: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,159 INFO L281 TraceCheckUtils]: 31: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,159 INFO L281 TraceCheckUtils]: 30: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,159 INFO L281 TraceCheckUtils]: 29: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,160 INFO L281 TraceCheckUtils]: 28: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,160 INFO L281 TraceCheckUtils]: 27: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,161 INFO L281 TraceCheckUtils]: 26: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,161 INFO L281 TraceCheckUtils]: 25: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,161 INFO L281 TraceCheckUtils]: 24: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,162 INFO L281 TraceCheckUtils]: 23: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,162 INFO L281 TraceCheckUtils]: 22: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,163 INFO L281 TraceCheckUtils]: 21: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,163 INFO L281 TraceCheckUtils]: 20: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,164 INFO L281 TraceCheckUtils]: 19: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,164 INFO L281 TraceCheckUtils]: 18: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,164 INFO L281 TraceCheckUtils]: 17: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,165 INFO L281 TraceCheckUtils]: 16: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,165 INFO L281 TraceCheckUtils]: 15: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,166 INFO L281 TraceCheckUtils]: 14: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,166 INFO L281 TraceCheckUtils]: 13: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,166 INFO L281 TraceCheckUtils]: 12: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,167 INFO L281 TraceCheckUtils]: 11: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,167 INFO L281 TraceCheckUtils]: 10: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,168 INFO L281 TraceCheckUtils]: 9: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,168 INFO L281 TraceCheckUtils]: 8: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,169 INFO L281 TraceCheckUtils]: 7: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,169 INFO L281 TraceCheckUtils]: 6: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,170 INFO L281 TraceCheckUtils]: 5: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~i~0 := 8 + main_~i~0; {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,170 INFO L281 TraceCheckUtils]: 4: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,170 INFO L281 TraceCheckUtils]: 3: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;main_~i~0 := 4 + main_~i~0; {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,171 INFO L281 TraceCheckUtils]: 2: Hoare triple {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < ~SIZE~0);assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,171 INFO L281 TraceCheckUtils]: 1: Hoare triple {5031#true} havoc main_#res;havoc main_#t~nondet7, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0;main_~j~0 := 0; {5301#(= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 14:12:47,171 INFO L281 TraceCheckUtils]: 0: Hoare triple {5031#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(9);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~SIZE~0 := 50000001; {5031#true} is VALID [2021-09-13 14:12:47,172 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2021-09-13 14:12:47,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892166088] provided 1 perfect and 1 imperfect interpolant sequences [2021-09-13 14:12:47,172 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:12:47,172 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [33, 34] total 67 [2021-09-13 14:12:47,172 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861525679] [2021-09-13 14:12:47,173 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-09-13 14:12:47,173 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:12:47,173 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:47,181 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:12:47,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-13 14:12:47,181 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:12:47,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-13 14:12:47,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=3792, Unknown=0, NotChecked=0, Total=4422 [2021-09-13 14:12:47,182 INFO L87 Difference]: Start difference. First operand 83 states and 121 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:47,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:47,435 INFO L93 Difference]: Finished difference Result 83 states and 121 transitions. [2021-09-13 14:12:47,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-09-13 14:12:47,435 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-09-13 14:12:47,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:12:47,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:47,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2021-09-13 14:12:47,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:47,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2021-09-13 14:12:47,436 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 9 transitions. [2021-09-13 14:12:47,442 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:12:47,442 INFO L225 Difference]: With dead ends: 83 [2021-09-13 14:12:47,442 INFO L226 Difference]: Without dead ends: 0 [2021-09-13 14:12:47,443 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 67 SyntacticMatches, 31 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2015 ImplicationChecksByTransitivity, 2228.26ms TimeCoverageRelationStatistics Valid=634, Invalid=3922, Unknown=0, NotChecked=0, Total=4556 [2021-09-13 14:12:47,443 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 1 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.32ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.13ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.48ms IncrementalHoareTripleChecker+Time [2021-09-13 14:12:47,444 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 0 Invalid, 14 Unknown, 0 Unchecked, 0.13ms Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 12.48ms Time] [2021-09-13 14:12:47,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-09-13 14:12:47,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-09-13 14:12:47,444 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:12:47,444 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:47,445 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:47,445 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:47,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:47,445 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2021-09-13 14:12:47,445 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-09-13 14:12:47,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:12:47,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:12:47,445 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2021-09-13 14:12:47,445 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2021-09-13 14:12:47,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:47,446 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2021-09-13 14:12:47,446 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-09-13 14:12:47,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:12:47,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:12:47,446 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:12:47,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:12:47,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:47,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-09-13 14:12:47,446 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2021-09-13 14:12:47,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:12:47,446 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-09-13 14:12:47,446 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:47,446 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-09-13 14:12:47,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:12:47,448 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-09-13 14:12:47,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-09-13 14:12:47,665 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:12:47,667 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-09-13 14:12:47,670 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-09-13 14:12:47,999 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-09-13 14:12:48,000 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-09-13 14:12:48,007 INFO L861 garLoopResultBuilder]: At program point L33(lines 20 34) the Hoare annotation is: true [2021-09-13 14:12:48,007 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-09-13 14:12:48,008 INFO L858 garLoopResultBuilder]: For program point L25(lines 25 28) no Hoare annotation was computed. [2021-09-13 14:12:48,008 INFO L854 garLoopResultBuilder]: At program point L25-2(lines 23 30) the Hoare annotation is: (and (= (* 4 (div ULTIMATE.start_main_~i~0 4)) ULTIMATE.start_main_~i~0) (<= 50000001 ~SIZE~0)) [2021-09-13 14:12:48,008 INFO L858 garLoopResultBuilder]: For program point L23-2(lines 23 30) no Hoare annotation was computed. [2021-09-13 14:12:48,008 INFO L858 garLoopResultBuilder]: For program point L13(lines 13 15) no Hoare annotation was computed. [2021-09-13 14:12:48,008 INFO L861 garLoopResultBuilder]: At program point L13-2(lines 12 17) the Hoare annotation is: true [2021-09-13 14:12:48,008 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-09-13 14:12:48,008 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-09-13 14:12:48,008 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-09-13 14:12:48,008 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2021-09-13 14:12:48,009 INFO L858 garLoopResultBuilder]: For program point L14(line 14) no Hoare annotation was computed. [2021-09-13 14:12:48,011 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-09-13 14:12:48,014 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2021-09-13 14:12:48,014 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2021-09-13 14:12:48,014 WARN L170 areAnnotationChecker]: L23-2 has no Hoare annotation [2021-09-13 14:12:48,014 WARN L170 areAnnotationChecker]: L23-2 has no Hoare annotation [2021-09-13 14:12:48,014 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2021-09-13 14:12:48,014 WARN L170 areAnnotationChecker]: L23-2 has no Hoare annotation [2021-09-13 14:12:48,015 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2021-09-13 14:12:48,015 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2021-09-13 14:12:48,015 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2021-09-13 14:12:48,015 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2021-09-13 14:12:48,015 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2021-09-13 14:12:48,015 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2021-09-13 14:12:48,015 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2021-09-13 14:12:48,015 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2021-09-13 14:12:48,015 INFO L163 areAnnotationChecker]: CFG has 1 edges. 1 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2021-09-13 14:12:48,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.09 02:12:48 BoogieIcfgContainer [2021-09-13 14:12:48,022 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-09-13 14:12:48,023 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-09-13 14:12:48,023 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-09-13 14:12:48,023 INFO L275 PluginConnector]: Witness Printer initialized [2021-09-13 14:12:48,024 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:12:29" (3/4) ... [2021-09-13 14:12:48,026 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-09-13 14:12:48,032 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2021-09-13 14:12:48,032 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-09-13 14:12:48,032 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-09-13 14:12:48,032 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-09-13 14:12:48,053 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-09-13 14:12:48,053 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-09-13 14:12:48,054 INFO L158 Benchmark]: Toolchain (without parser) took 19377.88ms. Allocated memory was 52.4MB in the beginning and 144.7MB in the end (delta: 92.3MB). Free memory was 30.2MB in the beginning and 99.6MB in the end (delta: -69.3MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. [2021-09-13 14:12:48,054 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 52.4MB. Free memory is still 34.2MB. There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:12:48,054 INFO L158 Benchmark]: CACSL2BoogieTranslator took 178.89ms. Allocated memory is still 52.4MB. Free memory was 30.0MB in the beginning and 32.0MB in the end (delta: -2.0MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. [2021-09-13 14:12:48,054 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.27ms. Allocated memory was 52.4MB in the beginning and 67.1MB in the end (delta: 14.7MB). Free memory was 32.0MB in the beginning and 51.6MB in the end (delta: -19.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-09-13 14:12:48,054 INFO L158 Benchmark]: Boogie Preprocessor took 24.74ms. Allocated memory is still 67.1MB. Free memory was 51.6MB in the beginning and 50.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:12:48,055 INFO L158 Benchmark]: RCFGBuilder took 297.19ms. Allocated memory is still 67.1MB. Free memory was 50.4MB in the beginning and 41.2MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-09-13 14:12:48,055 INFO L158 Benchmark]: TraceAbstraction took 18798.68ms. Allocated memory was 67.1MB in the beginning and 144.7MB in the end (delta: 77.6MB). Free memory was 40.6MB in the beginning and 101.7MB in the end (delta: -61.1MB). Peak memory consumption was 81.6MB. Max. memory is 16.1GB. [2021-09-13 14:12:48,058 INFO L158 Benchmark]: Witness Printer took 30.00ms. Allocated memory is still 144.7MB. Free memory was 101.7MB in the beginning and 99.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-09-13 14:12:48,059 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 52.4MB. Free memory is still 34.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 178.89ms. Allocated memory is still 52.4MB. Free memory was 30.0MB in the beginning and 32.0MB in the end (delta: -2.0MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.27ms. Allocated memory was 52.4MB in the beginning and 67.1MB in the end (delta: 14.7MB). Free memory was 32.0MB in the beginning and 51.6MB in the end (delta: -19.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.74ms. Allocated memory is still 67.1MB. Free memory was 51.6MB in the beginning and 50.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 297.19ms. Allocated memory is still 67.1MB. Free memory was 50.4MB in the beginning and 41.2MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 18798.68ms. Allocated memory was 67.1MB in the beginning and 144.7MB in the end (delta: 77.6MB). Free memory was 40.6MB in the beginning and 101.7MB in the end (delta: -61.1MB). Peak memory consumption was 81.6MB. Max. memory is 16.1GB. * Witness Printer took 30.00ms. Allocated memory is still 144.7MB. Free memory was 101.7MB in the beginning and 99.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 14]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 12 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18717.58ms, OverallIterations: 9, TraceHistogramMax: 30, EmptinessCheckTime: 12.18ms, AutomataDifference: 5284.87ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 341.21ms, InitialAbstractionConstructionTime: 7.59ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 348 SdHoareTripleChecker+Valid, 991.62ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 348 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 970.18ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 97 mSDsCounter, 704 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 587 IncrementalHoareTripleChecker+Invalid, 1291 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 704 mSolverCounterUnsat, 0 mSDtfsCounter, 587 mSolverCounterSat, 25.68ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 548 GetRequests, 217 SyntacticMatches, 31 SemanticMatches, 300 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6481 ImplicationChecksByTransitivity, 5500.84ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=83occurred in iteration=8, InterpolantAutomatonStates: 138, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 580.45ms AutomataMinimizationTime, 9 MinimizatonAttempts, 717 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.00ms HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 43 NumberOfFragments, 13 HoareAnnotationTreeSize, 3 FomulaSimplifications, 42072 FormulaSimplificationTreeSizeReduction, 332.11ms HoareSimplificationTime, 3 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 3.95ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 61.61ms SsaConstructionTime, 300.93ms SatisfiabilityAnalysisTime, 9858.59ms InterpolantComputationTime, 412 NumberOfCodeBlocks, 381 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 589 ConstructedInterpolants, 0 QuantifiedInterpolants, 2851 SizeOfPredicates, 15 NumberOfNonLiveVariables, 729 ConjunctsInSsa, 134 ConjunctsInUnsatCore, 23 InterpolantComputations, 3 PerfectInterpolantSequences, 900/4575 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: 4 * (i / 4) == i && 50000001 <= SIZE - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2021-09-13 14:12:48,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...