/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/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/array-examples/data_structures_set_multi_proc_trivial_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 00:47:06,469 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 00:47:06,471 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 00:47:06,483 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 00:47:06,483 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 00:47:06,484 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 00:47:06,485 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 00:47:06,488 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 00:47:06,490 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 00:47:06,491 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 00:47:06,492 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 00:47:06,493 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 00:47:06,493 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 00:47:06,494 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 00:47:06,495 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 00:47:06,496 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 00:47:06,497 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 00:47:06,498 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 00:47:06,501 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 00:47:06,502 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 00:47:06,506 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 00:47:06,507 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 00:47:06,508 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 00:47:06,509 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 00:47:06,511 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 00:47:06,511 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 00:47:06,512 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 00:47:06,512 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 00:47:06,513 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 00:47:06,514 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 00:47:06,514 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 00:47:06,515 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 00:47:06,516 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 00:47:06,516 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 00:47:06,517 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 00:47:06,517 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 00:47:06,518 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 00:47:06,519 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 00:47:06,519 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 00:47:06,520 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 00:47:06,521 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 00:47:06,522 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 00:47:06,530 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 00:47:06,531 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 00:47:06,532 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 00:47:06,532 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 00:47:06,532 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 00:47:06,532 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 00:47:06,533 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 00:47:06,533 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 00:47:06,533 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 00:47:06,533 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 00:47:06,533 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 00:47:06,534 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 00:47:06,534 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 00:47:06,534 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 00:47:06,534 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 00:47:06,534 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 00:47:06,535 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 00:47:06,535 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 00:47:06,535 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:47:06,535 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 00:47:06,535 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 00:47:06,536 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 00:47:06,536 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-18 00:47:06,855 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 00:47:06,867 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 00:47:06,870 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 00:47:06,871 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 00:47:06,871 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 00:47:06,872 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/data_structures_set_multi_proc_trivial_ground.i [2020-07-18 00:47:06,942 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b9c1e217/484374d3d8a847c8bf117771df438174/FLAGc93ea5c89 [2020-07-18 00:47:07,433 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 00:47:07,433 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/data_structures_set_multi_proc_trivial_ground.i [2020-07-18 00:47:07,441 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b9c1e217/484374d3d8a847c8bf117771df438174/FLAGc93ea5c89 [2020-07-18 00:47:07,809 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b9c1e217/484374d3d8a847c8bf117771df438174 [2020-07-18 00:47:07,819 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 00:47:07,822 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 00:47:07,823 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 00:47:07,823 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 00:47:07,829 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 00:47:07,831 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:47:07" (1/1) ... [2020-07-18 00:47:07,834 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@282a9d8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:07, skipping insertion in model container [2020-07-18 00:47:07,835 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:47:07" (1/1) ... [2020-07-18 00:47:07,843 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 00:47:07,862 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 00:47:08,034 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:47:08,043 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 00:47:08,077 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:47:08,182 INFO L208 MainTranslator]: Completed translation [2020-07-18 00:47:08,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:08 WrapperNode [2020-07-18 00:47:08,183 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 00:47:08,184 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 00:47:08,184 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 00:47:08,184 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 00:47:08,198 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:08" (1/1) ... [2020-07-18 00:47:08,198 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:08" (1/1) ... [2020-07-18 00:47:08,205 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:08" (1/1) ... [2020-07-18 00:47:08,206 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:08" (1/1) ... [2020-07-18 00:47:08,220 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:08" (1/1) ... [2020-07-18 00:47:08,231 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:08" (1/1) ... [2020-07-18 00:47:08,233 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:08" (1/1) ... [2020-07-18 00:47:08,238 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 00:47:08,239 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 00:47:08,239 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 00:47:08,239 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 00:47:08,241 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:08" (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-18 00:47:08,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 00:47:08,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 00:47:08,302 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-18 00:47:08,303 INFO L138 BoogieDeclarations]: Found implementation of procedure insert [2020-07-18 00:47:08,303 INFO L138 BoogieDeclarations]: Found implementation of procedure elem_exists [2020-07-18 00:47:08,303 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 00:47:08,303 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 00:47:08,303 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-18 00:47:08,303 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 00:47:08,303 INFO L130 BoogieDeclarations]: Found specification of procedure insert [2020-07-18 00:47:08,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-18 00:47:08,304 INFO L130 BoogieDeclarations]: Found specification of procedure elem_exists [2020-07-18 00:47:08,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-18 00:47:08,304 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 00:47:08,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-18 00:47:08,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-18 00:47:08,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 00:47:08,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 00:47:08,925 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 00:47:08,925 INFO L295 CfgBuilder]: Removed 10 assume(true) statements. [2020-07-18 00:47:08,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:47:08 BoogieIcfgContainer [2020-07-18 00:47:08,930 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 00:47:08,932 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 00:47:08,932 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 00:47:08,935 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 00:47:08,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 12:47:07" (1/3) ... [2020-07-18 00:47:08,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26357830 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:47:08, skipping insertion in model container [2020-07-18 00:47:08,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:08" (2/3) ... [2020-07-18 00:47:08,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26357830 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:47:08, skipping insertion in model container [2020-07-18 00:47:08,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:47:08" (3/3) ... [2020-07-18 00:47:08,939 INFO L109 eAbstractionObserver]: Analyzing ICFG data_structures_set_multi_proc_trivial_ground.i [2020-07-18 00:47:08,950 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 00:47:08,958 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 00:47:08,974 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 00:47:08,996 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 00:47:08,996 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 00:47:08,996 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-18 00:47:08,996 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 00:47:08,997 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 00:47:08,997 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 00:47:08,997 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 00:47:08,997 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 00:47:09,016 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states. [2020-07-18 00:47:09,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-18 00:47:09,027 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:09,028 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, 1, 1] [2020-07-18 00:47:09,028 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:09,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:09,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1588916751, now seen corresponding path program 1 times [2020-07-18 00:47:09,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:09,045 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1680430143] [2020-07-18 00:47:09,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:47:09,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:09,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:09,251 INFO L280 TraceCheckUtils]: 0: Hoare triple {142#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {135#true} is VALID [2020-07-18 00:47:09,251 INFO L280 TraceCheckUtils]: 1: Hoare triple {135#true} #valid := #valid[0 := 0]; {135#true} is VALID [2020-07-18 00:47:09,252 INFO L280 TraceCheckUtils]: 2: Hoare triple {135#true} assume 0 < #StackHeapBarrier; {135#true} is VALID [2020-07-18 00:47:09,252 INFO L280 TraceCheckUtils]: 3: Hoare triple {135#true} assume true; {135#true} is VALID [2020-07-18 00:47:09,253 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {135#true} {135#true} #247#return; {135#true} is VALID [2020-07-18 00:47:09,256 INFO L263 TraceCheckUtils]: 0: Hoare triple {135#true} call ULTIMATE.init(); {142#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:47:09,257 INFO L280 TraceCheckUtils]: 1: Hoare triple {142#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {135#true} is VALID [2020-07-18 00:47:09,257 INFO L280 TraceCheckUtils]: 2: Hoare triple {135#true} #valid := #valid[0 := 0]; {135#true} is VALID [2020-07-18 00:47:09,257 INFO L280 TraceCheckUtils]: 3: Hoare triple {135#true} assume 0 < #StackHeapBarrier; {135#true} is VALID [2020-07-18 00:47:09,258 INFO L280 TraceCheckUtils]: 4: Hoare triple {135#true} assume true; {135#true} is VALID [2020-07-18 00:47:09,258 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {135#true} {135#true} #247#return; {135#true} is VALID [2020-07-18 00:47:09,258 INFO L263 TraceCheckUtils]: 6: Hoare triple {135#true} call #t~ret23 := main(); {135#true} is VALID [2020-07-18 00:47:09,259 INFO L280 TraceCheckUtils]: 7: Hoare triple {135#true} ~n~0 := 0; {135#true} is VALID [2020-07-18 00:47:09,259 INFO L280 TraceCheckUtils]: 8: Hoare triple {135#true} SUMMARY for call ~#set~0.base, ~#set~0.offset := #Ultimate.allocOnStack(400000); srcloc: L18 {135#true} is VALID [2020-07-18 00:47:09,260 INFO L280 TraceCheckUtils]: 9: Hoare triple {135#true} havoc ~x~0; {135#true} is VALID [2020-07-18 00:47:09,260 INFO L280 TraceCheckUtils]: 10: Hoare triple {135#true} havoc ~y~0; {135#true} is VALID [2020-07-18 00:47:09,260 INFO L280 TraceCheckUtils]: 11: Hoare triple {135#true} ~x~0 := 0; {135#true} is VALID [2020-07-18 00:47:09,262 INFO L280 TraceCheckUtils]: 12: Hoare triple {135#true} assume !true; {136#false} is VALID [2020-07-18 00:47:09,262 INFO L280 TraceCheckUtils]: 13: Hoare triple {136#false} ~x~0 := 0; {136#false} is VALID [2020-07-18 00:47:09,263 INFO L280 TraceCheckUtils]: 14: Hoare triple {136#false} assume !!(~x~0 < ~n~0); {136#false} is VALID [2020-07-18 00:47:09,263 INFO L280 TraceCheckUtils]: 15: Hoare triple {136#false} ~y~0 := 1 + ~x~0; {136#false} is VALID [2020-07-18 00:47:09,263 INFO L280 TraceCheckUtils]: 16: Hoare triple {136#false} assume !!(~y~0 < ~n~0); {136#false} is VALID [2020-07-18 00:47:09,264 INFO L280 TraceCheckUtils]: 17: Hoare triple {136#false} SUMMARY for call #t~mem6 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4); srcloc: L30 {136#false} is VALID [2020-07-18 00:47:09,264 INFO L280 TraceCheckUtils]: 18: Hoare triple {136#false} SUMMARY for call #t~mem7 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); srcloc: L30-1 {136#false} is VALID [2020-07-18 00:47:09,264 INFO L263 TraceCheckUtils]: 19: Hoare triple {136#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {136#false} is VALID [2020-07-18 00:47:09,265 INFO L280 TraceCheckUtils]: 20: Hoare triple {136#false} ~cond := #in~cond; {136#false} is VALID [2020-07-18 00:47:09,265 INFO L280 TraceCheckUtils]: 21: Hoare triple {136#false} assume 0 == ~cond; {136#false} is VALID [2020-07-18 00:47:09,265 INFO L280 TraceCheckUtils]: 22: Hoare triple {136#false} assume !false; {136#false} is VALID [2020-07-18 00:47:09,269 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-18 00:47:09,271 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:47:09,273 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1680430143] [2020-07-18 00:47:09,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:47:09,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:47:09,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190714203] [2020-07-18 00:47:09,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-18 00:47:09,285 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:47:09,289 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:47:09,327 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:09,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:47:09,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:47:09,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:47:09,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:47:09,339 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 3 states. [2020-07-18 00:47:10,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:10,099 INFO L93 Difference]: Finished difference Result 245 states and 295 transitions. [2020-07-18 00:47:10,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:47:10,100 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-18 00:47:10,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:47:10,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:47:10,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 295 transitions. [2020-07-18 00:47:10,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:47:10,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 295 transitions. [2020-07-18 00:47:10,128 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 295 transitions. [2020-07-18 00:47:10,482 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 295 edges. 295 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:10,500 INFO L225 Difference]: With dead ends: 245 [2020-07-18 00:47:10,500 INFO L226 Difference]: Without dead ends: 123 [2020-07-18 00:47:10,505 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-18 00:47:10,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-07-18 00:47:10,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2020-07-18 00:47:10,630 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:47:10,630 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand 123 states. [2020-07-18 00:47:10,631 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 123 states. [2020-07-18 00:47:10,631 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 123 states. [2020-07-18 00:47:10,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:10,642 INFO L93 Difference]: Finished difference Result 123 states and 136 transitions. [2020-07-18 00:47:10,642 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 136 transitions. [2020-07-18 00:47:10,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:10,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:10,644 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 123 states. [2020-07-18 00:47:10,644 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 123 states. [2020-07-18 00:47:10,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:10,653 INFO L93 Difference]: Finished difference Result 123 states and 136 transitions. [2020-07-18 00:47:10,653 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 136 transitions. [2020-07-18 00:47:10,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:10,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:10,659 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:47:10,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:47:10,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-07-18 00:47:10,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 136 transitions. [2020-07-18 00:47:10,678 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 136 transitions. Word has length 23 [2020-07-18 00:47:10,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:47:10,679 INFO L479 AbstractCegarLoop]: Abstraction has 123 states and 136 transitions. [2020-07-18 00:47:10,679 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:47:10,679 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 123 states and 136 transitions. [2020-07-18 00:47:10,835 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:10,836 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 136 transitions. [2020-07-18 00:47:10,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-18 00:47:10,837 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:10,837 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, 1, 1] [2020-07-18 00:47:10,838 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 00:47:10,838 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:10,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:10,841 INFO L82 PathProgramCache]: Analyzing trace with hash -119454780, now seen corresponding path program 1 times [2020-07-18 00:47:10,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:10,841 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1719233253] [2020-07-18 00:47:10,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:47:10,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:10,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:10,950 INFO L280 TraceCheckUtils]: 0: Hoare triple {1135#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1127#true} is VALID [2020-07-18 00:47:10,950 INFO L280 TraceCheckUtils]: 1: Hoare triple {1127#true} #valid := #valid[0 := 0]; {1127#true} is VALID [2020-07-18 00:47:10,951 INFO L280 TraceCheckUtils]: 2: Hoare triple {1127#true} assume 0 < #StackHeapBarrier; {1127#true} is VALID [2020-07-18 00:47:10,951 INFO L280 TraceCheckUtils]: 3: Hoare triple {1127#true} assume true; {1127#true} is VALID [2020-07-18 00:47:10,951 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1127#true} {1127#true} #247#return; {1127#true} is VALID [2020-07-18 00:47:10,953 INFO L263 TraceCheckUtils]: 0: Hoare triple {1127#true} call ULTIMATE.init(); {1135#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:47:10,953 INFO L280 TraceCheckUtils]: 1: Hoare triple {1135#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1127#true} is VALID [2020-07-18 00:47:10,953 INFO L280 TraceCheckUtils]: 2: Hoare triple {1127#true} #valid := #valid[0 := 0]; {1127#true} is VALID [2020-07-18 00:47:10,953 INFO L280 TraceCheckUtils]: 3: Hoare triple {1127#true} assume 0 < #StackHeapBarrier; {1127#true} is VALID [2020-07-18 00:47:10,954 INFO L280 TraceCheckUtils]: 4: Hoare triple {1127#true} assume true; {1127#true} is VALID [2020-07-18 00:47:10,954 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1127#true} {1127#true} #247#return; {1127#true} is VALID [2020-07-18 00:47:10,954 INFO L263 TraceCheckUtils]: 6: Hoare triple {1127#true} call #t~ret23 := main(); {1127#true} is VALID [2020-07-18 00:47:10,955 INFO L280 TraceCheckUtils]: 7: Hoare triple {1127#true} ~n~0 := 0; {1127#true} is VALID [2020-07-18 00:47:10,955 INFO L280 TraceCheckUtils]: 8: Hoare triple {1127#true} SUMMARY for call ~#set~0.base, ~#set~0.offset := #Ultimate.allocOnStack(400000); srcloc: L18 {1127#true} is VALID [2020-07-18 00:47:10,955 INFO L280 TraceCheckUtils]: 9: Hoare triple {1127#true} havoc ~x~0; {1127#true} is VALID [2020-07-18 00:47:10,956 INFO L280 TraceCheckUtils]: 10: Hoare triple {1127#true} havoc ~y~0; {1127#true} is VALID [2020-07-18 00:47:10,957 INFO L280 TraceCheckUtils]: 11: Hoare triple {1127#true} ~x~0 := 0; {1134#(= 0 main_~x~0)} is VALID [2020-07-18 00:47:10,958 INFO L280 TraceCheckUtils]: 12: Hoare triple {1134#(= 0 main_~x~0)} assume !(~x~0 < 100000); {1128#false} is VALID [2020-07-18 00:47:10,958 INFO L280 TraceCheckUtils]: 13: Hoare triple {1128#false} ~x~0 := 0; {1128#false} is VALID [2020-07-18 00:47:10,959 INFO L280 TraceCheckUtils]: 14: Hoare triple {1128#false} assume !!(~x~0 < ~n~0); {1128#false} is VALID [2020-07-18 00:47:10,959 INFO L280 TraceCheckUtils]: 15: Hoare triple {1128#false} ~y~0 := 1 + ~x~0; {1128#false} is VALID [2020-07-18 00:47:10,959 INFO L280 TraceCheckUtils]: 16: Hoare triple {1128#false} assume !!(~y~0 < ~n~0); {1128#false} is VALID [2020-07-18 00:47:10,960 INFO L280 TraceCheckUtils]: 17: Hoare triple {1128#false} SUMMARY for call #t~mem6 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4); srcloc: L30 {1128#false} is VALID [2020-07-18 00:47:10,960 INFO L280 TraceCheckUtils]: 18: Hoare triple {1128#false} SUMMARY for call #t~mem7 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); srcloc: L30-1 {1128#false} is VALID [2020-07-18 00:47:10,960 INFO L263 TraceCheckUtils]: 19: Hoare triple {1128#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {1128#false} is VALID [2020-07-18 00:47:10,961 INFO L280 TraceCheckUtils]: 20: Hoare triple {1128#false} ~cond := #in~cond; {1128#false} is VALID [2020-07-18 00:47:10,961 INFO L280 TraceCheckUtils]: 21: Hoare triple {1128#false} assume 0 == ~cond; {1128#false} is VALID [2020-07-18 00:47:10,961 INFO L280 TraceCheckUtils]: 22: Hoare triple {1128#false} assume !false; {1128#false} is VALID [2020-07-18 00:47:10,962 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-18 00:47:10,967 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:47:10,968 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1719233253] [2020-07-18 00:47:10,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:47:10,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-18 00:47:10,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426268268] [2020-07-18 00:47:10,970 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-07-18 00:47:10,970 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:47:10,970 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-18 00:47:10,996 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:10,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-18 00:47:10,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:47:10,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-18 00:47:10,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-18 00:47:10,997 INFO L87 Difference]: Start difference. First operand 123 states and 136 transitions. Second operand 4 states. [2020-07-18 00:47:11,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:11,839 INFO L93 Difference]: Finished difference Result 303 states and 342 transitions. [2020-07-18 00:47:11,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-18 00:47:11,839 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-07-18 00:47:11,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:47:11,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:47:11,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 342 transitions. [2020-07-18 00:47:11,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:47:11,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 342 transitions. [2020-07-18 00:47:11,853 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 342 transitions. [2020-07-18 00:47:12,205 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 342 edges. 342 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:12,213 INFO L225 Difference]: With dead ends: 303 [2020-07-18 00:47:12,213 INFO L226 Difference]: Without dead ends: 199 [2020-07-18 00:47:12,219 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-18 00:47:12,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2020-07-18 00:47:12,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 124. [2020-07-18 00:47:12,312 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:47:12,313 INFO L82 GeneralOperation]: Start isEquivalent. First operand 199 states. Second operand 124 states. [2020-07-18 00:47:12,313 INFO L74 IsIncluded]: Start isIncluded. First operand 199 states. Second operand 124 states. [2020-07-18 00:47:12,313 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 124 states. [2020-07-18 00:47:12,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:12,329 INFO L93 Difference]: Finished difference Result 199 states and 225 transitions. [2020-07-18 00:47:12,329 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 225 transitions. [2020-07-18 00:47:12,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:12,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:12,332 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand 199 states. [2020-07-18 00:47:12,332 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 199 states. [2020-07-18 00:47:12,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:12,348 INFO L93 Difference]: Finished difference Result 199 states and 225 transitions. [2020-07-18 00:47:12,348 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 225 transitions. [2020-07-18 00:47:12,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:12,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:12,350 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:47:12,350 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:47:12,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-07-18 00:47:12,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 137 transitions. [2020-07-18 00:47:12,357 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 137 transitions. Word has length 23 [2020-07-18 00:47:12,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:47:12,358 INFO L479 AbstractCegarLoop]: Abstraction has 124 states and 137 transitions. [2020-07-18 00:47:12,358 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-18 00:47:12,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 124 states and 137 transitions. [2020-07-18 00:47:12,484 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:12,484 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 137 transitions. [2020-07-18 00:47:12,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-18 00:47:12,485 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:12,485 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:47:12,486 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 00:47:12,486 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:12,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:12,486 INFO L82 PathProgramCache]: Analyzing trace with hash -395870253, now seen corresponding path program 1 times [2020-07-18 00:47:12,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:12,487 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [31775486] [2020-07-18 00:47:12,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:47:12,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:12,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:12,604 INFO L280 TraceCheckUtils]: 0: Hoare triple {2400#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {2390#true} is VALID [2020-07-18 00:47:12,604 INFO L280 TraceCheckUtils]: 1: Hoare triple {2390#true} #valid := #valid[0 := 0]; {2390#true} is VALID [2020-07-18 00:47:12,605 INFO L280 TraceCheckUtils]: 2: Hoare triple {2390#true} assume 0 < #StackHeapBarrier; {2390#true} is VALID [2020-07-18 00:47:12,605 INFO L280 TraceCheckUtils]: 3: Hoare triple {2390#true} assume true; {2390#true} is VALID [2020-07-18 00:47:12,605 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2390#true} {2390#true} #247#return; {2390#true} is VALID [2020-07-18 00:47:12,606 INFO L263 TraceCheckUtils]: 0: Hoare triple {2390#true} call ULTIMATE.init(); {2400#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:47:12,607 INFO L280 TraceCheckUtils]: 1: Hoare triple {2400#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {2390#true} is VALID [2020-07-18 00:47:12,607 INFO L280 TraceCheckUtils]: 2: Hoare triple {2390#true} #valid := #valid[0 := 0]; {2390#true} is VALID [2020-07-18 00:47:12,607 INFO L280 TraceCheckUtils]: 3: Hoare triple {2390#true} assume 0 < #StackHeapBarrier; {2390#true} is VALID [2020-07-18 00:47:12,608 INFO L280 TraceCheckUtils]: 4: Hoare triple {2390#true} assume true; {2390#true} is VALID [2020-07-18 00:47:12,608 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2390#true} {2390#true} #247#return; {2390#true} is VALID [2020-07-18 00:47:12,608 INFO L263 TraceCheckUtils]: 6: Hoare triple {2390#true} call #t~ret23 := main(); {2390#true} is VALID [2020-07-18 00:47:12,609 INFO L280 TraceCheckUtils]: 7: Hoare triple {2390#true} ~n~0 := 0; {2390#true} is VALID [2020-07-18 00:47:12,609 INFO L280 TraceCheckUtils]: 8: Hoare triple {2390#true} SUMMARY for call ~#set~0.base, ~#set~0.offset := #Ultimate.allocOnStack(400000); srcloc: L18 {2390#true} is VALID [2020-07-18 00:47:12,609 INFO L280 TraceCheckUtils]: 9: Hoare triple {2390#true} havoc ~x~0; {2390#true} is VALID [2020-07-18 00:47:12,610 INFO L280 TraceCheckUtils]: 10: Hoare triple {2390#true} havoc ~y~0; {2390#true} is VALID [2020-07-18 00:47:12,614 INFO L280 TraceCheckUtils]: 11: Hoare triple {2390#true} ~x~0 := 0; {2397#(= 0 main_~x~0)} is VALID [2020-07-18 00:47:12,617 INFO L280 TraceCheckUtils]: 12: Hoare triple {2397#(= 0 main_~x~0)} assume !!(~x~0 < 100000); {2397#(= 0 main_~x~0)} is VALID [2020-07-18 00:47:12,617 INFO L280 TraceCheckUtils]: 13: Hoare triple {2397#(= 0 main_~x~0)} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2397#(= 0 main_~x~0)} is VALID [2020-07-18 00:47:12,618 INFO L280 TraceCheckUtils]: 14: Hoare triple {2397#(= 0 main_~x~0)} SUMMARY for call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4); srcloc: L24-1 {2397#(= 0 main_~x~0)} is VALID [2020-07-18 00:47:12,622 INFO L280 TraceCheckUtils]: 15: Hoare triple {2397#(= 0 main_~x~0)} havoc #t~nondet3; {2397#(= 0 main_~x~0)} is VALID [2020-07-18 00:47:12,624 INFO L280 TraceCheckUtils]: 16: Hoare triple {2397#(= 0 main_~x~0)} #t~post2 := ~x~0; {2398#(= |main_#t~post2| 0)} is VALID [2020-07-18 00:47:12,625 INFO L280 TraceCheckUtils]: 17: Hoare triple {2398#(= |main_#t~post2| 0)} ~x~0 := 1 + #t~post2; {2399#(<= main_~x~0 1)} is VALID [2020-07-18 00:47:12,626 INFO L280 TraceCheckUtils]: 18: Hoare triple {2399#(<= main_~x~0 1)} havoc #t~post2; {2399#(<= main_~x~0 1)} is VALID [2020-07-18 00:47:12,628 INFO L280 TraceCheckUtils]: 19: Hoare triple {2399#(<= main_~x~0 1)} assume !(~x~0 < 100000); {2391#false} is VALID [2020-07-18 00:47:12,629 INFO L280 TraceCheckUtils]: 20: Hoare triple {2391#false} ~x~0 := 0; {2391#false} is VALID [2020-07-18 00:47:12,629 INFO L280 TraceCheckUtils]: 21: Hoare triple {2391#false} assume !!(~x~0 < ~n~0); {2391#false} is VALID [2020-07-18 00:47:12,629 INFO L280 TraceCheckUtils]: 22: Hoare triple {2391#false} ~y~0 := 1 + ~x~0; {2391#false} is VALID [2020-07-18 00:47:12,630 INFO L280 TraceCheckUtils]: 23: Hoare triple {2391#false} assume !!(~y~0 < ~n~0); {2391#false} is VALID [2020-07-18 00:47:12,630 INFO L280 TraceCheckUtils]: 24: Hoare triple {2391#false} SUMMARY for call #t~mem6 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4); srcloc: L30 {2391#false} is VALID [2020-07-18 00:47:12,633 INFO L280 TraceCheckUtils]: 25: Hoare triple {2391#false} SUMMARY for call #t~mem7 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); srcloc: L30-1 {2391#false} is VALID [2020-07-18 00:47:12,634 INFO L263 TraceCheckUtils]: 26: Hoare triple {2391#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {2391#false} is VALID [2020-07-18 00:47:12,634 INFO L280 TraceCheckUtils]: 27: Hoare triple {2391#false} ~cond := #in~cond; {2391#false} is VALID [2020-07-18 00:47:12,634 INFO L280 TraceCheckUtils]: 28: Hoare triple {2391#false} assume 0 == ~cond; {2391#false} is VALID [2020-07-18 00:47:12,634 INFO L280 TraceCheckUtils]: 29: Hoare triple {2391#false} assume !false; {2391#false} is VALID [2020-07-18 00:47:12,639 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-18 00:47:12,644 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:47:12,645 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [31775486] [2020-07-18 00:47:12,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:47:12,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-18 00:47:12,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7275319] [2020-07-18 00:47:12,646 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2020-07-18 00:47:12,646 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:47:12,646 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-18 00:47:12,674 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:12,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-18 00:47:12,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:47:12,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-18 00:47:12,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-18 00:47:12,675 INFO L87 Difference]: Start difference. First operand 124 states and 137 transitions. Second operand 6 states. [2020-07-18 00:47:13,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:13,817 INFO L93 Difference]: Finished difference Result 310 states and 349 transitions. [2020-07-18 00:47:13,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-18 00:47:13,817 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2020-07-18 00:47:13,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:47:13,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 00:47:13,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 349 transitions. [2020-07-18 00:47:13,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 00:47:13,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 349 transitions. [2020-07-18 00:47:13,835 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 349 transitions. [2020-07-18 00:47:14,172 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 349 edges. 349 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:14,178 INFO L225 Difference]: With dead ends: 310 [2020-07-18 00:47:14,178 INFO L226 Difference]: Without dead ends: 206 [2020-07-18 00:47:14,179 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-18 00:47:14,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2020-07-18 00:47:14,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 131. [2020-07-18 00:47:14,283 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:47:14,284 INFO L82 GeneralOperation]: Start isEquivalent. First operand 206 states. Second operand 131 states. [2020-07-18 00:47:14,284 INFO L74 IsIncluded]: Start isIncluded. First operand 206 states. Second operand 131 states. [2020-07-18 00:47:14,284 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 131 states. [2020-07-18 00:47:14,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:14,292 INFO L93 Difference]: Finished difference Result 206 states and 232 transitions. [2020-07-18 00:47:14,292 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 232 transitions. [2020-07-18 00:47:14,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:14,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:14,294 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand 206 states. [2020-07-18 00:47:14,294 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 206 states. [2020-07-18 00:47:14,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:14,302 INFO L93 Difference]: Finished difference Result 206 states and 232 transitions. [2020-07-18 00:47:14,302 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 232 transitions. [2020-07-18 00:47:14,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:14,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:14,303 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:47:14,304 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:47:14,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2020-07-18 00:47:14,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 144 transitions. [2020-07-18 00:47:14,308 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 144 transitions. Word has length 30 [2020-07-18 00:47:14,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:47:14,308 INFO L479 AbstractCegarLoop]: Abstraction has 131 states and 144 transitions. [2020-07-18 00:47:14,309 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-18 00:47:14,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 131 states and 144 transitions. [2020-07-18 00:47:14,450 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:14,451 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 144 transitions. [2020-07-18 00:47:14,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-18 00:47:14,452 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:14,452 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:47:14,453 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 00:47:14,453 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:14,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:14,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1926718692, now seen corresponding path program 2 times [2020-07-18 00:47:14,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:14,454 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1720565800] [2020-07-18 00:47:14,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:47:14,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:14,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:14,576 INFO L280 TraceCheckUtils]: 0: Hoare triple {3713#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {3701#true} is VALID [2020-07-18 00:47:14,576 INFO L280 TraceCheckUtils]: 1: Hoare triple {3701#true} #valid := #valid[0 := 0]; {3701#true} is VALID [2020-07-18 00:47:14,576 INFO L280 TraceCheckUtils]: 2: Hoare triple {3701#true} assume 0 < #StackHeapBarrier; {3701#true} is VALID [2020-07-18 00:47:14,577 INFO L280 TraceCheckUtils]: 3: Hoare triple {3701#true} assume true; {3701#true} is VALID [2020-07-18 00:47:14,577 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3701#true} {3701#true} #247#return; {3701#true} is VALID [2020-07-18 00:47:14,578 INFO L263 TraceCheckUtils]: 0: Hoare triple {3701#true} call ULTIMATE.init(); {3713#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:47:14,578 INFO L280 TraceCheckUtils]: 1: Hoare triple {3713#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {3701#true} is VALID [2020-07-18 00:47:14,579 INFO L280 TraceCheckUtils]: 2: Hoare triple {3701#true} #valid := #valid[0 := 0]; {3701#true} is VALID [2020-07-18 00:47:14,579 INFO L280 TraceCheckUtils]: 3: Hoare triple {3701#true} assume 0 < #StackHeapBarrier; {3701#true} is VALID [2020-07-18 00:47:14,579 INFO L280 TraceCheckUtils]: 4: Hoare triple {3701#true} assume true; {3701#true} is VALID [2020-07-18 00:47:14,579 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3701#true} {3701#true} #247#return; {3701#true} is VALID [2020-07-18 00:47:14,580 INFO L263 TraceCheckUtils]: 6: Hoare triple {3701#true} call #t~ret23 := main(); {3701#true} is VALID [2020-07-18 00:47:14,580 INFO L280 TraceCheckUtils]: 7: Hoare triple {3701#true} ~n~0 := 0; {3701#true} is VALID [2020-07-18 00:47:14,580 INFO L280 TraceCheckUtils]: 8: Hoare triple {3701#true} SUMMARY for call ~#set~0.base, ~#set~0.offset := #Ultimate.allocOnStack(400000); srcloc: L18 {3701#true} is VALID [2020-07-18 00:47:14,580 INFO L280 TraceCheckUtils]: 9: Hoare triple {3701#true} havoc ~x~0; {3701#true} is VALID [2020-07-18 00:47:14,580 INFO L280 TraceCheckUtils]: 10: Hoare triple {3701#true} havoc ~y~0; {3701#true} is VALID [2020-07-18 00:47:14,583 INFO L280 TraceCheckUtils]: 11: Hoare triple {3701#true} ~x~0 := 0; {3708#(= 0 main_~x~0)} is VALID [2020-07-18 00:47:14,584 INFO L280 TraceCheckUtils]: 12: Hoare triple {3708#(= 0 main_~x~0)} assume !!(~x~0 < 100000); {3708#(= 0 main_~x~0)} is VALID [2020-07-18 00:47:14,585 INFO L280 TraceCheckUtils]: 13: Hoare triple {3708#(= 0 main_~x~0)} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {3708#(= 0 main_~x~0)} is VALID [2020-07-18 00:47:14,585 INFO L280 TraceCheckUtils]: 14: Hoare triple {3708#(= 0 main_~x~0)} SUMMARY for call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4); srcloc: L24-1 {3708#(= 0 main_~x~0)} is VALID [2020-07-18 00:47:14,586 INFO L280 TraceCheckUtils]: 15: Hoare triple {3708#(= 0 main_~x~0)} havoc #t~nondet3; {3708#(= 0 main_~x~0)} is VALID [2020-07-18 00:47:14,587 INFO L280 TraceCheckUtils]: 16: Hoare triple {3708#(= 0 main_~x~0)} #t~post2 := ~x~0; {3709#(= |main_#t~post2| 0)} is VALID [2020-07-18 00:47:14,587 INFO L280 TraceCheckUtils]: 17: Hoare triple {3709#(= |main_#t~post2| 0)} ~x~0 := 1 + #t~post2; {3710#(<= main_~x~0 1)} is VALID [2020-07-18 00:47:14,588 INFO L280 TraceCheckUtils]: 18: Hoare triple {3710#(<= main_~x~0 1)} havoc #t~post2; {3710#(<= main_~x~0 1)} is VALID [2020-07-18 00:47:14,588 INFO L280 TraceCheckUtils]: 19: Hoare triple {3710#(<= main_~x~0 1)} assume !!(~x~0 < 100000); {3710#(<= main_~x~0 1)} is VALID [2020-07-18 00:47:14,588 INFO L280 TraceCheckUtils]: 20: Hoare triple {3710#(<= main_~x~0 1)} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {3710#(<= main_~x~0 1)} is VALID [2020-07-18 00:47:14,589 INFO L280 TraceCheckUtils]: 21: Hoare triple {3710#(<= main_~x~0 1)} SUMMARY for call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4); srcloc: L24-1 {3710#(<= main_~x~0 1)} is VALID [2020-07-18 00:47:14,590 INFO L280 TraceCheckUtils]: 22: Hoare triple {3710#(<= main_~x~0 1)} havoc #t~nondet3; {3710#(<= main_~x~0 1)} is VALID [2020-07-18 00:47:14,590 INFO L280 TraceCheckUtils]: 23: Hoare triple {3710#(<= main_~x~0 1)} #t~post2 := ~x~0; {3711#(<= |main_#t~post2| 1)} is VALID [2020-07-18 00:47:14,591 INFO L280 TraceCheckUtils]: 24: Hoare triple {3711#(<= |main_#t~post2| 1)} ~x~0 := 1 + #t~post2; {3712#(<= main_~x~0 2)} is VALID [2020-07-18 00:47:14,592 INFO L280 TraceCheckUtils]: 25: Hoare triple {3712#(<= main_~x~0 2)} havoc #t~post2; {3712#(<= main_~x~0 2)} is VALID [2020-07-18 00:47:14,599 INFO L280 TraceCheckUtils]: 26: Hoare triple {3712#(<= main_~x~0 2)} assume !(~x~0 < 100000); {3702#false} is VALID [2020-07-18 00:47:14,599 INFO L280 TraceCheckUtils]: 27: Hoare triple {3702#false} ~x~0 := 0; {3702#false} is VALID [2020-07-18 00:47:14,599 INFO L280 TraceCheckUtils]: 28: Hoare triple {3702#false} assume !!(~x~0 < ~n~0); {3702#false} is VALID [2020-07-18 00:47:14,600 INFO L280 TraceCheckUtils]: 29: Hoare triple {3702#false} ~y~0 := 1 + ~x~0; {3702#false} is VALID [2020-07-18 00:47:14,600 INFO L280 TraceCheckUtils]: 30: Hoare triple {3702#false} assume !!(~y~0 < ~n~0); {3702#false} is VALID [2020-07-18 00:47:14,600 INFO L280 TraceCheckUtils]: 31: Hoare triple {3702#false} SUMMARY for call #t~mem6 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4); srcloc: L30 {3702#false} is VALID [2020-07-18 00:47:14,601 INFO L280 TraceCheckUtils]: 32: Hoare triple {3702#false} SUMMARY for call #t~mem7 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); srcloc: L30-1 {3702#false} is VALID [2020-07-18 00:47:14,601 INFO L263 TraceCheckUtils]: 33: Hoare triple {3702#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {3702#false} is VALID [2020-07-18 00:47:14,601 INFO L280 TraceCheckUtils]: 34: Hoare triple {3702#false} ~cond := #in~cond; {3702#false} is VALID [2020-07-18 00:47:14,601 INFO L280 TraceCheckUtils]: 35: Hoare triple {3702#false} assume 0 == ~cond; {3702#false} is VALID [2020-07-18 00:47:14,602 INFO L280 TraceCheckUtils]: 36: Hoare triple {3702#false} assume !false; {3702#false} is VALID [2020-07-18 00:47:14,608 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-18 00:47:14,612 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:47:14,612 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1720565800] [2020-07-18 00:47:14,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:47:14,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-18 00:47:14,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116237205] [2020-07-18 00:47:14,613 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2020-07-18 00:47:14,613 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:47:14,614 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-18 00:47:14,653 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:14,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-18 00:47:14,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:47:14,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-18 00:47:14,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-18 00:47:14,655 INFO L87 Difference]: Start difference. First operand 131 states and 144 transitions. Second operand 8 states. [2020-07-18 00:47:15,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:15,902 INFO L93 Difference]: Finished difference Result 317 states and 356 transitions. [2020-07-18 00:47:15,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-18 00:47:15,903 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2020-07-18 00:47:15,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:47:15,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 00:47:15,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 356 transitions. [2020-07-18 00:47:15,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 00:47:15,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 356 transitions. [2020-07-18 00:47:15,913 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 356 transitions. [2020-07-18 00:47:16,283 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 356 edges. 356 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:16,288 INFO L225 Difference]: With dead ends: 317 [2020-07-18 00:47:16,289 INFO L226 Difference]: Without dead ends: 213 [2020-07-18 00:47:16,290 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-07-18 00:47:16,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2020-07-18 00:47:16,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 138. [2020-07-18 00:47:16,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:47:16,408 INFO L82 GeneralOperation]: Start isEquivalent. First operand 213 states. Second operand 138 states. [2020-07-18 00:47:16,409 INFO L74 IsIncluded]: Start isIncluded. First operand 213 states. Second operand 138 states. [2020-07-18 00:47:16,409 INFO L87 Difference]: Start difference. First operand 213 states. Second operand 138 states. [2020-07-18 00:47:16,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:16,418 INFO L93 Difference]: Finished difference Result 213 states and 239 transitions. [2020-07-18 00:47:16,418 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 239 transitions. [2020-07-18 00:47:16,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:16,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:16,419 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 213 states. [2020-07-18 00:47:16,419 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 213 states. [2020-07-18 00:47:16,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:16,427 INFO L93 Difference]: Finished difference Result 213 states and 239 transitions. [2020-07-18 00:47:16,427 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 239 transitions. [2020-07-18 00:47:16,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:16,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:16,428 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:47:16,428 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:47:16,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-07-18 00:47:16,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 151 transitions. [2020-07-18 00:47:16,433 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 151 transitions. Word has length 37 [2020-07-18 00:47:16,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:47:16,433 INFO L479 AbstractCegarLoop]: Abstraction has 138 states and 151 transitions. [2020-07-18 00:47:16,433 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-18 00:47:16,433 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 138 states and 151 transitions. [2020-07-18 00:47:16,596 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:16,597 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 151 transitions. [2020-07-18 00:47:16,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-07-18 00:47:16,598 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:16,598 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:47:16,599 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 00:47:16,599 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:16,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:16,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1889524403, now seen corresponding path program 3 times [2020-07-18 00:47:16,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:16,600 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1597621827] [2020-07-18 00:47:16,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:47:16,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:16,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:16,745 INFO L280 TraceCheckUtils]: 0: Hoare triple {5069#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {5060#true} is VALID [2020-07-18 00:47:16,745 INFO L280 TraceCheckUtils]: 1: Hoare triple {5060#true} #valid := #valid[0 := 0]; {5060#true} is VALID [2020-07-18 00:47:16,746 INFO L280 TraceCheckUtils]: 2: Hoare triple {5060#true} assume 0 < #StackHeapBarrier; {5060#true} is VALID [2020-07-18 00:47:16,746 INFO L280 TraceCheckUtils]: 3: Hoare triple {5060#true} assume true; {5060#true} is VALID [2020-07-18 00:47:16,746 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {5060#true} {5060#true} #247#return; {5060#true} is VALID [2020-07-18 00:47:16,747 INFO L263 TraceCheckUtils]: 0: Hoare triple {5060#true} call ULTIMATE.init(); {5069#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:47:16,748 INFO L280 TraceCheckUtils]: 1: Hoare triple {5069#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {5060#true} is VALID [2020-07-18 00:47:16,748 INFO L280 TraceCheckUtils]: 2: Hoare triple {5060#true} #valid := #valid[0 := 0]; {5060#true} is VALID [2020-07-18 00:47:16,748 INFO L280 TraceCheckUtils]: 3: Hoare triple {5060#true} assume 0 < #StackHeapBarrier; {5060#true} is VALID [2020-07-18 00:47:16,748 INFO L280 TraceCheckUtils]: 4: Hoare triple {5060#true} assume true; {5060#true} is VALID [2020-07-18 00:47:16,749 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {5060#true} {5060#true} #247#return; {5060#true} is VALID [2020-07-18 00:47:16,749 INFO L263 TraceCheckUtils]: 6: Hoare triple {5060#true} call #t~ret23 := main(); {5060#true} is VALID [2020-07-18 00:47:16,750 INFO L280 TraceCheckUtils]: 7: Hoare triple {5060#true} ~n~0 := 0; {5067#(= 0 main_~n~0)} is VALID [2020-07-18 00:47:16,750 INFO L280 TraceCheckUtils]: 8: Hoare triple {5067#(= 0 main_~n~0)} SUMMARY for call ~#set~0.base, ~#set~0.offset := #Ultimate.allocOnStack(400000); srcloc: L18 {5067#(= 0 main_~n~0)} is VALID [2020-07-18 00:47:16,751 INFO L280 TraceCheckUtils]: 9: Hoare triple {5067#(= 0 main_~n~0)} havoc ~x~0; {5067#(= 0 main_~n~0)} is VALID [2020-07-18 00:47:16,751 INFO L280 TraceCheckUtils]: 10: Hoare triple {5067#(= 0 main_~n~0)} havoc ~y~0; {5067#(= 0 main_~n~0)} is VALID [2020-07-18 00:47:16,752 INFO L280 TraceCheckUtils]: 11: Hoare triple {5067#(= 0 main_~n~0)} ~x~0 := 0; {5067#(= 0 main_~n~0)} is VALID [2020-07-18 00:47:16,752 INFO L280 TraceCheckUtils]: 12: Hoare triple {5067#(= 0 main_~n~0)} assume !!(~x~0 < 100000); {5067#(= 0 main_~n~0)} is VALID [2020-07-18 00:47:16,753 INFO L280 TraceCheckUtils]: 13: Hoare triple {5067#(= 0 main_~n~0)} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {5067#(= 0 main_~n~0)} is VALID [2020-07-18 00:47:16,754 INFO L280 TraceCheckUtils]: 14: Hoare triple {5067#(= 0 main_~n~0)} SUMMARY for call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4); srcloc: L24-1 {5067#(= 0 main_~n~0)} is VALID [2020-07-18 00:47:16,754 INFO L280 TraceCheckUtils]: 15: Hoare triple {5067#(= 0 main_~n~0)} havoc #t~nondet3; {5067#(= 0 main_~n~0)} is VALID [2020-07-18 00:47:16,755 INFO L280 TraceCheckUtils]: 16: Hoare triple {5067#(= 0 main_~n~0)} #t~post2 := ~x~0; {5067#(= 0 main_~n~0)} is VALID [2020-07-18 00:47:16,755 INFO L280 TraceCheckUtils]: 17: Hoare triple {5067#(= 0 main_~n~0)} ~x~0 := 1 + #t~post2; {5067#(= 0 main_~n~0)} is VALID [2020-07-18 00:47:16,756 INFO L280 TraceCheckUtils]: 18: Hoare triple {5067#(= 0 main_~n~0)} havoc #t~post2; {5067#(= 0 main_~n~0)} is VALID [2020-07-18 00:47:16,756 INFO L280 TraceCheckUtils]: 19: Hoare triple {5067#(= 0 main_~n~0)} assume !!(~x~0 < 100000); {5067#(= 0 main_~n~0)} is VALID [2020-07-18 00:47:16,757 INFO L280 TraceCheckUtils]: 20: Hoare triple {5067#(= 0 main_~n~0)} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {5067#(= 0 main_~n~0)} is VALID [2020-07-18 00:47:16,758 INFO L280 TraceCheckUtils]: 21: Hoare triple {5067#(= 0 main_~n~0)} SUMMARY for call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4); srcloc: L24-1 {5067#(= 0 main_~n~0)} is VALID [2020-07-18 00:47:16,759 INFO L280 TraceCheckUtils]: 22: Hoare triple {5067#(= 0 main_~n~0)} havoc #t~nondet3; {5067#(= 0 main_~n~0)} is VALID [2020-07-18 00:47:16,760 INFO L280 TraceCheckUtils]: 23: Hoare triple {5067#(= 0 main_~n~0)} #t~post2 := ~x~0; {5067#(= 0 main_~n~0)} is VALID [2020-07-18 00:47:16,760 INFO L280 TraceCheckUtils]: 24: Hoare triple {5067#(= 0 main_~n~0)} ~x~0 := 1 + #t~post2; {5067#(= 0 main_~n~0)} is VALID [2020-07-18 00:47:16,761 INFO L280 TraceCheckUtils]: 25: Hoare triple {5067#(= 0 main_~n~0)} havoc #t~post2; {5067#(= 0 main_~n~0)} is VALID [2020-07-18 00:47:16,762 INFO L280 TraceCheckUtils]: 26: Hoare triple {5067#(= 0 main_~n~0)} assume !!(~x~0 < 100000); {5067#(= 0 main_~n~0)} is VALID [2020-07-18 00:47:16,762 INFO L280 TraceCheckUtils]: 27: Hoare triple {5067#(= 0 main_~n~0)} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {5067#(= 0 main_~n~0)} is VALID [2020-07-18 00:47:16,763 INFO L280 TraceCheckUtils]: 28: Hoare triple {5067#(= 0 main_~n~0)} SUMMARY for call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4); srcloc: L24-1 {5067#(= 0 main_~n~0)} is VALID [2020-07-18 00:47:16,764 INFO L280 TraceCheckUtils]: 29: Hoare triple {5067#(= 0 main_~n~0)} havoc #t~nondet3; {5067#(= 0 main_~n~0)} is VALID [2020-07-18 00:47:16,765 INFO L280 TraceCheckUtils]: 30: Hoare triple {5067#(= 0 main_~n~0)} #t~post2 := ~x~0; {5067#(= 0 main_~n~0)} is VALID [2020-07-18 00:47:16,766 INFO L280 TraceCheckUtils]: 31: Hoare triple {5067#(= 0 main_~n~0)} ~x~0 := 1 + #t~post2; {5067#(= 0 main_~n~0)} is VALID [2020-07-18 00:47:16,767 INFO L280 TraceCheckUtils]: 32: Hoare triple {5067#(= 0 main_~n~0)} havoc #t~post2; {5067#(= 0 main_~n~0)} is VALID [2020-07-18 00:47:16,767 INFO L280 TraceCheckUtils]: 33: Hoare triple {5067#(= 0 main_~n~0)} assume !(~x~0 < 100000); {5067#(= 0 main_~n~0)} is VALID [2020-07-18 00:47:16,768 INFO L280 TraceCheckUtils]: 34: Hoare triple {5067#(= 0 main_~n~0)} ~x~0 := 0; {5068#(and (= 0 main_~n~0) (= 0 main_~x~0))} is VALID [2020-07-18 00:47:16,769 INFO L280 TraceCheckUtils]: 35: Hoare triple {5068#(and (= 0 main_~n~0) (= 0 main_~x~0))} assume !!(~x~0 < ~n~0); {5061#false} is VALID [2020-07-18 00:47:16,769 INFO L280 TraceCheckUtils]: 36: Hoare triple {5061#false} ~y~0 := 1 + ~x~0; {5061#false} is VALID [2020-07-18 00:47:16,769 INFO L280 TraceCheckUtils]: 37: Hoare triple {5061#false} assume !!(~y~0 < ~n~0); {5061#false} is VALID [2020-07-18 00:47:16,770 INFO L280 TraceCheckUtils]: 38: Hoare triple {5061#false} SUMMARY for call #t~mem6 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4); srcloc: L30 {5061#false} is VALID [2020-07-18 00:47:16,770 INFO L280 TraceCheckUtils]: 39: Hoare triple {5061#false} SUMMARY for call #t~mem7 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); srcloc: L30-1 {5061#false} is VALID [2020-07-18 00:47:16,771 INFO L263 TraceCheckUtils]: 40: Hoare triple {5061#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {5061#false} is VALID [2020-07-18 00:47:16,771 INFO L280 TraceCheckUtils]: 41: Hoare triple {5061#false} ~cond := #in~cond; {5061#false} is VALID [2020-07-18 00:47:16,771 INFO L280 TraceCheckUtils]: 42: Hoare triple {5061#false} assume 0 == ~cond; {5061#false} is VALID [2020-07-18 00:47:16,772 INFO L280 TraceCheckUtils]: 43: Hoare triple {5061#false} assume !false; {5061#false} is VALID [2020-07-18 00:47:16,776 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-18 00:47:16,780 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:47:16,781 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1597621827] [2020-07-18 00:47:16,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:47:16,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 00:47:16,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525212195] [2020-07-18 00:47:16,782 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2020-07-18 00:47:16,782 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:47:16,782 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 00:47:16,816 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:16,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 00:47:16,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:47:16,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 00:47:16,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:47:16,817 INFO L87 Difference]: Start difference. First operand 138 states and 151 transitions. Second operand 5 states. [2020-07-18 00:47:17,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:17,495 INFO L93 Difference]: Finished difference Result 248 states and 276 transitions. [2020-07-18 00:47:17,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-18 00:47:17,495 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2020-07-18 00:47:17,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:47:17,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:47:17,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 267 transitions. [2020-07-18 00:47:17,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:47:17,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 267 transitions. [2020-07-18 00:47:17,505 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 267 transitions. [2020-07-18 00:47:17,774 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 267 edges. 267 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:17,778 INFO L225 Difference]: With dead ends: 248 [2020-07-18 00:47:17,778 INFO L226 Difference]: Without dead ends: 143 [2020-07-18 00:47:17,778 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-18 00:47:17,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-07-18 00:47:17,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 137. [2020-07-18 00:47:17,928 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:47:17,928 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand 137 states. [2020-07-18 00:47:17,929 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand 137 states. [2020-07-18 00:47:17,929 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 137 states. [2020-07-18 00:47:17,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:17,934 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2020-07-18 00:47:17,934 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 156 transitions. [2020-07-18 00:47:17,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:17,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:17,936 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand 143 states. [2020-07-18 00:47:17,936 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 143 states. [2020-07-18 00:47:17,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:17,941 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2020-07-18 00:47:17,941 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 156 transitions. [2020-07-18 00:47:17,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:17,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:17,942 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:47:17,942 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:47:17,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-07-18 00:47:17,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 149 transitions. [2020-07-18 00:47:17,947 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 149 transitions. Word has length 44 [2020-07-18 00:47:17,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:47:17,947 INFO L479 AbstractCegarLoop]: Abstraction has 137 states and 149 transitions. [2020-07-18 00:47:17,947 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 00:47:17,947 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 137 states and 149 transitions. [2020-07-18 00:47:18,133 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:18,133 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 149 transitions. [2020-07-18 00:47:18,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-07-18 00:47:18,135 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:18,135 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:47:18,136 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-18 00:47:18,136 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:18,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:18,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1581132658, now seen corresponding path program 1 times [2020-07-18 00:47:18,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:18,137 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2130014081] [2020-07-18 00:47:18,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:47:18,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:18,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:18,332 INFO L280 TraceCheckUtils]: 0: Hoare triple {6160#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {6130#true} is VALID [2020-07-18 00:47:18,332 INFO L280 TraceCheckUtils]: 1: Hoare triple {6130#true} #valid := #valid[0 := 0]; {6130#true} is VALID [2020-07-18 00:47:18,332 INFO L280 TraceCheckUtils]: 2: Hoare triple {6130#true} assume 0 < #StackHeapBarrier; {6130#true} is VALID [2020-07-18 00:47:18,333 INFO L280 TraceCheckUtils]: 3: Hoare triple {6130#true} assume true; {6130#true} is VALID [2020-07-18 00:47:18,333 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {6130#true} {6130#true} #247#return; {6130#true} is VALID [2020-07-18 00:47:18,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:18,343 INFO L280 TraceCheckUtils]: 0: Hoare triple {6130#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset; {6130#true} is VALID [2020-07-18 00:47:18,344 INFO L280 TraceCheckUtils]: 1: Hoare triple {6130#true} ~size := #in~size; {6130#true} is VALID [2020-07-18 00:47:18,344 INFO L280 TraceCheckUtils]: 2: Hoare triple {6130#true} ~value := #in~value; {6130#true} is VALID [2020-07-18 00:47:18,344 INFO L280 TraceCheckUtils]: 3: Hoare triple {6130#true} havoc ~i~0; {6130#true} is VALID [2020-07-18 00:47:18,345 INFO L280 TraceCheckUtils]: 4: Hoare triple {6130#true} ~i~0 := 0; {6130#true} is VALID [2020-07-18 00:47:18,345 INFO L280 TraceCheckUtils]: 5: Hoare triple {6130#true} assume !(~i~0 < ~size); {6130#true} is VALID [2020-07-18 00:47:18,345 INFO L280 TraceCheckUtils]: 6: Hoare triple {6130#true} #res := 0; {6130#true} is VALID [2020-07-18 00:47:18,348 INFO L280 TraceCheckUtils]: 7: Hoare triple {6130#true} assume true; {6130#true} is VALID [2020-07-18 00:47:18,349 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {6130#true} {6131#false} #253#return; {6131#false} is VALID [2020-07-18 00:47:18,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:18,369 INFO L280 TraceCheckUtils]: 0: Hoare triple {6161#(= |#memory_int| |old(#memory_int)|)} ~set.base, ~set.offset := #in~set.base, #in~set.offset; {6130#true} is VALID [2020-07-18 00:47:18,369 INFO L280 TraceCheckUtils]: 1: Hoare triple {6130#true} ~size := #in~size; {6130#true} is VALID [2020-07-18 00:47:18,370 INFO L280 TraceCheckUtils]: 2: Hoare triple {6130#true} ~value := #in~value; {6130#true} is VALID [2020-07-18 00:47:18,370 INFO L280 TraceCheckUtils]: 3: Hoare triple {6130#true} SUMMARY for call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4); srcloc: L6 {6130#true} is VALID [2020-07-18 00:47:18,370 INFO L280 TraceCheckUtils]: 4: Hoare triple {6130#true} #res := 1 + ~size; {6130#true} is VALID [2020-07-18 00:47:18,371 INFO L280 TraceCheckUtils]: 5: Hoare triple {6130#true} assume true; {6130#true} is VALID [2020-07-18 00:47:18,371 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {6130#true} {6131#false} #255#return; {6131#false} is VALID [2020-07-18 00:47:18,376 INFO L263 TraceCheckUtils]: 0: Hoare triple {6130#true} call ULTIMATE.init(); {6160#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:47:18,377 INFO L280 TraceCheckUtils]: 1: Hoare triple {6160#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {6130#true} is VALID [2020-07-18 00:47:18,377 INFO L280 TraceCheckUtils]: 2: Hoare triple {6130#true} #valid := #valid[0 := 0]; {6130#true} is VALID [2020-07-18 00:47:18,377 INFO L280 TraceCheckUtils]: 3: Hoare triple {6130#true} assume 0 < #StackHeapBarrier; {6130#true} is VALID [2020-07-18 00:47:18,378 INFO L280 TraceCheckUtils]: 4: Hoare triple {6130#true} assume true; {6130#true} is VALID [2020-07-18 00:47:18,378 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {6130#true} {6130#true} #247#return; {6130#true} is VALID [2020-07-18 00:47:18,378 INFO L263 TraceCheckUtils]: 6: Hoare triple {6130#true} call #t~ret23 := main(); {6130#true} is VALID [2020-07-18 00:47:18,378 INFO L280 TraceCheckUtils]: 7: Hoare triple {6130#true} ~n~0 := 0; {6130#true} is VALID [2020-07-18 00:47:18,378 INFO L280 TraceCheckUtils]: 8: Hoare triple {6130#true} SUMMARY for call ~#set~0.base, ~#set~0.offset := #Ultimate.allocOnStack(400000); srcloc: L18 {6130#true} is VALID [2020-07-18 00:47:18,378 INFO L280 TraceCheckUtils]: 9: Hoare triple {6130#true} havoc ~x~0; {6130#true} is VALID [2020-07-18 00:47:18,379 INFO L280 TraceCheckUtils]: 10: Hoare triple {6130#true} havoc ~y~0; {6130#true} is VALID [2020-07-18 00:47:18,381 INFO L280 TraceCheckUtils]: 11: Hoare triple {6130#true} ~x~0 := 0; {6137#(= 0 main_~x~0)} is VALID [2020-07-18 00:47:18,384 INFO L280 TraceCheckUtils]: 12: Hoare triple {6137#(= 0 main_~x~0)} assume !!(~x~0 < 100000); {6137#(= 0 main_~x~0)} is VALID [2020-07-18 00:47:18,384 INFO L280 TraceCheckUtils]: 13: Hoare triple {6137#(= 0 main_~x~0)} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {6137#(= 0 main_~x~0)} is VALID [2020-07-18 00:47:18,386 INFO L280 TraceCheckUtils]: 14: Hoare triple {6137#(= 0 main_~x~0)} SUMMARY for call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4); srcloc: L24-1 {6137#(= 0 main_~x~0)} is VALID [2020-07-18 00:47:18,386 INFO L280 TraceCheckUtils]: 15: Hoare triple {6137#(= 0 main_~x~0)} havoc #t~nondet3; {6137#(= 0 main_~x~0)} is VALID [2020-07-18 00:47:18,388 INFO L280 TraceCheckUtils]: 16: Hoare triple {6137#(= 0 main_~x~0)} #t~post2 := ~x~0; {6138#(= |main_#t~post2| 0)} is VALID [2020-07-18 00:47:18,388 INFO L280 TraceCheckUtils]: 17: Hoare triple {6138#(= |main_#t~post2| 0)} ~x~0 := 1 + #t~post2; {6139#(<= main_~x~0 1)} is VALID [2020-07-18 00:47:18,389 INFO L280 TraceCheckUtils]: 18: Hoare triple {6139#(<= main_~x~0 1)} havoc #t~post2; {6139#(<= main_~x~0 1)} is VALID [2020-07-18 00:47:18,390 INFO L280 TraceCheckUtils]: 19: Hoare triple {6139#(<= main_~x~0 1)} assume !!(~x~0 < 100000); {6139#(<= main_~x~0 1)} is VALID [2020-07-18 00:47:18,390 INFO L280 TraceCheckUtils]: 20: Hoare triple {6139#(<= main_~x~0 1)} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {6139#(<= main_~x~0 1)} is VALID [2020-07-18 00:47:18,391 INFO L280 TraceCheckUtils]: 21: Hoare triple {6139#(<= main_~x~0 1)} SUMMARY for call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4); srcloc: L24-1 {6139#(<= main_~x~0 1)} is VALID [2020-07-18 00:47:18,391 INFO L280 TraceCheckUtils]: 22: Hoare triple {6139#(<= main_~x~0 1)} havoc #t~nondet3; {6139#(<= main_~x~0 1)} is VALID [2020-07-18 00:47:18,392 INFO L280 TraceCheckUtils]: 23: Hoare triple {6139#(<= main_~x~0 1)} #t~post2 := ~x~0; {6140#(<= |main_#t~post2| 1)} is VALID [2020-07-18 00:47:18,392 INFO L280 TraceCheckUtils]: 24: Hoare triple {6140#(<= |main_#t~post2| 1)} ~x~0 := 1 + #t~post2; {6141#(<= main_~x~0 2)} is VALID [2020-07-18 00:47:18,393 INFO L280 TraceCheckUtils]: 25: Hoare triple {6141#(<= main_~x~0 2)} havoc #t~post2; {6141#(<= main_~x~0 2)} is VALID [2020-07-18 00:47:18,394 INFO L280 TraceCheckUtils]: 26: Hoare triple {6141#(<= main_~x~0 2)} assume !!(~x~0 < 100000); {6141#(<= main_~x~0 2)} is VALID [2020-07-18 00:47:18,394 INFO L280 TraceCheckUtils]: 27: Hoare triple {6141#(<= main_~x~0 2)} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {6141#(<= main_~x~0 2)} is VALID [2020-07-18 00:47:18,395 INFO L280 TraceCheckUtils]: 28: Hoare triple {6141#(<= main_~x~0 2)} SUMMARY for call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4); srcloc: L24-1 {6141#(<= main_~x~0 2)} is VALID [2020-07-18 00:47:18,395 INFO L280 TraceCheckUtils]: 29: Hoare triple {6141#(<= main_~x~0 2)} havoc #t~nondet3; {6141#(<= main_~x~0 2)} is VALID [2020-07-18 00:47:18,396 INFO L280 TraceCheckUtils]: 30: Hoare triple {6141#(<= main_~x~0 2)} #t~post2 := ~x~0; {6142#(<= |main_#t~post2| 2)} is VALID [2020-07-18 00:47:18,397 INFO L280 TraceCheckUtils]: 31: Hoare triple {6142#(<= |main_#t~post2| 2)} ~x~0 := 1 + #t~post2; {6143#(<= main_~x~0 3)} is VALID [2020-07-18 00:47:18,397 INFO L280 TraceCheckUtils]: 32: Hoare triple {6143#(<= main_~x~0 3)} havoc #t~post2; {6143#(<= main_~x~0 3)} is VALID [2020-07-18 00:47:18,398 INFO L280 TraceCheckUtils]: 33: Hoare triple {6143#(<= main_~x~0 3)} assume !(~x~0 < 100000); {6131#false} is VALID [2020-07-18 00:47:18,398 INFO L280 TraceCheckUtils]: 34: Hoare triple {6131#false} ~x~0 := 0; {6131#false} is VALID [2020-07-18 00:47:18,398 INFO L280 TraceCheckUtils]: 35: Hoare triple {6131#false} assume !(~x~0 < ~n~0); {6131#false} is VALID [2020-07-18 00:47:18,399 INFO L280 TraceCheckUtils]: 36: Hoare triple {6131#false} SUMMARY for call ~#values~0.base, ~#values~0.offset := #Ultimate.allocOnStack(400000); srcloc: L28-6 {6131#false} is VALID [2020-07-18 00:47:18,399 INFO L280 TraceCheckUtils]: 37: Hoare triple {6131#false} havoc ~v~0; {6131#false} is VALID [2020-07-18 00:47:18,399 INFO L280 TraceCheckUtils]: 38: Hoare triple {6131#false} ~v~0 := 0; {6131#false} is VALID [2020-07-18 00:47:18,399 INFO L280 TraceCheckUtils]: 39: Hoare triple {6131#false} assume !(~v~0 < 100000); {6131#false} is VALID [2020-07-18 00:47:18,400 INFO L280 TraceCheckUtils]: 40: Hoare triple {6131#false} ~v~0 := 0; {6131#false} is VALID [2020-07-18 00:47:18,400 INFO L280 TraceCheckUtils]: 41: Hoare triple {6131#false} assume !!(~v~0 < 100000); {6131#false} is VALID [2020-07-18 00:47:18,400 INFO L280 TraceCheckUtils]: 42: Hoare triple {6131#false} SUMMARY for call #t~mem11 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); srcloc: L41 {6131#false} is VALID [2020-07-18 00:47:18,400 INFO L263 TraceCheckUtils]: 43: Hoare triple {6131#false} call #t~ret12 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem11); {6130#true} is VALID [2020-07-18 00:47:18,401 INFO L280 TraceCheckUtils]: 44: Hoare triple {6130#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset; {6130#true} is VALID [2020-07-18 00:47:18,401 INFO L280 TraceCheckUtils]: 45: Hoare triple {6130#true} ~size := #in~size; {6130#true} is VALID [2020-07-18 00:47:18,401 INFO L280 TraceCheckUtils]: 46: Hoare triple {6130#true} ~value := #in~value; {6130#true} is VALID [2020-07-18 00:47:18,401 INFO L280 TraceCheckUtils]: 47: Hoare triple {6130#true} havoc ~i~0; {6130#true} is VALID [2020-07-18 00:47:18,402 INFO L280 TraceCheckUtils]: 48: Hoare triple {6130#true} ~i~0 := 0; {6130#true} is VALID [2020-07-18 00:47:18,402 INFO L280 TraceCheckUtils]: 49: Hoare triple {6130#true} assume !(~i~0 < ~size); {6130#true} is VALID [2020-07-18 00:47:18,402 INFO L280 TraceCheckUtils]: 50: Hoare triple {6130#true} #res := 0; {6130#true} is VALID [2020-07-18 00:47:18,402 INFO L280 TraceCheckUtils]: 51: Hoare triple {6130#true} assume true; {6130#true} is VALID [2020-07-18 00:47:18,403 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {6130#true} {6131#false} #253#return; {6131#false} is VALID [2020-07-18 00:47:18,403 INFO L280 TraceCheckUtils]: 53: Hoare triple {6131#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {6131#false} is VALID [2020-07-18 00:47:18,403 INFO L280 TraceCheckUtils]: 54: Hoare triple {6131#false} assume 0 != #t~ret12; {6131#false} is VALID [2020-07-18 00:47:18,403 INFO L280 TraceCheckUtils]: 55: Hoare triple {6131#false} havoc #t~mem11; {6131#false} is VALID [2020-07-18 00:47:18,404 INFO L280 TraceCheckUtils]: 56: Hoare triple {6131#false} havoc #t~ret12; {6131#false} is VALID [2020-07-18 00:47:18,404 INFO L280 TraceCheckUtils]: 57: Hoare triple {6131#false} SUMMARY for call #t~mem13 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); srcloc: L42 {6131#false} is VALID [2020-07-18 00:47:18,404 INFO L263 TraceCheckUtils]: 58: Hoare triple {6131#false} call #t~ret14 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem13); {6161#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-18 00:47:18,404 INFO L280 TraceCheckUtils]: 59: Hoare triple {6161#(= |#memory_int| |old(#memory_int)|)} ~set.base, ~set.offset := #in~set.base, #in~set.offset; {6130#true} is VALID [2020-07-18 00:47:18,405 INFO L280 TraceCheckUtils]: 60: Hoare triple {6130#true} ~size := #in~size; {6130#true} is VALID [2020-07-18 00:47:18,405 INFO L280 TraceCheckUtils]: 61: Hoare triple {6130#true} ~value := #in~value; {6130#true} is VALID [2020-07-18 00:47:18,405 INFO L280 TraceCheckUtils]: 62: Hoare triple {6130#true} SUMMARY for call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4); srcloc: L6 {6130#true} is VALID [2020-07-18 00:47:18,405 INFO L280 TraceCheckUtils]: 63: Hoare triple {6130#true} #res := 1 + ~size; {6130#true} is VALID [2020-07-18 00:47:18,405 INFO L280 TraceCheckUtils]: 64: Hoare triple {6130#true} assume true; {6130#true} is VALID [2020-07-18 00:47:18,406 INFO L275 TraceCheckUtils]: 65: Hoare quadruple {6130#true} {6131#false} #255#return; {6131#false} is VALID [2020-07-18 00:47:18,406 INFO L280 TraceCheckUtils]: 66: Hoare triple {6131#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {6131#false} is VALID [2020-07-18 00:47:18,406 INFO L280 TraceCheckUtils]: 67: Hoare triple {6131#false} ~n~0 := #t~ret14; {6131#false} is VALID [2020-07-18 00:47:18,406 INFO L280 TraceCheckUtils]: 68: Hoare triple {6131#false} havoc #t~mem13; {6131#false} is VALID [2020-07-18 00:47:18,407 INFO L280 TraceCheckUtils]: 69: Hoare triple {6131#false} havoc #t~ret14; {6131#false} is VALID [2020-07-18 00:47:18,407 INFO L280 TraceCheckUtils]: 70: Hoare triple {6131#false} ~x~0 := 0; {6131#false} is VALID [2020-07-18 00:47:18,407 INFO L280 TraceCheckUtils]: 71: Hoare triple {6131#false} assume !!(~x~0 < ~n~0); {6131#false} is VALID [2020-07-18 00:47:18,407 INFO L280 TraceCheckUtils]: 72: Hoare triple {6131#false} ~y~0 := 1 + ~x~0; {6131#false} is VALID [2020-07-18 00:47:18,408 INFO L280 TraceCheckUtils]: 73: Hoare triple {6131#false} assume !!(~y~0 < ~n~0); {6131#false} is VALID [2020-07-18 00:47:18,408 INFO L280 TraceCheckUtils]: 74: Hoare triple {6131#false} SUMMARY for call #t~mem17 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4); srcloc: L46 {6131#false} is VALID [2020-07-18 00:47:18,408 INFO L280 TraceCheckUtils]: 75: Hoare triple {6131#false} SUMMARY for call #t~mem18 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); srcloc: L46-1 {6131#false} is VALID [2020-07-18 00:47:18,408 INFO L263 TraceCheckUtils]: 76: Hoare triple {6131#false} call __VERIFIER_assert((if #t~mem17 != #t~mem18 then 1 else 0)); {6131#false} is VALID [2020-07-18 00:47:18,409 INFO L280 TraceCheckUtils]: 77: Hoare triple {6131#false} ~cond := #in~cond; {6131#false} is VALID [2020-07-18 00:47:18,409 INFO L280 TraceCheckUtils]: 78: Hoare triple {6131#false} assume 0 == ~cond; {6131#false} is VALID [2020-07-18 00:47:18,409 INFO L280 TraceCheckUtils]: 79: Hoare triple {6131#false} assume !false; {6131#false} is VALID [2020-07-18 00:47:18,415 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-18 00:47:18,957 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:47:18,958 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2130014081] [2020-07-18 00:47:18,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:47:18,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2020-07-18 00:47:18,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705021695] [2020-07-18 00:47:18,959 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 80 [2020-07-18 00:47:18,960 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:47:18,960 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2020-07-18 00:47:18,978 WARN L140 InductivityCheck]: Transition 6173#(and (= 0 main_~x~0) (= main_~y~0 (+ main_~x~0 1)) (= |main_#t~mem18| (select (select |#memory_int| |main_~#set~0.base|) (+ |main_~#set~0.offset| (* main_~y~0 4)))) (<= main_~n~0 2147483647) (< main_~y~0 main_~n~0) (= |main_#t~mem17| (select (select |#memory_int| |main_~#set~0.base|) (+ |main_~#set~0.offset| (* main_~x~0 4))))) ( _ , call __VERIFIER_assert((if #t~mem17 != #t~mem18 then 1 else 0)); , 6174#(and (= (ite (not (= (select (select |#memory_int| |main_~#set~0.base|) (+ |main_~#set~0.offset| (* main_~x~0 4))) (select (select |#memory_int| |main_~#set~0.base|) (+ |main_~#set~0.offset| (* main_~y~0 4))))) 1 0) |__VERIFIER_assert_#in~cond|) (= 0 main_~x~0) (= main_~y~0 (+ main_~x~0 1)) (<= main_~n~0 2147483647) (< main_~y~0 main_~n~0)) ) not inductive [2020-07-18 00:47:18,978 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-18 00:47:18,979 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inductivity failed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:583) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:455) 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-18 00:47:18,986 INFO L168 Benchmark]: Toolchain (without parser) took 11164.10 ms. Allocated memory was 143.7 MB in the beginning and 352.3 MB in the end (delta: 208.7 MB). Free memory was 101.6 MB in the beginning and 167.0 MB in the end (delta: -65.3 MB). Peak memory consumption was 143.3 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:18,990 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 143.7 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-18 00:47:18,991 INFO L168 Benchmark]: CACSL2BoogieTranslator took 360.83 ms. Allocated memory was 143.7 MB in the beginning and 198.7 MB in the end (delta: 55.1 MB). Free memory was 101.2 MB in the beginning and 177.6 MB in the end (delta: -76.3 MB). Peak memory consumption was 21.4 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:18,997 INFO L168 Benchmark]: Boogie Preprocessor took 54.50 ms. Allocated memory is still 198.7 MB. Free memory was 177.6 MB in the beginning and 175.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:18,997 INFO L168 Benchmark]: RCFGBuilder took 691.62 ms. Allocated memory is still 198.7 MB. Free memory was 175.0 MB in the beginning and 125.4 MB in the end (delta: 49.6 MB). Peak memory consumption was 49.6 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:18,998 INFO L168 Benchmark]: TraceAbstraction took 10050.51 ms. Allocated memory was 198.7 MB in the beginning and 352.3 MB in the end (delta: 153.6 MB). Free memory was 124.7 MB in the beginning and 167.0 MB in the end (delta: -42.3 MB). Peak memory consumption was 111.3 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:19,007 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 143.7 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 360.83 ms. Allocated memory was 143.7 MB in the beginning and 198.7 MB in the end (delta: 55.1 MB). Free memory was 101.2 MB in the beginning and 177.6 MB in the end (delta: -76.3 MB). Peak memory consumption was 21.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 54.50 ms. Allocated memory is still 198.7 MB. Free memory was 177.6 MB in the beginning and 175.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 691.62 ms. Allocated memory is still 198.7 MB. Free memory was 175.0 MB in the beginning and 125.4 MB in the end (delta: 49.6 MB). Peak memory consumption was 49.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10050.51 ms. Allocated memory was 198.7 MB in the beginning and 352.3 MB in the end (delta: 153.6 MB). Free memory was 124.7 MB in the beginning and 167.0 MB in the end (delta: -42.3 MB). Peak memory consumption was 111.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inductivity failed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:142) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...