./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-acceleration/diamond_2-2.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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/loop-acceleration/diamond_2-2.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(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4c239e25bc1e45e912a3e7b96bb82f6853e587e9 ..................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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/loop-acceleration/diamond_2-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4c239e25bc1e45e912a3e7b96bb82f6853e587e9 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 18:13:12,572 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 18:13:12,575 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 18:13:12,587 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 18:13:12,588 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 18:13:12,589 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 18:13:12,591 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 18:13:12,593 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 18:13:12,595 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 18:13:12,596 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 18:13:12,598 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 18:13:12,602 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 18:13:12,603 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 18:13:12,604 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 18:13:12,607 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 18:13:12,608 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 18:13:12,609 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 18:13:12,612 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 18:13:12,613 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 18:13:12,620 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 18:13:12,622 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 18:13:12,623 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 18:13:12,627 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 18:13:12,629 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 18:13:12,632 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 18:13:12,634 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 18:13:12,634 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 18:13:12,635 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 18:13:12,637 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 18:13:12,638 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 18:13:12,639 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 18:13:12,640 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 18:13:12,642 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 18:13:12,643 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 18:13:12,645 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 18:13:12,646 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 18:13:12,646 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 18:13:12,647 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 18:13:12,647 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 18:13:12,648 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 18:13:12,650 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 18:13:12,650 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 18:13:12,689 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 18:13:12,691 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 18:13:12,693 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 18:13:12,693 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 18:13:12,693 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 18:13:12,696 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 18:13:12,696 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 18:13:12,696 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 18:13:12,697 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 18:13:12,697 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 18:13:12,697 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 18:13:12,697 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 18:13:12,698 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 18:13:12,698 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 18:13:12,699 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 18:13:12,700 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 18:13:12,700 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 18:13:12,700 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 18:13:12,700 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 18:13:12,701 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 18:13:12,701 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 18:13:12,701 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 18:13:12,702 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 18:13:12,702 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 18:13:12,703 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 18:13:12,703 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 18:13:12,703 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 18:13:12,703 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 18:13:12,704 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 18:13:12,704 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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(__VERIFIER_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 -> 4c239e25bc1e45e912a3e7b96bb82f6853e587e9 [2020-07-28 18:13:13,009 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 18:13:13,022 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 18:13:13,026 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 18:13:13,027 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 18:13:13,028 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 18:13:13,028 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-acceleration/diamond_2-2.c [2020-07-28 18:13:13,092 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4507c5a94/29f03190bcb743d7898a8298c2da4bd2/FLAGb77468113 [2020-07-28 18:13:13,480 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 18:13:13,481 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-acceleration/diamond_2-2.c [2020-07-28 18:13:13,487 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4507c5a94/29f03190bcb743d7898a8298c2da4bd2/FLAGb77468113 [2020-07-28 18:13:13,917 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4507c5a94/29f03190bcb743d7898a8298c2da4bd2 [2020-07-28 18:13:13,921 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 18:13:13,924 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 18:13:13,926 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 18:13:13,926 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 18:13:13,929 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 18:13:13,931 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:13:13" (1/1) ... [2020-07-28 18:13:13,934 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e64d722 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:13, skipping insertion in model container [2020-07-28 18:13:13,934 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:13:13" (1/1) ... [2020-07-28 18:13:13,945 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 18:13:13,968 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 18:13:14,139 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:13:14,145 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 18:13:14,173 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:13:14,189 INFO L208 MainTranslator]: Completed translation [2020-07-28 18:13:14,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:14 WrapperNode [2020-07-28 18:13:14,190 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 18:13:14,191 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 18:13:14,191 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 18:13:14,191 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 18:13:14,201 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:14" (1/1) ... [2020-07-28 18:13:14,208 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:14" (1/1) ... [2020-07-28 18:13:14,305 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 18:13:14,308 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 18:13:14,308 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 18:13:14,308 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 18:13:14,321 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:14" (1/1) ... [2020-07-28 18:13:14,321 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:14" (1/1) ... [2020-07-28 18:13:14,323 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:14" (1/1) ... [2020-07-28 18:13:14,324 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:14" (1/1) ... [2020-07-28 18:13:14,350 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:14" (1/1) ... [2020-07-28 18:13:14,369 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:14" (1/1) ... [2020-07-28 18:13:14,374 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:14" (1/1) ... [2020-07-28 18:13:14,379 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 18:13:14,380 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 18:13:14,380 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 18:13:14,380 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 18:13:14,382 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 18:13:14,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 18:13:14,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 18:13:14,969 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 18:13:14,970 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-28 18:13:14,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:13:14 BoogieIcfgContainer [2020-07-28 18:13:14,974 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 18:13:14,975 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 18:13:14,976 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 18:13:14,980 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 18:13:14,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 06:13:13" (1/3) ... [2020-07-28 18:13:14,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@485181f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:13:14, skipping insertion in model container [2020-07-28 18:13:14,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:14" (2/3) ... [2020-07-28 18:13:14,984 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@485181f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:13:14, skipping insertion in model container [2020-07-28 18:13:14,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:13:14" (3/3) ... [2020-07-28 18:13:14,987 INFO L109 eAbstractionObserver]: Analyzing ICFG diamond_2-2.c [2020-07-28 18:13:15,001 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 18:13:15,010 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 18:13:15,030 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 18:13:15,059 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 18:13:15,059 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 18:13:15,060 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 18:13:15,060 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 18:13:15,060 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 18:13:15,060 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 18:13:15,061 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 18:13:15,061 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 18:13:15,080 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2020-07-28 18:13:15,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-28 18:13:15,088 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:13:15,090 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-28 18:13:15,091 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:13:15,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:13:15,099 INFO L82 PathProgramCache]: Analyzing trace with hash 31771204, now seen corresponding path program 1 times [2020-07-28 18:13:15,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:13:15,112 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464685078] [2020-07-28 18:13:15,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:13:15,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:13:15,255 INFO L280 TraceCheckUtils]: 0: Hoare triple {22#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~x~0, main_~y~0;main_~x~0 := 0;main_~y~0 := main_#t~nondet0;havoc main_#t~nondet0; {22#true} is VALID [2020-07-28 18:13:15,257 INFO L280 TraceCheckUtils]: 1: Hoare triple {22#true} assume !true; {23#false} is VALID [2020-07-28 18:13:15,257 INFO L280 TraceCheckUtils]: 2: Hoare triple {23#false} __VERIFIER_assert_#in~cond := (if (if main_~x~0 % 4294967296 < 0 && 0 != main_~x~0 % 4294967296 % 2 then main_~x~0 % 4294967296 % 2 - 2 else main_~x~0 % 4294967296 % 2) % 4294967296 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {23#false} is VALID [2020-07-28 18:13:15,258 INFO L280 TraceCheckUtils]: 3: Hoare triple {23#false} assume 0 == __VERIFIER_assert_~cond; {23#false} is VALID [2020-07-28 18:13:15,258 INFO L280 TraceCheckUtils]: 4: Hoare triple {23#false} assume !false; {23#false} is VALID [2020-07-28 18:13:15,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:13:15,262 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464685078] [2020-07-28 18:13:15,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:13:15,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 18:13:15,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606775042] [2020-07-28 18:13:15,273 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2020-07-28 18:13:15,275 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:13:15,279 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 18:13:15,293 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:13:15,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 18:13:15,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:13:15,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 18:13:15,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 18:13:15,307 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2020-07-28 18:13:15,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:13:15,377 INFO L93 Difference]: Finished difference Result 26 states and 38 transitions. [2020-07-28 18:13:15,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 18:13:15,378 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2020-07-28 18:13:15,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:13:15,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 18:13:15,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 38 transitions. [2020-07-28 18:13:15,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 18:13:15,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 38 transitions. [2020-07-28 18:13:15,391 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 38 transitions. [2020-07-28 18:13:15,460 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:13:15,471 INFO L225 Difference]: With dead ends: 26 [2020-07-28 18:13:15,472 INFO L226 Difference]: Without dead ends: 16 [2020-07-28 18:13:15,476 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 18:13:15,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-28 18:13:15,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-28 18:13:15,509 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:13:15,510 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2020-07-28 18:13:15,510 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-28 18:13:15,511 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-28 18:13:15,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:13:15,514 INFO L93 Difference]: Finished difference Result 16 states and 26 transitions. [2020-07-28 18:13:15,514 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 26 transitions. [2020-07-28 18:13:15,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:13:15,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:13:15,515 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-28 18:13:15,516 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-28 18:13:15,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:13:15,518 INFO L93 Difference]: Finished difference Result 16 states and 26 transitions. [2020-07-28 18:13:15,519 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 26 transitions. [2020-07-28 18:13:15,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:13:15,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:13:15,520 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:13:15,520 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:13:15,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-28 18:13:15,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 26 transitions. [2020-07-28 18:13:15,525 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 26 transitions. Word has length 5 [2020-07-28 18:13:15,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:13:15,525 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 26 transitions. [2020-07-28 18:13:15,526 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 18:13:15,526 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 26 transitions. [2020-07-28 18:13:15,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-28 18:13:15,527 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:13:15,527 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-28 18:13:15,527 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 18:13:15,528 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:13:15,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:13:15,528 INFO L82 PathProgramCache]: Analyzing trace with hash 29864580, now seen corresponding path program 1 times [2020-07-28 18:13:15,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:13:15,529 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856537650] [2020-07-28 18:13:15,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:13:15,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:13:15,589 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 18:13:15,590 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.proof.FixResolutionProof.fix(FixResolutionProof.java:191) at de.uni_freiburg.informatik.ultimate.smtinterpol.proof.ProofTermGenerator.convert(ProofTermGenerator.java:150) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getProof(SMTInterpol.java:797) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:392) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:386) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:191) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:285) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:166) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:326) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:228) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-28 18:13:15,598 INFO L168 Benchmark]: Toolchain (without parser) took 1674.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 957.5 MB in the beginning and 1.1 GB in the end (delta: -112.0 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. [2020-07-28 18:13:15,599 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 18:13:15,600 INFO L168 Benchmark]: CACSL2BoogieTranslator took 264.75 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 946.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-28 18:13:15,601 INFO L168 Benchmark]: Boogie Procedure Inliner took 116.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -182.4 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2020-07-28 18:13:15,602 INFO L168 Benchmark]: Boogie Preprocessor took 71.65 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 18:13:15,603 INFO L168 Benchmark]: RCFGBuilder took 594.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. [2020-07-28 18:13:15,604 INFO L168 Benchmark]: TraceAbstraction took 618.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 11.5 GB. [2020-07-28 18:13:15,608 INFO L336 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.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 264.75 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 946.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 116.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -182.4 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 71.65 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 594.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 618.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.proof.FixResolutionProof.fix(FixResolutionProof.java:191) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 18:13:17,622 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 18:13:17,624 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 18:13:17,642 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 18:13:17,643 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 18:13:17,645 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 18:13:17,647 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 18:13:17,660 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 18:13:17,662 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 18:13:17,664 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 18:13:17,666 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 18:13:17,668 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 18:13:17,669 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 18:13:17,673 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 18:13:17,674 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 18:13:17,676 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 18:13:17,677 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 18:13:17,679 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 18:13:17,682 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 18:13:17,687 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 18:13:17,692 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 18:13:17,696 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 18:13:17,697 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 18:13:17,699 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 18:13:17,702 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 18:13:17,702 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 18:13:17,703 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 18:13:17,705 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 18:13:17,705 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 18:13:17,706 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 18:13:17,706 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 18:13:17,708 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 18:13:17,709 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 18:13:17,710 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 18:13:17,712 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 18:13:17,712 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 18:13:17,713 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 18:13:17,713 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 18:13:17,713 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 18:13:17,714 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 18:13:17,716 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 18:13:17,717 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-07-28 18:13:17,742 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 18:13:17,742 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 18:13:17,744 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 18:13:17,745 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 18:13:17,745 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 18:13:17,746 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 18:13:17,746 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 18:13:17,746 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 18:13:17,746 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 18:13:17,747 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 18:13:17,748 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 18:13:17,748 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 18:13:17,748 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-07-28 18:13:17,749 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-07-28 18:13:17,749 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 18:13:17,749 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 18:13:17,750 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 18:13:17,750 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 18:13:17,750 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 18:13:17,751 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 18:13:17,751 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 18:13:17,751 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 18:13:17,751 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 18:13:17,752 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 18:13:17,752 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 18:13:17,752 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 18:13:17,752 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-07-28 18:13:17,753 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-07-28 18:13:17,753 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 18:13:17,753 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 18:13:17,754 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-28 18:13:17,754 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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(__VERIFIER_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 -> 4c239e25bc1e45e912a3e7b96bb82f6853e587e9 [2020-07-28 18:13:18,033 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 18:13:18,049 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 18:13:18,053 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 18:13:18,055 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 18:13:18,058 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 18:13:18,059 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-acceleration/diamond_2-2.c [2020-07-28 18:13:18,140 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90a1f66d5/15713ad5ef5b45958d1539dd4cf0a801/FLAG747278f3f [2020-07-28 18:13:18,641 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 18:13:18,642 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-acceleration/diamond_2-2.c [2020-07-28 18:13:18,651 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90a1f66d5/15713ad5ef5b45958d1539dd4cf0a801/FLAG747278f3f [2020-07-28 18:13:18,991 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90a1f66d5/15713ad5ef5b45958d1539dd4cf0a801 [2020-07-28 18:13:18,995 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 18:13:18,998 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 18:13:18,999 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 18:13:18,999 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 18:13:19,003 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 18:13:19,005 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:13:18" (1/1) ... [2020-07-28 18:13:19,007 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9bfa321 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:19, skipping insertion in model container [2020-07-28 18:13:19,008 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:13:18" (1/1) ... [2020-07-28 18:13:19,015 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 18:13:19,036 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 18:13:19,224 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:13:19,230 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 18:13:19,255 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:13:19,270 INFO L208 MainTranslator]: Completed translation [2020-07-28 18:13:19,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:19 WrapperNode [2020-07-28 18:13:19,271 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 18:13:19,272 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 18:13:19,272 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 18:13:19,273 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 18:13:19,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:19" (1/1) ... [2020-07-28 18:13:19,289 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:19" (1/1) ... [2020-07-28 18:13:19,368 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 18:13:19,369 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 18:13:19,369 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 18:13:19,369 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 18:13:19,377 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:19" (1/1) ... [2020-07-28 18:13:19,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:19" (1/1) ... [2020-07-28 18:13:19,378 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:19" (1/1) ... [2020-07-28 18:13:19,379 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:19" (1/1) ... [2020-07-28 18:13:19,385 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:19" (1/1) ... [2020-07-28 18:13:19,391 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:19" (1/1) ... [2020-07-28 18:13:19,393 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:19" (1/1) ... [2020-07-28 18:13:19,395 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 18:13:19,396 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 18:13:19,396 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 18:13:19,396 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 18:13:19,397 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 18:13:19,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 18:13:19,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 18:13:19,760 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 18:13:19,760 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-28 18:13:19,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:13:19 BoogieIcfgContainer [2020-07-28 18:13:19,764 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 18:13:19,765 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 18:13:19,766 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 18:13:19,769 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 18:13:19,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 06:13:18" (1/3) ... [2020-07-28 18:13:19,770 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26f16d02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:13:19, skipping insertion in model container [2020-07-28 18:13:19,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:19" (2/3) ... [2020-07-28 18:13:19,771 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26f16d02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:13:19, skipping insertion in model container [2020-07-28 18:13:19,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:13:19" (3/3) ... [2020-07-28 18:13:19,773 INFO L109 eAbstractionObserver]: Analyzing ICFG diamond_2-2.c [2020-07-28 18:13:19,784 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 18:13:19,804 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 18:13:19,844 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 18:13:19,872 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 18:13:19,873 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 18:13:19,873 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 18:13:19,873 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 18:13:19,873 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 18:13:19,874 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 18:13:19,874 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 18:13:19,874 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 18:13:19,892 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2020-07-28 18:13:19,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-28 18:13:19,902 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:13:19,905 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-28 18:13:19,905 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:13:19,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:13:19,910 INFO L82 PathProgramCache]: Analyzing trace with hash 31771204, now seen corresponding path program 1 times [2020-07-28 18:13:19,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 18:13:19,921 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1899709537] [2020-07-28 18:13:19,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-07-28 18:13:19,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:13:19,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-28 18:13:19,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:13:19,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:13:19,993 INFO L280 TraceCheckUtils]: 0: Hoare triple {22#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~x~0, main_~y~0;main_~x~0 := 0bv32;main_~y~0 := main_#t~nondet0;havoc main_#t~nondet0; {22#true} is VALID [2020-07-28 18:13:19,997 INFO L280 TraceCheckUtils]: 1: Hoare triple {22#true} assume !true; {23#false} is VALID [2020-07-28 18:13:19,997 INFO L280 TraceCheckUtils]: 2: Hoare triple {23#false} __VERIFIER_assert_#in~cond := (if ~bvurem32(main_~x~0, 2bv32) == ~bvurem32(main_~y~0, 2bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {23#false} is VALID [2020-07-28 18:13:19,997 INFO L280 TraceCheckUtils]: 3: Hoare triple {23#false} assume 0bv32 == __VERIFIER_assert_~cond; {23#false} is VALID [2020-07-28 18:13:19,998 INFO L280 TraceCheckUtils]: 4: Hoare triple {23#false} assume !false; {23#false} is VALID [2020-07-28 18:13:20,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:13:20,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 18:13:20,015 INFO L280 TraceCheckUtils]: 4: Hoare triple {23#false} assume !false; {23#false} is VALID [2020-07-28 18:13:20,015 INFO L280 TraceCheckUtils]: 3: Hoare triple {23#false} assume 0bv32 == __VERIFIER_assert_~cond; {23#false} is VALID [2020-07-28 18:13:20,015 INFO L280 TraceCheckUtils]: 2: Hoare triple {23#false} __VERIFIER_assert_#in~cond := (if ~bvurem32(main_~x~0, 2bv32) == ~bvurem32(main_~y~0, 2bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {23#false} is VALID [2020-07-28 18:13:20,017 INFO L280 TraceCheckUtils]: 1: Hoare triple {22#true} assume !true; {23#false} is VALID [2020-07-28 18:13:20,017 INFO L280 TraceCheckUtils]: 0: Hoare triple {22#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~x~0, main_~y~0;main_~x~0 := 0bv32;main_~y~0 := main_#t~nondet0;havoc main_#t~nondet0; {22#true} is VALID [2020-07-28 18:13:20,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:13:20,019 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1899709537] [2020-07-28 18:13:20,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:13:20,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-07-28 18:13:20,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432569566] [2020-07-28 18:13:20,029 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2020-07-28 18:13:20,031 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:13:20,035 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 18:13:20,052 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:13:20,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 18:13:20,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 18:13:20,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 18:13:20,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 18:13:20,061 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2020-07-28 18:13:20,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:13:20,133 INFO L93 Difference]: Finished difference Result 26 states and 38 transitions. [2020-07-28 18:13:20,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 18:13:20,134 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2020-07-28 18:13:20,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:13:20,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 18:13:20,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 38 transitions. [2020-07-28 18:13:20,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 18:13:20,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 38 transitions. [2020-07-28 18:13:20,147 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 38 transitions. [2020-07-28 18:13:20,235 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:13:20,246 INFO L225 Difference]: With dead ends: 26 [2020-07-28 18:13:20,246 INFO L226 Difference]: Without dead ends: 16 [2020-07-28 18:13:20,249 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 18:13:20,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-28 18:13:20,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-28 18:13:20,283 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:13:20,283 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2020-07-28 18:13:20,284 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-28 18:13:20,284 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-28 18:13:20,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:13:20,287 INFO L93 Difference]: Finished difference Result 16 states and 26 transitions. [2020-07-28 18:13:20,288 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 26 transitions. [2020-07-28 18:13:20,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:13:20,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:13:20,289 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-28 18:13:20,289 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-28 18:13:20,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:13:20,291 INFO L93 Difference]: Finished difference Result 16 states and 26 transitions. [2020-07-28 18:13:20,292 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 26 transitions. [2020-07-28 18:13:20,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:13:20,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:13:20,293 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:13:20,293 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:13:20,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-28 18:13:20,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 26 transitions. [2020-07-28 18:13:20,298 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 26 transitions. Word has length 5 [2020-07-28 18:13:20,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:13:20,298 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 26 transitions. [2020-07-28 18:13:20,298 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 18:13:20,299 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 26 transitions. [2020-07-28 18:13:20,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-28 18:13:20,299 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:13:20,300 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-28 18:13:20,511 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-07-28 18:13:20,512 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:13:20,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:13:20,514 INFO L82 PathProgramCache]: Analyzing trace with hash 29864580, now seen corresponding path program 1 times [2020-07-28 18:13:20,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 18:13:20,515 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [64591314] [2020-07-28 18:13:20,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2020-07-28 18:13:20,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:13:20,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-07-28 18:13:20,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:13:20,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:13:20,583 INFO L280 TraceCheckUtils]: 0: Hoare triple {128#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~x~0, main_~y~0;main_~x~0 := 0bv32;main_~y~0 := main_#t~nondet0;havoc main_#t~nondet0; {133#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:13:20,585 INFO L280 TraceCheckUtils]: 1: Hoare triple {133#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} assume !~bvult32(main_~x~0, 99bv32); {129#false} is VALID [2020-07-28 18:13:20,586 INFO L280 TraceCheckUtils]: 2: Hoare triple {129#false} __VERIFIER_assert_#in~cond := (if ~bvurem32(main_~x~0, 2bv32) == ~bvurem32(main_~y~0, 2bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {129#false} is VALID [2020-07-28 18:13:20,586 INFO L280 TraceCheckUtils]: 3: Hoare triple {129#false} assume 0bv32 == __VERIFIER_assert_~cond; {129#false} is VALID [2020-07-28 18:13:20,586 INFO L280 TraceCheckUtils]: 4: Hoare triple {129#false} assume !false; {129#false} is VALID [2020-07-28 18:13:20,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:13:20,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 18:13:20,604 INFO L280 TraceCheckUtils]: 4: Hoare triple {129#false} assume !false; {129#false} is VALID [2020-07-28 18:13:20,604 INFO L280 TraceCheckUtils]: 3: Hoare triple {129#false} assume 0bv32 == __VERIFIER_assert_~cond; {129#false} is VALID [2020-07-28 18:13:20,605 INFO L280 TraceCheckUtils]: 2: Hoare triple {129#false} __VERIFIER_assert_#in~cond := (if ~bvurem32(main_~x~0, 2bv32) == ~bvurem32(main_~y~0, 2bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {129#false} is VALID [2020-07-28 18:13:20,607 INFO L280 TraceCheckUtils]: 1: Hoare triple {155#(bvult ULTIMATE.start_main_~x~0 (_ bv99 32))} assume !~bvult32(main_~x~0, 99bv32); {129#false} is VALID [2020-07-28 18:13:20,609 INFO L280 TraceCheckUtils]: 0: Hoare triple {128#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~x~0, main_~y~0;main_~x~0 := 0bv32;main_~y~0 := main_#t~nondet0;havoc main_#t~nondet0; {155#(bvult ULTIMATE.start_main_~x~0 (_ bv99 32))} is VALID [2020-07-28 18:13:20,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:13:20,610 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [64591314] [2020-07-28 18:13:20,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:13:20,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2020-07-28 18:13:20,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910558139] [2020-07-28 18:13:20,613 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-07-28 18:13:20,616 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:13:20,616 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 18:13:20,629 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:13:20,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 18:13:20,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 18:13:20,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 18:13:20,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-28 18:13:20,631 INFO L87 Difference]: Start difference. First operand 16 states and 26 transitions. Second operand 4 states. [2020-07-28 18:13:20,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:13:20,952 INFO L93 Difference]: Finished difference Result 23 states and 35 transitions. [2020-07-28 18:13:20,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 18:13:20,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-07-28 18:13:20,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:13:20,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:13:20,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2020-07-28 18:13:20,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:13:20,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2020-07-28 18:13:20,964 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 35 transitions. [2020-07-28 18:13:21,052 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:13:21,055 INFO L225 Difference]: With dead ends: 23 [2020-07-28 18:13:21,056 INFO L226 Difference]: Without dead ends: 19 [2020-07-28 18:13:21,057 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-28 18:13:21,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-07-28 18:13:21,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2020-07-28 18:13:21,066 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:13:21,066 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 17 states. [2020-07-28 18:13:21,066 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 17 states. [2020-07-28 18:13:21,066 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 17 states. [2020-07-28 18:13:21,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:13:21,070 INFO L93 Difference]: Finished difference Result 19 states and 31 transitions. [2020-07-28 18:13:21,071 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 31 transitions. [2020-07-28 18:13:21,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:13:21,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:13:21,072 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 19 states. [2020-07-28 18:13:21,072 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 19 states. [2020-07-28 18:13:21,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:13:21,075 INFO L93 Difference]: Finished difference Result 19 states and 31 transitions. [2020-07-28 18:13:21,076 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 31 transitions. [2020-07-28 18:13:21,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:13:21,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:13:21,077 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:13:21,077 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:13:21,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-28 18:13:21,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 27 transitions. [2020-07-28 18:13:21,083 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 27 transitions. Word has length 5 [2020-07-28 18:13:21,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:13:21,084 INFO L479 AbstractCegarLoop]: Abstraction has 17 states and 27 transitions. [2020-07-28 18:13:21,084 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 18:13:21,085 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 27 transitions. [2020-07-28 18:13:21,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-28 18:13:21,086 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:13:21,086 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:13:21,309 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-07-28 18:13:21,310 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:13:21,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:13:21,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1273519218, now seen corresponding path program 1 times [2020-07-28 18:13:21,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 18:13:21,312 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1633028505] [2020-07-28 18:13:21,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-07-28 18:13:21,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:13:21,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-28 18:13:21,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:13:21,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:13:21,383 INFO L280 TraceCheckUtils]: 0: Hoare triple {240#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~x~0, main_~y~0;main_~x~0 := 0bv32;main_~y~0 := main_#t~nondet0;havoc main_#t~nondet0; {240#true} is VALID [2020-07-28 18:13:21,383 INFO L280 TraceCheckUtils]: 1: Hoare triple {240#true} assume !!~bvult32(main_~x~0, 99bv32); {240#true} is VALID [2020-07-28 18:13:21,384 INFO L280 TraceCheckUtils]: 2: Hoare triple {240#true} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {240#true} is VALID [2020-07-28 18:13:21,384 INFO L280 TraceCheckUtils]: 3: Hoare triple {240#true} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {240#true} is VALID [2020-07-28 18:13:21,384 INFO L280 TraceCheckUtils]: 4: Hoare triple {240#true} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {240#true} is VALID [2020-07-28 18:13:21,386 INFO L280 TraceCheckUtils]: 5: Hoare triple {240#true} assume !(0bv32 == ~bvurem32(main_~y~0, 2bv32));main_~x~0 := ~bvsub32(main_~x~0, 2bv32); {260#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32))))} is VALID [2020-07-28 18:13:21,387 INFO L280 TraceCheckUtils]: 6: Hoare triple {260#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32))))} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {260#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32))))} is VALID [2020-07-28 18:13:21,387 INFO L280 TraceCheckUtils]: 7: Hoare triple {260#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32))))} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {260#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32))))} is VALID [2020-07-28 18:13:21,388 INFO L280 TraceCheckUtils]: 8: Hoare triple {260#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32))))} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {260#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32))))} is VALID [2020-07-28 18:13:21,389 INFO L280 TraceCheckUtils]: 9: Hoare triple {260#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32))))} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {241#false} is VALID [2020-07-28 18:13:21,390 INFO L280 TraceCheckUtils]: 10: Hoare triple {241#false} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {241#false} is VALID [2020-07-28 18:13:21,390 INFO L280 TraceCheckUtils]: 11: Hoare triple {241#false} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {241#false} is VALID [2020-07-28 18:13:21,390 INFO L280 TraceCheckUtils]: 12: Hoare triple {241#false} assume !~bvult32(main_~x~0, 99bv32); {241#false} is VALID [2020-07-28 18:13:21,390 INFO L280 TraceCheckUtils]: 13: Hoare triple {241#false} __VERIFIER_assert_#in~cond := (if ~bvurem32(main_~x~0, 2bv32) == ~bvurem32(main_~y~0, 2bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {241#false} is VALID [2020-07-28 18:13:21,391 INFO L280 TraceCheckUtils]: 14: Hoare triple {241#false} assume 0bv32 == __VERIFIER_assert_~cond; {241#false} is VALID [2020-07-28 18:13:21,391 INFO L280 TraceCheckUtils]: 15: Hoare triple {241#false} assume !false; {241#false} is VALID [2020-07-28 18:13:21,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:13:21,394 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 18:13:21,415 INFO L280 TraceCheckUtils]: 15: Hoare triple {241#false} assume !false; {241#false} is VALID [2020-07-28 18:13:21,415 INFO L280 TraceCheckUtils]: 14: Hoare triple {241#false} assume 0bv32 == __VERIFIER_assert_~cond; {241#false} is VALID [2020-07-28 18:13:21,416 INFO L280 TraceCheckUtils]: 13: Hoare triple {241#false} __VERIFIER_assert_#in~cond := (if ~bvurem32(main_~x~0, 2bv32) == ~bvurem32(main_~y~0, 2bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {241#false} is VALID [2020-07-28 18:13:21,416 INFO L280 TraceCheckUtils]: 12: Hoare triple {241#false} assume !~bvult32(main_~x~0, 99bv32); {241#false} is VALID [2020-07-28 18:13:21,417 INFO L280 TraceCheckUtils]: 11: Hoare triple {241#false} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {241#false} is VALID [2020-07-28 18:13:21,417 INFO L280 TraceCheckUtils]: 10: Hoare triple {241#false} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {241#false} is VALID [2020-07-28 18:13:21,418 INFO L280 TraceCheckUtils]: 9: Hoare triple {260#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32))))} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {241#false} is VALID [2020-07-28 18:13:21,419 INFO L280 TraceCheckUtils]: 8: Hoare triple {260#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32))))} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {260#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32))))} is VALID [2020-07-28 18:13:21,420 INFO L280 TraceCheckUtils]: 7: Hoare triple {260#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32))))} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {260#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32))))} is VALID [2020-07-28 18:13:21,421 INFO L280 TraceCheckUtils]: 6: Hoare triple {260#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32))))} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {260#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32))))} is VALID [2020-07-28 18:13:21,422 INFO L280 TraceCheckUtils]: 5: Hoare triple {240#true} assume !(0bv32 == ~bvurem32(main_~y~0, 2bv32));main_~x~0 := ~bvsub32(main_~x~0, 2bv32); {260#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32))))} is VALID [2020-07-28 18:13:21,422 INFO L280 TraceCheckUtils]: 4: Hoare triple {240#true} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {240#true} is VALID [2020-07-28 18:13:21,423 INFO L280 TraceCheckUtils]: 3: Hoare triple {240#true} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {240#true} is VALID [2020-07-28 18:13:21,423 INFO L280 TraceCheckUtils]: 2: Hoare triple {240#true} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {240#true} is VALID [2020-07-28 18:13:21,423 INFO L280 TraceCheckUtils]: 1: Hoare triple {240#true} assume !!~bvult32(main_~x~0, 99bv32); {240#true} is VALID [2020-07-28 18:13:21,424 INFO L280 TraceCheckUtils]: 0: Hoare triple {240#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~x~0, main_~y~0;main_~x~0 := 0bv32;main_~y~0 := main_#t~nondet0;havoc main_#t~nondet0; {240#true} is VALID [2020-07-28 18:13:21,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:13:21,426 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1633028505] [2020-07-28 18:13:21,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:13:21,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-07-28 18:13:21,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204768648] [2020-07-28 18:13:21,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-07-28 18:13:21,427 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:13:21,427 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-28 18:13:21,453 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:13:21,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-28 18:13:21,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 18:13:21,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-28 18:13:21,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 18:13:21,454 INFO L87 Difference]: Start difference. First operand 17 states and 27 transitions. Second operand 3 states. [2020-07-28 18:13:21,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:13:21,643 INFO L93 Difference]: Finished difference Result 47 states and 77 transitions. [2020-07-28 18:13:21,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-28 18:13:21,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-07-28 18:13:21,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:13:21,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 18:13:21,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2020-07-28 18:13:21,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 18:13:21,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2020-07-28 18:13:21,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 76 transitions. [2020-07-28 18:13:21,813 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:13:21,814 INFO L225 Difference]: With dead ends: 47 [2020-07-28 18:13:21,815 INFO L226 Difference]: Without dead ends: 32 [2020-07-28 18:13:21,815 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 18:13:21,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-28 18:13:21,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2020-07-28 18:13:21,831 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:13:21,831 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 28 states. [2020-07-28 18:13:21,831 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 28 states. [2020-07-28 18:13:21,831 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 28 states. [2020-07-28 18:13:21,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:13:21,834 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2020-07-28 18:13:21,834 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2020-07-28 18:13:21,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:13:21,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:13:21,835 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 32 states. [2020-07-28 18:13:21,835 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 32 states. [2020-07-28 18:13:21,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:13:21,838 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2020-07-28 18:13:21,838 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2020-07-28 18:13:21,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:13:21,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:13:21,839 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:13:21,839 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:13:21,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-28 18:13:21,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2020-07-28 18:13:21,841 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 16 [2020-07-28 18:13:21,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:13:21,841 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2020-07-28 18:13:21,842 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-28 18:13:21,842 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2020-07-28 18:13:21,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-28 18:13:21,843 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:13:21,843 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:13:22,053 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-07-28 18:13:22,055 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:13:22,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:13:22,056 INFO L82 PathProgramCache]: Analyzing trace with hash 38278222, now seen corresponding path program 1 times [2020-07-28 18:13:22,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 18:13:22,057 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [151195704] [2020-07-28 18:13:22,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-07-28 18:13:22,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:13:22,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-28 18:13:22,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:13:22,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:13:22,143 INFO L280 TraceCheckUtils]: 0: Hoare triple {481#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~x~0, main_~y~0;main_~x~0 := 0bv32;main_~y~0 := main_#t~nondet0;havoc main_#t~nondet0; {481#true} is VALID [2020-07-28 18:13:22,144 INFO L280 TraceCheckUtils]: 1: Hoare triple {481#true} assume !!~bvult32(main_~x~0, 99bv32); {481#true} is VALID [2020-07-28 18:13:22,145 INFO L280 TraceCheckUtils]: 2: Hoare triple {481#true} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {492#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} is VALID [2020-07-28 18:13:22,146 INFO L280 TraceCheckUtils]: 3: Hoare triple {492#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {492#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} is VALID [2020-07-28 18:13:22,147 INFO L280 TraceCheckUtils]: 4: Hoare triple {492#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {492#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} is VALID [2020-07-28 18:13:22,147 INFO L280 TraceCheckUtils]: 5: Hoare triple {492#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} assume !(0bv32 == ~bvurem32(main_~y~0, 2bv32));main_~x~0 := ~bvsub32(main_~x~0, 2bv32); {492#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} is VALID [2020-07-28 18:13:22,148 INFO L280 TraceCheckUtils]: 6: Hoare triple {492#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} assume !(0bv32 == ~bvurem32(main_~y~0, 2bv32));main_~x~0 := ~bvadd32(2bv32, main_~x~0); {492#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} is VALID [2020-07-28 18:13:22,148 INFO L280 TraceCheckUtils]: 7: Hoare triple {492#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} assume !(0bv32 == ~bvurem32(main_~y~0, 2bv32));main_~x~0 := ~bvsub32(main_~x~0, 4bv32); {492#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} is VALID [2020-07-28 18:13:22,149 INFO L280 TraceCheckUtils]: 8: Hoare triple {492#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} assume !(0bv32 == ~bvurem32(main_~y~0, 2bv32));main_~x~0 := ~bvadd32(4bv32, main_~x~0); {492#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} is VALID [2020-07-28 18:13:22,151 INFO L280 TraceCheckUtils]: 9: Hoare triple {492#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} assume !(0bv32 == ~bvurem32(main_~y~0, 2bv32));main_~x~0 := ~bvadd32(2bv32, main_~x~0); {482#false} is VALID [2020-07-28 18:13:22,151 INFO L280 TraceCheckUtils]: 10: Hoare triple {482#false} assume !(0bv32 == ~bvurem32(main_~y~0, 2bv32));main_~x~0 := ~bvsub32(main_~x~0, 4bv32); {482#false} is VALID [2020-07-28 18:13:22,152 INFO L280 TraceCheckUtils]: 11: Hoare triple {482#false} assume !(0bv32 == ~bvurem32(main_~y~0, 2bv32));main_~x~0 := ~bvsub32(main_~x~0, 4bv32); {482#false} is VALID [2020-07-28 18:13:22,152 INFO L280 TraceCheckUtils]: 12: Hoare triple {482#false} assume !~bvult32(main_~x~0, 99bv32); {482#false} is VALID [2020-07-28 18:13:22,152 INFO L280 TraceCheckUtils]: 13: Hoare triple {482#false} __VERIFIER_assert_#in~cond := (if ~bvurem32(main_~x~0, 2bv32) == ~bvurem32(main_~y~0, 2bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {482#false} is VALID [2020-07-28 18:13:22,152 INFO L280 TraceCheckUtils]: 14: Hoare triple {482#false} assume 0bv32 == __VERIFIER_assert_~cond; {482#false} is VALID [2020-07-28 18:13:22,153 INFO L280 TraceCheckUtils]: 15: Hoare triple {482#false} assume !false; {482#false} is VALID [2020-07-28 18:13:22,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:13:22,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 18:13:22,182 INFO L280 TraceCheckUtils]: 15: Hoare triple {482#false} assume !false; {482#false} is VALID [2020-07-28 18:13:22,183 INFO L280 TraceCheckUtils]: 14: Hoare triple {482#false} assume 0bv32 == __VERIFIER_assert_~cond; {482#false} is VALID [2020-07-28 18:13:22,183 INFO L280 TraceCheckUtils]: 13: Hoare triple {482#false} __VERIFIER_assert_#in~cond := (if ~bvurem32(main_~x~0, 2bv32) == ~bvurem32(main_~y~0, 2bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {482#false} is VALID [2020-07-28 18:13:22,184 INFO L280 TraceCheckUtils]: 12: Hoare triple {482#false} assume !~bvult32(main_~x~0, 99bv32); {482#false} is VALID [2020-07-28 18:13:22,184 INFO L280 TraceCheckUtils]: 11: Hoare triple {482#false} assume !(0bv32 == ~bvurem32(main_~y~0, 2bv32));main_~x~0 := ~bvsub32(main_~x~0, 4bv32); {482#false} is VALID [2020-07-28 18:13:22,185 INFO L280 TraceCheckUtils]: 10: Hoare triple {482#false} assume !(0bv32 == ~bvurem32(main_~y~0, 2bv32));main_~x~0 := ~bvsub32(main_~x~0, 4bv32); {482#false} is VALID [2020-07-28 18:13:22,186 INFO L280 TraceCheckUtils]: 9: Hoare triple {492#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} assume !(0bv32 == ~bvurem32(main_~y~0, 2bv32));main_~x~0 := ~bvadd32(2bv32, main_~x~0); {482#false} is VALID [2020-07-28 18:13:22,187 INFO L280 TraceCheckUtils]: 8: Hoare triple {492#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} assume !(0bv32 == ~bvurem32(main_~y~0, 2bv32));main_~x~0 := ~bvadd32(4bv32, main_~x~0); {492#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} is VALID [2020-07-28 18:13:22,188 INFO L280 TraceCheckUtils]: 7: Hoare triple {492#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} assume !(0bv32 == ~bvurem32(main_~y~0, 2bv32));main_~x~0 := ~bvsub32(main_~x~0, 4bv32); {492#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} is VALID [2020-07-28 18:13:22,188 INFO L280 TraceCheckUtils]: 6: Hoare triple {492#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} assume !(0bv32 == ~bvurem32(main_~y~0, 2bv32));main_~x~0 := ~bvadd32(2bv32, main_~x~0); {492#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} is VALID [2020-07-28 18:13:22,189 INFO L280 TraceCheckUtils]: 5: Hoare triple {492#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} assume !(0bv32 == ~bvurem32(main_~y~0, 2bv32));main_~x~0 := ~bvsub32(main_~x~0, 2bv32); {492#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} is VALID [2020-07-28 18:13:22,190 INFO L280 TraceCheckUtils]: 4: Hoare triple {492#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {492#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} is VALID [2020-07-28 18:13:22,190 INFO L280 TraceCheckUtils]: 3: Hoare triple {492#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {492#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} is VALID [2020-07-28 18:13:22,191 INFO L280 TraceCheckUtils]: 2: Hoare triple {481#true} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {492#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} is VALID [2020-07-28 18:13:22,191 INFO L280 TraceCheckUtils]: 1: Hoare triple {481#true} assume !!~bvult32(main_~x~0, 99bv32); {481#true} is VALID [2020-07-28 18:13:22,191 INFO L280 TraceCheckUtils]: 0: Hoare triple {481#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~x~0, main_~y~0;main_~x~0 := 0bv32;main_~y~0 := main_#t~nondet0;havoc main_#t~nondet0; {481#true} is VALID [2020-07-28 18:13:22,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:13:22,192 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [151195704] [2020-07-28 18:13:22,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:13:22,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-07-28 18:13:22,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129467086] [2020-07-28 18:13:22,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-07-28 18:13:22,194 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:13:22,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-28 18:13:22,221 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:13:22,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-28 18:13:22,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 18:13:22,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-28 18:13:22,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 18:13:22,222 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand 3 states. [2020-07-28 18:13:22,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:13:22,387 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2020-07-28 18:13:22,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-28 18:13:22,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-07-28 18:13:22,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:13:22,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 18:13:22,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2020-07-28 18:13:22,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 18:13:22,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2020-07-28 18:13:22,391 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 57 transitions. [2020-07-28 18:13:22,481 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:13:22,483 INFO L225 Difference]: With dead ends: 48 [2020-07-28 18:13:22,484 INFO L226 Difference]: Without dead ends: 33 [2020-07-28 18:13:22,485 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 18:13:22,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-28 18:13:22,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2020-07-28 18:13:22,500 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:13:22,500 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 29 states. [2020-07-28 18:13:22,501 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 29 states. [2020-07-28 18:13:22,501 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 29 states. [2020-07-28 18:13:22,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:13:22,503 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2020-07-28 18:13:22,503 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-07-28 18:13:22,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:13:22,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:13:22,504 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 33 states. [2020-07-28 18:13:22,504 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 33 states. [2020-07-28 18:13:22,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:13:22,506 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2020-07-28 18:13:22,506 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-07-28 18:13:22,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:13:22,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:13:22,507 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:13:22,507 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:13:22,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-28 18:13:22,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2020-07-28 18:13:22,509 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 16 [2020-07-28 18:13:22,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:13:22,510 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2020-07-28 18:13:22,510 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-28 18:13:22,510 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-28 18:13:22,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-28 18:13:22,511 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:13:22,511 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:13:22,722 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-07-28 18:13:22,723 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:13:22,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:13:22,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1974583796, now seen corresponding path program 1 times [2020-07-28 18:13:22,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 18:13:22,725 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1678749341] [2020-07-28 18:13:22,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-07-28 18:13:22,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:13:22,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-28 18:13:22,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:13:22,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:13:22,981 INFO L280 TraceCheckUtils]: 0: Hoare triple {726#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~x~0, main_~y~0;main_~x~0 := 0bv32;main_~y~0 := main_#t~nondet0;havoc main_#t~nondet0; {731#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:13:22,981 INFO L280 TraceCheckUtils]: 1: Hoare triple {731#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} assume !!~bvult32(main_~x~0, 99bv32); {731#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:13:22,982 INFO L280 TraceCheckUtils]: 2: Hoare triple {731#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {738#(= (_ bv2 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:13:22,983 INFO L280 TraceCheckUtils]: 3: Hoare triple {738#(= (_ bv2 32) ULTIMATE.start_main_~x~0)} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {742#(= (bvadd ULTIMATE.start_main_~x~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2020-07-28 18:13:22,984 INFO L280 TraceCheckUtils]: 4: Hoare triple {742#(= (bvadd ULTIMATE.start_main_~x~0 (_ bv4294967292 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {746#(= (_ bv6 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:13:22,985 INFO L280 TraceCheckUtils]: 5: Hoare triple {746#(= (_ bv6 32) ULTIMATE.start_main_~x~0)} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {750#(= (bvadd ULTIMATE.start_main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2020-07-28 18:13:22,986 INFO L280 TraceCheckUtils]: 6: Hoare triple {750#(= (bvadd ULTIMATE.start_main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {754#(= (_ bv10 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:13:22,987 INFO L280 TraceCheckUtils]: 7: Hoare triple {754#(= (_ bv10 32) ULTIMATE.start_main_~x~0)} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {758#(= (_ bv12 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:13:22,988 INFO L280 TraceCheckUtils]: 8: Hoare triple {758#(= (_ bv12 32) ULTIMATE.start_main_~x~0)} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {762#(= (bvadd ULTIMATE.start_main_~x~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2020-07-28 18:13:22,989 INFO L280 TraceCheckUtils]: 9: Hoare triple {762#(= (bvadd ULTIMATE.start_main_~x~0 (_ bv4294967282 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {766#(= (_ bv16 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:13:22,989 INFO L280 TraceCheckUtils]: 10: Hoare triple {766#(= (_ bv16 32) ULTIMATE.start_main_~x~0)} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {770#(= (_ bv18 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:13:22,990 INFO L280 TraceCheckUtils]: 11: Hoare triple {770#(= (_ bv18 32) ULTIMATE.start_main_~x~0)} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {774#(= (bvadd ULTIMATE.start_main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2020-07-28 18:13:22,991 INFO L280 TraceCheckUtils]: 12: Hoare triple {774#(= (bvadd ULTIMATE.start_main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} assume !~bvult32(main_~x~0, 99bv32); {727#false} is VALID [2020-07-28 18:13:22,991 INFO L280 TraceCheckUtils]: 13: Hoare triple {727#false} __VERIFIER_assert_#in~cond := (if ~bvurem32(main_~x~0, 2bv32) == ~bvurem32(main_~y~0, 2bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {727#false} is VALID [2020-07-28 18:13:22,991 INFO L280 TraceCheckUtils]: 14: Hoare triple {727#false} assume 0bv32 == __VERIFIER_assert_~cond; {727#false} is VALID [2020-07-28 18:13:22,991 INFO L280 TraceCheckUtils]: 15: Hoare triple {727#false} assume !false; {727#false} is VALID [2020-07-28 18:13:22,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:13:22,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 18:13:23,567 INFO L280 TraceCheckUtils]: 15: Hoare triple {727#false} assume !false; {727#false} is VALID [2020-07-28 18:13:23,567 INFO L280 TraceCheckUtils]: 14: Hoare triple {727#false} assume 0bv32 == __VERIFIER_assert_~cond; {727#false} is VALID [2020-07-28 18:13:23,567 INFO L280 TraceCheckUtils]: 13: Hoare triple {727#false} __VERIFIER_assert_#in~cond := (if ~bvurem32(main_~x~0, 2bv32) == ~bvurem32(main_~y~0, 2bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {727#false} is VALID [2020-07-28 18:13:23,568 INFO L280 TraceCheckUtils]: 12: Hoare triple {796#(bvult ULTIMATE.start_main_~x~0 (_ bv99 32))} assume !~bvult32(main_~x~0, 99bv32); {727#false} is VALID [2020-07-28 18:13:23,569 INFO L280 TraceCheckUtils]: 11: Hoare triple {800#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {796#(bvult ULTIMATE.start_main_~x~0 (_ bv99 32))} is VALID [2020-07-28 18:13:23,573 INFO L280 TraceCheckUtils]: 10: Hoare triple {804#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv4 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {800#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv99 32))} is VALID [2020-07-28 18:13:23,577 INFO L280 TraceCheckUtils]: 9: Hoare triple {808#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv6 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {804#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv4 32)) (_ bv99 32))} is VALID [2020-07-28 18:13:23,585 INFO L280 TraceCheckUtils]: 8: Hoare triple {812#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv8 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {808#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv6 32)) (_ bv99 32))} is VALID [2020-07-28 18:13:23,591 INFO L280 TraceCheckUtils]: 7: Hoare triple {816#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv10 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {812#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv8 32)) (_ bv99 32))} is VALID [2020-07-28 18:13:23,596 INFO L280 TraceCheckUtils]: 6: Hoare triple {820#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv12 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {816#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv10 32)) (_ bv99 32))} is VALID [2020-07-28 18:13:23,601 INFO L280 TraceCheckUtils]: 5: Hoare triple {824#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv14 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {820#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv12 32)) (_ bv99 32))} is VALID [2020-07-28 18:13:23,607 INFO L280 TraceCheckUtils]: 4: Hoare triple {828#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv16 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {824#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv14 32)) (_ bv99 32))} is VALID [2020-07-28 18:13:23,611 INFO L280 TraceCheckUtils]: 3: Hoare triple {832#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv18 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {828#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv16 32)) (_ bv99 32))} is VALID [2020-07-28 18:13:23,618 INFO L280 TraceCheckUtils]: 2: Hoare triple {836#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv20 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {832#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv18 32)) (_ bv99 32))} is VALID [2020-07-28 18:13:23,618 INFO L280 TraceCheckUtils]: 1: Hoare triple {836#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv20 32)) (_ bv99 32))} assume !!~bvult32(main_~x~0, 99bv32); {836#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv20 32)) (_ bv99 32))} is VALID [2020-07-28 18:13:23,619 INFO L280 TraceCheckUtils]: 0: Hoare triple {726#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~x~0, main_~y~0;main_~x~0 := 0bv32;main_~y~0 := main_#t~nondet0;havoc main_#t~nondet0; {836#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv20 32)) (_ bv99 32))} is VALID [2020-07-28 18:13:23,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:13:23,620 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1678749341] [2020-07-28 18:13:23,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:13:23,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2020-07-28 18:13:23,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122349046] [2020-07-28 18:13:23,621 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 16 [2020-07-28 18:13:23,622 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:13:23,622 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2020-07-28 18:13:23,712 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:13:23,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-07-28 18:13:23,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 18:13:23,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-07-28 18:13:23,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2020-07-28 18:13:23,714 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 24 states. [2020-07-28 18:13:29,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:13:29,146 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2020-07-28 18:13:29,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-07-28 18:13:29,146 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 16 [2020-07-28 18:13:29,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:13:29,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-28 18:13:29,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 63 transitions. [2020-07-28 18:13:29,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-28 18:13:29,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 63 transitions. [2020-07-28 18:13:29,153 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 63 transitions. [2020-07-28 18:13:29,323 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:13:29,326 INFO L225 Difference]: With dead ends: 61 [2020-07-28 18:13:29,326 INFO L226 Difference]: Without dead ends: 57 [2020-07-28 18:13:29,327 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=502, Invalid=904, Unknown=0, NotChecked=0, Total=1406 [2020-07-28 18:13:29,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-07-28 18:13:29,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2020-07-28 18:13:29,347 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:13:29,347 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 50 states. [2020-07-28 18:13:29,347 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 50 states. [2020-07-28 18:13:29,348 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 50 states. [2020-07-28 18:13:29,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:13:29,350 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2020-07-28 18:13:29,350 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2020-07-28 18:13:29,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:13:29,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:13:29,351 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 57 states. [2020-07-28 18:13:29,351 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 57 states. [2020-07-28 18:13:29,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:13:29,353 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2020-07-28 18:13:29,354 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2020-07-28 18:13:29,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:13:29,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:13:29,355 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:13:29,355 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:13:29,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-07-28 18:13:29,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2020-07-28 18:13:29,357 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 16 [2020-07-28 18:13:29,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:13:29,357 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2020-07-28 18:13:29,357 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-07-28 18:13:29,357 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2020-07-28 18:13:29,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-28 18:13:29,358 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:13:29,358 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:13:29,568 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-07-28 18:13:29,569 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:13:29,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:13:29,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1301479604, now seen corresponding path program 1 times [2020-07-28 18:13:29,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 18:13:29,571 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [547089579] [2020-07-28 18:13:29,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-07-28 18:13:29,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:13:29,596 WARN L261 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 15 conjunts are in the unsatisfiable core [2020-07-28 18:13:29,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:13:29,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:13:29,792 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 18:13:29,839 INFO L280 TraceCheckUtils]: 0: Hoare triple {1105#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~x~0, main_~y~0;main_~x~0 := 0bv32;main_~y~0 := main_#t~nondet0;havoc main_#t~nondet0; {1110#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:13:29,840 INFO L280 TraceCheckUtils]: 1: Hoare triple {1110#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} assume !!~bvult32(main_~x~0, 99bv32); {1110#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:13:29,841 INFO L280 TraceCheckUtils]: 2: Hoare triple {1110#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} assume !(0bv32 == ~bvurem32(main_~y~0, 2bv32));main_#t~post1 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post1);havoc main_#t~post1; {1117#(= (_ bv1 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:13:29,843 INFO L280 TraceCheckUtils]: 3: Hoare triple {1117#(= (_ bv1 32) ULTIMATE.start_main_~x~0)} assume !(0bv32 == ~bvurem32(main_~y~0, 2bv32));main_~x~0 := ~bvsub32(main_~x~0, 2bv32); {1121#(= (_ bv4294967295 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:13:29,845 INFO L280 TraceCheckUtils]: 4: Hoare triple {1121#(= (_ bv4294967295 32) ULTIMATE.start_main_~x~0)} assume !(0bv32 == ~bvurem32(main_~y~0, 2bv32));main_~x~0 := ~bvadd32(2bv32, main_~x~0); {1117#(= (_ bv1 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:13:29,846 INFO L280 TraceCheckUtils]: 5: Hoare triple {1117#(= (_ bv1 32) ULTIMATE.start_main_~x~0)} assume !(0bv32 == ~bvurem32(main_~y~0, 2bv32));main_~x~0 := ~bvsub32(main_~x~0, 2bv32); {1121#(= (_ bv4294967295 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:13:29,847 INFO L280 TraceCheckUtils]: 6: Hoare triple {1121#(= (_ bv4294967295 32) ULTIMATE.start_main_~x~0)} assume !(0bv32 == ~bvurem32(main_~y~0, 2bv32));main_~x~0 := ~bvadd32(2bv32, main_~x~0); {1117#(= (_ bv1 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:13:29,855 INFO L280 TraceCheckUtils]: 7: Hoare triple {1117#(= (_ bv1 32) ULTIMATE.start_main_~x~0)} assume !(0bv32 == ~bvurem32(main_~y~0, 2bv32));main_~x~0 := ~bvsub32(main_~x~0, 4bv32); {1134#(= (bvadd ULTIMATE.start_main_~x~0 (_ bv3 32)) (_ bv0 32))} is VALID [2020-07-28 18:13:29,856 INFO L280 TraceCheckUtils]: 8: Hoare triple {1134#(= (bvadd ULTIMATE.start_main_~x~0 (_ bv3 32)) (_ bv0 32))} assume !(0bv32 == ~bvurem32(main_~y~0, 2bv32));main_~x~0 := ~bvadd32(4bv32, main_~x~0); {1117#(= (_ bv1 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:13:29,857 INFO L280 TraceCheckUtils]: 9: Hoare triple {1117#(= (_ bv1 32) ULTIMATE.start_main_~x~0)} assume !(0bv32 == ~bvurem32(main_~y~0, 2bv32));main_~x~0 := ~bvadd32(2bv32, main_~x~0); {1141#(and (= (_ bv3 32) ULTIMATE.start_main_~x~0) (not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))))} is VALID [2020-07-28 18:13:29,859 INFO L280 TraceCheckUtils]: 10: Hoare triple {1141#(and (= (_ bv3 32) ULTIMATE.start_main_~x~0) (not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))))} assume !(0bv32 == ~bvurem32(main_~y~0, 2bv32));main_~x~0 := ~bvsub32(main_~x~0, 4bv32); {1145#(and (= (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv0 32)) (not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))))} is VALID [2020-07-28 18:13:29,860 INFO L280 TraceCheckUtils]: 11: Hoare triple {1145#(and (= (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv0 32)) (not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))))} assume !(0bv32 == ~bvurem32(main_~y~0, 2bv32));main_~x~0 := ~bvsub32(main_~x~0, 4bv32); {1149#(and (not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))) (= (bvadd ULTIMATE.start_main_~x~0 (_ bv5 32)) (_ bv0 32)))} is VALID [2020-07-28 18:13:29,861 INFO L280 TraceCheckUtils]: 12: Hoare triple {1149#(and (not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))) (= (bvadd ULTIMATE.start_main_~x~0 (_ bv5 32)) (_ bv0 32)))} assume !~bvult32(main_~x~0, 99bv32); {1149#(and (not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))) (= (bvadd ULTIMATE.start_main_~x~0 (_ bv5 32)) (_ bv0 32)))} is VALID [2020-07-28 18:13:29,862 INFO L280 TraceCheckUtils]: 13: Hoare triple {1149#(and (not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))) (= (bvadd ULTIMATE.start_main_~x~0 (_ bv5 32)) (_ bv0 32)))} __VERIFIER_assert_#in~cond := (if ~bvurem32(main_~x~0, 2bv32) == ~bvurem32(main_~y~0, 2bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1156#(= (bvadd ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2020-07-28 18:13:29,863 INFO L280 TraceCheckUtils]: 14: Hoare triple {1156#(= (bvadd ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == __VERIFIER_assert_~cond; {1106#false} is VALID [2020-07-28 18:13:29,863 INFO L280 TraceCheckUtils]: 15: Hoare triple {1106#false} assume !false; {1106#false} is VALID [2020-07-28 18:13:29,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:13:29,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 18:13:30,375 INFO L280 TraceCheckUtils]: 15: Hoare triple {1106#false} assume !false; {1106#false} is VALID [2020-07-28 18:13:30,376 INFO L280 TraceCheckUtils]: 14: Hoare triple {1166#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} assume 0bv32 == __VERIFIER_assert_~cond; {1106#false} is VALID [2020-07-28 18:13:30,377 INFO L280 TraceCheckUtils]: 13: Hoare triple {1170#(= (bvurem ULTIMATE.start_main_~x~0 (_ bv2 32)) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} __VERIFIER_assert_#in~cond := (if ~bvurem32(main_~x~0, 2bv32) == ~bvurem32(main_~y~0, 2bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1166#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} is VALID [2020-07-28 18:13:30,378 INFO L280 TraceCheckUtils]: 12: Hoare triple {1170#(= (bvurem ULTIMATE.start_main_~x~0 (_ bv2 32)) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} assume !~bvult32(main_~x~0, 99bv32); {1170#(= (bvurem ULTIMATE.start_main_~x~0 (_ bv2 32)) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} is VALID [2020-07-28 18:13:30,380 INFO L280 TraceCheckUtils]: 11: Hoare triple {1170#(= (bvurem ULTIMATE.start_main_~x~0 (_ bv2 32)) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} assume !(0bv32 == ~bvurem32(main_~y~0, 2bv32));main_~x~0 := ~bvsub32(main_~x~0, 4bv32); {1170#(= (bvurem ULTIMATE.start_main_~x~0 (_ bv2 32)) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} is VALID [2020-07-28 18:13:30,383 INFO L280 TraceCheckUtils]: 10: Hoare triple {1170#(= (bvurem ULTIMATE.start_main_~x~0 (_ bv2 32)) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} assume !(0bv32 == ~bvurem32(main_~y~0, 2bv32));main_~x~0 := ~bvsub32(main_~x~0, 4bv32); {1170#(= (bvurem ULTIMATE.start_main_~x~0 (_ bv2 32)) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} is VALID [2020-07-28 18:13:30,386 INFO L280 TraceCheckUtils]: 9: Hoare triple {1183#(forall ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32))) (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))))} assume !(0bv32 == ~bvurem32(main_~y~0, 2bv32));main_~x~0 := ~bvadd32(2bv32, main_~x~0); {1170#(= (bvurem ULTIMATE.start_main_~x~0 (_ bv2 32)) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} is VALID [2020-07-28 18:13:30,390 INFO L280 TraceCheckUtils]: 8: Hoare triple {1183#(forall ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32))) (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))))} assume !(0bv32 == ~bvurem32(main_~y~0, 2bv32));main_~x~0 := ~bvadd32(4bv32, main_~x~0); {1183#(forall ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32))) (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))))} is VALID [2020-07-28 18:13:30,392 INFO L280 TraceCheckUtils]: 7: Hoare triple {1183#(forall ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32))) (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))))} assume !(0bv32 == ~bvurem32(main_~y~0, 2bv32));main_~x~0 := ~bvsub32(main_~x~0, 4bv32); {1183#(forall ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32))) (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))))} is VALID [2020-07-28 18:13:30,395 INFO L280 TraceCheckUtils]: 6: Hoare triple {1183#(forall ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32))) (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))))} assume !(0bv32 == ~bvurem32(main_~y~0, 2bv32));main_~x~0 := ~bvadd32(2bv32, main_~x~0); {1183#(forall ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32))) (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))))} is VALID [2020-07-28 18:13:30,397 INFO L280 TraceCheckUtils]: 5: Hoare triple {1183#(forall ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32))) (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))))} assume !(0bv32 == ~bvurem32(main_~y~0, 2bv32));main_~x~0 := ~bvsub32(main_~x~0, 2bv32); {1183#(forall ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32))) (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))))} is VALID [2020-07-28 18:13:30,399 INFO L280 TraceCheckUtils]: 4: Hoare triple {1183#(forall ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32))) (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))))} assume !(0bv32 == ~bvurem32(main_~y~0, 2bv32));main_~x~0 := ~bvadd32(2bv32, main_~x~0); {1183#(forall ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32))) (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))))} is VALID [2020-07-28 18:13:30,401 INFO L280 TraceCheckUtils]: 3: Hoare triple {1183#(forall ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32))) (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))))} assume !(0bv32 == ~bvurem32(main_~y~0, 2bv32));main_~x~0 := ~bvsub32(main_~x~0, 2bv32); {1183#(forall ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32))) (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))))} is VALID [2020-07-28 18:13:30,404 INFO L280 TraceCheckUtils]: 2: Hoare triple {1205#(forall ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (or (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32))) (= (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv3 32)) (_ bv2 32)) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))))} assume !(0bv32 == ~bvurem32(main_~y~0, 2bv32));main_#t~post1 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post1);havoc main_#t~post1; {1183#(forall ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32))) (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))))} is VALID [2020-07-28 18:13:30,404 INFO L280 TraceCheckUtils]: 1: Hoare triple {1205#(forall ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (or (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32))) (= (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv3 32)) (_ bv2 32)) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))))} assume !!~bvult32(main_~x~0, 99bv32); {1205#(forall ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (or (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32))) (= (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv3 32)) (_ bv2 32)) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))))} is VALID [2020-07-28 18:13:30,406 INFO L280 TraceCheckUtils]: 0: Hoare triple {1105#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~x~0, main_~y~0;main_~x~0 := 0bv32;main_~y~0 := main_#t~nondet0;havoc main_#t~nondet0; {1205#(forall ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (or (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32))) (= (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv3 32)) (_ bv2 32)) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))))} is VALID [2020-07-28 18:13:30,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:13:30,408 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [547089579] [2020-07-28 18:13:30,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:13:30,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 13 [2020-07-28 18:13:30,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940544185] [2020-07-28 18:13:30,409 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 16 [2020-07-28 18:13:30,409 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:13:30,409 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-28 18:13:30,474 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:13:30,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-28 18:13:30,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 18:13:30,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-28 18:13:30,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2020-07-28 18:13:30,475 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 14 states. [2020-07-28 18:13:31,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:13:31,665 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2020-07-28 18:13:31,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-28 18:13:31,665 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 16 [2020-07-28 18:13:31,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:13:31,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-28 18:13:31,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 46 transitions. [2020-07-28 18:13:31,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-28 18:13:31,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 46 transitions. [2020-07-28 18:13:31,668 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 46 transitions. [2020-07-28 18:13:31,752 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:13:31,752 INFO L225 Difference]: With dead ends: 64 [2020-07-28 18:13:31,752 INFO L226 Difference]: Without dead ends: 0 [2020-07-28 18:13:31,754 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 8 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2020-07-28 18:13:31,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-28 18:13:31,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-28 18:13:31,754 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:13:31,754 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-28 18:13:31,754 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 18:13:31,754 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 18:13:31,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:13:31,755 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 18:13:31,755 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:13:31,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:13:31,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:13:31,755 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 18:13:31,755 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 18:13:31,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:13:31,756 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 18:13:31,756 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:13:31,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:13:31,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:13:31,756 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:13:31,757 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:13:31,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-28 18:13:31,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-28 18:13:31,757 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2020-07-28 18:13:31,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:13:31,758 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-28 18:13:31,758 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-28 18:13:31,758 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:13:31,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:13:31,958 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-07-28 18:13:31,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-28 18:13:32,086 INFO L268 CegarLoopResult]: For program point L31-1(lines 15 45) no Hoare annotation was computed. [2020-07-28 18:13:32,086 INFO L268 CegarLoopResult]: For program point L19-1(lines 15 45) no Hoare annotation was computed. [2020-07-28 18:13:32,087 INFO L268 CegarLoopResult]: For program point L15-2(lines 15 45) no Hoare annotation was computed. [2020-07-28 18:13:32,087 INFO L268 CegarLoopResult]: For program point L40-1(lines 15 45) no Hoare annotation was computed. [2020-07-28 18:13:32,087 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-28 18:13:32,087 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-28 18:13:32,087 INFO L268 CegarLoopResult]: For program point L28-1(lines 15 45) no Hoare annotation was computed. [2020-07-28 18:13:32,087 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2020-07-28 18:13:32,087 INFO L268 CegarLoopResult]: For program point L16(lines 16 17) no Hoare annotation was computed. [2020-07-28 18:13:32,087 INFO L268 CegarLoopResult]: For program point L16-2(lines 15 45) no Hoare annotation was computed. [2020-07-28 18:13:32,087 INFO L268 CegarLoopResult]: For program point L37-1(lines 15 45) no Hoare annotation was computed. [2020-07-28 18:13:32,087 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-28 18:13:32,088 INFO L268 CegarLoopResult]: For program point L25-1(lines 15 45) no Hoare annotation was computed. [2020-07-28 18:13:32,088 INFO L268 CegarLoopResult]: For program point L5(lines 5 7) no Hoare annotation was computed. [2020-07-28 18:13:32,088 INFO L271 CegarLoopResult]: At program point L5-2(lines 1 48) the Hoare annotation is: true [2020-07-28 18:13:32,088 INFO L268 CegarLoopResult]: For program point L34-1(lines 15 45) no Hoare annotation was computed. [2020-07-28 18:13:32,088 INFO L268 CegarLoopResult]: For program point L22-1(lines 15 45) no Hoare annotation was computed. [2020-07-28 18:13:32,089 INFO L264 CegarLoopResult]: At program point L43-1(lines 15 45) the Hoare annotation is: (let ((.cse1 (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32))))) (or (and (forall ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (let ((.cse0 (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))) (or (= (_ bv0 32) .cse0) (= (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv3 32)) (_ bv2 32)) .cse0)))) .cse1) (and (not .cse1) (= (bvadd ULTIMATE.start_main_~x~0 (_ bv5 32)) (_ bv0 32))) (= (_ bv0 32) ULTIMATE.start_main_~x~0))) [2020-07-28 18:13:32,089 INFO L268 CegarLoopResult]: For program point L6(line 6) no Hoare annotation was computed. [2020-07-28 18:13:32,093 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 18:13:32,093 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2020-07-28 18:13:32,094 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2020-07-28 18:13:32,094 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-28 18:13:32,094 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2020-07-28 18:13:32,094 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-28 18:13:32,094 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-28 18:13:32,094 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-28 18:13:32,094 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-28 18:13:32,094 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2020-07-28 18:13:32,094 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2020-07-28 18:13:32,095 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2020-07-28 18:13:32,095 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2020-07-28 18:13:32,095 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 18:13:32,095 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2020-07-28 18:13:32,095 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2020-07-28 18:13:32,095 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 18:13:32,095 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2020-07-28 18:13:32,095 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2020-07-28 18:13:32,095 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2020-07-28 18:13:32,095 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2020-07-28 18:13:32,095 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2020-07-28 18:13:32,096 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2020-07-28 18:13:32,096 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2020-07-28 18:13:32,096 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2020-07-28 18:13:32,096 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2020-07-28 18:13:32,096 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2020-07-28 18:13:32,096 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2020-07-28 18:13:32,096 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2020-07-28 18:13:32,096 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2020-07-28 18:13:32,096 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2020-07-28 18:13:32,096 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-28 18:13:32,100 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~y~0,QUANTIFIED] [2020-07-28 18:13:32,101 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~y~0,QUANTIFIED] [2020-07-28 18:13:32,104 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~y~0,QUANTIFIED] [2020-07-28 18:13:32,104 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~y~0,QUANTIFIED] [2020-07-28 18:13:32,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 06:13:32 BoogieIcfgContainer [2020-07-28 18:13:32,107 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 18:13:32,107 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 18:13:32,107 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 18:13:32,108 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 18:13:32,109 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:13:19" (3/4) ... [2020-07-28 18:13:32,111 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-07-28 18:13:32,120 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-07-28 18:13:32,120 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-07-28 18:13:32,177 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 18:13:32,177 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 18:13:32,179 INFO L168 Benchmark]: Toolchain (without parser) took 13182.66 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 259.5 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -138.0 MB). Peak memory consumption was 121.6 MB. Max. memory is 11.5 GB. [2020-07-28 18:13:32,180 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 18:13:32,181 INFO L168 Benchmark]: CACSL2BoogieTranslator took 272.77 ms. Allocated memory is still 1.0 GB. Free memory was 954.9 MB in the beginning and 942.8 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2020-07-28 18:13:32,181 INFO L168 Benchmark]: Boogie Procedure Inliner took 96.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 942.8 MB in the beginning and 1.1 GB in the end (delta: -202.3 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-28 18:13:32,182 INFO L168 Benchmark]: Boogie Preprocessor took 27.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2020-07-28 18:13:32,182 INFO L168 Benchmark]: RCFGBuilder took 368.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. [2020-07-28 18:13:32,183 INFO L168 Benchmark]: TraceAbstraction took 12341.53 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 111.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.8 MB). Peak memory consumption was 123.0 MB. Max. memory is 11.5 GB. [2020-07-28 18:13:32,184 INFO L168 Benchmark]: Witness Printer took 69.51 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. [2020-07-28 18:13:32,187 INFO L336 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.29 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 272.77 ms. Allocated memory is still 1.0 GB. Free memory was 954.9 MB in the beginning and 942.8 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 96.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 942.8 MB in the beginning and 1.1 GB in the end (delta: -202.3 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 368.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12341.53 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 111.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.8 MB). Peak memory consumption was 123.0 MB. Max. memory is 11.5 GB. * Witness Printer took 69.51 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~y~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~y~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~y~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~y~0,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 15]: Loop Invariant [2020-07-28 18:13:32,195 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~y~0,QUANTIFIED] [2020-07-28 18:13:32,195 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~y~0,QUANTIFIED] [2020-07-28 18:13:32,196 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~y~0,QUANTIFIED] [2020-07-28 18:13:32,196 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~y~0,QUANTIFIED] Derived loop invariant: (((forall ULTIMATE.start_main_~y~0 : bv32 :: 0bv32 == ~bvurem32(ULTIMATE.start_main_~y~0, 2bv32) || ~bvurem32(~bvadd64(x, 3bv32), 2bv32) == ~bvurem32(ULTIMATE.start_main_~y~0, 2bv32)) && 0bv32 == ~bvurem32(y, 2bv32)) || (!(0bv32 == ~bvurem32(y, 2bv32)) && ~bvadd64(x, 5bv32) == 0bv32)) || 0bv32 == x - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 12.0s, OverallIterations: 6, TraceHistogramMax: 1, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 91 SDtfs, 81 SDslu, 36 SDs, 0 SdLazy, 703 SolverSat, 349 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 155 GetRequests, 90 SyntacticMatches, 8 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 17 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 8 NumberOfFragments, 39 HoareAnnotationTreeSize, 2 FomulaSimplifications, 71 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 17 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 74 NumberOfCodeBlocks, 74 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 136 ConstructedInterpolants, 9 QuantifiedInterpolants, 7910 SizeOfPredicates, 7 NumberOfNonLiveVariables, 138 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 4/8 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 RESULT: Ultimate proved your program to be correct! Received shutdown request...