/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/invert_string-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:50:11,262 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:50:11,264 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:50:11,276 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:50:11,276 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:50:11,277 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:50:11,278 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:50:11,280 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:50:11,282 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:50:11,282 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:50:11,283 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:50:11,284 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:50:11,285 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:50:11,286 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:50:11,287 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:50:11,288 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:50:11,288 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:50:11,289 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:50:11,291 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:50:11,293 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:50:11,295 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:50:11,296 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:50:11,297 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:50:11,298 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:50:11,301 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:50:11,301 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:50:11,301 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:50:11,302 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:50:11,303 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:50:11,304 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:50:11,304 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:50:11,305 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:50:11,306 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:50:11,308 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:50:11,309 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:50:11,310 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:50:11,310 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:50:11,311 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:50:11,311 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:50:11,312 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:50:11,312 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:50:11,313 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-17 22:50:11,328 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:50:11,329 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:50:11,330 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:50:11,330 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:50:11,330 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:50:11,330 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:50:11,330 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:50:11,331 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:50:11,331 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:50:11,331 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:50:11,331 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:50:11,331 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:50:11,332 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:50:11,332 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:50:11,332 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:50:11,332 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:50:11,332 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:50:11,333 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:50:11,333 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:50:11,333 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:50:11,333 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:50:11,333 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:50:11,334 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:50:11,334 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:50:11,334 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:50:11,334 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:50:11,334 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:50:11,335 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:50:11,335 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:50:11,335 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:50:11,633 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:50:11,646 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:50:11,649 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:50:11,651 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:50:11,651 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:50:11,651 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/invert_string-1.c [2020-07-17 22:50:11,720 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/337a07946/b973a83565804b90b01fa768eca02730/FLAG1a93b1b28 [2020-07-17 22:50:12,198 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:50:12,199 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/invert_string-1.c [2020-07-17 22:50:12,205 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/337a07946/b973a83565804b90b01fa768eca02730/FLAG1a93b1b28 [2020-07-17 22:50:12,634 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/337a07946/b973a83565804b90b01fa768eca02730 [2020-07-17 22:50:12,645 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:50:12,648 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:50:12,649 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:50:12,650 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:50:12,653 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:50:12,655 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:50:12" (1/1) ... [2020-07-17 22:50:12,658 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8d81a21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:12, skipping insertion in model container [2020-07-17 22:50:12,658 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:50:12" (1/1) ... [2020-07-17 22:50:12,666 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:50:12,684 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:50:12,868 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:50:12,873 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:50:12,901 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:50:12,921 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:50:12,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:12 WrapperNode [2020-07-17 22:50:12,922 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:50:12,923 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:50:12,923 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:50:12,923 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:50:13,014 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:12" (1/1) ... [2020-07-17 22:50:13,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:12" (1/1) ... [2020-07-17 22:50:13,022 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:12" (1/1) ... [2020-07-17 22:50:13,022 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:12" (1/1) ... [2020-07-17 22:50:13,039 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:12" (1/1) ... [2020-07-17 22:50:13,051 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:12" (1/1) ... [2020-07-17 22:50:13,052 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:12" (1/1) ... [2020-07-17 22:50:13,057 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:50:13,058 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:50:13,058 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:50:13,060 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:50:13,061 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:12" (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-17 22:50:13,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:50:13,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:50:13,120 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-17 22:50:13,120 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:50:13,120 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:50:13,121 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-17 22:50:13,121 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-17 22:50:13,121 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-07-17 22:50:13,121 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2020-07-17 22:50:13,121 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:50:13,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-17 22:50:13,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-17 22:50:13,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-17 22:50:13,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-17 22:50:13,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:50:13,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:50:13,521 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:50:13,521 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-17 22:50:13,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:50:13 BoogieIcfgContainer [2020-07-17 22:50:13,525 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:50:13,526 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:50:13,526 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:50:13,529 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:50:13,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:50:12" (1/3) ... [2020-07-17 22:50:13,530 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48097f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:50:13, skipping insertion in model container [2020-07-17 22:50:13,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:12" (2/3) ... [2020-07-17 22:50:13,531 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48097f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:50:13, skipping insertion in model container [2020-07-17 22:50:13,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:50:13" (3/3) ... [2020-07-17 22:50:13,533 INFO L109 eAbstractionObserver]: Analyzing ICFG invert_string-1.c [2020-07-17 22:50:13,542 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:50:13,549 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:50:13,562 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:50:13,580 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:50:13,580 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:50:13,580 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:50:13,581 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:50:13,581 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:50:13,581 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:50:13,581 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:50:13,581 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:50:13,596 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2020-07-17 22:50:13,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-17 22:50:13,601 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:13,602 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:13,603 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:13,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:13,608 INFO L82 PathProgramCache]: Analyzing trace with hash -474003824, now seen corresponding path program 1 times [2020-07-17 22:50:13,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:13,616 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744253522] [2020-07-17 22:50:13,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:13,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:13,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:13,830 INFO L280 TraceCheckUtils]: 0: Hoare triple {37#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {32#true} is VALID [2020-07-17 22:50:13,831 INFO L280 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2020-07-17 22:50:13,831 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #70#return; {32#true} is VALID [2020-07-17 22:50:13,834 INFO L263 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {37#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:50:13,834 INFO L280 TraceCheckUtils]: 1: Hoare triple {37#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {32#true} is VALID [2020-07-17 22:50:13,835 INFO L280 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2020-07-17 22:50:13,835 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #70#return; {32#true} is VALID [2020-07-17 22:50:13,836 INFO L263 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret10 := main(); {32#true} is VALID [2020-07-17 22:50:13,836 INFO L280 TraceCheckUtils]: 5: Hoare triple {32#true} ~MAX~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0; {32#true} is VALID [2020-07-17 22:50:13,837 INFO L280 TraceCheckUtils]: 6: Hoare triple {32#true} assume !(~MAX~0 > 0);assume false; {33#false} is VALID [2020-07-17 22:50:13,837 INFO L280 TraceCheckUtils]: 7: Hoare triple {33#false} call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~MAX~0);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~MAX~0);havoc ~cont~0;havoc ~i~0;havoc ~j~0;~cont~0 := 0;~i~0 := 0; {33#false} is VALID [2020-07-17 22:50:13,838 INFO L280 TraceCheckUtils]: 8: Hoare triple {33#false} assume !(~i~0 < ~MAX~0); {33#false} is VALID [2020-07-17 22:50:13,838 INFO L280 TraceCheckUtils]: 9: Hoare triple {33#false} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~MAX~0 - 1), 1);~j~0 := 0;~i~0 := ~MAX~0 - 1; {33#false} is VALID [2020-07-17 22:50:13,838 INFO L280 TraceCheckUtils]: 10: Hoare triple {33#false} assume !(~i~0 >= 0); {33#false} is VALID [2020-07-17 22:50:13,839 INFO L280 TraceCheckUtils]: 11: Hoare triple {33#false} ~j~0 := ~MAX~0 - 1;~i~0 := 0; {33#false} is VALID [2020-07-17 22:50:13,839 INFO L280 TraceCheckUtils]: 12: Hoare triple {33#false} assume !!(~i~0 < ~MAX~0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem8 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {33#false} is VALID [2020-07-17 22:50:13,839 INFO L263 TraceCheckUtils]: 13: Hoare triple {33#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {33#false} is VALID [2020-07-17 22:50:13,840 INFO L280 TraceCheckUtils]: 14: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2020-07-17 22:50:13,840 INFO L280 TraceCheckUtils]: 15: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2020-07-17 22:50:13,841 INFO L280 TraceCheckUtils]: 16: Hoare triple {33#false} assume !false; {33#false} is VALID [2020-07-17 22:50:13,842 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-17 22:50:13,843 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744253522] [2020-07-17 22:50:13,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:50:13,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:50:13,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967171261] [2020-07-17 22:50:13,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-07-17 22:50:13,854 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:13,858 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:50:13,921 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:13,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:50:13,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:13,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:50:13,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:50:13,934 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2020-07-17 22:50:14,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:14,133 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2020-07-17 22:50:14,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:50:14,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-07-17 22:50:14,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:14,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:50:14,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2020-07-17 22:50:14,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:50:14,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2020-07-17 22:50:14,152 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 65 transitions. [2020-07-17 22:50:14,255 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:14,266 INFO L225 Difference]: With dead ends: 51 [2020-07-17 22:50:14,266 INFO L226 Difference]: Without dead ends: 24 [2020-07-17 22:50:14,270 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-17 22:50:14,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-17 22:50:14,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-07-17 22:50:14,315 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:14,316 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2020-07-17 22:50:14,316 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-17 22:50:14,317 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-17 22:50:14,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:14,321 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2020-07-17 22:50:14,321 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2020-07-17 22:50:14,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:14,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:14,322 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-17 22:50:14,322 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-17 22:50:14,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:14,326 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2020-07-17 22:50:14,326 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2020-07-17 22:50:14,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:14,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:14,327 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:14,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:14,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-17 22:50:14,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2020-07-17 22:50:14,332 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 17 [2020-07-17 22:50:14,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:14,332 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2020-07-17 22:50:14,333 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:50:14,333 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2020-07-17 22:50:14,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-17 22:50:14,334 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:14,334 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:14,334 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:50:14,335 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:14,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:14,335 INFO L82 PathProgramCache]: Analyzing trace with hash 227060754, now seen corresponding path program 1 times [2020-07-17 22:50:14,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:14,336 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880323828] [2020-07-17 22:50:14,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:14,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:14,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:14,469 INFO L280 TraceCheckUtils]: 0: Hoare triple {193#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {186#true} is VALID [2020-07-17 22:50:14,469 INFO L280 TraceCheckUtils]: 1: Hoare triple {186#true} assume true; {186#true} is VALID [2020-07-17 22:50:14,469 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {186#true} {186#true} #70#return; {186#true} is VALID [2020-07-17 22:50:14,471 INFO L263 TraceCheckUtils]: 0: Hoare triple {186#true} call ULTIMATE.init(); {193#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:50:14,471 INFO L280 TraceCheckUtils]: 1: Hoare triple {193#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {186#true} is VALID [2020-07-17 22:50:14,471 INFO L280 TraceCheckUtils]: 2: Hoare triple {186#true} assume true; {186#true} is VALID [2020-07-17 22:50:14,472 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {186#true} {186#true} #70#return; {186#true} is VALID [2020-07-17 22:50:14,472 INFO L263 TraceCheckUtils]: 4: Hoare triple {186#true} call #t~ret10 := main(); {186#true} is VALID [2020-07-17 22:50:14,472 INFO L280 TraceCheckUtils]: 5: Hoare triple {186#true} ~MAX~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0; {186#true} is VALID [2020-07-17 22:50:14,474 INFO L280 TraceCheckUtils]: 6: Hoare triple {186#true} assume !!(~MAX~0 > 0); {191#(<= 1 main_~MAX~0)} is VALID [2020-07-17 22:50:14,475 INFO L280 TraceCheckUtils]: 7: Hoare triple {191#(<= 1 main_~MAX~0)} call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~MAX~0);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~MAX~0);havoc ~cont~0;havoc ~i~0;havoc ~j~0;~cont~0 := 0;~i~0 := 0; {192#(and (= 0 main_~i~0) (<= 1 main_~MAX~0))} is VALID [2020-07-17 22:50:14,476 INFO L280 TraceCheckUtils]: 8: Hoare triple {192#(and (= 0 main_~i~0) (<= 1 main_~MAX~0))} assume !(~i~0 < ~MAX~0); {187#false} is VALID [2020-07-17 22:50:14,476 INFO L280 TraceCheckUtils]: 9: Hoare triple {187#false} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~MAX~0 - 1), 1);~j~0 := 0;~i~0 := ~MAX~0 - 1; {187#false} is VALID [2020-07-17 22:50:14,477 INFO L280 TraceCheckUtils]: 10: Hoare triple {187#false} assume !(~i~0 >= 0); {187#false} is VALID [2020-07-17 22:50:14,477 INFO L280 TraceCheckUtils]: 11: Hoare triple {187#false} ~j~0 := ~MAX~0 - 1;~i~0 := 0; {187#false} is VALID [2020-07-17 22:50:14,477 INFO L280 TraceCheckUtils]: 12: Hoare triple {187#false} assume !!(~i~0 < ~MAX~0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem8 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {187#false} is VALID [2020-07-17 22:50:14,478 INFO L263 TraceCheckUtils]: 13: Hoare triple {187#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {187#false} is VALID [2020-07-17 22:50:14,478 INFO L280 TraceCheckUtils]: 14: Hoare triple {187#false} ~cond := #in~cond; {187#false} is VALID [2020-07-17 22:50:14,478 INFO L280 TraceCheckUtils]: 15: Hoare triple {187#false} assume 0 == ~cond; {187#false} is VALID [2020-07-17 22:50:14,479 INFO L280 TraceCheckUtils]: 16: Hoare triple {187#false} assume !false; {187#false} is VALID [2020-07-17 22:50:14,480 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-17 22:50:14,480 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880323828] [2020-07-17 22:50:14,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:50:14,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:50:14,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253951646] [2020-07-17 22:50:14,483 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-07-17 22:50:14,483 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:14,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:50:14,509 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:14,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:50:14,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:14,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:50:14,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:50:14,511 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 5 states. [2020-07-17 22:50:14,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:14,745 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2020-07-17 22:50:14,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:50:14,745 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-07-17 22:50:14,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:14,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:50:14,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2020-07-17 22:50:14,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:50:14,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2020-07-17 22:50:14,753 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 49 transitions. [2020-07-17 22:50:14,820 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:14,823 INFO L225 Difference]: With dead ends: 44 [2020-07-17 22:50:14,823 INFO L226 Difference]: Without dead ends: 30 [2020-07-17 22:50:14,825 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:50:14,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-17 22:50:14,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2020-07-17 22:50:14,844 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:14,844 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 25 states. [2020-07-17 22:50:14,844 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 25 states. [2020-07-17 22:50:14,844 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 25 states. [2020-07-17 22:50:14,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:14,849 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-07-17 22:50:14,849 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-17 22:50:14,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:14,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:14,850 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 30 states. [2020-07-17 22:50:14,850 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 30 states. [2020-07-17 22:50:14,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:14,854 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-07-17 22:50:14,854 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-17 22:50:14,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:14,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:14,855 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:14,855 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:14,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-17 22:50:14,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2020-07-17 22:50:14,858 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 17 [2020-07-17 22:50:14,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:14,858 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2020-07-17 22:50:14,858 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:50:14,858 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-17 22:50:14,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-17 22:50:14,859 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:14,859 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:14,859 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:50:14,860 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:14,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:14,860 INFO L82 PathProgramCache]: Analyzing trace with hash -714610672, now seen corresponding path program 1 times [2020-07-17 22:50:14,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:14,861 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362058736] [2020-07-17 22:50:14,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:14,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:14,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:14,960 INFO L280 TraceCheckUtils]: 0: Hoare triple {360#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {353#true} is VALID [2020-07-17 22:50:14,961 INFO L280 TraceCheckUtils]: 1: Hoare triple {353#true} assume true; {353#true} is VALID [2020-07-17 22:50:14,961 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {353#true} {353#true} #70#return; {353#true} is VALID [2020-07-17 22:50:14,962 INFO L263 TraceCheckUtils]: 0: Hoare triple {353#true} call ULTIMATE.init(); {360#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:50:14,962 INFO L280 TraceCheckUtils]: 1: Hoare triple {360#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {353#true} is VALID [2020-07-17 22:50:14,963 INFO L280 TraceCheckUtils]: 2: Hoare triple {353#true} assume true; {353#true} is VALID [2020-07-17 22:50:14,963 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {353#true} {353#true} #70#return; {353#true} is VALID [2020-07-17 22:50:14,963 INFO L263 TraceCheckUtils]: 4: Hoare triple {353#true} call #t~ret10 := main(); {353#true} is VALID [2020-07-17 22:50:14,964 INFO L280 TraceCheckUtils]: 5: Hoare triple {353#true} ~MAX~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0; {353#true} is VALID [2020-07-17 22:50:14,965 INFO L280 TraceCheckUtils]: 6: Hoare triple {353#true} assume !!(~MAX~0 > 0); {358#(<= 1 main_~MAX~0)} is VALID [2020-07-17 22:50:14,965 INFO L280 TraceCheckUtils]: 7: Hoare triple {358#(<= 1 main_~MAX~0)} call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~MAX~0);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~MAX~0);havoc ~cont~0;havoc ~i~0;havoc ~j~0;~cont~0 := 0;~i~0 := 0; {358#(<= 1 main_~MAX~0)} is VALID [2020-07-17 22:50:14,966 INFO L280 TraceCheckUtils]: 8: Hoare triple {358#(<= 1 main_~MAX~0)} assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet2; {358#(<= 1 main_~MAX~0)} is VALID [2020-07-17 22:50:14,967 INFO L280 TraceCheckUtils]: 9: Hoare triple {358#(<= 1 main_~MAX~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {358#(<= 1 main_~MAX~0)} is VALID [2020-07-17 22:50:14,968 INFO L280 TraceCheckUtils]: 10: Hoare triple {358#(<= 1 main_~MAX~0)} assume !(~i~0 < ~MAX~0); {358#(<= 1 main_~MAX~0)} is VALID [2020-07-17 22:50:14,970 INFO L280 TraceCheckUtils]: 11: Hoare triple {358#(<= 1 main_~MAX~0)} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~MAX~0 - 1), 1);~j~0 := 0;~i~0 := ~MAX~0 - 1; {359#(<= 0 main_~i~0)} is VALID [2020-07-17 22:50:14,971 INFO L280 TraceCheckUtils]: 12: Hoare triple {359#(<= 0 main_~i~0)} assume !(~i~0 >= 0); {354#false} is VALID [2020-07-17 22:50:14,971 INFO L280 TraceCheckUtils]: 13: Hoare triple {354#false} ~j~0 := ~MAX~0 - 1;~i~0 := 0; {354#false} is VALID [2020-07-17 22:50:14,971 INFO L280 TraceCheckUtils]: 14: Hoare triple {354#false} assume !!(~i~0 < ~MAX~0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem8 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); {354#false} is VALID [2020-07-17 22:50:14,972 INFO L263 TraceCheckUtils]: 15: Hoare triple {354#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {354#false} is VALID [2020-07-17 22:50:14,972 INFO L280 TraceCheckUtils]: 16: Hoare triple {354#false} ~cond := #in~cond; {354#false} is VALID [2020-07-17 22:50:14,972 INFO L280 TraceCheckUtils]: 17: Hoare triple {354#false} assume 0 == ~cond; {354#false} is VALID [2020-07-17 22:50:14,972 INFO L280 TraceCheckUtils]: 18: Hoare triple {354#false} assume !false; {354#false} is VALID [2020-07-17 22:50:14,974 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-17 22:50:14,974 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362058736] [2020-07-17 22:50:14,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:50:14,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:50:14,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883296773] [2020-07-17 22:50:14,976 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-07-17 22:50:14,976 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:14,976 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:50:15,001 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-17 22:50:15,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:50:15,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:15,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:50:15,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:50:15,003 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 5 states. [2020-07-17 22:50:15,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:15,230 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2020-07-17 22:50:15,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:50:15,230 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-07-17 22:50:15,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:15,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:50:15,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2020-07-17 22:50:15,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:50:15,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2020-07-17 22:50:15,237 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 39 transitions. [2020-07-17 22:50:15,295 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:15,297 INFO L225 Difference]: With dead ends: 37 [2020-07-17 22:50:15,297 INFO L226 Difference]: Without dead ends: 26 [2020-07-17 22:50:15,298 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:50:15,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-17 22:50:15,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-07-17 22:50:15,319 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:15,319 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2020-07-17 22:50:15,319 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2020-07-17 22:50:15,320 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2020-07-17 22:50:15,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:15,322 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2020-07-17 22:50:15,323 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2020-07-17 22:50:15,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:15,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:15,324 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2020-07-17 22:50:15,324 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2020-07-17 22:50:15,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:15,326 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2020-07-17 22:50:15,326 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2020-07-17 22:50:15,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:15,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:15,327 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:15,327 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:15,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-17 22:50:15,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2020-07-17 22:50:15,330 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 19 [2020-07-17 22:50:15,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:15,330 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2020-07-17 22:50:15,330 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:50:15,330 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2020-07-17 22:50:15,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-17 22:50:15,331 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:15,331 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:15,332 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 22:50:15,332 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:15,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:15,332 INFO L82 PathProgramCache]: Analyzing trace with hash 483863630, now seen corresponding path program 1 times [2020-07-17 22:50:15,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:15,333 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330822416] [2020-07-17 22:50:15,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:15,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:15,405 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-17 22:50:15,406 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:337) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:239) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:108) 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-17 22:50:15,412 INFO L168 Benchmark]: Toolchain (without parser) took 2764.17 ms. Allocated memory was 136.8 MB in the beginning and 230.2 MB in the end (delta: 93.3 MB). Free memory was 101.2 MB in the beginning and 76.1 MB in the end (delta: 25.1 MB). Peak memory consumption was 118.4 MB. Max. memory is 7.1 GB. [2020-07-17 22:50:15,413 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 136.8 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-17 22:50:15,414 INFO L168 Benchmark]: CACSL2BoogieTranslator took 272.90 ms. Allocated memory is still 136.8 MB. Free memory was 100.8 MB in the beginning and 90.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. [2020-07-17 22:50:15,415 INFO L168 Benchmark]: Boogie Preprocessor took 134.86 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 90.1 MB in the beginning and 177.6 MB in the end (delta: -87.5 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2020-07-17 22:50:15,415 INFO L168 Benchmark]: RCFGBuilder took 467.02 ms. Allocated memory is still 200.3 MB. Free memory was 177.6 MB in the beginning and 153.6 MB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 7.1 GB. [2020-07-17 22:50:15,416 INFO L168 Benchmark]: TraceAbstraction took 1882.56 ms. Allocated memory was 200.3 MB in the beginning and 230.2 MB in the end (delta: 29.9 MB). Free memory was 152.9 MB in the beginning and 76.1 MB in the end (delta: 76.7 MB). Peak memory consumption was 106.6 MB. Max. memory is 7.1 GB. [2020-07-17 22:50:15,424 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.22 ms. Allocated memory is still 136.8 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 272.90 ms. Allocated memory is still 136.8 MB. Free memory was 100.8 MB in the beginning and 90.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 134.86 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 90.1 MB in the beginning and 177.6 MB in the end (delta: -87.5 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 467.02 ms. Allocated memory is still 200.3 MB. Free memory was 177.6 MB in the beginning and 153.6 MB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1882.56 ms. Allocated memory was 200.3 MB in the beginning and 230.2 MB in the end (delta: 29.9 MB). Free memory was 152.9 MB in the beginning and 76.1 MB in the end (delta: 76.7 MB). Peak memory consumption was 106.6 MB. Max. memory is 7.1 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...