./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-lit/ddlm2013.i --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-lit/ddlm2013.i -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 9b212aa0e4727252446cfa5c93d0e28de33539c6 ...................................................................................................................................................................................................................................................................................................................... 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-lit/ddlm2013.i -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 9b212aa0e4727252446cfa5c93d0e28de33539c6 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:16:45,997 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 18:16:45,999 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 18:16:46,013 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 18:16:46,013 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 18:16:46,015 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 18:16:46,016 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 18:16:46,018 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 18:16:46,024 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 18:16:46,025 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 18:16:46,026 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 18:16:46,027 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 18:16:46,028 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 18:16:46,033 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 18:16:46,034 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 18:16:46,036 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 18:16:46,037 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 18:16:46,038 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 18:16:46,039 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 18:16:46,042 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 18:16:46,043 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 18:16:46,045 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 18:16:46,046 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 18:16:46,047 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 18:16:46,050 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 18:16:46,050 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 18:16:46,050 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 18:16:46,051 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 18:16:46,052 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 18:16:46,053 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 18:16:46,053 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 18:16:46,055 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 18:16:46,055 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 18:16:46,056 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 18:16:46,058 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 18:16:46,058 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 18:16:46,059 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 18:16:46,059 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 18:16:46,059 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 18:16:46,060 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 18:16:46,061 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 18:16:46,062 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:16:46,077 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 18:16:46,077 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 18:16:46,079 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 18:16:46,079 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 18:16:46,079 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 18:16:46,079 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 18:16:46,080 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 18:16:46,080 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 18:16:46,080 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 18:16:46,081 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 18:16:46,081 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 18:16:46,081 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 18:16:46,081 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 18:16:46,082 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 18:16:46,082 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 18:16:46,082 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 18:16:46,082 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 18:16:46,083 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 18:16:46,083 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 18:16:46,083 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 18:16:46,084 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 18:16:46,084 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 18:16:46,084 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 18:16:46,084 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 18:16:46,085 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 18:16:46,085 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 18:16:46,085 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 18:16:46,086 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 18:16:46,086 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 18:16:46,086 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 -> 9b212aa0e4727252446cfa5c93d0e28de33539c6 [2020-07-28 18:16:46,391 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 18:16:46,403 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 18:16:46,407 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 18:16:46,408 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 18:16:46,409 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 18:16:46,410 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/ddlm2013.i [2020-07-28 18:16:46,470 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e8dff3ec/eba33fb54f7f48d2bd611662037448cd/FLAG263032ead [2020-07-28 18:16:46,873 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 18:16:46,874 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/ddlm2013.i [2020-07-28 18:16:46,881 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e8dff3ec/eba33fb54f7f48d2bd611662037448cd/FLAG263032ead [2020-07-28 18:16:47,296 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e8dff3ec/eba33fb54f7f48d2bd611662037448cd [2020-07-28 18:16:47,300 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 18:16:47,304 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 18:16:47,305 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 18:16:47,305 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 18:16:47,309 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 18:16:47,311 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:16:47" (1/1) ... [2020-07-28 18:16:47,314 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68ecf4e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:16:47, skipping insertion in model container [2020-07-28 18:16:47,314 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:16:47" (1/1) ... [2020-07-28 18:16:47,322 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 18:16:47,344 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 18:16:47,529 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:16:47,536 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 18:16:47,561 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:16:47,577 INFO L208 MainTranslator]: Completed translation [2020-07-28 18:16:47,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:16:47 WrapperNode [2020-07-28 18:16:47,579 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 18:16:47,580 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 18:16:47,581 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 18:16:47,581 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 18:16:47,591 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:16:47" (1/1) ... [2020-07-28 18:16:47,598 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:16:47" (1/1) ... [2020-07-28 18:16:47,692 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 18:16:47,693 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 18:16:47,693 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 18:16:47,696 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 18:16:47,706 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:16:47" (1/1) ... [2020-07-28 18:16:47,706 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:16:47" (1/1) ... [2020-07-28 18:16:47,708 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:16:47" (1/1) ... [2020-07-28 18:16:47,708 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:16:47" (1/1) ... [2020-07-28 18:16:47,719 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:16:47" (1/1) ... [2020-07-28 18:16:47,728 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:16:47" (1/1) ... [2020-07-28 18:16:47,729 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:16:47" (1/1) ... [2020-07-28 18:16:47,736 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 18:16:47,737 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 18:16:47,737 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 18:16:47,737 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 18:16:47,738 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:16:47" (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:16:47,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 18:16:47,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 18:16:48,076 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 18:16:48,079 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-28 18:16:48,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:16:48 BoogieIcfgContainer [2020-07-28 18:16:48,086 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 18:16:48,091 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 18:16:48,091 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 18:16:48,100 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 18:16:48,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 06:16:47" (1/3) ... [2020-07-28 18:16:48,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bcc4f97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:16:48, skipping insertion in model container [2020-07-28 18:16:48,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:16:47" (2/3) ... [2020-07-28 18:16:48,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bcc4f97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:16:48, skipping insertion in model container [2020-07-28 18:16:48,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:16:48" (3/3) ... [2020-07-28 18:16:48,110 INFO L109 eAbstractionObserver]: Analyzing ICFG ddlm2013.i [2020-07-28 18:16:48,134 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 18:16:48,149 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 18:16:48,175 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 18:16:48,196 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 18:16:48,196 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 18:16:48,196 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 18:16:48,196 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 18:16:48,197 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 18:16:48,197 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 18:16:48,197 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 18:16:48,197 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 18:16:48,210 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2020-07-28 18:16:48,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-28 18:16:48,217 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:16:48,218 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-28 18:16:48,218 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:16:48,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:16:48,225 INFO L82 PathProgramCache]: Analyzing trace with hash 920569802, now seen corresponding path program 1 times [2020-07-28 18:16:48,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:16:48,234 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562369153] [2020-07-28 18:16:48,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:16:48,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:16:48,361 INFO L280 TraceCheckUtils]: 0: Hoare triple {16#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post2, main_#t~post3, main_#t~nondet1, main_~i~0, main_~j~0, main_~a~0, main_~b~0, main_~flag~0;havoc main_~i~0;havoc main_~j~0;havoc main_~a~0;havoc main_~b~0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~flag~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 0;main_~b~0 := 0;main_~j~0 := 1; {16#true} is VALID [2020-07-28 18:16:48,361 INFO L280 TraceCheckUtils]: 1: Hoare triple {16#true} assume 0 != main_~flag~0;main_~i~0 := 0; {16#true} is VALID [2020-07-28 18:16:48,363 INFO L280 TraceCheckUtils]: 2: Hoare triple {16#true} assume !true; {17#false} is VALID [2020-07-28 18:16:48,364 INFO L280 TraceCheckUtils]: 3: Hoare triple {17#false} assume 0 != main_~flag~0;__VERIFIER_assert_#in~cond := (if main_~a~0 % 4294967296 == main_~b~0 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {17#false} is VALID [2020-07-28 18:16:48,364 INFO L280 TraceCheckUtils]: 4: Hoare triple {17#false} assume 0 == __VERIFIER_assert_~cond; {17#false} is VALID [2020-07-28 18:16:48,364 INFO L280 TraceCheckUtils]: 5: Hoare triple {17#false} assume !false; {17#false} is VALID [2020-07-28 18:16:48,367 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:16:48,368 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562369153] [2020-07-28 18:16:48,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:16:48,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 18:16:48,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059457771] [2020-07-28 18:16:48,377 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2020-07-28 18:16:48,379 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:16:48,382 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 18:16:48,406 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:16:48,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 18:16:48,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:16:48,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 18:16:48,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 18:16:48,417 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2020-07-28 18:16:48,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:16:48,466 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2020-07-28 18:16:48,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 18:16:48,467 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2020-07-28 18:16:48,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:16:48,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 18:16:48,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 27 transitions. [2020-07-28 18:16:48,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 18:16:48,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 27 transitions. [2020-07-28 18:16:48,477 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 27 transitions. [2020-07-28 18:16:48,535 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:16:48,546 INFO L225 Difference]: With dead ends: 21 [2020-07-28 18:16:48,547 INFO L226 Difference]: Without dead ends: 9 [2020-07-28 18:16:48,550 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:16:48,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2020-07-28 18:16:48,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-07-28 18:16:48,578 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:16:48,578 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states. Second operand 9 states. [2020-07-28 18:16:48,579 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states. [2020-07-28 18:16:48,579 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states. [2020-07-28 18:16:48,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:16:48,581 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2020-07-28 18:16:48,582 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2020-07-28 18:16:48,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:16:48,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:16:48,582 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states. [2020-07-28 18:16:48,583 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states. [2020-07-28 18:16:48,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:16:48,584 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2020-07-28 18:16:48,584 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2020-07-28 18:16:48,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:16:48,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:16:48,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:16:48,586 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:16:48,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-28 18:16:48,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2020-07-28 18:16:48,589 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 6 [2020-07-28 18:16:48,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:16:48,589 INFO L479 AbstractCegarLoop]: Abstraction has 9 states and 11 transitions. [2020-07-28 18:16:48,589 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 18:16:48,589 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2020-07-28 18:16:48,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-28 18:16:48,590 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:16:48,590 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:16:48,590 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 18:16:48,591 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:16:48,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:16:48,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1539532969, now seen corresponding path program 1 times [2020-07-28 18:16:48,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:16:48,592 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045546461] [2020-07-28 18:16:48,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:16:48,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:16:48,644 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 18:16:48,645 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:16:48,651 INFO L168 Benchmark]: Toolchain (without parser) took 1348.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 961.6 MB in the beginning and 1.1 GB in the end (delta: -101.2 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2020-07-28 18:16:48,652 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 18:16:48,652 INFO L168 Benchmark]: CACSL2BoogieTranslator took 274.14 ms. Allocated memory is still 1.0 GB. Free memory was 961.6 MB in the beginning and 949.5 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:16:48,655 INFO L168 Benchmark]: Boogie Procedure Inliner took 111.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -161.4 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2020-07-28 18:16:48,656 INFO L168 Benchmark]: Boogie Preprocessor took 43.96 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:16:48,657 INFO L168 Benchmark]: RCFGBuilder took 349.13 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: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2020-07-28 18:16:48,661 INFO L168 Benchmark]: TraceAbstraction took 556.89 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: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. [2020-07-28 18:16:48,667 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.34 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 274.14 ms. Allocated memory is still 1.0 GB. Free memory was 961.6 MB in the beginning and 949.5 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 111.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -161.4 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.96 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 349.13 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: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 556.89 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: 27.3 MB). Peak memory consumption was 27.3 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:16:50,636 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 18:16:50,639 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 18:16:50,652 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 18:16:50,652 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 18:16:50,654 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 18:16:50,655 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 18:16:50,657 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 18:16:50,659 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 18:16:50,660 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 18:16:50,661 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 18:16:50,663 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 18:16:50,663 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 18:16:50,664 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 18:16:50,665 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 18:16:50,667 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 18:16:50,668 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 18:16:50,669 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 18:16:50,671 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 18:16:50,673 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 18:16:50,674 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 18:16:50,676 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 18:16:50,677 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 18:16:50,678 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 18:16:50,681 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 18:16:50,681 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 18:16:50,682 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 18:16:50,683 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 18:16:50,683 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 18:16:50,684 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 18:16:50,685 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 18:16:50,686 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 18:16:50,686 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 18:16:50,687 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 18:16:50,689 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 18:16:50,689 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 18:16:50,690 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 18:16:50,690 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 18:16:50,691 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 18:16:50,692 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 18:16:50,693 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 18:16:50,696 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:16:50,711 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 18:16:50,712 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 18:16:50,713 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 18:16:50,713 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 18:16:50,714 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 18:16:50,714 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 18:16:50,714 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 18:16:50,714 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 18:16:50,715 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 18:16:50,715 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 18:16:50,715 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 18:16:50,715 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 18:16:50,716 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-07-28 18:16:50,716 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-07-28 18:16:50,716 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 18:16:50,717 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 18:16:50,717 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 18:16:50,717 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 18:16:50,718 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 18:16:50,718 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 18:16:50,718 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 18:16:50,718 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 18:16:50,719 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 18:16:50,719 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 18:16:50,719 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 18:16:50,719 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 18:16:50,720 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-07-28 18:16:50,720 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-07-28 18:16:50,720 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 18:16:50,721 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 18:16:50,721 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-28 18:16:50,721 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 -> 9b212aa0e4727252446cfa5c93d0e28de33539c6 [2020-07-28 18:16:51,025 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 18:16:51,042 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 18:16:51,048 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 18:16:51,049 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 18:16:51,050 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 18:16:51,053 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/ddlm2013.i [2020-07-28 18:16:51,123 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02434261c/124e97fd98444c6990e5835d9bd5c215/FLAG23470cbe0 [2020-07-28 18:16:51,615 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 18:16:51,616 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/ddlm2013.i [2020-07-28 18:16:51,623 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02434261c/124e97fd98444c6990e5835d9bd5c215/FLAG23470cbe0 [2020-07-28 18:16:51,996 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02434261c/124e97fd98444c6990e5835d9bd5c215 [2020-07-28 18:16:52,000 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 18:16:52,004 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 18:16:52,005 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 18:16:52,006 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 18:16:52,009 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 18:16:52,011 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:16:51" (1/1) ... [2020-07-28 18:16:52,014 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ae8b490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:16:52, skipping insertion in model container [2020-07-28 18:16:52,015 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:16:51" (1/1) ... [2020-07-28 18:16:52,023 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 18:16:52,044 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 18:16:52,270 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:16:52,276 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 18:16:52,293 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:16:52,308 INFO L208 MainTranslator]: Completed translation [2020-07-28 18:16:52,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:16:52 WrapperNode [2020-07-28 18:16:52,309 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 18:16:52,310 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 18:16:52,310 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 18:16:52,310 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 18:16:52,320 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:16:52" (1/1) ... [2020-07-28 18:16:52,327 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:16:52" (1/1) ... [2020-07-28 18:16:52,419 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 18:16:52,420 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 18:16:52,420 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 18:16:52,420 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 18:16:52,427 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:16:52" (1/1) ... [2020-07-28 18:16:52,427 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:16:52" (1/1) ... [2020-07-28 18:16:52,429 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:16:52" (1/1) ... [2020-07-28 18:16:52,429 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:16:52" (1/1) ... [2020-07-28 18:16:52,434 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:16:52" (1/1) ... [2020-07-28 18:16:52,438 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:16:52" (1/1) ... [2020-07-28 18:16:52,439 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:16:52" (1/1) ... [2020-07-28 18:16:52,441 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 18:16:52,442 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 18:16:52,442 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 18:16:52,442 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 18:16:52,443 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:16:52" (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:16:52,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 18:16:52,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 18:16:52,842 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 18:16:52,842 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-28 18:16:52,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:16:52 BoogieIcfgContainer [2020-07-28 18:16:52,845 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 18:16:52,846 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 18:16:52,847 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 18:16:52,849 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 18:16:52,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 06:16:51" (1/3) ... [2020-07-28 18:16:52,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@183c5358 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:16:52, skipping insertion in model container [2020-07-28 18:16:52,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:16:52" (2/3) ... [2020-07-28 18:16:52,851 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@183c5358 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:16:52, skipping insertion in model container [2020-07-28 18:16:52,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:16:52" (3/3) ... [2020-07-28 18:16:52,853 INFO L109 eAbstractionObserver]: Analyzing ICFG ddlm2013.i [2020-07-28 18:16:52,862 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 18:16:52,868 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 18:16:52,882 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 18:16:52,905 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 18:16:52,905 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 18:16:52,905 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 18:16:52,905 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 18:16:52,906 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 18:16:52,906 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 18:16:52,906 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 18:16:52,906 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 18:16:52,920 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2020-07-28 18:16:52,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-28 18:16:52,925 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:16:52,926 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-28 18:16:52,926 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:16:52,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:16:52,933 INFO L82 PathProgramCache]: Analyzing trace with hash 920539018, now seen corresponding path program 1 times [2020-07-28 18:16:52,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 18:16:52,944 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [605192918] [2020-07-28 18:16:52,945 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:16:52,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:16:52,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-28 18:16:53,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:16:53,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:16:53,040 INFO L280 TraceCheckUtils]: 0: Hoare triple {15#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post2, main_#t~post3, main_#t~nondet1, main_~i~0, main_~j~0, main_~a~0, main_~b~0, main_~flag~0;havoc main_~i~0;havoc main_~j~0;havoc main_~a~0;havoc main_~b~0;main_~flag~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 0bv32;main_~b~0 := 0bv32;main_~j~0 := 1bv32; {15#true} is VALID [2020-07-28 18:16:53,041 INFO L280 TraceCheckUtils]: 1: Hoare triple {15#true} assume 0bv32 != main_~flag~0;main_~i~0 := 0bv32; {15#true} is VALID [2020-07-28 18:16:53,042 INFO L280 TraceCheckUtils]: 2: Hoare triple {15#true} assume !true; {16#false} is VALID [2020-07-28 18:16:53,042 INFO L280 TraceCheckUtils]: 3: Hoare triple {16#false} assume 0bv32 != main_~flag~0;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~b~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {16#false} is VALID [2020-07-28 18:16:53,043 INFO L280 TraceCheckUtils]: 4: Hoare triple {16#false} assume 0bv32 == __VERIFIER_assert_~cond; {16#false} is VALID [2020-07-28 18:16:53,043 INFO L280 TraceCheckUtils]: 5: Hoare triple {16#false} assume !false; {16#false} is VALID [2020-07-28 18:16:53,046 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:16:53,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 18:16:53,060 INFO L280 TraceCheckUtils]: 5: Hoare triple {16#false} assume !false; {16#false} is VALID [2020-07-28 18:16:53,061 INFO L280 TraceCheckUtils]: 4: Hoare triple {16#false} assume 0bv32 == __VERIFIER_assert_~cond; {16#false} is VALID [2020-07-28 18:16:53,061 INFO L280 TraceCheckUtils]: 3: Hoare triple {16#false} assume 0bv32 != main_~flag~0;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~b~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {16#false} is VALID [2020-07-28 18:16:53,063 INFO L280 TraceCheckUtils]: 2: Hoare triple {15#true} assume !true; {16#false} is VALID [2020-07-28 18:16:53,063 INFO L280 TraceCheckUtils]: 1: Hoare triple {15#true} assume 0bv32 != main_~flag~0;main_~i~0 := 0bv32; {15#true} is VALID [2020-07-28 18:16:53,063 INFO L280 TraceCheckUtils]: 0: Hoare triple {15#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post2, main_#t~post3, main_#t~nondet1, main_~i~0, main_~j~0, main_~a~0, main_~b~0, main_~flag~0;havoc main_~i~0;havoc main_~j~0;havoc main_~a~0;havoc main_~b~0;main_~flag~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 0bv32;main_~b~0 := 0bv32;main_~j~0 := 1bv32; {15#true} is VALID [2020-07-28 18:16:53,064 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:16:53,065 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [605192918] [2020-07-28 18:16:53,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:16:53,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-07-28 18:16:53,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230452287] [2020-07-28 18:16:53,072 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2020-07-28 18:16:53,073 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:16:53,077 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 18:16:53,094 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:16:53,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 18:16:53,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 18:16:53,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 18:16:53,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 18:16:53,104 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 2 states. [2020-07-28 18:16:53,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:16:53,157 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2020-07-28 18:16:53,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 18:16:53,157 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2020-07-28 18:16:53,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:16:53,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 18:16:53,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 26 transitions. [2020-07-28 18:16:53,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 18:16:53,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 26 transitions. [2020-07-28 18:16:53,168 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 26 transitions. [2020-07-28 18:16:53,226 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:16:53,236 INFO L225 Difference]: With dead ends: 20 [2020-07-28 18:16:53,237 INFO L226 Difference]: Without dead ends: 8 [2020-07-28 18:16:53,243 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 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:16:53,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2020-07-28 18:16:53,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2020-07-28 18:16:53,271 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:16:53,271 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand 8 states. [2020-07-28 18:16:53,272 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2020-07-28 18:16:53,272 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2020-07-28 18:16:53,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:16:53,274 INFO L93 Difference]: Finished difference Result 8 states and 10 transitions. [2020-07-28 18:16:53,274 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2020-07-28 18:16:53,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:16:53,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:16:53,275 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2020-07-28 18:16:53,275 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2020-07-28 18:16:53,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:16:53,277 INFO L93 Difference]: Finished difference Result 8 states and 10 transitions. [2020-07-28 18:16:53,277 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2020-07-28 18:16:53,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:16:53,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:16:53,278 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:16:53,278 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:16:53,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 18:16:53,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2020-07-28 18:16:53,281 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 6 [2020-07-28 18:16:53,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:16:53,281 INFO L479 AbstractCegarLoop]: Abstraction has 8 states and 10 transitions. [2020-07-28 18:16:53,282 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 18:16:53,282 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2020-07-28 18:16:53,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-28 18:16:53,282 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:16:53,283 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-28 18:16:53,493 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-07-28 18:16:53,494 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:16:53,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:16:53,495 INFO L82 PathProgramCache]: Analyzing trace with hash 920241108, now seen corresponding path program 1 times [2020-07-28 18:16:53,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 18:16:53,496 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [630630169] [2020-07-28 18:16:53,496 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) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-07-28 18:16:53,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:16:53,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-28 18:16:53,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:16:53,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:16:53,602 INFO L280 TraceCheckUtils]: 0: Hoare triple {97#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post2, main_#t~post3, main_#t~nondet1, main_~i~0, main_~j~0, main_~a~0, main_~b~0, main_~flag~0;havoc main_~i~0;havoc main_~j~0;havoc main_~a~0;havoc main_~b~0;main_~flag~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 0bv32;main_~b~0 := 0bv32;main_~j~0 := 1bv32; {102#(and (= (_ bv0 32) ULTIMATE.start_main_~a~0) (= (_ bv0 32) ULTIMATE.start_main_~b~0))} is VALID [2020-07-28 18:16:53,604 INFO L280 TraceCheckUtils]: 1: Hoare triple {102#(and (= (_ bv0 32) ULTIMATE.start_main_~a~0) (= (_ bv0 32) ULTIMATE.start_main_~b~0))} assume 0bv32 != main_~flag~0;main_~i~0 := 0bv32; {102#(and (= (_ bv0 32) ULTIMATE.start_main_~a~0) (= (_ bv0 32) ULTIMATE.start_main_~b~0))} is VALID [2020-07-28 18:16:53,605 INFO L280 TraceCheckUtils]: 2: Hoare triple {102#(and (= (_ bv0 32) ULTIMATE.start_main_~a~0) (= (_ bv0 32) ULTIMATE.start_main_~b~0))} assume !(0bv32 != main_#t~nondet1);havoc main_#t~nondet1; {102#(and (= (_ bv0 32) ULTIMATE.start_main_~a~0) (= (_ bv0 32) ULTIMATE.start_main_~b~0))} is VALID [2020-07-28 18:16:53,606 INFO L280 TraceCheckUtils]: 3: Hoare triple {102#(and (= (_ bv0 32) ULTIMATE.start_main_~a~0) (= (_ bv0 32) ULTIMATE.start_main_~b~0))} assume 0bv32 != main_~flag~0;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~b~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {112#(= (bvadd ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2020-07-28 18:16:53,607 INFO L280 TraceCheckUtils]: 4: Hoare triple {112#(= (bvadd ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == __VERIFIER_assert_~cond; {98#false} is VALID [2020-07-28 18:16:53,608 INFO L280 TraceCheckUtils]: 5: Hoare triple {98#false} assume !false; {98#false} is VALID [2020-07-28 18:16:53,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:16:53,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 18:16:53,668 INFO L280 TraceCheckUtils]: 5: Hoare triple {98#false} assume !false; {98#false} is VALID [2020-07-28 18:16:53,669 INFO L280 TraceCheckUtils]: 4: Hoare triple {122#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} assume 0bv32 == __VERIFIER_assert_~cond; {98#false} is VALID [2020-07-28 18:16:53,671 INFO L280 TraceCheckUtils]: 3: Hoare triple {126#(= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)} assume 0bv32 != main_~flag~0;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~b~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {122#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} is VALID [2020-07-28 18:16:53,672 INFO L280 TraceCheckUtils]: 2: Hoare triple {126#(= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)} assume !(0bv32 != main_#t~nondet1);havoc main_#t~nondet1; {126#(= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)} is VALID [2020-07-28 18:16:53,673 INFO L280 TraceCheckUtils]: 1: Hoare triple {126#(= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)} assume 0bv32 != main_~flag~0;main_~i~0 := 0bv32; {126#(= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)} is VALID [2020-07-28 18:16:53,675 INFO L280 TraceCheckUtils]: 0: Hoare triple {97#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post2, main_#t~post3, main_#t~nondet1, main_~i~0, main_~j~0, main_~a~0, main_~b~0, main_~flag~0;havoc main_~i~0;havoc main_~j~0;havoc main_~a~0;havoc main_~b~0;main_~flag~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 0bv32;main_~b~0 := 0bv32;main_~j~0 := 1bv32; {126#(= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)} is VALID [2020-07-28 18:16:53,675 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:16:53,675 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [630630169] [2020-07-28 18:16:53,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:16:53,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2020-07-28 18:16:53,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537603528] [2020-07-28 18:16:53,678 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2020-07-28 18:16:53,679 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:16:53,680 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-28 18:16:53,700 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:16:53,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-28 18:16:53,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 18:16:53,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-28 18:16:53,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-28 18:16:53,701 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 6 states. [2020-07-28 18:16:53,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:16:53,870 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2020-07-28 18:16:53,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 18:16:53,870 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2020-07-28 18:16:53,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:16:53,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 18:16:53,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2020-07-28 18:16:53,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 18:16:53,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2020-07-28 18:16:53,874 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 15 transitions. [2020-07-28 18:16:53,903 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:16:53,904 INFO L225 Difference]: With dead ends: 13 [2020-07-28 18:16:53,904 INFO L226 Difference]: Without dead ends: 9 [2020-07-28 18:16:53,906 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-28 18:16:53,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2020-07-28 18:16:53,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-07-28 18:16:53,908 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:16:53,908 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states. Second operand 9 states. [2020-07-28 18:16:53,908 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states. [2020-07-28 18:16:53,908 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states. [2020-07-28 18:16:53,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:16:53,910 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2020-07-28 18:16:53,910 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2020-07-28 18:16:53,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:16:53,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:16:53,911 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states. [2020-07-28 18:16:53,911 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states. [2020-07-28 18:16:53,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:16:53,913 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2020-07-28 18:16:53,913 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2020-07-28 18:16:53,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:16:53,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:16:53,914 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:16:53,914 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:16:53,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-28 18:16:53,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2020-07-28 18:16:53,916 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 6 [2020-07-28 18:16:53,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:16:53,916 INFO L479 AbstractCegarLoop]: Abstraction has 9 states and 11 transitions. [2020-07-28 18:16:53,916 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-28 18:16:53,916 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2020-07-28 18:16:53,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-28 18:16:53,917 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:16:53,917 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:16:54,137 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-07-28 18:16:54,138 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:16:54,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:16:54,139 INFO L82 PathProgramCache]: Analyzing trace with hash -363121865, now seen corresponding path program 1 times [2020-07-28 18:16:54,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 18:16:54,141 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [253304098] [2020-07-28 18:16:54,141 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:16:54,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:16:54,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-28 18:16:54,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:16:54,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:16:54,483 INFO L280 TraceCheckUtils]: 0: Hoare triple {177#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post2, main_#t~post3, main_#t~nondet1, main_~i~0, main_~j~0, main_~a~0, main_~b~0, main_~flag~0;havoc main_~i~0;havoc main_~j~0;havoc main_~a~0;havoc main_~b~0;main_~flag~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 0bv32;main_~b~0 := 0bv32;main_~j~0 := 1bv32; {182#(and (= (_ bv0 32) ULTIMATE.start_main_~a~0) (= (_ bv1 32) ULTIMATE.start_main_~j~0) (= (_ bv0 32) ULTIMATE.start_main_~b~0))} is VALID [2020-07-28 18:16:54,484 INFO L280 TraceCheckUtils]: 1: Hoare triple {182#(and (= (_ bv0 32) ULTIMATE.start_main_~a~0) (= (_ bv1 32) ULTIMATE.start_main_~j~0) (= (_ bv0 32) ULTIMATE.start_main_~b~0))} assume 0bv32 != main_~flag~0;main_~i~0 := 0bv32; {186#(and (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv0 32) ULTIMATE.start_main_~a~0) (= (_ bv1 32) ULTIMATE.start_main_~j~0) (= (_ bv0 32) ULTIMATE.start_main_~b~0))} is VALID [2020-07-28 18:16:54,485 INFO L280 TraceCheckUtils]: 2: Hoare triple {186#(and (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv0 32) ULTIMATE.start_main_~a~0) (= (_ bv1 32) ULTIMATE.start_main_~j~0) (= (_ bv0 32) ULTIMATE.start_main_~b~0))} assume !!(0bv32 != main_#t~nondet1);havoc main_#t~nondet1;main_#t~post2 := main_~a~0;main_~a~0 := ~bvadd32(1bv32, main_#t~post2);havoc main_#t~post2;main_~b~0 := ~bvadd32(main_~b~0, ~bvsub32(main_~j~0, main_~i~0));main_~i~0 := ~bvadd32(2bv32, main_~i~0); {190#(and (= (bvadd ULTIMATE.start_main_~b~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) ULTIMATE.start_main_~a~0))} is VALID [2020-07-28 18:16:54,487 INFO L280 TraceCheckUtils]: 3: Hoare triple {190#(and (= (bvadd ULTIMATE.start_main_~b~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) ULTIMATE.start_main_~a~0))} assume 0bv32 == ~bvurem32(main_~i~0, 2bv32);main_~j~0 := ~bvadd32(2bv32, main_~j~0); {190#(and (= (bvadd ULTIMATE.start_main_~b~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) ULTIMATE.start_main_~a~0))} is VALID [2020-07-28 18:16:54,488 INFO L280 TraceCheckUtils]: 4: Hoare triple {190#(and (= (bvadd ULTIMATE.start_main_~b~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) ULTIMATE.start_main_~a~0))} assume !(0bv32 != main_#t~nondet1);havoc main_#t~nondet1; {190#(and (= (bvadd ULTIMATE.start_main_~b~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) ULTIMATE.start_main_~a~0))} is VALID [2020-07-28 18:16:54,489 INFO L280 TraceCheckUtils]: 5: Hoare triple {190#(and (= (bvadd ULTIMATE.start_main_~b~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) ULTIMATE.start_main_~a~0))} assume 0bv32 != main_~flag~0;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~b~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {200#(= (bvadd ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2020-07-28 18:16:54,490 INFO L280 TraceCheckUtils]: 6: Hoare triple {200#(= (bvadd ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == __VERIFIER_assert_~cond; {178#false} is VALID [2020-07-28 18:16:54,490 INFO L280 TraceCheckUtils]: 7: Hoare triple {178#false} assume !false; {178#false} is VALID [2020-07-28 18:16:54,492 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:16:54,492 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 18:16:54,691 INFO L280 TraceCheckUtils]: 7: Hoare triple {178#false} assume !false; {178#false} is VALID [2020-07-28 18:16:54,692 INFO L280 TraceCheckUtils]: 6: Hoare triple {210#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} assume 0bv32 == __VERIFIER_assert_~cond; {178#false} is VALID [2020-07-28 18:16:54,694 INFO L280 TraceCheckUtils]: 5: Hoare triple {214#(= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)} assume 0bv32 != main_~flag~0;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~b~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {210#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} is VALID [2020-07-28 18:16:54,695 INFO L280 TraceCheckUtils]: 4: Hoare triple {214#(= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)} assume !(0bv32 != main_#t~nondet1);havoc main_#t~nondet1; {214#(= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)} is VALID [2020-07-28 18:16:54,696 INFO L280 TraceCheckUtils]: 3: Hoare triple {214#(= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)} assume 0bv32 == ~bvurem32(main_~i~0, 2bv32);main_~j~0 := ~bvadd32(2bv32, main_~j~0); {214#(= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)} is VALID [2020-07-28 18:16:54,724 INFO L280 TraceCheckUtils]: 2: Hoare triple {224#(= (bvadd ULTIMATE.start_main_~a~0 (_ bv1 32)) (bvadd (bvneg ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~j~0))} assume !!(0bv32 != main_#t~nondet1);havoc main_#t~nondet1;main_#t~post2 := main_~a~0;main_~a~0 := ~bvadd32(1bv32, main_#t~post2);havoc main_#t~post2;main_~b~0 := ~bvadd32(main_~b~0, ~bvsub32(main_~j~0, main_~i~0));main_~i~0 := ~bvadd32(2bv32, main_~i~0); {214#(= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)} is VALID [2020-07-28 18:16:54,737 INFO L280 TraceCheckUtils]: 1: Hoare triple {228#(= (bvadd ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~j~0 (_ bv4294967295 32)) ULTIMATE.start_main_~a~0)} assume 0bv32 != main_~flag~0;main_~i~0 := 0bv32; {224#(= (bvadd ULTIMATE.start_main_~a~0 (_ bv1 32)) (bvadd (bvneg ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~j~0))} is VALID [2020-07-28 18:16:54,738 INFO L280 TraceCheckUtils]: 0: Hoare triple {177#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post2, main_#t~post3, main_#t~nondet1, main_~i~0, main_~j~0, main_~a~0, main_~b~0, main_~flag~0;havoc main_~i~0;havoc main_~j~0;havoc main_~a~0;havoc main_~b~0;main_~flag~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 0bv32;main_~b~0 := 0bv32;main_~j~0 := 1bv32; {228#(= (bvadd ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~j~0 (_ bv4294967295 32)) ULTIMATE.start_main_~a~0)} is VALID [2020-07-28 18:16:54,739 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:16:54,739 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [253304098] [2020-07-28 18:16:54,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:16:54,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2020-07-28 18:16:54,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972501090] [2020-07-28 18:16:54,741 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2020-07-28 18:16:54,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:16:54,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-28 18:16:54,810 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:16:54,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-28 18:16:54,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 18:16:54,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-28 18:16:54,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-07-28 18:16:54,811 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand 10 states. [2020-07-28 18:16:55,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:16:55,061 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2020-07-28 18:16:55,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-28 18:16:55,061 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2020-07-28 18:16:55,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:16:55,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 18:16:55,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 19 transitions. [2020-07-28 18:16:55,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 18:16:55,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 19 transitions. [2020-07-28 18:16:55,068 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 19 transitions. [2020-07-28 18:16:55,123 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:16:55,124 INFO L225 Difference]: With dead ends: 16 [2020-07-28 18:16:55,124 INFO L226 Difference]: Without dead ends: 12 [2020-07-28 18:16:55,125 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-07-28 18:16:55,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2020-07-28 18:16:55,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2020-07-28 18:16:55,131 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:16:55,131 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 11 states. [2020-07-28 18:16:55,131 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 11 states. [2020-07-28 18:16:55,132 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 11 states. [2020-07-28 18:16:55,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:16:55,134 INFO L93 Difference]: Finished difference Result 12 states and 15 transitions. [2020-07-28 18:16:55,134 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 15 transitions. [2020-07-28 18:16:55,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:16:55,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:16:55,142 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 12 states. [2020-07-28 18:16:55,143 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 12 states. [2020-07-28 18:16:55,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:16:55,144 INFO L93 Difference]: Finished difference Result 12 states and 15 transitions. [2020-07-28 18:16:55,144 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 15 transitions. [2020-07-28 18:16:55,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:16:55,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:16:55,145 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:16:55,146 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:16:55,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-28 18:16:55,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2020-07-28 18:16:55,149 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 14 transitions. Word has length 8 [2020-07-28 18:16:55,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:16:55,150 INFO L479 AbstractCegarLoop]: Abstraction has 11 states and 14 transitions. [2020-07-28 18:16:55,150 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-28 18:16:55,150 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2020-07-28 18:16:55,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-28 18:16:55,151 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:16:55,151 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:16:55,375 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-07-28 18:16:55,376 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:16:55,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:16:55,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1411885497, now seen corresponding path program 1 times [2020-07-28 18:16:55,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 18:16:55,378 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [312155888] [2020-07-28 18:16:55,378 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:16:55,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:16:55,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-28 18:16:55,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:16:55,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:16:55,445 INFO L280 TraceCheckUtils]: 0: Hoare triple {286#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post2, main_#t~post3, main_#t~nondet1, main_~i~0, main_~j~0, main_~a~0, main_~b~0, main_~flag~0;havoc main_~i~0;havoc main_~j~0;havoc main_~a~0;havoc main_~b~0;main_~flag~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 0bv32;main_~b~0 := 0bv32;main_~j~0 := 1bv32; {286#true} is VALID [2020-07-28 18:16:55,446 INFO L280 TraceCheckUtils]: 1: Hoare triple {286#true} assume !(0bv32 != main_~flag~0);main_~i~0 := 1bv32; {294#(= (_ bv1 32) ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 18:16:55,447 INFO L280 TraceCheckUtils]: 2: Hoare triple {294#(= (_ bv1 32) ULTIMATE.start_main_~i~0)} assume !!(0bv32 != main_#t~nondet1);havoc main_#t~nondet1;main_#t~post2 := main_~a~0;main_~a~0 := ~bvadd32(1bv32, main_#t~post2);havoc main_#t~post2;main_~b~0 := ~bvadd32(main_~b~0, ~bvsub32(main_~j~0, main_~i~0));main_~i~0 := ~bvadd32(2bv32, main_~i~0); {298#(= (_ bv3 32) ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 18:16:55,448 INFO L280 TraceCheckUtils]: 3: Hoare triple {298#(= (_ bv3 32) ULTIMATE.start_main_~i~0)} assume 0bv32 == ~bvurem32(main_~i~0, 2bv32);main_~j~0 := ~bvadd32(2bv32, main_~j~0); {287#false} is VALID [2020-07-28 18:16:55,448 INFO L280 TraceCheckUtils]: 4: Hoare triple {287#false} assume !(0bv32 != main_#t~nondet1);havoc main_#t~nondet1; {287#false} is VALID [2020-07-28 18:16:55,449 INFO L280 TraceCheckUtils]: 5: Hoare triple {287#false} assume 0bv32 != main_~flag~0;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~b~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {287#false} is VALID [2020-07-28 18:16:55,449 INFO L280 TraceCheckUtils]: 6: Hoare triple {287#false} assume 0bv32 == __VERIFIER_assert_~cond; {287#false} is VALID [2020-07-28 18:16:55,449 INFO L280 TraceCheckUtils]: 7: Hoare triple {287#false} assume !false; {287#false} is VALID [2020-07-28 18:16:55,450 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:16:55,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 18:16:55,485 INFO L280 TraceCheckUtils]: 7: Hoare triple {287#false} assume !false; {287#false} is VALID [2020-07-28 18:16:55,485 INFO L280 TraceCheckUtils]: 6: Hoare triple {287#false} assume 0bv32 == __VERIFIER_assert_~cond; {287#false} is VALID [2020-07-28 18:16:55,486 INFO L280 TraceCheckUtils]: 5: Hoare triple {287#false} assume 0bv32 != main_~flag~0;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~b~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {287#false} is VALID [2020-07-28 18:16:55,486 INFO L280 TraceCheckUtils]: 4: Hoare triple {287#false} assume !(0bv32 != main_#t~nondet1);havoc main_#t~nondet1; {287#false} is VALID [2020-07-28 18:16:55,492 INFO L280 TraceCheckUtils]: 3: Hoare triple {326#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~i~0 (_ bv2 32))))} assume 0bv32 == ~bvurem32(main_~i~0, 2bv32);main_~j~0 := ~bvadd32(2bv32, main_~j~0); {287#false} is VALID [2020-07-28 18:16:55,496 INFO L280 TraceCheckUtils]: 2: Hoare triple {326#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~i~0 (_ bv2 32))))} assume !!(0bv32 != main_#t~nondet1);havoc main_#t~nondet1;main_#t~post2 := main_~a~0;main_~a~0 := ~bvadd32(1bv32, main_#t~post2);havoc main_#t~post2;main_~b~0 := ~bvadd32(main_~b~0, ~bvsub32(main_~j~0, main_~i~0));main_~i~0 := ~bvadd32(2bv32, main_~i~0); {326#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~i~0 (_ bv2 32))))} is VALID [2020-07-28 18:16:55,497 INFO L280 TraceCheckUtils]: 1: Hoare triple {286#true} assume !(0bv32 != main_~flag~0);main_~i~0 := 1bv32; {326#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~i~0 (_ bv2 32))))} is VALID [2020-07-28 18:16:55,497 INFO L280 TraceCheckUtils]: 0: Hoare triple {286#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post2, main_#t~post3, main_#t~nondet1, main_~i~0, main_~j~0, main_~a~0, main_~b~0, main_~flag~0;havoc main_~i~0;havoc main_~j~0;havoc main_~a~0;havoc main_~b~0;main_~flag~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 0bv32;main_~b~0 := 0bv32;main_~j~0 := 1bv32; {286#true} is VALID [2020-07-28 18:16:55,497 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:16:55,498 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [312155888] [2020-07-28 18:16:55,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:16:55,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 3] imperfect sequences [] total 5 [2020-07-28 18:16:55,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792552238] [2020-07-28 18:16:55,499 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-07-28 18:16:55,499 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:16:55,499 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 18:16:55,524 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:16:55,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 18:16:55,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 18:16:55,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 18:16:55,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-28 18:16:55,525 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand 5 states. [2020-07-28 18:16:55,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:16:55,678 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2020-07-28 18:16:55,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 18:16:55,680 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-07-28 18:16:55,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:16:55,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 18:16:55,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2020-07-28 18:16:55,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 18:16:55,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2020-07-28 18:16:55,683 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2020-07-28 18:16:55,744 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:16:55,745 INFO L225 Difference]: With dead ends: 31 [2020-07-28 18:16:55,745 INFO L226 Difference]: Without dead ends: 25 [2020-07-28 18:16:55,746 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-28 18:16:55,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-28 18:16:55,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 14. [2020-07-28 18:16:55,749 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:16:55,749 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 14 states. [2020-07-28 18:16:55,749 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 14 states. [2020-07-28 18:16:55,750 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 14 states. [2020-07-28 18:16:55,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:16:55,752 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2020-07-28 18:16:55,752 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2020-07-28 18:16:55,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:16:55,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:16:55,753 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 25 states. [2020-07-28 18:16:55,753 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 25 states. [2020-07-28 18:16:55,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:16:55,755 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2020-07-28 18:16:55,756 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2020-07-28 18:16:55,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:16:55,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:16:55,757 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:16:55,757 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:16:55,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-28 18:16:55,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2020-07-28 18:16:55,758 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 18 transitions. Word has length 8 [2020-07-28 18:16:55,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:16:55,759 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 18 transitions. [2020-07-28 18:16:55,759 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 18:16:55,759 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 18 transitions. [2020-07-28 18:16:55,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-28 18:16:55,760 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:16:55,760 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:16:55,969 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-07-28 18:16:55,970 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:16:55,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:16:55,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1413732539, now seen corresponding path program 1 times [2020-07-28 18:16:55,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 18:16:55,972 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1336243928] [2020-07-28 18:16:55,972 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:16:55,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:16:56,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-28 18:16:56,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:16:56,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:16:56,024 INFO L280 TraceCheckUtils]: 0: Hoare triple {430#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post2, main_#t~post3, main_#t~nondet1, main_~i~0, main_~j~0, main_~a~0, main_~b~0, main_~flag~0;havoc main_~i~0;havoc main_~j~0;havoc main_~a~0;havoc main_~b~0;main_~flag~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 0bv32;main_~b~0 := 0bv32;main_~j~0 := 1bv32; {430#true} is VALID [2020-07-28 18:16:56,025 INFO L280 TraceCheckUtils]: 1: Hoare triple {430#true} assume !(0bv32 != main_~flag~0);main_~i~0 := 1bv32; {438#(= (_ bv0 32) ULTIMATE.start_main_~flag~0)} is VALID [2020-07-28 18:16:56,026 INFO L280 TraceCheckUtils]: 2: Hoare triple {438#(= (_ bv0 32) ULTIMATE.start_main_~flag~0)} assume !!(0bv32 != main_#t~nondet1);havoc main_#t~nondet1;main_#t~post2 := main_~a~0;main_~a~0 := ~bvadd32(1bv32, main_#t~post2);havoc main_#t~post2;main_~b~0 := ~bvadd32(main_~b~0, ~bvsub32(main_~j~0, main_~i~0));main_~i~0 := ~bvadd32(2bv32, main_~i~0); {438#(= (_ bv0 32) ULTIMATE.start_main_~flag~0)} is VALID [2020-07-28 18:16:56,027 INFO L280 TraceCheckUtils]: 3: Hoare triple {438#(= (_ bv0 32) ULTIMATE.start_main_~flag~0)} assume !(0bv32 == ~bvurem32(main_~i~0, 2bv32));main_#t~post3 := main_~j~0;main_~j~0 := ~bvadd32(1bv32, main_#t~post3);havoc main_#t~post3; {438#(= (_ bv0 32) ULTIMATE.start_main_~flag~0)} is VALID [2020-07-28 18:16:56,028 INFO L280 TraceCheckUtils]: 4: Hoare triple {438#(= (_ bv0 32) ULTIMATE.start_main_~flag~0)} assume !(0bv32 != main_#t~nondet1);havoc main_#t~nondet1; {438#(= (_ bv0 32) ULTIMATE.start_main_~flag~0)} is VALID [2020-07-28 18:16:56,030 INFO L280 TraceCheckUtils]: 5: Hoare triple {438#(= (_ bv0 32) ULTIMATE.start_main_~flag~0)} assume 0bv32 != main_~flag~0;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~b~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {431#false} is VALID [2020-07-28 18:16:56,030 INFO L280 TraceCheckUtils]: 6: Hoare triple {431#false} assume 0bv32 == __VERIFIER_assert_~cond; {431#false} is VALID [2020-07-28 18:16:56,031 INFO L280 TraceCheckUtils]: 7: Hoare triple {431#false} assume !false; {431#false} is VALID [2020-07-28 18:16:56,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-28 18:16:56,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 18:16:56,047 INFO L280 TraceCheckUtils]: 7: Hoare triple {431#false} assume !false; {431#false} is VALID [2020-07-28 18:16:56,048 INFO L280 TraceCheckUtils]: 6: Hoare triple {431#false} assume 0bv32 == __VERIFIER_assert_~cond; {431#false} is VALID [2020-07-28 18:16:56,050 INFO L280 TraceCheckUtils]: 5: Hoare triple {438#(= (_ bv0 32) ULTIMATE.start_main_~flag~0)} assume 0bv32 != main_~flag~0;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~b~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {431#false} is VALID [2020-07-28 18:16:56,051 INFO L280 TraceCheckUtils]: 4: Hoare triple {438#(= (_ bv0 32) ULTIMATE.start_main_~flag~0)} assume !(0bv32 != main_#t~nondet1);havoc main_#t~nondet1; {438#(= (_ bv0 32) ULTIMATE.start_main_~flag~0)} is VALID [2020-07-28 18:16:56,052 INFO L280 TraceCheckUtils]: 3: Hoare triple {438#(= (_ bv0 32) ULTIMATE.start_main_~flag~0)} assume !(0bv32 == ~bvurem32(main_~i~0, 2bv32));main_#t~post3 := main_~j~0;main_~j~0 := ~bvadd32(1bv32, main_#t~post3);havoc main_#t~post3; {438#(= (_ bv0 32) ULTIMATE.start_main_~flag~0)} is VALID [2020-07-28 18:16:56,053 INFO L280 TraceCheckUtils]: 2: Hoare triple {438#(= (_ bv0 32) ULTIMATE.start_main_~flag~0)} assume !!(0bv32 != main_#t~nondet1);havoc main_#t~nondet1;main_#t~post2 := main_~a~0;main_~a~0 := ~bvadd32(1bv32, main_#t~post2);havoc main_#t~post2;main_~b~0 := ~bvadd32(main_~b~0, ~bvsub32(main_~j~0, main_~i~0));main_~i~0 := ~bvadd32(2bv32, main_~i~0); {438#(= (_ bv0 32) ULTIMATE.start_main_~flag~0)} is VALID [2020-07-28 18:16:56,055 INFO L280 TraceCheckUtils]: 1: Hoare triple {430#true} assume !(0bv32 != main_~flag~0);main_~i~0 := 1bv32; {438#(= (_ bv0 32) ULTIMATE.start_main_~flag~0)} is VALID [2020-07-28 18:16:56,056 INFO L280 TraceCheckUtils]: 0: Hoare triple {430#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post2, main_#t~post3, main_#t~nondet1, main_~i~0, main_~j~0, main_~a~0, main_~b~0, main_~flag~0;havoc main_~i~0;havoc main_~j~0;havoc main_~a~0;havoc main_~b~0;main_~flag~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 0bv32;main_~b~0 := 0bv32;main_~j~0 := 1bv32; {430#true} is VALID [2020-07-28 18:16:56,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-28 18:16:56,057 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1336243928] [2020-07-28 18:16:56,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:16:56,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-07-28 18:16:56,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266436282] [2020-07-28 18:16:56,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-07-28 18:16:56,059 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:16:56,059 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-28 18:16:56,074 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:16:56,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-28 18:16:56,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 18:16:56,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-28 18:16:56,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 18:16:56,076 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. Second operand 3 states. [2020-07-28 18:16:56,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:16:56,111 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2020-07-28 18:16:56,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-28 18:16:56,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-07-28 18:16:56,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:16:56,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 18:16:56,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2020-07-28 18:16:56,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 18:16:56,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2020-07-28 18:16:56,114 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 16 transitions. [2020-07-28 18:16:56,143 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:16:56,144 INFO L225 Difference]: With dead ends: 21 [2020-07-28 18:16:56,144 INFO L226 Difference]: Without dead ends: 14 [2020-07-28 18:16:56,145 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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:16:56,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-07-28 18:16:56,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-07-28 18:16:56,147 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:16:56,148 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2020-07-28 18:16:56,148 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-28 18:16:56,148 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-28 18:16:56,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:16:56,149 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2020-07-28 18:16:56,150 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2020-07-28 18:16:56,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:16:56,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:16:56,150 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-28 18:16:56,150 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-28 18:16:56,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:16:56,151 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2020-07-28 18:16:56,152 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2020-07-28 18:16:56,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:16:56,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:16:56,152 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:16:56,153 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:16:56,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-28 18:16:56,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2020-07-28 18:16:56,158 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 8 [2020-07-28 18:16:56,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:16:56,159 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 17 transitions. [2020-07-28 18:16:56,159 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-28 18:16:56,159 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2020-07-28 18:16:56,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-28 18:16:56,160 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:16:56,161 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2020-07-28 18:16:56,365 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-07-28 18:16:56,366 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:16:56,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:16:56,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1019324966, now seen corresponding path program 2 times [2020-07-28 18:16:56,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 18:16:56,367 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [754821156] [2020-07-28 18:16:56,368 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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:16:56,394 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-28 18:16:56,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 18:16:56,395 WARN L261 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 13 conjunts are in the unsatisfiable core [2020-07-28 18:16:56,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:16:56,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:16:56,692 INFO L280 TraceCheckUtils]: 0: Hoare triple {540#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post2, main_#t~post3, main_#t~nondet1, main_~i~0, main_~j~0, main_~a~0, main_~b~0, main_~flag~0;havoc main_~i~0;havoc main_~j~0;havoc main_~a~0;havoc main_~b~0;main_~flag~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 0bv32;main_~b~0 := 0bv32;main_~j~0 := 1bv32; {545#(and (= (_ bv0 32) ULTIMATE.start_main_~a~0) (= (_ bv1 32) ULTIMATE.start_main_~j~0) (= (_ bv0 32) ULTIMATE.start_main_~b~0))} is VALID [2020-07-28 18:16:56,693 INFO L280 TraceCheckUtils]: 1: Hoare triple {545#(and (= (_ bv0 32) ULTIMATE.start_main_~a~0) (= (_ bv1 32) ULTIMATE.start_main_~j~0) (= (_ bv0 32) ULTIMATE.start_main_~b~0))} assume 0bv32 != main_~flag~0;main_~i~0 := 0bv32; {549#(and (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv0 32) ULTIMATE.start_main_~a~0) (= (_ bv1 32) ULTIMATE.start_main_~j~0) (= (_ bv0 32) ULTIMATE.start_main_~b~0))} is VALID [2020-07-28 18:16:56,694 INFO L280 TraceCheckUtils]: 2: Hoare triple {549#(and (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv0 32) ULTIMATE.start_main_~a~0) (= (_ bv1 32) ULTIMATE.start_main_~j~0) (= (_ bv0 32) ULTIMATE.start_main_~b~0))} assume !!(0bv32 != main_#t~nondet1);havoc main_#t~nondet1;main_#t~post2 := main_~a~0;main_~a~0 := ~bvadd32(1bv32, main_#t~post2);havoc main_#t~post2;main_~b~0 := ~bvadd32(main_~b~0, ~bvsub32(main_~j~0, main_~i~0));main_~i~0 := ~bvadd32(2bv32, main_~i~0); {553#(and (= (_ bv1 32) ULTIMATE.start_main_~a~0) (= (_ bv0 32) (bvadd ULTIMATE.start_main_~b~0 (bvneg ULTIMATE.start_main_~j~0))) (= (_ bv2 32) ULTIMATE.start_main_~i~0) (= (_ bv1 32) ULTIMATE.start_main_~j~0))} is VALID [2020-07-28 18:16:56,695 INFO L280 TraceCheckUtils]: 3: Hoare triple {553#(and (= (_ bv1 32) ULTIMATE.start_main_~a~0) (= (_ bv0 32) (bvadd ULTIMATE.start_main_~b~0 (bvneg ULTIMATE.start_main_~j~0))) (= (_ bv2 32) ULTIMATE.start_main_~i~0) (= (_ bv1 32) ULTIMATE.start_main_~j~0))} assume 0bv32 == ~bvurem32(main_~i~0, 2bv32);main_~j~0 := ~bvadd32(2bv32, main_~j~0); {557#(and (= (_ bv3 32) ULTIMATE.start_main_~j~0) (= (bvadd ULTIMATE.start_main_~b~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) ULTIMATE.start_main_~a~0) (= (_ bv2 32) ULTIMATE.start_main_~i~0))} is VALID [2020-07-28 18:16:56,696 INFO L280 TraceCheckUtils]: 4: Hoare triple {557#(and (= (_ bv3 32) ULTIMATE.start_main_~j~0) (= (bvadd ULTIMATE.start_main_~b~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) ULTIMATE.start_main_~a~0) (= (_ bv2 32) ULTIMATE.start_main_~i~0))} assume !!(0bv32 != main_#t~nondet1);havoc main_#t~nondet1;main_#t~post2 := main_~a~0;main_~a~0 := ~bvadd32(1bv32, main_#t~post2);havoc main_#t~post2;main_~b~0 := ~bvadd32(main_~b~0, ~bvsub32(main_~j~0, main_~i~0));main_~i~0 := ~bvadd32(2bv32, main_~i~0); {561#(and (= (_ bv2 32) ULTIMATE.start_main_~a~0) (= (_ bv2 32) ULTIMATE.start_main_~b~0))} is VALID [2020-07-28 18:16:56,697 INFO L280 TraceCheckUtils]: 5: Hoare triple {561#(and (= (_ bv2 32) ULTIMATE.start_main_~a~0) (= (_ bv2 32) ULTIMATE.start_main_~b~0))} assume 0bv32 == ~bvurem32(main_~i~0, 2bv32);main_~j~0 := ~bvadd32(2bv32, main_~j~0); {561#(and (= (_ bv2 32) ULTIMATE.start_main_~a~0) (= (_ bv2 32) ULTIMATE.start_main_~b~0))} is VALID [2020-07-28 18:16:56,698 INFO L280 TraceCheckUtils]: 6: Hoare triple {561#(and (= (_ bv2 32) ULTIMATE.start_main_~a~0) (= (_ bv2 32) ULTIMATE.start_main_~b~0))} assume !(0bv32 != main_#t~nondet1);havoc main_#t~nondet1; {561#(and (= (_ bv2 32) ULTIMATE.start_main_~a~0) (= (_ bv2 32) ULTIMATE.start_main_~b~0))} is VALID [2020-07-28 18:16:56,699 INFO L280 TraceCheckUtils]: 7: Hoare triple {561#(and (= (_ bv2 32) ULTIMATE.start_main_~a~0) (= (_ bv2 32) ULTIMATE.start_main_~b~0))} assume 0bv32 != main_~flag~0;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~b~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {571#(= (bvadd ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2020-07-28 18:16:56,701 INFO L280 TraceCheckUtils]: 8: Hoare triple {571#(= (bvadd ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == __VERIFIER_assert_~cond; {541#false} is VALID [2020-07-28 18:16:56,701 INFO L280 TraceCheckUtils]: 9: Hoare triple {541#false} assume !false; {541#false} is VALID [2020-07-28 18:16:56,702 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:16:56,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 18:17:01,080 INFO L280 TraceCheckUtils]: 9: Hoare triple {541#false} assume !false; {541#false} is VALID [2020-07-28 18:17:01,081 INFO L280 TraceCheckUtils]: 8: Hoare triple {581#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} assume 0bv32 == __VERIFIER_assert_~cond; {541#false} is VALID [2020-07-28 18:17:01,088 INFO L280 TraceCheckUtils]: 7: Hoare triple {585#(= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)} assume 0bv32 != main_~flag~0;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~b~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {581#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} is VALID [2020-07-28 18:17:01,089 INFO L280 TraceCheckUtils]: 6: Hoare triple {585#(= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)} assume !(0bv32 != main_#t~nondet1);havoc main_#t~nondet1; {585#(= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)} is VALID [2020-07-28 18:17:01,089 INFO L280 TraceCheckUtils]: 5: Hoare triple {585#(= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)} assume 0bv32 == ~bvurem32(main_~i~0, 2bv32);main_~j~0 := ~bvadd32(2bv32, main_~j~0); {585#(= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)} is VALID [2020-07-28 18:17:01,110 INFO L280 TraceCheckUtils]: 4: Hoare triple {595#(= (bvadd ULTIMATE.start_main_~a~0 (_ bv1 32)) (bvadd (bvneg ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~j~0))} assume !!(0bv32 != main_#t~nondet1);havoc main_#t~nondet1;main_#t~post2 := main_~a~0;main_~a~0 := ~bvadd32(1bv32, main_#t~post2);havoc main_#t~post2;main_~b~0 := ~bvadd32(main_~b~0, ~bvsub32(main_~j~0, main_~i~0));main_~i~0 := ~bvadd32(2bv32, main_~i~0); {585#(= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)} is VALID [2020-07-28 18:17:03,115 INFO L280 TraceCheckUtils]: 3: Hoare triple {599#(= (bvadd (bvneg ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~j~0 (_ bv1 32)) ULTIMATE.start_main_~a~0)} assume 0bv32 == ~bvurem32(main_~i~0, 2bv32);main_~j~0 := ~bvadd32(2bv32, main_~j~0); {595#(= (bvadd ULTIMATE.start_main_~a~0 (_ bv1 32)) (bvadd (bvneg ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~j~0))} is UNKNOWN [2020-07-28 18:17:05,121 INFO L280 TraceCheckUtils]: 2: Hoare triple {603#(= (bvadd (bvneg ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~b~0 (bvneg (bvadd ULTIMATE.start_main_~i~0 (_ bv2 32))) (bvmul (_ bv2 32) ULTIMATE.start_main_~j~0)) ULTIMATE.start_main_~a~0)} assume !!(0bv32 != main_#t~nondet1);havoc main_#t~nondet1;main_#t~post2 := main_~a~0;main_~a~0 := ~bvadd32(1bv32, main_#t~post2);havoc main_#t~post2;main_~b~0 := ~bvadd32(main_~b~0, ~bvsub32(main_~j~0, main_~i~0));main_~i~0 := ~bvadd32(2bv32, main_~i~0); {599#(= (bvadd (bvneg ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~j~0 (_ bv1 32)) ULTIMATE.start_main_~a~0)} is UNKNOWN [2020-07-28 18:17:05,122 INFO L280 TraceCheckUtils]: 1: Hoare triple {607#(= (bvadd ULTIMATE.start_main_~b~0 (bvmul (_ bv2 32) ULTIMATE.start_main_~j~0) (_ bv4294967294 32)) ULTIMATE.start_main_~a~0)} assume 0bv32 != main_~flag~0;main_~i~0 := 0bv32; {603#(= (bvadd (bvneg ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~b~0 (bvneg (bvadd ULTIMATE.start_main_~i~0 (_ bv2 32))) (bvmul (_ bv2 32) ULTIMATE.start_main_~j~0)) ULTIMATE.start_main_~a~0)} is VALID [2020-07-28 18:17:05,124 INFO L280 TraceCheckUtils]: 0: Hoare triple {540#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post2, main_#t~post3, main_#t~nondet1, main_~i~0, main_~j~0, main_~a~0, main_~b~0, main_~flag~0;havoc main_~i~0;havoc main_~j~0;havoc main_~a~0;havoc main_~b~0;main_~flag~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 0bv32;main_~b~0 := 0bv32;main_~j~0 := 1bv32; {607#(= (bvadd ULTIMATE.start_main_~b~0 (bvmul (_ bv2 32) ULTIMATE.start_main_~j~0) (_ bv4294967294 32)) ULTIMATE.start_main_~a~0)} is VALID [2020-07-28 18:17:05,124 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:17:05,125 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [754821156] [2020-07-28 18:17:05,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:17:05,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2020-07-28 18:17:05,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483463721] [2020-07-28 18:17:05,126 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2020-07-28 18:17:05,127 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:17:05,127 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-28 18:17:09,193 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 17 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2020-07-28 18:17:09,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-28 18:17:09,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 18:17:09,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-28 18:17:09,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2020-07-28 18:17:09,195 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. Second operand 14 states. [2020-07-28 18:17:09,843 WARN L193 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2020-07-28 18:17:10,724 WARN L193 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2020-07-28 18:17:13,014 WARN L193 SmtUtils]: Spent 1.95 s on a formula simplification. DAG size of input: 17 DAG size of output: 16 [2020-07-28 18:17:21,310 WARN L193 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 22 DAG size of output: 21 [2020-07-28 18:17:22,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:17:22,909 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2020-07-28 18:17:22,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-28 18:17:22,909 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2020-07-28 18:17:22,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:17:22,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-28 18:17:22,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 38 transitions. [2020-07-28 18:17:22,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-28 18:17:22,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 38 transitions. [2020-07-28 18:17:22,920 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 38 transitions. [2020-07-28 18:17:27,716 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 37 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2020-07-28 18:17:27,717 INFO L225 Difference]: With dead ends: 32 [2020-07-28 18:17:27,717 INFO L226 Difference]: Without dead ends: 17 [2020-07-28 18:17:27,718 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2020-07-28 18:17:27,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-07-28 18:17:27,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 13. [2020-07-28 18:17:27,720 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:17:27,720 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 13 states. [2020-07-28 18:17:27,720 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 13 states. [2020-07-28 18:17:27,720 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 13 states. [2020-07-28 18:17:27,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:17:27,721 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2020-07-28 18:17:27,721 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2020-07-28 18:17:27,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:17:27,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:17:27,723 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 17 states. [2020-07-28 18:17:27,723 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 17 states. [2020-07-28 18:17:27,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:17:27,724 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2020-07-28 18:17:27,725 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2020-07-28 18:17:27,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:17:27,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:17:27,725 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:17:27,726 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:17:27,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-28 18:17:27,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2020-07-28 18:17:27,727 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2020-07-28 18:17:27,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:17:27,727 INFO L479 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2020-07-28 18:17:27,728 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-28 18:17:27,728 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2020-07-28 18:17:27,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-28 18:17:27,728 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:17:27,729 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:17:27,929 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-07-28 18:17:27,930 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:17:27,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:17:27,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1506541889, now seen corresponding path program 1 times [2020-07-28 18:17:27,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 18:17:27,932 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1788747219] [2020-07-28 18:17:27,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2020-07-28 18:17:27,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:17:27,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-28 18:17:27,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:17:27,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:17:28,000 INFO L280 TraceCheckUtils]: 0: Hoare triple {705#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post2, main_#t~post3, main_#t~nondet1, main_~i~0, main_~j~0, main_~a~0, main_~b~0, main_~flag~0;havoc main_~i~0;havoc main_~j~0;havoc main_~a~0;havoc main_~b~0;main_~flag~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 0bv32;main_~b~0 := 0bv32;main_~j~0 := 1bv32; {705#true} is VALID [2020-07-28 18:17:28,001 INFO L280 TraceCheckUtils]: 1: Hoare triple {705#true} assume 0bv32 != main_~flag~0;main_~i~0 := 0bv32; {713#(= (_ bv0 32) ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 18:17:28,003 INFO L280 TraceCheckUtils]: 2: Hoare triple {713#(= (_ bv0 32) ULTIMATE.start_main_~i~0)} assume !!(0bv32 != main_#t~nondet1);havoc main_#t~nondet1;main_#t~post2 := main_~a~0;main_~a~0 := ~bvadd32(1bv32, main_#t~post2);havoc main_#t~post2;main_~b~0 := ~bvadd32(main_~b~0, ~bvsub32(main_~j~0, main_~i~0));main_~i~0 := ~bvadd32(2bv32, main_~i~0); {717#(= (_ bv2 32) ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 18:17:28,003 INFO L280 TraceCheckUtils]: 3: Hoare triple {717#(= (_ bv2 32) ULTIMATE.start_main_~i~0)} assume 0bv32 == ~bvurem32(main_~i~0, 2bv32);main_~j~0 := ~bvadd32(2bv32, main_~j~0); {717#(= (_ bv2 32) ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 18:17:28,007 INFO L280 TraceCheckUtils]: 4: Hoare triple {717#(= (_ bv2 32) ULTIMATE.start_main_~i~0)} assume !!(0bv32 != main_#t~nondet1);havoc main_#t~nondet1;main_#t~post2 := main_~a~0;main_~a~0 := ~bvadd32(1bv32, main_#t~post2);havoc main_#t~post2;main_~b~0 := ~bvadd32(main_~b~0, ~bvsub32(main_~j~0, main_~i~0));main_~i~0 := ~bvadd32(2bv32, main_~i~0); {724#(= (bvadd ULTIMATE.start_main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2020-07-28 18:17:28,007 INFO L280 TraceCheckUtils]: 5: Hoare triple {724#(= (bvadd ULTIMATE.start_main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume !(0bv32 == ~bvurem32(main_~i~0, 2bv32));main_#t~post3 := main_~j~0;main_~j~0 := ~bvadd32(1bv32, main_#t~post3);havoc main_#t~post3; {706#false} is VALID [2020-07-28 18:17:28,008 INFO L280 TraceCheckUtils]: 6: Hoare triple {706#false} assume !!(0bv32 != main_#t~nondet1);havoc main_#t~nondet1;main_#t~post2 := main_~a~0;main_~a~0 := ~bvadd32(1bv32, main_#t~post2);havoc main_#t~post2;main_~b~0 := ~bvadd32(main_~b~0, ~bvsub32(main_~j~0, main_~i~0));main_~i~0 := ~bvadd32(2bv32, main_~i~0); {706#false} is VALID [2020-07-28 18:17:28,008 INFO L280 TraceCheckUtils]: 7: Hoare triple {706#false} assume !(0bv32 == ~bvurem32(main_~i~0, 2bv32));main_#t~post3 := main_~j~0;main_~j~0 := ~bvadd32(1bv32, main_#t~post3);havoc main_#t~post3; {706#false} is VALID [2020-07-28 18:17:28,008 INFO L280 TraceCheckUtils]: 8: Hoare triple {706#false} assume !(0bv32 != main_#t~nondet1);havoc main_#t~nondet1; {706#false} is VALID [2020-07-28 18:17:28,008 INFO L280 TraceCheckUtils]: 9: Hoare triple {706#false} assume 0bv32 != main_~flag~0;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~b~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {706#false} is VALID [2020-07-28 18:17:28,008 INFO L280 TraceCheckUtils]: 10: Hoare triple {706#false} assume 0bv32 == __VERIFIER_assert_~cond; {706#false} is VALID [2020-07-28 18:17:28,009 INFO L280 TraceCheckUtils]: 11: Hoare triple {706#false} assume !false; {706#false} is VALID [2020-07-28 18:17:28,009 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-28 18:17:28,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 18:17:28,051 INFO L280 TraceCheckUtils]: 11: Hoare triple {706#false} assume !false; {706#false} is VALID [2020-07-28 18:17:28,051 INFO L280 TraceCheckUtils]: 10: Hoare triple {706#false} assume 0bv32 == __VERIFIER_assert_~cond; {706#false} is VALID [2020-07-28 18:17:28,052 INFO L280 TraceCheckUtils]: 9: Hoare triple {706#false} assume 0bv32 != main_~flag~0;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~b~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {706#false} is VALID [2020-07-28 18:17:28,052 INFO L280 TraceCheckUtils]: 8: Hoare triple {706#false} assume !(0bv32 != main_#t~nondet1);havoc main_#t~nondet1; {706#false} is VALID [2020-07-28 18:17:28,052 INFO L280 TraceCheckUtils]: 7: Hoare triple {706#false} assume !(0bv32 == ~bvurem32(main_~i~0, 2bv32));main_#t~post3 := main_~j~0;main_~j~0 := ~bvadd32(1bv32, main_#t~post3);havoc main_#t~post3; {706#false} is VALID [2020-07-28 18:17:28,053 INFO L280 TraceCheckUtils]: 6: Hoare triple {706#false} assume !!(0bv32 != main_#t~nondet1);havoc main_#t~nondet1;main_#t~post2 := main_~a~0;main_~a~0 := ~bvadd32(1bv32, main_#t~post2);havoc main_#t~post2;main_~b~0 := ~bvadd32(main_~b~0, ~bvsub32(main_~j~0, main_~i~0));main_~i~0 := ~bvadd32(2bv32, main_~i~0); {706#false} is VALID [2020-07-28 18:17:28,055 INFO L280 TraceCheckUtils]: 5: Hoare triple {764#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~i~0 (_ bv2 32)))} assume !(0bv32 == ~bvurem32(main_~i~0, 2bv32));main_#t~post3 := main_~j~0;main_~j~0 := ~bvadd32(1bv32, main_#t~post3);havoc main_#t~post3; {706#false} is VALID [2020-07-28 18:17:28,059 INFO L280 TraceCheckUtils]: 4: Hoare triple {764#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~i~0 (_ bv2 32)))} assume !!(0bv32 != main_#t~nondet1);havoc main_#t~nondet1;main_#t~post2 := main_~a~0;main_~a~0 := ~bvadd32(1bv32, main_#t~post2);havoc main_#t~post2;main_~b~0 := ~bvadd32(main_~b~0, ~bvsub32(main_~j~0, main_~i~0));main_~i~0 := ~bvadd32(2bv32, main_~i~0); {764#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~i~0 (_ bv2 32)))} is VALID [2020-07-28 18:17:28,060 INFO L280 TraceCheckUtils]: 3: Hoare triple {764#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~i~0 (_ bv2 32)))} assume 0bv32 == ~bvurem32(main_~i~0, 2bv32);main_~j~0 := ~bvadd32(2bv32, main_~j~0); {764#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~i~0 (_ bv2 32)))} is VALID [2020-07-28 18:17:28,063 INFO L280 TraceCheckUtils]: 2: Hoare triple {764#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~i~0 (_ bv2 32)))} assume !!(0bv32 != main_#t~nondet1);havoc main_#t~nondet1;main_#t~post2 := main_~a~0;main_~a~0 := ~bvadd32(1bv32, main_#t~post2);havoc main_#t~post2;main_~b~0 := ~bvadd32(main_~b~0, ~bvsub32(main_~j~0, main_~i~0));main_~i~0 := ~bvadd32(2bv32, main_~i~0); {764#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~i~0 (_ bv2 32)))} is VALID [2020-07-28 18:17:28,064 INFO L280 TraceCheckUtils]: 1: Hoare triple {705#true} assume 0bv32 != main_~flag~0;main_~i~0 := 0bv32; {764#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~i~0 (_ bv2 32)))} is VALID [2020-07-28 18:17:28,064 INFO L280 TraceCheckUtils]: 0: Hoare triple {705#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post2, main_#t~post3, main_#t~nondet1, main_~i~0, main_~j~0, main_~a~0, main_~b~0, main_~flag~0;havoc main_~i~0;havoc main_~j~0;havoc main_~a~0;havoc main_~b~0;main_~flag~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 0bv32;main_~b~0 := 0bv32;main_~j~0 := 1bv32; {705#true} is VALID [2020-07-28 18:17:28,064 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-28 18:17:28,064 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1788747219] [2020-07-28 18:17:28,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-28 18:17:28,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2020-07-28 18:17:28,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954091363] [2020-07-28 18:17:28,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-07-28 18:17:28,065 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:17:28,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-28 18:17:28,082 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:17:28,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-28 18:17:28,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 18:17:28,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-28 18:17:28,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-28 18:17:28,083 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2020-07-28 18:17:28,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:17:28,100 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2020-07-28 18:17:28,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-28 18:17:28,100 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-07-28 18:17:28,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:17:28,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 18:17:28,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2020-07-28 18:17:28,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 18:17:28,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2020-07-28 18:17:28,102 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 11 transitions. [2020-07-28 18:17:28,120 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:17:28,120 INFO L225 Difference]: With dead ends: 13 [2020-07-28 18:17:28,120 INFO L226 Difference]: Without dead ends: 0 [2020-07-28 18:17:28,121 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-28 18:17:28,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-28 18:17:28,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-28 18:17:28,122 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:17:28,122 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-28 18:17:28,122 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 18:17:28,122 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 18:17:28,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:17:28,123 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 18:17:28,123 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:17:28,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:17:28,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:17:28,123 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 18:17:28,124 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 18:17:28,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:17:28,124 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 18:17:28,124 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:17:28,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:17:28,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:17:28,125 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:17:28,125 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:17:28,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-28 18:17:28,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-28 18:17:28,125 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2020-07-28 18:17:28,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:17:28,126 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-28 18:17:28,126 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-28 18:17:28,126 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:17:28,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:17:28,327 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-07-28 18:17:28,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-28 18:17:28,373 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-28 18:17:28,373 INFO L268 CegarLoopResult]: For program point L19(lines 19 23) no Hoare annotation was computed. [2020-07-28 18:17:28,373 INFO L268 CegarLoopResult]: For program point L7(lines 7 9) no Hoare annotation was computed. [2020-07-28 18:17:28,373 INFO L271 CegarLoopResult]: At program point L34(lines 34 36) the Hoare annotation is: true [2020-07-28 18:17:28,374 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-28 18:17:28,374 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-28 18:17:28,374 INFO L268 CegarLoopResult]: For program point L28(lines 28 32) no Hoare annotation was computed. [2020-07-28 18:17:28,374 INFO L268 CegarLoopResult]: For program point L28-2(lines 13 38) no Hoare annotation was computed. [2020-07-28 18:17:28,374 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-28 18:17:28,374 INFO L268 CegarLoopResult]: For program point L24-1(lines 13 38) no Hoare annotation was computed. [2020-07-28 18:17:28,374 INFO L268 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2020-07-28 18:17:28,374 INFO L271 CegarLoopResult]: At program point L37(lines 13 38) the Hoare annotation is: true [2020-07-28 18:17:28,379 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 18:17:28,379 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-28 18:17:28,379 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-28 18:17:28,379 WARN L170 areAnnotationChecker]: L28-2 has no Hoare annotation [2020-07-28 18:17:28,379 WARN L170 areAnnotationChecker]: L28-2 has no Hoare annotation [2020-07-28 18:17:28,379 WARN L170 areAnnotationChecker]: L28-2 has no Hoare annotation [2020-07-28 18:17:28,379 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2020-07-28 18:17:28,379 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2020-07-28 18:17:28,380 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-28 18:17:28,380 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-28 18:17:28,380 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-28 18:17:28,380 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-28 18:17:28,380 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-28 18:17:28,380 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-28 18:17:28,380 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 18:17:28,380 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 18:17:28,380 INFO L163 areAnnotationChecker]: CFG has 1 edges. 1 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-28 18:17:28,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 06:17:28 BoogieIcfgContainer [2020-07-28 18:17:28,386 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 18:17:28,387 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 18:17:28,387 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 18:17:28,387 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 18:17:28,388 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:16:52" (3/4) ... [2020-07-28 18:17:28,391 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-07-28 18:17:28,402 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-07-28 18:17:28,402 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-07-28 18:17:28,451 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 18:17:28,451 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 18:17:28,454 INFO L168 Benchmark]: Toolchain (without parser) took 36451.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 188.7 MB). Free memory was 957.5 MB in the beginning and 1.1 GB in the end (delta: -142.9 MB). Peak memory consumption was 45.9 MB. Max. memory is 11.5 GB. [2020-07-28 18:17:28,454 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 18:17:28,455 INFO L168 Benchmark]: CACSL2BoogieTranslator took 303.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:17:28,456 INFO L168 Benchmark]: Boogie Procedure Inliner took 109.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -171.0 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-28 18:17:28,456 INFO L168 Benchmark]: Boogie Preprocessor took 21.33 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:17:28,457 INFO L168 Benchmark]: RCFGBuilder took 403.77 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.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2020-07-28 18:17:28,458 INFO L168 Benchmark]: TraceAbstraction took 35539.91 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 60.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -1.9 MB). Peak memory consumption was 58.9 MB. Max. memory is 11.5 GB. [2020-07-28 18:17:28,458 INFO L168 Benchmark]: Witness Printer took 64.66 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:17:28,461 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 303.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 109.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -171.0 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.33 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 403.77 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.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 35539.91 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 60.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -1.9 MB). Peak memory consumption was 58.9 MB. Max. memory is 11.5 GB. * Witness Printer took 64.66 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. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: 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: 13]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 12 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 35.4s, OverallIterations: 7, TraceHistogramMax: 3, AutomataDifference: 19.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 58 SDtfs, 34 SDslu, 88 SDs, 0 SdLazy, 126 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 7.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 16 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 4 NumberOfFragments, 2 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 9.7s InterpolantComputationTime, 58 NumberOfCodeBlocks, 58 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 102 ConstructedInterpolants, 0 QuantifiedInterpolants, 2981 SizeOfPredicates, 16 NumberOfNonLiveVariables, 146 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 14 InterpolantComputations, 9 PerfectInterpolantSequences, 20/32 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...