/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/data_structures_set_multi_proc_trivial_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:25:50,018 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:25:50,020 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:25:50,033 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:25:50,034 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:25:50,035 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:25:50,036 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:25:50,038 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:25:50,040 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:25:50,041 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:25:50,042 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:25:50,045 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:25:50,045 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:25:50,046 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:25:50,047 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:25:50,050 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:25:50,051 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:25:50,052 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:25:50,056 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:25:50,062 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:25:50,065 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:25:50,069 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:25:50,070 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:25:50,071 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:25:50,076 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:25:50,077 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:25:50,077 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:25:50,079 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:25:50,080 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:25:50,081 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:25:50,081 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:25:50,082 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:25:50,085 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:25:50,085 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:25:50,086 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:25:50,087 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:25:50,089 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:25:50,089 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:25:50,089 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:25:50,090 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:25:50,092 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:25:50,093 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 15:25:50,118 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:25:50,118 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:25:50,120 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:25:50,120 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:25:50,120 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:25:50,121 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:25:50,121 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:25:50,121 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:25:50,121 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:25:50,121 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:25:50,122 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:25:50,123 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:25:50,123 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:25:50,124 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:25:50,124 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:25:50,124 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:25:50,124 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:25:50,124 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:25:50,124 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:25:50,125 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:25:50,125 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:25:50,125 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:25:50,126 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:25:50,126 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:25:50,126 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:25:50,126 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:25:50,127 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:25:50,127 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:25:50,127 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:25:50,127 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:25:50,423 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:25:50,439 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:25:50,445 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:25:50,447 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:25:50,448 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:25:50,449 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-10 15:25:50,540 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbf96dd93/bfe9838d79a6474fa5df2142f5b3d714/FLAGd8d704090 [2020-07-10 15:25:51,057 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:25:51,058 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/data_structures_set_multi_proc_trivial_ground.i [2020-07-10 15:25:51,066 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbf96dd93/bfe9838d79a6474fa5df2142f5b3d714/FLAGd8d704090 [2020-07-10 15:25:51,410 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbf96dd93/bfe9838d79a6474fa5df2142f5b3d714 [2020-07-10 15:25:51,422 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:25:51,424 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:25:51,426 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:25:51,426 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:25:51,431 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:25:51,433 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:25:51" (1/1) ... [2020-07-10 15:25:51,437 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1279cfc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:51, skipping insertion in model container [2020-07-10 15:25:51,437 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:25:51" (1/1) ... [2020-07-10 15:25:51,446 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:25:51,475 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:25:51,697 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:25:51,709 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:25:51,743 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:25:51,843 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:25:51,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:51 WrapperNode [2020-07-10 15:25:51,844 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:25:51,847 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:25:51,847 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:25:51,847 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:25:51,862 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:51" (1/1) ... [2020-07-10 15:25:51,862 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:51" (1/1) ... [2020-07-10 15:25:51,872 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:51" (1/1) ... [2020-07-10 15:25:51,872 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:51" (1/1) ... [2020-07-10 15:25:51,888 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:51" (1/1) ... [2020-07-10 15:25:51,900 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:51" (1/1) ... [2020-07-10 15:25:51,905 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:51" (1/1) ... [2020-07-10 15:25:51,911 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:25:51,914 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:25:51,915 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:25:51,915 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:25:51,918 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:51" (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-10 15:25:51,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:25:51,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:25:51,984 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:25:51,984 INFO L138 BoogieDeclarations]: Found implementation of procedure insert [2020-07-10 15:25:51,984 INFO L138 BoogieDeclarations]: Found implementation of procedure elem_exists [2020-07-10 15:25:51,985 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:25:51,985 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:25:51,985 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:25:51,985 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:25:51,985 INFO L130 BoogieDeclarations]: Found specification of procedure insert [2020-07-10 15:25:51,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:25:51,985 INFO L130 BoogieDeclarations]: Found specification of procedure elem_exists [2020-07-10 15:25:51,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:25:51,986 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:25:51,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 15:25:51,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:25:51,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:25:51,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:25:52,653 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:25:52,654 INFO L295 CfgBuilder]: Removed 10 assume(true) statements. [2020-07-10 15:25:52,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:25:52 BoogieIcfgContainer [2020-07-10 15:25:52,659 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:25:52,660 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:25:52,661 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:25:52,664 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:25:52,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:25:51" (1/3) ... [2020-07-10 15:25:52,665 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5daeaf1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:25:52, skipping insertion in model container [2020-07-10 15:25:52,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:51" (2/3) ... [2020-07-10 15:25:52,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5daeaf1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:25:52, skipping insertion in model container [2020-07-10 15:25:52,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:25:52" (3/3) ... [2020-07-10 15:25:52,668 INFO L109 eAbstractionObserver]: Analyzing ICFG data_structures_set_multi_proc_trivial_ground.i [2020-07-10 15:25:52,677 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:25:52,686 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:25:52,703 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:25:52,730 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:25:52,730 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:25:52,730 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:25:52,730 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:25:52,731 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:25:52,731 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:25:52,731 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:25:52,731 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:25:52,750 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2020-07-10 15:25:52,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-10 15:25:52,758 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:25:52,759 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:25:52,760 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:25:52,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:25:52,768 INFO L82 PathProgramCache]: Analyzing trace with hash 528217166, now seen corresponding path program 1 times [2020-07-10 15:25:52,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:25:52,781 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547507584] [2020-07-10 15:25:52,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:25:52,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:53,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:53,080 INFO L280 TraceCheckUtils]: 0: Hoare triple {70#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {64#true} is VALID [2020-07-10 15:25:53,081 INFO L280 TraceCheckUtils]: 1: Hoare triple {64#true} assume true; {64#true} is VALID [2020-07-10 15:25:53,082 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {64#true} {64#true} #176#return; {64#true} is VALID [2020-07-10 15:25:53,090 INFO L263 TraceCheckUtils]: 0: Hoare triple {64#true} call ULTIMATE.init(); {70#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:25:53,091 INFO L280 TraceCheckUtils]: 1: Hoare triple {70#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {64#true} is VALID [2020-07-10 15:25:53,092 INFO L280 TraceCheckUtils]: 2: Hoare triple {64#true} assume true; {64#true} is VALID [2020-07-10 15:25:53,094 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {64#true} {64#true} #176#return; {64#true} is VALID [2020-07-10 15:25:53,095 INFO L263 TraceCheckUtils]: 4: Hoare triple {64#true} call #t~ret23 := main(); {64#true} is VALID [2020-07-10 15:25:53,098 INFO L280 TraceCheckUtils]: 5: Hoare triple {64#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.allocOnStack(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {69#(= 0 main_~x~0)} is VALID [2020-07-10 15:25:53,099 INFO L280 TraceCheckUtils]: 6: Hoare triple {69#(= 0 main_~x~0)} assume !(~x~0 < 100000); {65#false} is VALID [2020-07-10 15:25:53,100 INFO L280 TraceCheckUtils]: 7: Hoare triple {65#false} ~x~0 := 0; {65#false} is VALID [2020-07-10 15:25:53,100 INFO L280 TraceCheckUtils]: 8: Hoare triple {65#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {65#false} is VALID [2020-07-10 15:25:53,101 INFO L280 TraceCheckUtils]: 9: Hoare triple {65#false} assume !!(~y~0 < ~n~0);call #t~mem6 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {65#false} is VALID [2020-07-10 15:25:53,102 INFO L263 TraceCheckUtils]: 10: Hoare triple {65#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {65#false} is VALID [2020-07-10 15:25:53,102 INFO L280 TraceCheckUtils]: 11: Hoare triple {65#false} ~cond := #in~cond; {65#false} is VALID [2020-07-10 15:25:53,103 INFO L280 TraceCheckUtils]: 12: Hoare triple {65#false} assume 0 == ~cond; {65#false} is VALID [2020-07-10 15:25:53,103 INFO L280 TraceCheckUtils]: 13: Hoare triple {65#false} assume !false; {65#false} is VALID [2020-07-10 15:25:53,105 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-10 15:25:53,107 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547507584] [2020-07-10 15:25:53,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:25:53,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 15:25:53,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073656038] [2020-07-10 15:25:53,121 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-07-10 15:25:53,127 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:25:53,132 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 15:25:53,181 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:25:53,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 15:25:53,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:25:53,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 15:25:53,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 15:25:53,197 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 4 states. [2020-07-10 15:25:54,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:54,030 INFO L93 Difference]: Finished difference Result 150 states and 228 transitions. [2020-07-10 15:25:54,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 15:25:54,030 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-07-10 15:25:54,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:25:54,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:25:54,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 228 transitions. [2020-07-10 15:25:54,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:25:54,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 228 transitions. [2020-07-10 15:25:54,090 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 228 transitions. [2020-07-10 15:25:54,367 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 228 edges. 228 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:25:54,393 INFO L225 Difference]: With dead ends: 150 [2020-07-10 15:25:54,393 INFO L226 Difference]: Without dead ends: 89 [2020-07-10 15:25:54,397 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 15:25:54,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-07-10 15:25:54,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 57. [2020-07-10 15:25:54,459 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:25:54,459 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 57 states. [2020-07-10 15:25:54,460 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 57 states. [2020-07-10 15:25:54,460 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 57 states. [2020-07-10 15:25:54,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:54,471 INFO L93 Difference]: Finished difference Result 89 states and 115 transitions. [2020-07-10 15:25:54,471 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 115 transitions. [2020-07-10 15:25:54,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:54,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:54,474 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 89 states. [2020-07-10 15:25:54,474 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 89 states. [2020-07-10 15:25:54,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:54,483 INFO L93 Difference]: Finished difference Result 89 states and 115 transitions. [2020-07-10 15:25:54,484 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 115 transitions. [2020-07-10 15:25:54,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:54,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:54,486 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:25:54,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:25:54,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-07-10 15:25:54,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2020-07-10 15:25:54,497 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 14 [2020-07-10 15:25:54,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:25:54,498 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 70 transitions. [2020-07-10 15:25:54,498 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 15:25:54,499 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2020-07-10 15:25:54,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-10 15:25:54,503 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:25:54,503 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:25:54,503 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:25:54,503 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:25:54,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:25:54,504 INFO L82 PathProgramCache]: Analyzing trace with hash 396779504, now seen corresponding path program 1 times [2020-07-10 15:25:54,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:25:54,505 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488518455] [2020-07-10 15:25:54,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:25:54,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:54,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:54,582 INFO L280 TraceCheckUtils]: 0: Hoare triple {541#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {534#true} is VALID [2020-07-10 15:25:54,583 INFO L280 TraceCheckUtils]: 1: Hoare triple {534#true} assume true; {534#true} is VALID [2020-07-10 15:25:54,583 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {534#true} {534#true} #176#return; {534#true} is VALID [2020-07-10 15:25:54,584 INFO L263 TraceCheckUtils]: 0: Hoare triple {534#true} call ULTIMATE.init(); {541#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:25:54,585 INFO L280 TraceCheckUtils]: 1: Hoare triple {541#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {534#true} is VALID [2020-07-10 15:25:54,585 INFO L280 TraceCheckUtils]: 2: Hoare triple {534#true} assume true; {534#true} is VALID [2020-07-10 15:25:54,585 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {534#true} {534#true} #176#return; {534#true} is VALID [2020-07-10 15:25:54,586 INFO L263 TraceCheckUtils]: 4: Hoare triple {534#true} call #t~ret23 := main(); {534#true} is VALID [2020-07-10 15:25:54,587 INFO L280 TraceCheckUtils]: 5: Hoare triple {534#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.allocOnStack(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {539#(= 0 main_~x~0)} is VALID [2020-07-10 15:25:54,588 INFO L280 TraceCheckUtils]: 6: Hoare triple {539#(= 0 main_~x~0)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {539#(= 0 main_~x~0)} is VALID [2020-07-10 15:25:54,589 INFO L280 TraceCheckUtils]: 7: Hoare triple {539#(= 0 main_~x~0)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {540#(<= main_~x~0 1)} is VALID [2020-07-10 15:25:54,590 INFO L280 TraceCheckUtils]: 8: Hoare triple {540#(<= main_~x~0 1)} assume !(~x~0 < 100000); {535#false} is VALID [2020-07-10 15:25:54,590 INFO L280 TraceCheckUtils]: 9: Hoare triple {535#false} ~x~0 := 0; {535#false} is VALID [2020-07-10 15:25:54,590 INFO L280 TraceCheckUtils]: 10: Hoare triple {535#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {535#false} is VALID [2020-07-10 15:25:54,591 INFO L280 TraceCheckUtils]: 11: Hoare triple {535#false} assume !!(~y~0 < ~n~0);call #t~mem6 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {535#false} is VALID [2020-07-10 15:25:54,591 INFO L263 TraceCheckUtils]: 12: Hoare triple {535#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {535#false} is VALID [2020-07-10 15:25:54,592 INFO L280 TraceCheckUtils]: 13: Hoare triple {535#false} ~cond := #in~cond; {535#false} is VALID [2020-07-10 15:25:54,592 INFO L280 TraceCheckUtils]: 14: Hoare triple {535#false} assume 0 == ~cond; {535#false} is VALID [2020-07-10 15:25:54,592 INFO L280 TraceCheckUtils]: 15: Hoare triple {535#false} assume !false; {535#false} is VALID [2020-07-10 15:25:54,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:25:54,595 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488518455] [2020-07-10 15:25:54,595 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277130195] [2020-07-10 15:25:54,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:25:54,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:54,642 INFO L264 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-10 15:25:54,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:54,665 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:25:54,729 INFO L263 TraceCheckUtils]: 0: Hoare triple {534#true} call ULTIMATE.init(); {534#true} is VALID [2020-07-10 15:25:54,729 INFO L280 TraceCheckUtils]: 1: Hoare triple {534#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {534#true} is VALID [2020-07-10 15:25:54,729 INFO L280 TraceCheckUtils]: 2: Hoare triple {534#true} assume true; {534#true} is VALID [2020-07-10 15:25:54,730 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {534#true} {534#true} #176#return; {534#true} is VALID [2020-07-10 15:25:54,730 INFO L263 TraceCheckUtils]: 4: Hoare triple {534#true} call #t~ret23 := main(); {534#true} is VALID [2020-07-10 15:25:54,731 INFO L280 TraceCheckUtils]: 5: Hoare triple {534#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.allocOnStack(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {560#(<= main_~x~0 0)} is VALID [2020-07-10 15:25:54,732 INFO L280 TraceCheckUtils]: 6: Hoare triple {560#(<= main_~x~0 0)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {560#(<= main_~x~0 0)} is VALID [2020-07-10 15:25:54,733 INFO L280 TraceCheckUtils]: 7: Hoare triple {560#(<= main_~x~0 0)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {540#(<= main_~x~0 1)} is VALID [2020-07-10 15:25:54,734 INFO L280 TraceCheckUtils]: 8: Hoare triple {540#(<= main_~x~0 1)} assume !(~x~0 < 100000); {535#false} is VALID [2020-07-10 15:25:54,734 INFO L280 TraceCheckUtils]: 9: Hoare triple {535#false} ~x~0 := 0; {535#false} is VALID [2020-07-10 15:25:54,735 INFO L280 TraceCheckUtils]: 10: Hoare triple {535#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {535#false} is VALID [2020-07-10 15:25:54,735 INFO L280 TraceCheckUtils]: 11: Hoare triple {535#false} assume !!(~y~0 < ~n~0);call #t~mem6 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {535#false} is VALID [2020-07-10 15:25:54,735 INFO L263 TraceCheckUtils]: 12: Hoare triple {535#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {535#false} is VALID [2020-07-10 15:25:54,736 INFO L280 TraceCheckUtils]: 13: Hoare triple {535#false} ~cond := #in~cond; {535#false} is VALID [2020-07-10 15:25:54,736 INFO L280 TraceCheckUtils]: 14: Hoare triple {535#false} assume 0 == ~cond; {535#false} is VALID [2020-07-10 15:25:54,736 INFO L280 TraceCheckUtils]: 15: Hoare triple {535#false} assume !false; {535#false} is VALID [2020-07-10 15:25:54,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:25:54,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:25:54,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2020-07-10 15:25:54,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007580209] [2020-07-10 15:25:54,740 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-10 15:25:54,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:25:54,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:25:54,782 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:25:54,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:25:54,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:25:54,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:25:54,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:25:54,783 INFO L87 Difference]: Start difference. First operand 57 states and 70 transitions. Second operand 6 states. [2020-07-10 15:25:55,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:55,656 INFO L93 Difference]: Finished difference Result 170 states and 222 transitions. [2020-07-10 15:25:55,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 15:25:55,656 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-10 15:25:55,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:25:55,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:25:55,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 222 transitions. [2020-07-10 15:25:55,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:25:55,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 222 transitions. [2020-07-10 15:25:55,669 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 222 transitions. [2020-07-10 15:25:55,944 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 222 edges. 222 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:25:55,950 INFO L225 Difference]: With dead ends: 170 [2020-07-10 15:25:55,950 INFO L226 Difference]: Without dead ends: 122 [2020-07-10 15:25:55,952 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:25:55,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-07-10 15:25:55,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 59. [2020-07-10 15:25:55,978 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:25:55,978 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand 59 states. [2020-07-10 15:25:55,979 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 59 states. [2020-07-10 15:25:55,979 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 59 states. [2020-07-10 15:25:55,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:55,987 INFO L93 Difference]: Finished difference Result 122 states and 161 transitions. [2020-07-10 15:25:55,987 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 161 transitions. [2020-07-10 15:25:55,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:55,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:55,990 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 122 states. [2020-07-10 15:25:55,990 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 122 states. [2020-07-10 15:25:55,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:55,998 INFO L93 Difference]: Finished difference Result 122 states and 161 transitions. [2020-07-10 15:25:55,998 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 161 transitions. [2020-07-10 15:25:56,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:56,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:56,000 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:25:56,001 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:25:56,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-07-10 15:25:56,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2020-07-10 15:25:56,004 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 16 [2020-07-10 15:25:56,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:25:56,004 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2020-07-10 15:25:56,005 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:25:56,005 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2020-07-10 15:25:56,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-10 15:25:56,006 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:25:56,006 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:25:56,220 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-10 15:25:56,220 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:25:56,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:25:56,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1360762094, now seen corresponding path program 2 times [2020-07-10 15:25:56,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:25:56,222 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443931147] [2020-07-10 15:25:56,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:25:56,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:56,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:56,304 INFO L280 TraceCheckUtils]: 0: Hoare triple {1162#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1154#true} is VALID [2020-07-10 15:25:56,305 INFO L280 TraceCheckUtils]: 1: Hoare triple {1154#true} assume true; {1154#true} is VALID [2020-07-10 15:25:56,305 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1154#true} {1154#true} #176#return; {1154#true} is VALID [2020-07-10 15:25:56,306 INFO L263 TraceCheckUtils]: 0: Hoare triple {1154#true} call ULTIMATE.init(); {1162#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:25:56,307 INFO L280 TraceCheckUtils]: 1: Hoare triple {1162#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1154#true} is VALID [2020-07-10 15:25:56,307 INFO L280 TraceCheckUtils]: 2: Hoare triple {1154#true} assume true; {1154#true} is VALID [2020-07-10 15:25:56,307 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1154#true} {1154#true} #176#return; {1154#true} is VALID [2020-07-10 15:25:56,308 INFO L263 TraceCheckUtils]: 4: Hoare triple {1154#true} call #t~ret23 := main(); {1154#true} is VALID [2020-07-10 15:25:56,308 INFO L280 TraceCheckUtils]: 5: Hoare triple {1154#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.allocOnStack(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {1159#(= 0 main_~x~0)} is VALID [2020-07-10 15:25:56,309 INFO L280 TraceCheckUtils]: 6: Hoare triple {1159#(= 0 main_~x~0)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {1159#(= 0 main_~x~0)} is VALID [2020-07-10 15:25:56,310 INFO L280 TraceCheckUtils]: 7: Hoare triple {1159#(= 0 main_~x~0)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {1160#(<= main_~x~0 1)} is VALID [2020-07-10 15:25:56,311 INFO L280 TraceCheckUtils]: 8: Hoare triple {1160#(<= main_~x~0 1)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {1160#(<= main_~x~0 1)} is VALID [2020-07-10 15:25:56,312 INFO L280 TraceCheckUtils]: 9: Hoare triple {1160#(<= main_~x~0 1)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {1161#(<= main_~x~0 2)} is VALID [2020-07-10 15:25:56,312 INFO L280 TraceCheckUtils]: 10: Hoare triple {1161#(<= main_~x~0 2)} assume !(~x~0 < 100000); {1155#false} is VALID [2020-07-10 15:25:56,313 INFO L280 TraceCheckUtils]: 11: Hoare triple {1155#false} ~x~0 := 0; {1155#false} is VALID [2020-07-10 15:25:56,313 INFO L280 TraceCheckUtils]: 12: Hoare triple {1155#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {1155#false} is VALID [2020-07-10 15:25:56,313 INFO L280 TraceCheckUtils]: 13: Hoare triple {1155#false} assume !!(~y~0 < ~n~0);call #t~mem6 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {1155#false} is VALID [2020-07-10 15:25:56,314 INFO L263 TraceCheckUtils]: 14: Hoare triple {1155#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {1155#false} is VALID [2020-07-10 15:25:56,314 INFO L280 TraceCheckUtils]: 15: Hoare triple {1155#false} ~cond := #in~cond; {1155#false} is VALID [2020-07-10 15:25:56,314 INFO L280 TraceCheckUtils]: 16: Hoare triple {1155#false} assume 0 == ~cond; {1155#false} is VALID [2020-07-10 15:25:56,315 INFO L280 TraceCheckUtils]: 17: Hoare triple {1155#false} assume !false; {1155#false} is VALID [2020-07-10 15:25:56,315 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:25:56,316 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443931147] [2020-07-10 15:25:56,316 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538026315] [2020-07-10 15:25:56,316 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:25:56,366 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-10 15:25:56,367 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:25:56,368 INFO L264 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-10 15:25:56,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:56,378 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:25:56,426 INFO L263 TraceCheckUtils]: 0: Hoare triple {1154#true} call ULTIMATE.init(); {1154#true} is VALID [2020-07-10 15:25:56,427 INFO L280 TraceCheckUtils]: 1: Hoare triple {1154#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1154#true} is VALID [2020-07-10 15:25:56,427 INFO L280 TraceCheckUtils]: 2: Hoare triple {1154#true} assume true; {1154#true} is VALID [2020-07-10 15:25:56,427 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1154#true} {1154#true} #176#return; {1154#true} is VALID [2020-07-10 15:25:56,428 INFO L263 TraceCheckUtils]: 4: Hoare triple {1154#true} call #t~ret23 := main(); {1154#true} is VALID [2020-07-10 15:25:56,429 INFO L280 TraceCheckUtils]: 5: Hoare triple {1154#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.allocOnStack(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {1181#(<= main_~n~0 0)} is VALID [2020-07-10 15:25:56,429 INFO L280 TraceCheckUtils]: 6: Hoare triple {1181#(<= main_~n~0 0)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {1181#(<= main_~n~0 0)} is VALID [2020-07-10 15:25:56,430 INFO L280 TraceCheckUtils]: 7: Hoare triple {1181#(<= main_~n~0 0)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {1181#(<= main_~n~0 0)} is VALID [2020-07-10 15:25:56,431 INFO L280 TraceCheckUtils]: 8: Hoare triple {1181#(<= main_~n~0 0)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {1181#(<= main_~n~0 0)} is VALID [2020-07-10 15:25:56,431 INFO L280 TraceCheckUtils]: 9: Hoare triple {1181#(<= main_~n~0 0)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {1181#(<= main_~n~0 0)} is VALID [2020-07-10 15:25:56,432 INFO L280 TraceCheckUtils]: 10: Hoare triple {1181#(<= main_~n~0 0)} assume !(~x~0 < 100000); {1181#(<= main_~n~0 0)} is VALID [2020-07-10 15:25:56,433 INFO L280 TraceCheckUtils]: 11: Hoare triple {1181#(<= main_~n~0 0)} ~x~0 := 0; {1200#(and (<= main_~n~0 0) (<= 0 main_~x~0))} is VALID [2020-07-10 15:25:56,434 INFO L280 TraceCheckUtils]: 12: Hoare triple {1200#(and (<= main_~n~0 0) (<= 0 main_~x~0))} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {1155#false} is VALID [2020-07-10 15:25:56,434 INFO L280 TraceCheckUtils]: 13: Hoare triple {1155#false} assume !!(~y~0 < ~n~0);call #t~mem6 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {1155#false} is VALID [2020-07-10 15:25:56,434 INFO L263 TraceCheckUtils]: 14: Hoare triple {1155#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {1155#false} is VALID [2020-07-10 15:25:56,435 INFO L280 TraceCheckUtils]: 15: Hoare triple {1155#false} ~cond := #in~cond; {1155#false} is VALID [2020-07-10 15:25:56,435 INFO L280 TraceCheckUtils]: 16: Hoare triple {1155#false} assume 0 == ~cond; {1155#false} is VALID [2020-07-10 15:25:56,435 INFO L280 TraceCheckUtils]: 17: Hoare triple {1155#false} assume !false; {1155#false} is VALID [2020-07-10 15:25:56,436 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-10 15:25:56,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:25:56,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2020-07-10 15:25:56,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473869099] [2020-07-10 15:25:56,437 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-07-10 15:25:56,437 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:25:56,438 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 15:25:56,454 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:25:56,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 15:25:56,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:25:56,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 15:25:56,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:25:56,455 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand 4 states. [2020-07-10 15:25:56,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:56,704 INFO L93 Difference]: Finished difference Result 112 states and 140 transitions. [2020-07-10 15:25:56,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:25:56,704 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-07-10 15:25:56,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:25:56,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:25:56,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2020-07-10 15:25:56,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:25:56,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2020-07-10 15:25:56,719 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 137 transitions. [2020-07-10 15:25:56,892 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-10 15:25:56,895 INFO L225 Difference]: With dead ends: 112 [2020-07-10 15:25:56,895 INFO L226 Difference]: Without dead ends: 63 [2020-07-10 15:25:56,896 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:25:56,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-07-10 15:25:56,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2020-07-10 15:25:56,923 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:25:56,924 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 61 states. [2020-07-10 15:25:56,924 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 61 states. [2020-07-10 15:25:56,924 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 61 states. [2020-07-10 15:25:56,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:56,927 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2020-07-10 15:25:56,928 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2020-07-10 15:25:56,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:56,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:56,929 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 63 states. [2020-07-10 15:25:56,929 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 63 states. [2020-07-10 15:25:56,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:56,932 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2020-07-10 15:25:56,932 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2020-07-10 15:25:56,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:56,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:56,933 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:25:56,933 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:25:56,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-07-10 15:25:56,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2020-07-10 15:25:56,937 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 18 [2020-07-10 15:25:56,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:25:56,937 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2020-07-10 15:25:56,937 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 15:25:56,937 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2020-07-10 15:25:56,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-10 15:25:56,938 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:25:56,939 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:25:57,152 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:25:57,153 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:25:57,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:25:57,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1841898364, now seen corresponding path program 1 times [2020-07-10 15:25:57,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:25:57,154 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052543335] [2020-07-10 15:25:57,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:25:57,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:57,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:57,257 INFO L280 TraceCheckUtils]: 0: Hoare triple {1602#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1586#true} is VALID [2020-07-10 15:25:57,258 INFO L280 TraceCheckUtils]: 1: Hoare triple {1586#true} assume true; {1586#true} is VALID [2020-07-10 15:25:57,258 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1586#true} {1586#true} #176#return; {1586#true} is VALID [2020-07-10 15:25:57,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:57,274 INFO L280 TraceCheckUtils]: 0: Hoare triple {1586#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {1586#true} is VALID [2020-07-10 15:25:57,274 INFO L280 TraceCheckUtils]: 1: Hoare triple {1586#true} assume !(~i~0 < ~size); {1586#true} is VALID [2020-07-10 15:25:57,274 INFO L280 TraceCheckUtils]: 2: Hoare triple {1586#true} #res := 0; {1586#true} is VALID [2020-07-10 15:25:57,275 INFO L280 TraceCheckUtils]: 3: Hoare triple {1586#true} assume true; {1586#true} is VALID [2020-07-10 15:25:57,275 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1586#true} {1587#false} #182#return; {1587#false} is VALID [2020-07-10 15:25:57,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:57,295 INFO L280 TraceCheckUtils]: 0: Hoare triple {1603#(= |#memory_int| |old(#memory_int)|)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4);#res := 1 + ~size; {1586#true} is VALID [2020-07-10 15:25:57,295 INFO L280 TraceCheckUtils]: 1: Hoare triple {1586#true} assume true; {1586#true} is VALID [2020-07-10 15:25:57,296 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1586#true} {1587#false} #184#return; {1587#false} is VALID [2020-07-10 15:25:57,297 INFO L263 TraceCheckUtils]: 0: Hoare triple {1586#true} call ULTIMATE.init(); {1602#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:25:57,297 INFO L280 TraceCheckUtils]: 1: Hoare triple {1602#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1586#true} is VALID [2020-07-10 15:25:57,297 INFO L280 TraceCheckUtils]: 2: Hoare triple {1586#true} assume true; {1586#true} is VALID [2020-07-10 15:25:57,297 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1586#true} {1586#true} #176#return; {1586#true} is VALID [2020-07-10 15:25:57,298 INFO L263 TraceCheckUtils]: 4: Hoare triple {1586#true} call #t~ret23 := main(); {1586#true} is VALID [2020-07-10 15:25:57,301 INFO L280 TraceCheckUtils]: 5: Hoare triple {1586#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.allocOnStack(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {1591#(= 0 main_~x~0)} is VALID [2020-07-10 15:25:57,302 INFO L280 TraceCheckUtils]: 6: Hoare triple {1591#(= 0 main_~x~0)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {1591#(= 0 main_~x~0)} is VALID [2020-07-10 15:25:57,302 INFO L280 TraceCheckUtils]: 7: Hoare triple {1591#(= 0 main_~x~0)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {1592#(<= main_~x~0 1)} is VALID [2020-07-10 15:25:57,303 INFO L280 TraceCheckUtils]: 8: Hoare triple {1592#(<= main_~x~0 1)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {1592#(<= main_~x~0 1)} is VALID [2020-07-10 15:25:57,303 INFO L280 TraceCheckUtils]: 9: Hoare triple {1592#(<= main_~x~0 1)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {1593#(<= main_~x~0 2)} is VALID [2020-07-10 15:25:57,304 INFO L280 TraceCheckUtils]: 10: Hoare triple {1593#(<= main_~x~0 2)} assume !(~x~0 < 100000); {1587#false} is VALID [2020-07-10 15:25:57,304 INFO L280 TraceCheckUtils]: 11: Hoare triple {1587#false} ~x~0 := 0; {1587#false} is VALID [2020-07-10 15:25:57,304 INFO L280 TraceCheckUtils]: 12: Hoare triple {1587#false} assume !(~x~0 < ~n~0); {1587#false} is VALID [2020-07-10 15:25:57,304 INFO L280 TraceCheckUtils]: 13: Hoare triple {1587#false} call ~#values~0.base, ~#values~0.offset := #Ultimate.allocOnStack(400000);havoc ~v~0;~v~0 := 0; {1587#false} is VALID [2020-07-10 15:25:57,305 INFO L280 TraceCheckUtils]: 14: Hoare triple {1587#false} assume !(~v~0 < 100000); {1587#false} is VALID [2020-07-10 15:25:57,305 INFO L280 TraceCheckUtils]: 15: Hoare triple {1587#false} ~v~0 := 0; {1587#false} is VALID [2020-07-10 15:25:57,305 INFO L280 TraceCheckUtils]: 16: Hoare triple {1587#false} assume !!(~v~0 < 100000);call #t~mem11 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {1587#false} is VALID [2020-07-10 15:25:57,305 INFO L263 TraceCheckUtils]: 17: Hoare triple {1587#false} call #t~ret12 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem11); {1586#true} is VALID [2020-07-10 15:25:57,306 INFO L280 TraceCheckUtils]: 18: Hoare triple {1586#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {1586#true} is VALID [2020-07-10 15:25:57,306 INFO L280 TraceCheckUtils]: 19: Hoare triple {1586#true} assume !(~i~0 < ~size); {1586#true} is VALID [2020-07-10 15:25:57,306 INFO L280 TraceCheckUtils]: 20: Hoare triple {1586#true} #res := 0; {1586#true} is VALID [2020-07-10 15:25:57,306 INFO L280 TraceCheckUtils]: 21: Hoare triple {1586#true} assume true; {1586#true} is VALID [2020-07-10 15:25:57,307 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1586#true} {1587#false} #182#return; {1587#false} is VALID [2020-07-10 15:25:57,307 INFO L280 TraceCheckUtils]: 23: Hoare triple {1587#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {1587#false} is VALID [2020-07-10 15:25:57,307 INFO L280 TraceCheckUtils]: 24: Hoare triple {1587#false} assume 0 != #t~ret12;havoc #t~ret12;havoc #t~mem11;call #t~mem13 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {1587#false} is VALID [2020-07-10 15:25:57,308 INFO L263 TraceCheckUtils]: 25: Hoare triple {1587#false} call #t~ret14 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem13); {1603#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:25:57,308 INFO L280 TraceCheckUtils]: 26: Hoare triple {1603#(= |#memory_int| |old(#memory_int)|)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4);#res := 1 + ~size; {1586#true} is VALID [2020-07-10 15:25:57,308 INFO L280 TraceCheckUtils]: 27: Hoare triple {1586#true} assume true; {1586#true} is VALID [2020-07-10 15:25:57,308 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1586#true} {1587#false} #184#return; {1587#false} is VALID [2020-07-10 15:25:57,309 INFO L280 TraceCheckUtils]: 29: Hoare triple {1587#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~n~0 := #t~ret14;havoc #t~mem13;havoc #t~ret14; {1587#false} is VALID [2020-07-10 15:25:57,309 INFO L280 TraceCheckUtils]: 30: Hoare triple {1587#false} ~x~0 := 0; {1587#false} is VALID [2020-07-10 15:25:57,309 INFO L280 TraceCheckUtils]: 31: Hoare triple {1587#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {1587#false} is VALID [2020-07-10 15:25:57,309 INFO L280 TraceCheckUtils]: 32: Hoare triple {1587#false} assume !!(~y~0 < ~n~0);call #t~mem17 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem18 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {1587#false} is VALID [2020-07-10 15:25:57,310 INFO L263 TraceCheckUtils]: 33: Hoare triple {1587#false} call __VERIFIER_assert((if #t~mem17 != #t~mem18 then 1 else 0)); {1587#false} is VALID [2020-07-10 15:25:57,310 INFO L280 TraceCheckUtils]: 34: Hoare triple {1587#false} ~cond := #in~cond; {1587#false} is VALID [2020-07-10 15:25:57,310 INFO L280 TraceCheckUtils]: 35: Hoare triple {1587#false} assume 0 == ~cond; {1587#false} is VALID [2020-07-10 15:25:57,311 INFO L280 TraceCheckUtils]: 36: Hoare triple {1587#false} assume !false; {1587#false} is VALID [2020-07-10 15:25:57,312 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:25:57,313 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052543335] [2020-07-10 15:25:57,313 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33284476] [2020-07-10 15:25:57,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:25:57,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:57,359 INFO L264 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-10 15:25:57,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:57,373 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:25:57,421 INFO L263 TraceCheckUtils]: 0: Hoare triple {1586#true} call ULTIMATE.init(); {1586#true} is VALID [2020-07-10 15:25:57,421 INFO L280 TraceCheckUtils]: 1: Hoare triple {1586#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1586#true} is VALID [2020-07-10 15:25:57,422 INFO L280 TraceCheckUtils]: 2: Hoare triple {1586#true} assume true; {1586#true} is VALID [2020-07-10 15:25:57,422 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1586#true} {1586#true} #176#return; {1586#true} is VALID [2020-07-10 15:25:57,422 INFO L263 TraceCheckUtils]: 4: Hoare triple {1586#true} call #t~ret23 := main(); {1586#true} is VALID [2020-07-10 15:25:57,422 INFO L280 TraceCheckUtils]: 5: Hoare triple {1586#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.allocOnStack(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {1586#true} is VALID [2020-07-10 15:25:57,423 INFO L280 TraceCheckUtils]: 6: Hoare triple {1586#true} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {1586#true} is VALID [2020-07-10 15:25:57,423 INFO L280 TraceCheckUtils]: 7: Hoare triple {1586#true} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {1586#true} is VALID [2020-07-10 15:25:57,423 INFO L280 TraceCheckUtils]: 8: Hoare triple {1586#true} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {1586#true} is VALID [2020-07-10 15:25:57,423 INFO L280 TraceCheckUtils]: 9: Hoare triple {1586#true} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {1586#true} is VALID [2020-07-10 15:25:57,424 INFO L280 TraceCheckUtils]: 10: Hoare triple {1586#true} assume !(~x~0 < 100000); {1586#true} is VALID [2020-07-10 15:25:57,424 INFO L280 TraceCheckUtils]: 11: Hoare triple {1586#true} ~x~0 := 0; {1586#true} is VALID [2020-07-10 15:25:57,424 INFO L280 TraceCheckUtils]: 12: Hoare triple {1586#true} assume !(~x~0 < ~n~0); {1586#true} is VALID [2020-07-10 15:25:57,425 INFO L280 TraceCheckUtils]: 13: Hoare triple {1586#true} call ~#values~0.base, ~#values~0.offset := #Ultimate.allocOnStack(400000);havoc ~v~0;~v~0 := 0; {1646#(<= main_~v~0 0)} is VALID [2020-07-10 15:25:57,426 INFO L280 TraceCheckUtils]: 14: Hoare triple {1646#(<= main_~v~0 0)} assume !(~v~0 < 100000); {1587#false} is VALID [2020-07-10 15:25:57,426 INFO L280 TraceCheckUtils]: 15: Hoare triple {1587#false} ~v~0 := 0; {1587#false} is VALID [2020-07-10 15:25:57,427 INFO L280 TraceCheckUtils]: 16: Hoare triple {1587#false} assume !!(~v~0 < 100000);call #t~mem11 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {1587#false} is VALID [2020-07-10 15:25:57,427 INFO L263 TraceCheckUtils]: 17: Hoare triple {1587#false} call #t~ret12 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem11); {1587#false} is VALID [2020-07-10 15:25:57,427 INFO L280 TraceCheckUtils]: 18: Hoare triple {1587#false} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {1587#false} is VALID [2020-07-10 15:25:57,427 INFO L280 TraceCheckUtils]: 19: Hoare triple {1587#false} assume !(~i~0 < ~size); {1587#false} is VALID [2020-07-10 15:25:57,427 INFO L280 TraceCheckUtils]: 20: Hoare triple {1587#false} #res := 0; {1587#false} is VALID [2020-07-10 15:25:57,428 INFO L280 TraceCheckUtils]: 21: Hoare triple {1587#false} assume true; {1587#false} is VALID [2020-07-10 15:25:57,428 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1587#false} {1587#false} #182#return; {1587#false} is VALID [2020-07-10 15:25:57,428 INFO L280 TraceCheckUtils]: 23: Hoare triple {1587#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {1587#false} is VALID [2020-07-10 15:25:57,428 INFO L280 TraceCheckUtils]: 24: Hoare triple {1587#false} assume 0 != #t~ret12;havoc #t~ret12;havoc #t~mem11;call #t~mem13 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {1587#false} is VALID [2020-07-10 15:25:57,429 INFO L263 TraceCheckUtils]: 25: Hoare triple {1587#false} call #t~ret14 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem13); {1587#false} is VALID [2020-07-10 15:25:57,429 INFO L280 TraceCheckUtils]: 26: Hoare triple {1587#false} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4);#res := 1 + ~size; {1587#false} is VALID [2020-07-10 15:25:57,429 INFO L280 TraceCheckUtils]: 27: Hoare triple {1587#false} assume true; {1587#false} is VALID [2020-07-10 15:25:57,430 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1587#false} {1587#false} #184#return; {1587#false} is VALID [2020-07-10 15:25:57,430 INFO L280 TraceCheckUtils]: 29: Hoare triple {1587#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~n~0 := #t~ret14;havoc #t~mem13;havoc #t~ret14; {1587#false} is VALID [2020-07-10 15:25:57,430 INFO L280 TraceCheckUtils]: 30: Hoare triple {1587#false} ~x~0 := 0; {1587#false} is VALID [2020-07-10 15:25:57,430 INFO L280 TraceCheckUtils]: 31: Hoare triple {1587#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {1587#false} is VALID [2020-07-10 15:25:57,431 INFO L280 TraceCheckUtils]: 32: Hoare triple {1587#false} assume !!(~y~0 < ~n~0);call #t~mem17 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem18 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {1587#false} is VALID [2020-07-10 15:25:57,431 INFO L263 TraceCheckUtils]: 33: Hoare triple {1587#false} call __VERIFIER_assert((if #t~mem17 != #t~mem18 then 1 else 0)); {1587#false} is VALID [2020-07-10 15:25:57,431 INFO L280 TraceCheckUtils]: 34: Hoare triple {1587#false} ~cond := #in~cond; {1587#false} is VALID [2020-07-10 15:25:57,431 INFO L280 TraceCheckUtils]: 35: Hoare triple {1587#false} assume 0 == ~cond; {1587#false} is VALID [2020-07-10 15:25:57,432 INFO L280 TraceCheckUtils]: 36: Hoare triple {1587#false} assume !false; {1587#false} is VALID [2020-07-10 15:25:57,433 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-10 15:25:57,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:25:57,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2020-07-10 15:25:57,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866230033] [2020-07-10 15:25:57,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2020-07-10 15:25:57,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:25:57,435 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:25:57,471 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:25:57,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:25:57,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:25:57,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:25:57,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:25:57,473 INFO L87 Difference]: Start difference. First operand 61 states and 73 transitions. Second operand 3 states. [2020-07-10 15:25:57,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:57,623 INFO L93 Difference]: Finished difference Result 125 states and 154 transitions. [2020-07-10 15:25:57,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:25:57,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2020-07-10 15:25:57,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:25:57,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:25:57,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2020-07-10 15:25:57,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:25:57,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2020-07-10 15:25:57,630 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 130 transitions. [2020-07-10 15:25:57,775 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:25:57,779 INFO L225 Difference]: With dead ends: 125 [2020-07-10 15:25:57,779 INFO L226 Difference]: Without dead ends: 80 [2020-07-10 15:25:57,780 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:25:57,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-07-10 15:25:57,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 62. [2020-07-10 15:25:57,815 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:25:57,815 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 62 states. [2020-07-10 15:25:57,816 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 62 states. [2020-07-10 15:25:57,816 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 62 states. [2020-07-10 15:25:57,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:57,819 INFO L93 Difference]: Finished difference Result 80 states and 98 transitions. [2020-07-10 15:25:57,820 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 98 transitions. [2020-07-10 15:25:57,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:57,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:57,820 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 80 states. [2020-07-10 15:25:57,820 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 80 states. [2020-07-10 15:25:57,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:57,824 INFO L93 Difference]: Finished difference Result 80 states and 98 transitions. [2020-07-10 15:25:57,824 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 98 transitions. [2020-07-10 15:25:57,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:57,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:57,825 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:25:57,825 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:25:57,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-07-10 15:25:57,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 74 transitions. [2020-07-10 15:25:57,828 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 74 transitions. Word has length 37 [2020-07-10 15:25:57,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:25:57,828 INFO L479 AbstractCegarLoop]: Abstraction has 62 states and 74 transitions. [2020-07-10 15:25:57,828 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:25:57,829 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 74 transitions. [2020-07-10 15:25:57,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-10 15:25:57,829 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:25:57,830 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:25:58,042 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:25:58,043 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:25:58,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:25:58,044 INFO L82 PathProgramCache]: Analyzing trace with hash 581153498, now seen corresponding path program 1 times [2020-07-10 15:25:58,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:25:58,045 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505658835] [2020-07-10 15:25:58,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:25:58,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:58,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:58,127 INFO L280 TraceCheckUtils]: 0: Hoare triple {2153#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2137#true} is VALID [2020-07-10 15:25:58,127 INFO L280 TraceCheckUtils]: 1: Hoare triple {2137#true} assume true; {2137#true} is VALID [2020-07-10 15:25:58,128 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2137#true} {2137#true} #176#return; {2137#true} is VALID [2020-07-10 15:25:58,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:58,143 INFO L280 TraceCheckUtils]: 0: Hoare triple {2137#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {2137#true} is VALID [2020-07-10 15:25:58,144 INFO L280 TraceCheckUtils]: 1: Hoare triple {2137#true} assume !(~i~0 < ~size); {2137#true} is VALID [2020-07-10 15:25:58,144 INFO L280 TraceCheckUtils]: 2: Hoare triple {2137#true} #res := 0; {2137#true} is VALID [2020-07-10 15:25:58,147 INFO L280 TraceCheckUtils]: 3: Hoare triple {2137#true} assume true; {2137#true} is VALID [2020-07-10 15:25:58,148 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2137#true} {2138#false} #182#return; {2138#false} is VALID [2020-07-10 15:25:58,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:58,182 INFO L280 TraceCheckUtils]: 0: Hoare triple {2154#(= |#memory_int| |old(#memory_int)|)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4);#res := 1 + ~size; {2137#true} is VALID [2020-07-10 15:25:58,182 INFO L280 TraceCheckUtils]: 1: Hoare triple {2137#true} assume true; {2137#true} is VALID [2020-07-10 15:25:58,183 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2137#true} {2138#false} #184#return; {2138#false} is VALID [2020-07-10 15:25:58,184 INFO L263 TraceCheckUtils]: 0: Hoare triple {2137#true} call ULTIMATE.init(); {2153#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:25:58,185 INFO L280 TraceCheckUtils]: 1: Hoare triple {2153#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2137#true} is VALID [2020-07-10 15:25:58,185 INFO L280 TraceCheckUtils]: 2: Hoare triple {2137#true} assume true; {2137#true} is VALID [2020-07-10 15:25:58,185 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2137#true} {2137#true} #176#return; {2137#true} is VALID [2020-07-10 15:25:58,186 INFO L263 TraceCheckUtils]: 4: Hoare triple {2137#true} call #t~ret23 := main(); {2137#true} is VALID [2020-07-10 15:25:58,190 INFO L280 TraceCheckUtils]: 5: Hoare triple {2137#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.allocOnStack(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {2142#(= 0 main_~x~0)} is VALID [2020-07-10 15:25:58,190 INFO L280 TraceCheckUtils]: 6: Hoare triple {2142#(= 0 main_~x~0)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {2142#(= 0 main_~x~0)} is VALID [2020-07-10 15:25:58,191 INFO L280 TraceCheckUtils]: 7: Hoare triple {2142#(= 0 main_~x~0)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2143#(<= main_~x~0 1)} is VALID [2020-07-10 15:25:58,192 INFO L280 TraceCheckUtils]: 8: Hoare triple {2143#(<= main_~x~0 1)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {2143#(<= main_~x~0 1)} is VALID [2020-07-10 15:25:58,193 INFO L280 TraceCheckUtils]: 9: Hoare triple {2143#(<= main_~x~0 1)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2144#(<= main_~x~0 2)} is VALID [2020-07-10 15:25:58,194 INFO L280 TraceCheckUtils]: 10: Hoare triple {2144#(<= main_~x~0 2)} assume !(~x~0 < 100000); {2138#false} is VALID [2020-07-10 15:25:58,194 INFO L280 TraceCheckUtils]: 11: Hoare triple {2138#false} ~x~0 := 0; {2138#false} is VALID [2020-07-10 15:25:58,194 INFO L280 TraceCheckUtils]: 12: Hoare triple {2138#false} assume !(~x~0 < ~n~0); {2138#false} is VALID [2020-07-10 15:25:58,195 INFO L280 TraceCheckUtils]: 13: Hoare triple {2138#false} call ~#values~0.base, ~#values~0.offset := #Ultimate.allocOnStack(400000);havoc ~v~0;~v~0 := 0; {2138#false} is VALID [2020-07-10 15:25:58,195 INFO L280 TraceCheckUtils]: 14: Hoare triple {2138#false} assume !!(~v~0 < 100000);assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;call write~int(#t~nondet9, ~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4);havoc #t~nondet9; {2138#false} is VALID [2020-07-10 15:25:58,197 INFO L280 TraceCheckUtils]: 15: Hoare triple {2138#false} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {2138#false} is VALID [2020-07-10 15:25:58,198 INFO L280 TraceCheckUtils]: 16: Hoare triple {2138#false} assume !(~v~0 < 100000); {2138#false} is VALID [2020-07-10 15:25:58,198 INFO L280 TraceCheckUtils]: 17: Hoare triple {2138#false} ~v~0 := 0; {2138#false} is VALID [2020-07-10 15:25:58,198 INFO L280 TraceCheckUtils]: 18: Hoare triple {2138#false} assume !!(~v~0 < 100000);call #t~mem11 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {2138#false} is VALID [2020-07-10 15:25:58,198 INFO L263 TraceCheckUtils]: 19: Hoare triple {2138#false} call #t~ret12 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem11); {2137#true} is VALID [2020-07-10 15:25:58,199 INFO L280 TraceCheckUtils]: 20: Hoare triple {2137#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {2137#true} is VALID [2020-07-10 15:25:58,199 INFO L280 TraceCheckUtils]: 21: Hoare triple {2137#true} assume !(~i~0 < ~size); {2137#true} is VALID [2020-07-10 15:25:58,199 INFO L280 TraceCheckUtils]: 22: Hoare triple {2137#true} #res := 0; {2137#true} is VALID [2020-07-10 15:25:58,199 INFO L280 TraceCheckUtils]: 23: Hoare triple {2137#true} assume true; {2137#true} is VALID [2020-07-10 15:25:58,200 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {2137#true} {2138#false} #182#return; {2138#false} is VALID [2020-07-10 15:25:58,200 INFO L280 TraceCheckUtils]: 25: Hoare triple {2138#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {2138#false} is VALID [2020-07-10 15:25:58,200 INFO L280 TraceCheckUtils]: 26: Hoare triple {2138#false} assume 0 != #t~ret12;havoc #t~ret12;havoc #t~mem11;call #t~mem13 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {2138#false} is VALID [2020-07-10 15:25:58,203 INFO L263 TraceCheckUtils]: 27: Hoare triple {2138#false} call #t~ret14 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem13); {2154#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:25:58,203 INFO L280 TraceCheckUtils]: 28: Hoare triple {2154#(= |#memory_int| |old(#memory_int)|)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4);#res := 1 + ~size; {2137#true} is VALID [2020-07-10 15:25:58,204 INFO L280 TraceCheckUtils]: 29: Hoare triple {2137#true} assume true; {2137#true} is VALID [2020-07-10 15:25:58,204 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2137#true} {2138#false} #184#return; {2138#false} is VALID [2020-07-10 15:25:58,204 INFO L280 TraceCheckUtils]: 31: Hoare triple {2138#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~n~0 := #t~ret14;havoc #t~mem13;havoc #t~ret14; {2138#false} is VALID [2020-07-10 15:25:58,204 INFO L280 TraceCheckUtils]: 32: Hoare triple {2138#false} ~x~0 := 0; {2138#false} is VALID [2020-07-10 15:25:58,205 INFO L280 TraceCheckUtils]: 33: Hoare triple {2138#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {2138#false} is VALID [2020-07-10 15:25:58,205 INFO L280 TraceCheckUtils]: 34: Hoare triple {2138#false} assume !!(~y~0 < ~n~0);call #t~mem17 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem18 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {2138#false} is VALID [2020-07-10 15:25:58,205 INFO L263 TraceCheckUtils]: 35: Hoare triple {2138#false} call __VERIFIER_assert((if #t~mem17 != #t~mem18 then 1 else 0)); {2138#false} is VALID [2020-07-10 15:25:58,206 INFO L280 TraceCheckUtils]: 36: Hoare triple {2138#false} ~cond := #in~cond; {2138#false} is VALID [2020-07-10 15:25:58,206 INFO L280 TraceCheckUtils]: 37: Hoare triple {2138#false} assume 0 == ~cond; {2138#false} is VALID [2020-07-10 15:25:58,206 INFO L280 TraceCheckUtils]: 38: Hoare triple {2138#false} assume !false; {2138#false} is VALID [2020-07-10 15:25:58,209 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-10 15:25:58,210 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505658835] [2020-07-10 15:25:58,210 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650122218] [2020-07-10 15:25:58,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:25:58,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:58,280 INFO L264 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-10 15:25:58,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:58,297 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:25:58,406 INFO L263 TraceCheckUtils]: 0: Hoare triple {2137#true} call ULTIMATE.init(); {2137#true} is VALID [2020-07-10 15:25:58,407 INFO L280 TraceCheckUtils]: 1: Hoare triple {2137#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2137#true} is VALID [2020-07-10 15:25:58,407 INFO L280 TraceCheckUtils]: 2: Hoare triple {2137#true} assume true; {2137#true} is VALID [2020-07-10 15:25:58,407 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2137#true} {2137#true} #176#return; {2137#true} is VALID [2020-07-10 15:25:58,407 INFO L263 TraceCheckUtils]: 4: Hoare triple {2137#true} call #t~ret23 := main(); {2137#true} is VALID [2020-07-10 15:25:58,410 INFO L280 TraceCheckUtils]: 5: Hoare triple {2137#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.allocOnStack(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {2173#(<= main_~x~0 0)} is VALID [2020-07-10 15:25:58,411 INFO L280 TraceCheckUtils]: 6: Hoare triple {2173#(<= main_~x~0 0)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {2173#(<= main_~x~0 0)} is VALID [2020-07-10 15:25:58,412 INFO L280 TraceCheckUtils]: 7: Hoare triple {2173#(<= main_~x~0 0)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2143#(<= main_~x~0 1)} is VALID [2020-07-10 15:25:58,413 INFO L280 TraceCheckUtils]: 8: Hoare triple {2143#(<= main_~x~0 1)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {2143#(<= main_~x~0 1)} is VALID [2020-07-10 15:25:58,414 INFO L280 TraceCheckUtils]: 9: Hoare triple {2143#(<= main_~x~0 1)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2144#(<= main_~x~0 2)} is VALID [2020-07-10 15:25:58,415 INFO L280 TraceCheckUtils]: 10: Hoare triple {2144#(<= main_~x~0 2)} assume !(~x~0 < 100000); {2138#false} is VALID [2020-07-10 15:25:58,416 INFO L280 TraceCheckUtils]: 11: Hoare triple {2138#false} ~x~0 := 0; {2138#false} is VALID [2020-07-10 15:25:58,416 INFO L280 TraceCheckUtils]: 12: Hoare triple {2138#false} assume !(~x~0 < ~n~0); {2138#false} is VALID [2020-07-10 15:25:58,416 INFO L280 TraceCheckUtils]: 13: Hoare triple {2138#false} call ~#values~0.base, ~#values~0.offset := #Ultimate.allocOnStack(400000);havoc ~v~0;~v~0 := 0; {2138#false} is VALID [2020-07-10 15:25:58,417 INFO L280 TraceCheckUtils]: 14: Hoare triple {2138#false} assume !!(~v~0 < 100000);assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;call write~int(#t~nondet9, ~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4);havoc #t~nondet9; {2138#false} is VALID [2020-07-10 15:25:58,417 INFO L280 TraceCheckUtils]: 15: Hoare triple {2138#false} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {2138#false} is VALID [2020-07-10 15:25:58,417 INFO L280 TraceCheckUtils]: 16: Hoare triple {2138#false} assume !(~v~0 < 100000); {2138#false} is VALID [2020-07-10 15:25:58,417 INFO L280 TraceCheckUtils]: 17: Hoare triple {2138#false} ~v~0 := 0; {2138#false} is VALID [2020-07-10 15:25:58,418 INFO L280 TraceCheckUtils]: 18: Hoare triple {2138#false} assume !!(~v~0 < 100000);call #t~mem11 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {2138#false} is VALID [2020-07-10 15:25:58,418 INFO L263 TraceCheckUtils]: 19: Hoare triple {2138#false} call #t~ret12 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem11); {2138#false} is VALID [2020-07-10 15:25:58,418 INFO L280 TraceCheckUtils]: 20: Hoare triple {2138#false} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {2138#false} is VALID [2020-07-10 15:25:58,418 INFO L280 TraceCheckUtils]: 21: Hoare triple {2138#false} assume !(~i~0 < ~size); {2138#false} is VALID [2020-07-10 15:25:58,419 INFO L280 TraceCheckUtils]: 22: Hoare triple {2138#false} #res := 0; {2138#false} is VALID [2020-07-10 15:25:58,419 INFO L280 TraceCheckUtils]: 23: Hoare triple {2138#false} assume true; {2138#false} is VALID [2020-07-10 15:25:58,419 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {2138#false} {2138#false} #182#return; {2138#false} is VALID [2020-07-10 15:25:58,419 INFO L280 TraceCheckUtils]: 25: Hoare triple {2138#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {2138#false} is VALID [2020-07-10 15:25:58,421 INFO L280 TraceCheckUtils]: 26: Hoare triple {2138#false} assume 0 != #t~ret12;havoc #t~ret12;havoc #t~mem11;call #t~mem13 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {2138#false} is VALID [2020-07-10 15:25:58,421 INFO L263 TraceCheckUtils]: 27: Hoare triple {2138#false} call #t~ret14 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem13); {2138#false} is VALID [2020-07-10 15:25:58,422 INFO L280 TraceCheckUtils]: 28: Hoare triple {2138#false} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4);#res := 1 + ~size; {2138#false} is VALID [2020-07-10 15:25:58,422 INFO L280 TraceCheckUtils]: 29: Hoare triple {2138#false} assume true; {2138#false} is VALID [2020-07-10 15:25:58,425 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2138#false} {2138#false} #184#return; {2138#false} is VALID [2020-07-10 15:25:58,425 INFO L280 TraceCheckUtils]: 31: Hoare triple {2138#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~n~0 := #t~ret14;havoc #t~mem13;havoc #t~ret14; {2138#false} is VALID [2020-07-10 15:25:58,426 INFO L280 TraceCheckUtils]: 32: Hoare triple {2138#false} ~x~0 := 0; {2138#false} is VALID [2020-07-10 15:25:58,426 INFO L280 TraceCheckUtils]: 33: Hoare triple {2138#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {2138#false} is VALID [2020-07-10 15:25:58,426 INFO L280 TraceCheckUtils]: 34: Hoare triple {2138#false} assume !!(~y~0 < ~n~0);call #t~mem17 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem18 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {2138#false} is VALID [2020-07-10 15:25:58,426 INFO L263 TraceCheckUtils]: 35: Hoare triple {2138#false} call __VERIFIER_assert((if #t~mem17 != #t~mem18 then 1 else 0)); {2138#false} is VALID [2020-07-10 15:25:58,426 INFO L280 TraceCheckUtils]: 36: Hoare triple {2138#false} ~cond := #in~cond; {2138#false} is VALID [2020-07-10 15:25:58,427 INFO L280 TraceCheckUtils]: 37: Hoare triple {2138#false} assume 0 == ~cond; {2138#false} is VALID [2020-07-10 15:25:58,427 INFO L280 TraceCheckUtils]: 38: Hoare triple {2138#false} assume !false; {2138#false} is VALID [2020-07-10 15:25:58,431 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-10 15:25:58,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:25:58,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 8 [2020-07-10 15:25:58,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645557388] [2020-07-10 15:25:58,433 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2020-07-10 15:25:58,438 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:25:58,439 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 15:25:58,513 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:25:58,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 15:25:58,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:25:58,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 15:25:58,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:25:58,515 INFO L87 Difference]: Start difference. First operand 62 states and 74 transitions. Second operand 8 states. [2020-07-10 15:25:59,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:59,449 INFO L93 Difference]: Finished difference Result 179 states and 230 transitions. [2020-07-10 15:25:59,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 15:25:59,450 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2020-07-10 15:25:59,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:25:59,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:25:59,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 210 transitions. [2020-07-10 15:25:59,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:25:59,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 210 transitions. [2020-07-10 15:25:59,461 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 210 transitions. [2020-07-10 15:25:59,749 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 210 edges. 210 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:25:59,753 INFO L225 Difference]: With dead ends: 179 [2020-07-10 15:25:59,753 INFO L226 Difference]: Without dead ends: 128 [2020-07-10 15:25:59,754 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-07-10 15:25:59,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-07-10 15:25:59,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 64. [2020-07-10 15:25:59,796 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:25:59,796 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand 64 states. [2020-07-10 15:25:59,796 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 64 states. [2020-07-10 15:25:59,796 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 64 states. [2020-07-10 15:25:59,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:59,803 INFO L93 Difference]: Finished difference Result 128 states and 167 transitions. [2020-07-10 15:25:59,803 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 167 transitions. [2020-07-10 15:25:59,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:59,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:59,804 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 128 states. [2020-07-10 15:25:59,804 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 128 states. [2020-07-10 15:25:59,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:59,810 INFO L93 Difference]: Finished difference Result 128 states and 167 transitions. [2020-07-10 15:25:59,810 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 167 transitions. [2020-07-10 15:25:59,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:59,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:59,811 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:25:59,811 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:25:59,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-07-10 15:25:59,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2020-07-10 15:25:59,814 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 39 [2020-07-10 15:25:59,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:25:59,814 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2020-07-10 15:25:59,814 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 15:25:59,814 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2020-07-10 15:25:59,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-10 15:25:59,815 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:25:59,815 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-07-10 15:26:00,029 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:00,030 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:00,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:00,031 INFO L82 PathProgramCache]: Analyzing trace with hash -822197896, now seen corresponding path program 2 times [2020-07-10 15:26:00,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:00,032 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458215105] [2020-07-10 15:26:00,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:00,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:00,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:00,127 INFO L280 TraceCheckUtils]: 0: Hoare triple {2893#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2876#true} is VALID [2020-07-10 15:26:00,128 INFO L280 TraceCheckUtils]: 1: Hoare triple {2876#true} assume true; {2876#true} is VALID [2020-07-10 15:26:00,128 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2876#true} {2876#true} #176#return; {2876#true} is VALID [2020-07-10 15:26:00,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:00,133 INFO L280 TraceCheckUtils]: 0: Hoare triple {2876#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {2876#true} is VALID [2020-07-10 15:26:00,133 INFO L280 TraceCheckUtils]: 1: Hoare triple {2876#true} assume !(~i~0 < ~size); {2876#true} is VALID [2020-07-10 15:26:00,133 INFO L280 TraceCheckUtils]: 2: Hoare triple {2876#true} #res := 0; {2876#true} is VALID [2020-07-10 15:26:00,134 INFO L280 TraceCheckUtils]: 3: Hoare triple {2876#true} assume true; {2876#true} is VALID [2020-07-10 15:26:00,134 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2876#true} {2877#false} #182#return; {2877#false} is VALID [2020-07-10 15:26:00,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:00,161 INFO L280 TraceCheckUtils]: 0: Hoare triple {2894#(= |#memory_int| |old(#memory_int)|)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4);#res := 1 + ~size; {2876#true} is VALID [2020-07-10 15:26:00,161 INFO L280 TraceCheckUtils]: 1: Hoare triple {2876#true} assume true; {2876#true} is VALID [2020-07-10 15:26:00,161 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2876#true} {2877#false} #184#return; {2877#false} is VALID [2020-07-10 15:26:00,164 INFO L263 TraceCheckUtils]: 0: Hoare triple {2876#true} call ULTIMATE.init(); {2893#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:26:00,164 INFO L280 TraceCheckUtils]: 1: Hoare triple {2893#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2876#true} is VALID [2020-07-10 15:26:00,164 INFO L280 TraceCheckUtils]: 2: Hoare triple {2876#true} assume true; {2876#true} is VALID [2020-07-10 15:26:00,165 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2876#true} {2876#true} #176#return; {2876#true} is VALID [2020-07-10 15:26:00,165 INFO L263 TraceCheckUtils]: 4: Hoare triple {2876#true} call #t~ret23 := main(); {2876#true} is VALID [2020-07-10 15:26:00,166 INFO L280 TraceCheckUtils]: 5: Hoare triple {2876#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.allocOnStack(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {2881#(= 0 main_~x~0)} is VALID [2020-07-10 15:26:00,166 INFO L280 TraceCheckUtils]: 6: Hoare triple {2881#(= 0 main_~x~0)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {2881#(= 0 main_~x~0)} is VALID [2020-07-10 15:26:00,167 INFO L280 TraceCheckUtils]: 7: Hoare triple {2881#(= 0 main_~x~0)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2882#(<= main_~x~0 1)} is VALID [2020-07-10 15:26:00,168 INFO L280 TraceCheckUtils]: 8: Hoare triple {2882#(<= main_~x~0 1)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {2882#(<= main_~x~0 1)} is VALID [2020-07-10 15:26:00,168 INFO L280 TraceCheckUtils]: 9: Hoare triple {2882#(<= main_~x~0 1)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2883#(<= main_~x~0 2)} is VALID [2020-07-10 15:26:00,169 INFO L280 TraceCheckUtils]: 10: Hoare triple {2883#(<= main_~x~0 2)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {2883#(<= main_~x~0 2)} is VALID [2020-07-10 15:26:00,170 INFO L280 TraceCheckUtils]: 11: Hoare triple {2883#(<= main_~x~0 2)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2884#(<= main_~x~0 3)} is VALID [2020-07-10 15:26:00,171 INFO L280 TraceCheckUtils]: 12: Hoare triple {2884#(<= main_~x~0 3)} assume !(~x~0 < 100000); {2877#false} is VALID [2020-07-10 15:26:00,171 INFO L280 TraceCheckUtils]: 13: Hoare triple {2877#false} ~x~0 := 0; {2877#false} is VALID [2020-07-10 15:26:00,171 INFO L280 TraceCheckUtils]: 14: Hoare triple {2877#false} assume !(~x~0 < ~n~0); {2877#false} is VALID [2020-07-10 15:26:00,171 INFO L280 TraceCheckUtils]: 15: Hoare triple {2877#false} call ~#values~0.base, ~#values~0.offset := #Ultimate.allocOnStack(400000);havoc ~v~0;~v~0 := 0; {2877#false} is VALID [2020-07-10 15:26:00,172 INFO L280 TraceCheckUtils]: 16: Hoare triple {2877#false} assume !!(~v~0 < 100000);assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;call write~int(#t~nondet9, ~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4);havoc #t~nondet9; {2877#false} is VALID [2020-07-10 15:26:00,172 INFO L280 TraceCheckUtils]: 17: Hoare triple {2877#false} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {2877#false} is VALID [2020-07-10 15:26:00,172 INFO L280 TraceCheckUtils]: 18: Hoare triple {2877#false} assume !(~v~0 < 100000); {2877#false} is VALID [2020-07-10 15:26:00,172 INFO L280 TraceCheckUtils]: 19: Hoare triple {2877#false} ~v~0 := 0; {2877#false} is VALID [2020-07-10 15:26:00,172 INFO L280 TraceCheckUtils]: 20: Hoare triple {2877#false} assume !!(~v~0 < 100000);call #t~mem11 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {2877#false} is VALID [2020-07-10 15:26:00,173 INFO L263 TraceCheckUtils]: 21: Hoare triple {2877#false} call #t~ret12 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem11); {2876#true} is VALID [2020-07-10 15:26:00,173 INFO L280 TraceCheckUtils]: 22: Hoare triple {2876#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {2876#true} is VALID [2020-07-10 15:26:00,173 INFO L280 TraceCheckUtils]: 23: Hoare triple {2876#true} assume !(~i~0 < ~size); {2876#true} is VALID [2020-07-10 15:26:00,173 INFO L280 TraceCheckUtils]: 24: Hoare triple {2876#true} #res := 0; {2876#true} is VALID [2020-07-10 15:26:00,174 INFO L280 TraceCheckUtils]: 25: Hoare triple {2876#true} assume true; {2876#true} is VALID [2020-07-10 15:26:00,174 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {2876#true} {2877#false} #182#return; {2877#false} is VALID [2020-07-10 15:26:00,174 INFO L280 TraceCheckUtils]: 27: Hoare triple {2877#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {2877#false} is VALID [2020-07-10 15:26:00,179 INFO L280 TraceCheckUtils]: 28: Hoare triple {2877#false} assume 0 != #t~ret12;havoc #t~ret12;havoc #t~mem11;call #t~mem13 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {2877#false} is VALID [2020-07-10 15:26:00,180 INFO L263 TraceCheckUtils]: 29: Hoare triple {2877#false} call #t~ret14 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem13); {2894#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:26:00,180 INFO L280 TraceCheckUtils]: 30: Hoare triple {2894#(= |#memory_int| |old(#memory_int)|)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4);#res := 1 + ~size; {2876#true} is VALID [2020-07-10 15:26:00,180 INFO L280 TraceCheckUtils]: 31: Hoare triple {2876#true} assume true; {2876#true} is VALID [2020-07-10 15:26:00,180 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {2876#true} {2877#false} #184#return; {2877#false} is VALID [2020-07-10 15:26:00,181 INFO L280 TraceCheckUtils]: 33: Hoare triple {2877#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~n~0 := #t~ret14;havoc #t~mem13;havoc #t~ret14; {2877#false} is VALID [2020-07-10 15:26:00,181 INFO L280 TraceCheckUtils]: 34: Hoare triple {2877#false} ~x~0 := 0; {2877#false} is VALID [2020-07-10 15:26:00,184 INFO L280 TraceCheckUtils]: 35: Hoare triple {2877#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {2877#false} is VALID [2020-07-10 15:26:00,184 INFO L280 TraceCheckUtils]: 36: Hoare triple {2877#false} assume !!(~y~0 < ~n~0);call #t~mem17 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem18 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {2877#false} is VALID [2020-07-10 15:26:00,184 INFO L263 TraceCheckUtils]: 37: Hoare triple {2877#false} call __VERIFIER_assert((if #t~mem17 != #t~mem18 then 1 else 0)); {2877#false} is VALID [2020-07-10 15:26:00,184 INFO L280 TraceCheckUtils]: 38: Hoare triple {2877#false} ~cond := #in~cond; {2877#false} is VALID [2020-07-10 15:26:00,185 INFO L280 TraceCheckUtils]: 39: Hoare triple {2877#false} assume 0 == ~cond; {2877#false} is VALID [2020-07-10 15:26:00,185 INFO L280 TraceCheckUtils]: 40: Hoare triple {2877#false} assume !false; {2877#false} is VALID [2020-07-10 15:26:00,186 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-10 15:26:00,187 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458215105] [2020-07-10 15:26:00,187 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464653156] [2020-07-10 15:26:00,187 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:00,231 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-10 15:26:00,232 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:26:00,233 INFO L264 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-10 15:26:00,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:00,249 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:26:00,434 INFO L263 TraceCheckUtils]: 0: Hoare triple {2876#true} call ULTIMATE.init(); {2876#true} is VALID [2020-07-10 15:26:00,434 INFO L280 TraceCheckUtils]: 1: Hoare triple {2876#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2876#true} is VALID [2020-07-10 15:26:00,435 INFO L280 TraceCheckUtils]: 2: Hoare triple {2876#true} assume true; {2876#true} is VALID [2020-07-10 15:26:00,435 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2876#true} {2876#true} #176#return; {2876#true} is VALID [2020-07-10 15:26:00,435 INFO L263 TraceCheckUtils]: 4: Hoare triple {2876#true} call #t~ret23 := main(); {2876#true} is VALID [2020-07-10 15:26:00,436 INFO L280 TraceCheckUtils]: 5: Hoare triple {2876#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.allocOnStack(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {2913#(<= main_~n~0 0)} is VALID [2020-07-10 15:26:00,437 INFO L280 TraceCheckUtils]: 6: Hoare triple {2913#(<= main_~n~0 0)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {2913#(<= main_~n~0 0)} is VALID [2020-07-10 15:26:00,437 INFO L280 TraceCheckUtils]: 7: Hoare triple {2913#(<= main_~n~0 0)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2913#(<= main_~n~0 0)} is VALID [2020-07-10 15:26:00,438 INFO L280 TraceCheckUtils]: 8: Hoare triple {2913#(<= main_~n~0 0)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {2913#(<= main_~n~0 0)} is VALID [2020-07-10 15:26:00,438 INFO L280 TraceCheckUtils]: 9: Hoare triple {2913#(<= main_~n~0 0)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2913#(<= main_~n~0 0)} is VALID [2020-07-10 15:26:00,439 INFO L280 TraceCheckUtils]: 10: Hoare triple {2913#(<= main_~n~0 0)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {2913#(<= main_~n~0 0)} is VALID [2020-07-10 15:26:00,439 INFO L280 TraceCheckUtils]: 11: Hoare triple {2913#(<= main_~n~0 0)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2913#(<= main_~n~0 0)} is VALID [2020-07-10 15:26:00,440 INFO L280 TraceCheckUtils]: 12: Hoare triple {2913#(<= main_~n~0 0)} assume !(~x~0 < 100000); {2913#(<= main_~n~0 0)} is VALID [2020-07-10 15:26:00,441 INFO L280 TraceCheckUtils]: 13: Hoare triple {2913#(<= main_~n~0 0)} ~x~0 := 0; {2913#(<= main_~n~0 0)} is VALID [2020-07-10 15:26:00,441 INFO L280 TraceCheckUtils]: 14: Hoare triple {2913#(<= main_~n~0 0)} assume !(~x~0 < ~n~0); {2913#(<= main_~n~0 0)} is VALID [2020-07-10 15:26:00,443 INFO L280 TraceCheckUtils]: 15: Hoare triple {2913#(<= main_~n~0 0)} call ~#values~0.base, ~#values~0.offset := #Ultimate.allocOnStack(400000);havoc ~v~0;~v~0 := 0; {2913#(<= main_~n~0 0)} is VALID [2020-07-10 15:26:00,443 INFO L280 TraceCheckUtils]: 16: Hoare triple {2913#(<= main_~n~0 0)} assume !!(~v~0 < 100000);assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;call write~int(#t~nondet9, ~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4);havoc #t~nondet9; {2913#(<= main_~n~0 0)} is VALID [2020-07-10 15:26:00,444 INFO L280 TraceCheckUtils]: 17: Hoare triple {2913#(<= main_~n~0 0)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {2913#(<= main_~n~0 0)} is VALID [2020-07-10 15:26:00,444 INFO L280 TraceCheckUtils]: 18: Hoare triple {2913#(<= main_~n~0 0)} assume !(~v~0 < 100000); {2913#(<= main_~n~0 0)} is VALID [2020-07-10 15:26:00,445 INFO L280 TraceCheckUtils]: 19: Hoare triple {2913#(<= main_~n~0 0)} ~v~0 := 0; {2913#(<= main_~n~0 0)} is VALID [2020-07-10 15:26:00,445 INFO L280 TraceCheckUtils]: 20: Hoare triple {2913#(<= main_~n~0 0)} assume !!(~v~0 < 100000);call #t~mem11 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {2913#(<= main_~n~0 0)} is VALID [2020-07-10 15:26:00,446 INFO L263 TraceCheckUtils]: 21: Hoare triple {2913#(<= main_~n~0 0)} call #t~ret12 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem11); {2876#true} is VALID [2020-07-10 15:26:00,446 INFO L280 TraceCheckUtils]: 22: Hoare triple {2876#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {2876#true} is VALID [2020-07-10 15:26:00,446 INFO L280 TraceCheckUtils]: 23: Hoare triple {2876#true} assume !(~i~0 < ~size); {2876#true} is VALID [2020-07-10 15:26:00,446 INFO L280 TraceCheckUtils]: 24: Hoare triple {2876#true} #res := 0; {2876#true} is VALID [2020-07-10 15:26:00,446 INFO L280 TraceCheckUtils]: 25: Hoare triple {2876#true} assume true; {2876#true} is VALID [2020-07-10 15:26:00,448 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {2876#true} {2913#(<= main_~n~0 0)} #182#return; {2913#(<= main_~n~0 0)} is VALID [2020-07-10 15:26:00,448 INFO L280 TraceCheckUtils]: 27: Hoare triple {2913#(<= main_~n~0 0)} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {2913#(<= main_~n~0 0)} is VALID [2020-07-10 15:26:00,449 INFO L280 TraceCheckUtils]: 28: Hoare triple {2913#(<= main_~n~0 0)} assume 0 != #t~ret12;havoc #t~ret12;havoc #t~mem11;call #t~mem13 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {2913#(<= main_~n~0 0)} is VALID [2020-07-10 15:26:00,449 INFO L263 TraceCheckUtils]: 29: Hoare triple {2913#(<= main_~n~0 0)} call #t~ret14 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem13); {2876#true} is VALID [2020-07-10 15:26:00,450 INFO L280 TraceCheckUtils]: 30: Hoare triple {2876#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4);#res := 1 + ~size; {2989#(<= |insert_#res| (+ |insert_#in~size| 1))} is VALID [2020-07-10 15:26:00,450 INFO L280 TraceCheckUtils]: 31: Hoare triple {2989#(<= |insert_#res| (+ |insert_#in~size| 1))} assume true; {2989#(<= |insert_#res| (+ |insert_#in~size| 1))} is VALID [2020-07-10 15:26:00,452 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {2989#(<= |insert_#res| (+ |insert_#in~size| 1))} {2913#(<= main_~n~0 0)} #184#return; {2996#(<= |main_#t~ret14| 1)} is VALID [2020-07-10 15:26:00,453 INFO L280 TraceCheckUtils]: 33: Hoare triple {2996#(<= |main_#t~ret14| 1)} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~n~0 := #t~ret14;havoc #t~mem13;havoc #t~ret14; {3000#(<= main_~n~0 1)} is VALID [2020-07-10 15:26:00,454 INFO L280 TraceCheckUtils]: 34: Hoare triple {3000#(<= main_~n~0 1)} ~x~0 := 0; {3004#(and (<= 0 main_~x~0) (<= main_~n~0 1))} is VALID [2020-07-10 15:26:00,455 INFO L280 TraceCheckUtils]: 35: Hoare triple {3004#(and (<= 0 main_~x~0) (<= main_~n~0 1))} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {3008#(and (<= 1 main_~y~0) (<= main_~n~0 1))} is VALID [2020-07-10 15:26:00,456 INFO L280 TraceCheckUtils]: 36: Hoare triple {3008#(and (<= 1 main_~y~0) (<= main_~n~0 1))} assume !!(~y~0 < ~n~0);call #t~mem17 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem18 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {2877#false} is VALID [2020-07-10 15:26:00,456 INFO L263 TraceCheckUtils]: 37: Hoare triple {2877#false} call __VERIFIER_assert((if #t~mem17 != #t~mem18 then 1 else 0)); {2877#false} is VALID [2020-07-10 15:26:00,456 INFO L280 TraceCheckUtils]: 38: Hoare triple {2877#false} ~cond := #in~cond; {2877#false} is VALID [2020-07-10 15:26:00,456 INFO L280 TraceCheckUtils]: 39: Hoare triple {2877#false} assume 0 == ~cond; {2877#false} is VALID [2020-07-10 15:26:00,456 INFO L280 TraceCheckUtils]: 40: Hoare triple {2877#false} assume !false; {2877#false} is VALID [2020-07-10 15:26:00,458 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-07-10 15:26:00,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:26:00,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2020-07-10 15:26:00,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240493764] [2020-07-10 15:26:00,460 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-07-10 15:26:00,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:00,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 15:26:00,495 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-10 15:26:00,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 15:26:00,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:00,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 15:26:00,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2020-07-10 15:26:00,496 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. Second operand 8 states. [2020-07-10 15:26:01,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:01,252 INFO L93 Difference]: Finished difference Result 129 states and 162 transitions. [2020-07-10 15:26:01,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:26:01,253 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-07-10 15:26:01,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:01,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:26:01,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 156 transitions. [2020-07-10 15:26:01,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:26:01,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 156 transitions. [2020-07-10 15:26:01,261 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 156 transitions. [2020-07-10 15:26:01,447 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:01,449 INFO L225 Difference]: With dead ends: 129 [2020-07-10 15:26:01,449 INFO L226 Difference]: Without dead ends: 86 [2020-07-10 15:26:01,450 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2020-07-10 15:26:01,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-07-10 15:26:01,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 75. [2020-07-10 15:26:01,500 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:01,501 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 75 states. [2020-07-10 15:26:01,501 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 75 states. [2020-07-10 15:26:01,501 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 75 states. [2020-07-10 15:26:01,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:01,505 INFO L93 Difference]: Finished difference Result 86 states and 107 transitions. [2020-07-10 15:26:01,505 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 107 transitions. [2020-07-10 15:26:01,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:01,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:01,506 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 86 states. [2020-07-10 15:26:01,506 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 86 states. [2020-07-10 15:26:01,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:01,510 INFO L93 Difference]: Finished difference Result 86 states and 107 transitions. [2020-07-10 15:26:01,510 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 107 transitions. [2020-07-10 15:26:01,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:01,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:01,511 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:01,511 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:01,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-07-10 15:26:01,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 91 transitions. [2020-07-10 15:26:01,515 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 91 transitions. Word has length 41 [2020-07-10 15:26:01,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:01,515 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 91 transitions. [2020-07-10 15:26:01,515 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 15:26:01,515 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2020-07-10 15:26:01,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-07-10 15:26:01,517 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:01,517 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-07-10 15:26:01,730 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-07-10 15:26:01,731 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:01,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:01,732 INFO L82 PathProgramCache]: Analyzing trace with hash -665199112, now seen corresponding path program 1 times [2020-07-10 15:26:01,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:01,733 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587919689] [2020-07-10 15:26:01,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:01,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:01,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:01,841 INFO L280 TraceCheckUtils]: 0: Hoare triple {3515#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3490#true} is VALID [2020-07-10 15:26:01,842 INFO L280 TraceCheckUtils]: 1: Hoare triple {3490#true} assume true; {3490#true} is VALID [2020-07-10 15:26:01,842 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3490#true} {3490#true} #176#return; {3490#true} is VALID [2020-07-10 15:26:01,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:01,847 INFO L280 TraceCheckUtils]: 0: Hoare triple {3490#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {3490#true} is VALID [2020-07-10 15:26:01,847 INFO L280 TraceCheckUtils]: 1: Hoare triple {3490#true} assume !(~i~0 < ~size); {3490#true} is VALID [2020-07-10 15:26:01,848 INFO L280 TraceCheckUtils]: 2: Hoare triple {3490#true} #res := 0; {3490#true} is VALID [2020-07-10 15:26:01,848 INFO L280 TraceCheckUtils]: 3: Hoare triple {3490#true} assume true; {3490#true} is VALID [2020-07-10 15:26:01,848 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3490#true} {3491#false} #182#return; {3491#false} is VALID [2020-07-10 15:26:01,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:01,862 INFO L280 TraceCheckUtils]: 0: Hoare triple {3516#(= |#memory_int| |old(#memory_int)|)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4);#res := 1 + ~size; {3490#true} is VALID [2020-07-10 15:26:01,862 INFO L280 TraceCheckUtils]: 1: Hoare triple {3490#true} assume true; {3490#true} is VALID [2020-07-10 15:26:01,862 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3490#true} {3491#false} #184#return; {3491#false} is VALID [2020-07-10 15:26:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:01,867 INFO L280 TraceCheckUtils]: 0: Hoare triple {3490#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {3490#true} is VALID [2020-07-10 15:26:01,868 INFO L280 TraceCheckUtils]: 1: Hoare triple {3490#true} assume !(~i~0 < ~size); {3490#true} is VALID [2020-07-10 15:26:01,868 INFO L280 TraceCheckUtils]: 2: Hoare triple {3490#true} #res := 0; {3490#true} is VALID [2020-07-10 15:26:01,868 INFO L280 TraceCheckUtils]: 3: Hoare triple {3490#true} assume true; {3490#true} is VALID [2020-07-10 15:26:01,868 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3490#true} {3491#false} #182#return; {3491#false} is VALID [2020-07-10 15:26:01,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:01,874 INFO L280 TraceCheckUtils]: 0: Hoare triple {3516#(= |#memory_int| |old(#memory_int)|)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4);#res := 1 + ~size; {3490#true} is VALID [2020-07-10 15:26:01,874 INFO L280 TraceCheckUtils]: 1: Hoare triple {3490#true} assume true; {3490#true} is VALID [2020-07-10 15:26:01,875 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3490#true} {3491#false} #184#return; {3491#false} is VALID [2020-07-10 15:26:01,876 INFO L263 TraceCheckUtils]: 0: Hoare triple {3490#true} call ULTIMATE.init(); {3515#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:26:01,876 INFO L280 TraceCheckUtils]: 1: Hoare triple {3515#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3490#true} is VALID [2020-07-10 15:26:01,876 INFO L280 TraceCheckUtils]: 2: Hoare triple {3490#true} assume true; {3490#true} is VALID [2020-07-10 15:26:01,876 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3490#true} {3490#true} #176#return; {3490#true} is VALID [2020-07-10 15:26:01,876 INFO L263 TraceCheckUtils]: 4: Hoare triple {3490#true} call #t~ret23 := main(); {3490#true} is VALID [2020-07-10 15:26:01,877 INFO L280 TraceCheckUtils]: 5: Hoare triple {3490#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.allocOnStack(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {3495#(= 0 main_~x~0)} is VALID [2020-07-10 15:26:01,878 INFO L280 TraceCheckUtils]: 6: Hoare triple {3495#(= 0 main_~x~0)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {3495#(= 0 main_~x~0)} is VALID [2020-07-10 15:26:01,879 INFO L280 TraceCheckUtils]: 7: Hoare triple {3495#(= 0 main_~x~0)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {3496#(<= main_~x~0 1)} is VALID [2020-07-10 15:26:01,880 INFO L280 TraceCheckUtils]: 8: Hoare triple {3496#(<= main_~x~0 1)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {3496#(<= main_~x~0 1)} is VALID [2020-07-10 15:26:01,881 INFO L280 TraceCheckUtils]: 9: Hoare triple {3496#(<= main_~x~0 1)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {3497#(<= main_~x~0 2)} is VALID [2020-07-10 15:26:01,882 INFO L280 TraceCheckUtils]: 10: Hoare triple {3497#(<= main_~x~0 2)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {3497#(<= main_~x~0 2)} is VALID [2020-07-10 15:26:01,883 INFO L280 TraceCheckUtils]: 11: Hoare triple {3497#(<= main_~x~0 2)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {3498#(<= main_~x~0 3)} is VALID [2020-07-10 15:26:01,884 INFO L280 TraceCheckUtils]: 12: Hoare triple {3498#(<= main_~x~0 3)} assume !(~x~0 < 100000); {3491#false} is VALID [2020-07-10 15:26:01,884 INFO L280 TraceCheckUtils]: 13: Hoare triple {3491#false} ~x~0 := 0; {3491#false} is VALID [2020-07-10 15:26:01,885 INFO L280 TraceCheckUtils]: 14: Hoare triple {3491#false} assume !(~x~0 < ~n~0); {3491#false} is VALID [2020-07-10 15:26:01,885 INFO L280 TraceCheckUtils]: 15: Hoare triple {3491#false} call ~#values~0.base, ~#values~0.offset := #Ultimate.allocOnStack(400000);havoc ~v~0;~v~0 := 0; {3491#false} is VALID [2020-07-10 15:26:01,885 INFO L280 TraceCheckUtils]: 16: Hoare triple {3491#false} assume !!(~v~0 < 100000);assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;call write~int(#t~nondet9, ~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4);havoc #t~nondet9; {3491#false} is VALID [2020-07-10 15:26:01,885 INFO L280 TraceCheckUtils]: 17: Hoare triple {3491#false} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3491#false} is VALID [2020-07-10 15:26:01,885 INFO L280 TraceCheckUtils]: 18: Hoare triple {3491#false} assume !(~v~0 < 100000); {3491#false} is VALID [2020-07-10 15:26:01,886 INFO L280 TraceCheckUtils]: 19: Hoare triple {3491#false} ~v~0 := 0; {3491#false} is VALID [2020-07-10 15:26:01,886 INFO L280 TraceCheckUtils]: 20: Hoare triple {3491#false} assume !!(~v~0 < 100000);call #t~mem11 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {3491#false} is VALID [2020-07-10 15:26:01,886 INFO L263 TraceCheckUtils]: 21: Hoare triple {3491#false} call #t~ret12 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem11); {3490#true} is VALID [2020-07-10 15:26:01,886 INFO L280 TraceCheckUtils]: 22: Hoare triple {3490#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {3490#true} is VALID [2020-07-10 15:26:01,887 INFO L280 TraceCheckUtils]: 23: Hoare triple {3490#true} assume !(~i~0 < ~size); {3490#true} is VALID [2020-07-10 15:26:01,887 INFO L280 TraceCheckUtils]: 24: Hoare triple {3490#true} #res := 0; {3490#true} is VALID [2020-07-10 15:26:01,887 INFO L280 TraceCheckUtils]: 25: Hoare triple {3490#true} assume true; {3490#true} is VALID [2020-07-10 15:26:01,887 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {3490#true} {3491#false} #182#return; {3491#false} is VALID [2020-07-10 15:26:01,887 INFO L280 TraceCheckUtils]: 27: Hoare triple {3491#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {3491#false} is VALID [2020-07-10 15:26:01,888 INFO L280 TraceCheckUtils]: 28: Hoare triple {3491#false} assume 0 != #t~ret12;havoc #t~ret12;havoc #t~mem11;call #t~mem13 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {3491#false} is VALID [2020-07-10 15:26:01,888 INFO L263 TraceCheckUtils]: 29: Hoare triple {3491#false} call #t~ret14 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem13); {3516#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:26:01,888 INFO L280 TraceCheckUtils]: 30: Hoare triple {3516#(= |#memory_int| |old(#memory_int)|)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4);#res := 1 + ~size; {3490#true} is VALID [2020-07-10 15:26:01,888 INFO L280 TraceCheckUtils]: 31: Hoare triple {3490#true} assume true; {3490#true} is VALID [2020-07-10 15:26:01,888 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {3490#true} {3491#false} #184#return; {3491#false} is VALID [2020-07-10 15:26:01,889 INFO L280 TraceCheckUtils]: 33: Hoare triple {3491#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~n~0 := #t~ret14;havoc #t~mem13;havoc #t~ret14; {3491#false} is VALID [2020-07-10 15:26:01,889 INFO L280 TraceCheckUtils]: 34: Hoare triple {3491#false} ~x~0 := 0; {3491#false} is VALID [2020-07-10 15:26:01,889 INFO L280 TraceCheckUtils]: 35: Hoare triple {3491#false} assume !(~x~0 < ~n~0); {3491#false} is VALID [2020-07-10 15:26:01,889 INFO L280 TraceCheckUtils]: 36: Hoare triple {3491#false} #t~post10 := ~v~0;~v~0 := 1 + #t~post10;havoc #t~post10; {3491#false} is VALID [2020-07-10 15:26:01,890 INFO L280 TraceCheckUtils]: 37: Hoare triple {3491#false} assume !!(~v~0 < 100000);call #t~mem11 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {3491#false} is VALID [2020-07-10 15:26:01,890 INFO L263 TraceCheckUtils]: 38: Hoare triple {3491#false} call #t~ret12 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem11); {3490#true} is VALID [2020-07-10 15:26:01,890 INFO L280 TraceCheckUtils]: 39: Hoare triple {3490#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {3490#true} is VALID [2020-07-10 15:26:01,890 INFO L280 TraceCheckUtils]: 40: Hoare triple {3490#true} assume !(~i~0 < ~size); {3490#true} is VALID [2020-07-10 15:26:01,890 INFO L280 TraceCheckUtils]: 41: Hoare triple {3490#true} #res := 0; {3490#true} is VALID [2020-07-10 15:26:01,891 INFO L280 TraceCheckUtils]: 42: Hoare triple {3490#true} assume true; {3490#true} is VALID [2020-07-10 15:26:01,891 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {3490#true} {3491#false} #182#return; {3491#false} is VALID [2020-07-10 15:26:01,891 INFO L280 TraceCheckUtils]: 44: Hoare triple {3491#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {3491#false} is VALID [2020-07-10 15:26:01,891 INFO L280 TraceCheckUtils]: 45: Hoare triple {3491#false} assume 0 != #t~ret12;havoc #t~ret12;havoc #t~mem11;call #t~mem13 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {3491#false} is VALID [2020-07-10 15:26:01,892 INFO L263 TraceCheckUtils]: 46: Hoare triple {3491#false} call #t~ret14 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem13); {3516#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:26:01,892 INFO L280 TraceCheckUtils]: 47: Hoare triple {3516#(= |#memory_int| |old(#memory_int)|)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4);#res := 1 + ~size; {3490#true} is VALID [2020-07-10 15:26:01,892 INFO L280 TraceCheckUtils]: 48: Hoare triple {3490#true} assume true; {3490#true} is VALID [2020-07-10 15:26:01,892 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {3490#true} {3491#false} #184#return; {3491#false} is VALID [2020-07-10 15:26:01,893 INFO L280 TraceCheckUtils]: 50: Hoare triple {3491#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~n~0 := #t~ret14;havoc #t~mem13;havoc #t~ret14; {3491#false} is VALID [2020-07-10 15:26:01,893 INFO L280 TraceCheckUtils]: 51: Hoare triple {3491#false} ~x~0 := 0; {3491#false} is VALID [2020-07-10 15:26:01,893 INFO L280 TraceCheckUtils]: 52: Hoare triple {3491#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {3491#false} is VALID [2020-07-10 15:26:01,893 INFO L280 TraceCheckUtils]: 53: Hoare triple {3491#false} assume !!(~y~0 < ~n~0);call #t~mem17 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem18 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {3491#false} is VALID [2020-07-10 15:26:01,893 INFO L263 TraceCheckUtils]: 54: Hoare triple {3491#false} call __VERIFIER_assert((if #t~mem17 != #t~mem18 then 1 else 0)); {3491#false} is VALID [2020-07-10 15:26:01,894 INFO L280 TraceCheckUtils]: 55: Hoare triple {3491#false} ~cond := #in~cond; {3491#false} is VALID [2020-07-10 15:26:01,894 INFO L280 TraceCheckUtils]: 56: Hoare triple {3491#false} assume 0 == ~cond; {3491#false} is VALID [2020-07-10 15:26:01,894 INFO L280 TraceCheckUtils]: 57: Hoare triple {3491#false} assume !false; {3491#false} is VALID [2020-07-10 15:26:01,897 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-07-10 15:26:01,898 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587919689] [2020-07-10 15:26:01,898 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783679312] [2020-07-10 15:26:01,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:01,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:01,967 INFO L264 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-10 15:26:01,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:01,984 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:26:02,086 INFO L263 TraceCheckUtils]: 0: Hoare triple {3490#true} call ULTIMATE.init(); {3490#true} is VALID [2020-07-10 15:26:02,087 INFO L280 TraceCheckUtils]: 1: Hoare triple {3490#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3490#true} is VALID [2020-07-10 15:26:02,087 INFO L280 TraceCheckUtils]: 2: Hoare triple {3490#true} assume true; {3490#true} is VALID [2020-07-10 15:26:02,087 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3490#true} {3490#true} #176#return; {3490#true} is VALID [2020-07-10 15:26:02,087 INFO L263 TraceCheckUtils]: 4: Hoare triple {3490#true} call #t~ret23 := main(); {3490#true} is VALID [2020-07-10 15:26:02,090 INFO L280 TraceCheckUtils]: 5: Hoare triple {3490#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.allocOnStack(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {3535#(<= main_~x~0 0)} is VALID [2020-07-10 15:26:02,091 INFO L280 TraceCheckUtils]: 6: Hoare triple {3535#(<= main_~x~0 0)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {3535#(<= main_~x~0 0)} is VALID [2020-07-10 15:26:02,091 INFO L280 TraceCheckUtils]: 7: Hoare triple {3535#(<= main_~x~0 0)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {3496#(<= main_~x~0 1)} is VALID [2020-07-10 15:26:02,092 INFO L280 TraceCheckUtils]: 8: Hoare triple {3496#(<= main_~x~0 1)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {3496#(<= main_~x~0 1)} is VALID [2020-07-10 15:26:02,093 INFO L280 TraceCheckUtils]: 9: Hoare triple {3496#(<= main_~x~0 1)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {3497#(<= main_~x~0 2)} is VALID [2020-07-10 15:26:02,093 INFO L280 TraceCheckUtils]: 10: Hoare triple {3497#(<= main_~x~0 2)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {3497#(<= main_~x~0 2)} is VALID [2020-07-10 15:26:02,094 INFO L280 TraceCheckUtils]: 11: Hoare triple {3497#(<= main_~x~0 2)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {3498#(<= main_~x~0 3)} is VALID [2020-07-10 15:26:02,095 INFO L280 TraceCheckUtils]: 12: Hoare triple {3498#(<= main_~x~0 3)} assume !(~x~0 < 100000); {3491#false} is VALID [2020-07-10 15:26:02,095 INFO L280 TraceCheckUtils]: 13: Hoare triple {3491#false} ~x~0 := 0; {3491#false} is VALID [2020-07-10 15:26:02,095 INFO L280 TraceCheckUtils]: 14: Hoare triple {3491#false} assume !(~x~0 < ~n~0); {3491#false} is VALID [2020-07-10 15:26:02,095 INFO L280 TraceCheckUtils]: 15: Hoare triple {3491#false} call ~#values~0.base, ~#values~0.offset := #Ultimate.allocOnStack(400000);havoc ~v~0;~v~0 := 0; {3491#false} is VALID [2020-07-10 15:26:02,095 INFO L280 TraceCheckUtils]: 16: Hoare triple {3491#false} assume !!(~v~0 < 100000);assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;call write~int(#t~nondet9, ~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4);havoc #t~nondet9; {3491#false} is VALID [2020-07-10 15:26:02,096 INFO L280 TraceCheckUtils]: 17: Hoare triple {3491#false} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3491#false} is VALID [2020-07-10 15:26:02,096 INFO L280 TraceCheckUtils]: 18: Hoare triple {3491#false} assume !(~v~0 < 100000); {3491#false} is VALID [2020-07-10 15:26:02,096 INFO L280 TraceCheckUtils]: 19: Hoare triple {3491#false} ~v~0 := 0; {3491#false} is VALID [2020-07-10 15:26:02,096 INFO L280 TraceCheckUtils]: 20: Hoare triple {3491#false} assume !!(~v~0 < 100000);call #t~mem11 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {3491#false} is VALID [2020-07-10 15:26:02,097 INFO L263 TraceCheckUtils]: 21: Hoare triple {3491#false} call #t~ret12 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem11); {3491#false} is VALID [2020-07-10 15:26:02,097 INFO L280 TraceCheckUtils]: 22: Hoare triple {3491#false} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {3491#false} is VALID [2020-07-10 15:26:02,097 INFO L280 TraceCheckUtils]: 23: Hoare triple {3491#false} assume !(~i~0 < ~size); {3491#false} is VALID [2020-07-10 15:26:02,097 INFO L280 TraceCheckUtils]: 24: Hoare triple {3491#false} #res := 0; {3491#false} is VALID [2020-07-10 15:26:02,097 INFO L280 TraceCheckUtils]: 25: Hoare triple {3491#false} assume true; {3491#false} is VALID [2020-07-10 15:26:02,097 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {3491#false} {3491#false} #182#return; {3491#false} is VALID [2020-07-10 15:26:02,098 INFO L280 TraceCheckUtils]: 27: Hoare triple {3491#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {3491#false} is VALID [2020-07-10 15:26:02,098 INFO L280 TraceCheckUtils]: 28: Hoare triple {3491#false} assume 0 != #t~ret12;havoc #t~ret12;havoc #t~mem11;call #t~mem13 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {3491#false} is VALID [2020-07-10 15:26:02,098 INFO L263 TraceCheckUtils]: 29: Hoare triple {3491#false} call #t~ret14 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem13); {3491#false} is VALID [2020-07-10 15:26:02,098 INFO L280 TraceCheckUtils]: 30: Hoare triple {3491#false} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4);#res := 1 + ~size; {3491#false} is VALID [2020-07-10 15:26:02,098 INFO L280 TraceCheckUtils]: 31: Hoare triple {3491#false} assume true; {3491#false} is VALID [2020-07-10 15:26:02,099 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {3491#false} {3491#false} #184#return; {3491#false} is VALID [2020-07-10 15:26:02,099 INFO L280 TraceCheckUtils]: 33: Hoare triple {3491#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~n~0 := #t~ret14;havoc #t~mem13;havoc #t~ret14; {3491#false} is VALID [2020-07-10 15:26:02,099 INFO L280 TraceCheckUtils]: 34: Hoare triple {3491#false} ~x~0 := 0; {3491#false} is VALID [2020-07-10 15:26:02,099 INFO L280 TraceCheckUtils]: 35: Hoare triple {3491#false} assume !(~x~0 < ~n~0); {3491#false} is VALID [2020-07-10 15:26:02,099 INFO L280 TraceCheckUtils]: 36: Hoare triple {3491#false} #t~post10 := ~v~0;~v~0 := 1 + #t~post10;havoc #t~post10; {3491#false} is VALID [2020-07-10 15:26:02,100 INFO L280 TraceCheckUtils]: 37: Hoare triple {3491#false} assume !!(~v~0 < 100000);call #t~mem11 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {3491#false} is VALID [2020-07-10 15:26:02,100 INFO L263 TraceCheckUtils]: 38: Hoare triple {3491#false} call #t~ret12 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem11); {3491#false} is VALID [2020-07-10 15:26:02,100 INFO L280 TraceCheckUtils]: 39: Hoare triple {3491#false} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {3491#false} is VALID [2020-07-10 15:26:02,100 INFO L280 TraceCheckUtils]: 40: Hoare triple {3491#false} assume !(~i~0 < ~size); {3491#false} is VALID [2020-07-10 15:26:02,100 INFO L280 TraceCheckUtils]: 41: Hoare triple {3491#false} #res := 0; {3491#false} is VALID [2020-07-10 15:26:02,101 INFO L280 TraceCheckUtils]: 42: Hoare triple {3491#false} assume true; {3491#false} is VALID [2020-07-10 15:26:02,101 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {3491#false} {3491#false} #182#return; {3491#false} is VALID [2020-07-10 15:26:02,101 INFO L280 TraceCheckUtils]: 44: Hoare triple {3491#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {3491#false} is VALID [2020-07-10 15:26:02,101 INFO L280 TraceCheckUtils]: 45: Hoare triple {3491#false} assume 0 != #t~ret12;havoc #t~ret12;havoc #t~mem11;call #t~mem13 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {3491#false} is VALID [2020-07-10 15:26:02,101 INFO L263 TraceCheckUtils]: 46: Hoare triple {3491#false} call #t~ret14 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem13); {3491#false} is VALID [2020-07-10 15:26:02,102 INFO L280 TraceCheckUtils]: 47: Hoare triple {3491#false} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4);#res := 1 + ~size; {3491#false} is VALID [2020-07-10 15:26:02,102 INFO L280 TraceCheckUtils]: 48: Hoare triple {3491#false} assume true; {3491#false} is VALID [2020-07-10 15:26:02,102 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {3491#false} {3491#false} #184#return; {3491#false} is VALID [2020-07-10 15:26:02,102 INFO L280 TraceCheckUtils]: 50: Hoare triple {3491#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~n~0 := #t~ret14;havoc #t~mem13;havoc #t~ret14; {3491#false} is VALID [2020-07-10 15:26:02,102 INFO L280 TraceCheckUtils]: 51: Hoare triple {3491#false} ~x~0 := 0; {3491#false} is VALID [2020-07-10 15:26:02,103 INFO L280 TraceCheckUtils]: 52: Hoare triple {3491#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {3491#false} is VALID [2020-07-10 15:26:02,103 INFO L280 TraceCheckUtils]: 53: Hoare triple {3491#false} assume !!(~y~0 < ~n~0);call #t~mem17 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem18 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {3491#false} is VALID [2020-07-10 15:26:02,103 INFO L263 TraceCheckUtils]: 54: Hoare triple {3491#false} call __VERIFIER_assert((if #t~mem17 != #t~mem18 then 1 else 0)); {3491#false} is VALID [2020-07-10 15:26:02,103 INFO L280 TraceCheckUtils]: 55: Hoare triple {3491#false} ~cond := #in~cond; {3491#false} is VALID [2020-07-10 15:26:02,103 INFO L280 TraceCheckUtils]: 56: Hoare triple {3491#false} assume 0 == ~cond; {3491#false} is VALID [2020-07-10 15:26:02,104 INFO L280 TraceCheckUtils]: 57: Hoare triple {3491#false} assume !false; {3491#false} is VALID [2020-07-10 15:26:02,106 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-07-10 15:26:02,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:26:02,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2020-07-10 15:26:02,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792614484] [2020-07-10 15:26:02,109 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2020-07-10 15:26:02,114 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:02,114 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-10 15:26:02,174 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:02,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-10 15:26:02,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:02,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-10 15:26:02,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-07-10 15:26:02,175 INFO L87 Difference]: Start difference. First operand 75 states and 91 transitions. Second operand 9 states. [2020-07-10 15:26:03,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:03,393 INFO L93 Difference]: Finished difference Result 260 states and 340 transitions. [2020-07-10 15:26:03,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-10 15:26:03,393 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2020-07-10 15:26:03,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:03,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 15:26:03,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 242 transitions. [2020-07-10 15:26:03,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 15:26:03,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 242 transitions. [2020-07-10 15:26:03,404 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 242 transitions. [2020-07-10 15:26:03,698 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 242 edges. 242 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:03,703 INFO L225 Difference]: With dead ends: 260 [2020-07-10 15:26:03,703 INFO L226 Difference]: Without dead ends: 198 [2020-07-10 15:26:03,705 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2020-07-10 15:26:03,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2020-07-10 15:26:03,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 77. [2020-07-10 15:26:03,776 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:03,776 INFO L82 GeneralOperation]: Start isEquivalent. First operand 198 states. Second operand 77 states. [2020-07-10 15:26:03,777 INFO L74 IsIncluded]: Start isIncluded. First operand 198 states. Second operand 77 states. [2020-07-10 15:26:03,777 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 77 states. [2020-07-10 15:26:03,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:03,787 INFO L93 Difference]: Finished difference Result 198 states and 262 transitions. [2020-07-10 15:26:03,787 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 262 transitions. [2020-07-10 15:26:03,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:03,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:03,789 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 198 states. [2020-07-10 15:26:03,789 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 198 states. [2020-07-10 15:26:03,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:03,797 INFO L93 Difference]: Finished difference Result 198 states and 262 transitions. [2020-07-10 15:26:03,798 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 262 transitions. [2020-07-10 15:26:03,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:03,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:03,800 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:03,800 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:03,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-07-10 15:26:03,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 93 transitions. [2020-07-10 15:26:03,803 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 93 transitions. Word has length 58 [2020-07-10 15:26:03,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:03,803 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 93 transitions. [2020-07-10 15:26:03,803 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-10 15:26:03,804 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 93 transitions. [2020-07-10 15:26:03,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-07-10 15:26:03,805 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:03,805 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-07-10 15:26:04,019 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:04,020 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:04,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:04,022 INFO L82 PathProgramCache]: Analyzing trace with hash -997532006, now seen corresponding path program 2 times [2020-07-10 15:26:04,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:04,022 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636146441] [2020-07-10 15:26:04,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:04,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:04,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:04,135 INFO L280 TraceCheckUtils]: 0: Hoare triple {4594#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {4571#true} is VALID [2020-07-10 15:26:04,135 INFO L280 TraceCheckUtils]: 1: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 15:26:04,136 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4571#true} {4571#true} #176#return; {4571#true} is VALID [2020-07-10 15:26:04,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:04,141 INFO L280 TraceCheckUtils]: 0: Hoare triple {4571#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {4571#true} is VALID [2020-07-10 15:26:04,142 INFO L280 TraceCheckUtils]: 1: Hoare triple {4571#true} assume !(~i~0 < ~size); {4571#true} is VALID [2020-07-10 15:26:04,142 INFO L280 TraceCheckUtils]: 2: Hoare triple {4571#true} #res := 0; {4571#true} is VALID [2020-07-10 15:26:04,142 INFO L280 TraceCheckUtils]: 3: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 15:26:04,143 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {4571#true} {4572#false} #182#return; {4572#false} is VALID [2020-07-10 15:26:04,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:04,156 INFO L280 TraceCheckUtils]: 0: Hoare triple {4595#(= |#memory_int| |old(#memory_int)|)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4);#res := 1 + ~size; {4571#true} is VALID [2020-07-10 15:26:04,156 INFO L280 TraceCheckUtils]: 1: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 15:26:04,156 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4571#true} {4572#false} #184#return; {4572#false} is VALID [2020-07-10 15:26:04,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:04,162 INFO L280 TraceCheckUtils]: 0: Hoare triple {4571#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {4571#true} is VALID [2020-07-10 15:26:04,163 INFO L280 TraceCheckUtils]: 1: Hoare triple {4571#true} assume !(~i~0 < ~size); {4571#true} is VALID [2020-07-10 15:26:04,163 INFO L280 TraceCheckUtils]: 2: Hoare triple {4571#true} #res := 0; {4571#true} is VALID [2020-07-10 15:26:04,163 INFO L280 TraceCheckUtils]: 3: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 15:26:04,163 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {4571#true} {4572#false} #182#return; {4572#false} is VALID [2020-07-10 15:26:04,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:04,169 INFO L280 TraceCheckUtils]: 0: Hoare triple {4595#(= |#memory_int| |old(#memory_int)|)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4);#res := 1 + ~size; {4571#true} is VALID [2020-07-10 15:26:04,170 INFO L280 TraceCheckUtils]: 1: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 15:26:04,170 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4571#true} {4572#false} #184#return; {4572#false} is VALID [2020-07-10 15:26:04,171 INFO L263 TraceCheckUtils]: 0: Hoare triple {4571#true} call ULTIMATE.init(); {4594#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:26:04,172 INFO L280 TraceCheckUtils]: 1: Hoare triple {4594#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {4571#true} is VALID [2020-07-10 15:26:04,172 INFO L280 TraceCheckUtils]: 2: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 15:26:04,172 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4571#true} {4571#true} #176#return; {4571#true} is VALID [2020-07-10 15:26:04,172 INFO L263 TraceCheckUtils]: 4: Hoare triple {4571#true} call #t~ret23 := main(); {4571#true} is VALID [2020-07-10 15:26:04,172 INFO L280 TraceCheckUtils]: 5: Hoare triple {4571#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.allocOnStack(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {4571#true} is VALID [2020-07-10 15:26:04,173 INFO L280 TraceCheckUtils]: 6: Hoare triple {4571#true} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {4571#true} is VALID [2020-07-10 15:26:04,173 INFO L280 TraceCheckUtils]: 7: Hoare triple {4571#true} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {4571#true} is VALID [2020-07-10 15:26:04,173 INFO L280 TraceCheckUtils]: 8: Hoare triple {4571#true} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {4571#true} is VALID [2020-07-10 15:26:04,173 INFO L280 TraceCheckUtils]: 9: Hoare triple {4571#true} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {4571#true} is VALID [2020-07-10 15:26:04,173 INFO L280 TraceCheckUtils]: 10: Hoare triple {4571#true} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {4571#true} is VALID [2020-07-10 15:26:04,174 INFO L280 TraceCheckUtils]: 11: Hoare triple {4571#true} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {4571#true} is VALID [2020-07-10 15:26:04,174 INFO L280 TraceCheckUtils]: 12: Hoare triple {4571#true} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {4571#true} is VALID [2020-07-10 15:26:04,174 INFO L280 TraceCheckUtils]: 13: Hoare triple {4571#true} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {4571#true} is VALID [2020-07-10 15:26:04,174 INFO L280 TraceCheckUtils]: 14: Hoare triple {4571#true} assume !(~x~0 < 100000); {4571#true} is VALID [2020-07-10 15:26:04,174 INFO L280 TraceCheckUtils]: 15: Hoare triple {4571#true} ~x~0 := 0; {4571#true} is VALID [2020-07-10 15:26:04,175 INFO L280 TraceCheckUtils]: 16: Hoare triple {4571#true} assume !(~x~0 < ~n~0); {4571#true} is VALID [2020-07-10 15:26:04,176 INFO L280 TraceCheckUtils]: 17: Hoare triple {4571#true} call ~#values~0.base, ~#values~0.offset := #Ultimate.allocOnStack(400000);havoc ~v~0;~v~0 := 0; {4576#(= 0 main_~v~0)} is VALID [2020-07-10 15:26:04,176 INFO L280 TraceCheckUtils]: 18: Hoare triple {4576#(= 0 main_~v~0)} assume !!(~v~0 < 100000);assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;call write~int(#t~nondet9, ~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4);havoc #t~nondet9; {4576#(= 0 main_~v~0)} is VALID [2020-07-10 15:26:04,177 INFO L280 TraceCheckUtils]: 19: Hoare triple {4576#(= 0 main_~v~0)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {4577#(<= main_~v~0 1)} is VALID [2020-07-10 15:26:04,178 INFO L280 TraceCheckUtils]: 20: Hoare triple {4577#(<= main_~v~0 1)} assume !(~v~0 < 100000); {4572#false} is VALID [2020-07-10 15:26:04,178 INFO L280 TraceCheckUtils]: 21: Hoare triple {4572#false} ~v~0 := 0; {4572#false} is VALID [2020-07-10 15:26:04,178 INFO L280 TraceCheckUtils]: 22: Hoare triple {4572#false} assume !!(~v~0 < 100000);call #t~mem11 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {4572#false} is VALID [2020-07-10 15:26:04,179 INFO L263 TraceCheckUtils]: 23: Hoare triple {4572#false} call #t~ret12 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem11); {4571#true} is VALID [2020-07-10 15:26:04,179 INFO L280 TraceCheckUtils]: 24: Hoare triple {4571#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {4571#true} is VALID [2020-07-10 15:26:04,179 INFO L280 TraceCheckUtils]: 25: Hoare triple {4571#true} assume !(~i~0 < ~size); {4571#true} is VALID [2020-07-10 15:26:04,179 INFO L280 TraceCheckUtils]: 26: Hoare triple {4571#true} #res := 0; {4571#true} is VALID [2020-07-10 15:26:04,180 INFO L280 TraceCheckUtils]: 27: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 15:26:04,180 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {4571#true} {4572#false} #182#return; {4572#false} is VALID [2020-07-10 15:26:04,180 INFO L280 TraceCheckUtils]: 29: Hoare triple {4572#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {4572#false} is VALID [2020-07-10 15:26:04,180 INFO L280 TraceCheckUtils]: 30: Hoare triple {4572#false} assume 0 != #t~ret12;havoc #t~ret12;havoc #t~mem11;call #t~mem13 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {4572#false} is VALID [2020-07-10 15:26:04,181 INFO L263 TraceCheckUtils]: 31: Hoare triple {4572#false} call #t~ret14 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem13); {4595#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:26:04,181 INFO L280 TraceCheckUtils]: 32: Hoare triple {4595#(= |#memory_int| |old(#memory_int)|)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4);#res := 1 + ~size; {4571#true} is VALID [2020-07-10 15:26:04,181 INFO L280 TraceCheckUtils]: 33: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 15:26:04,181 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {4571#true} {4572#false} #184#return; {4572#false} is VALID [2020-07-10 15:26:04,182 INFO L280 TraceCheckUtils]: 35: Hoare triple {4572#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~n~0 := #t~ret14;havoc #t~mem13;havoc #t~ret14; {4572#false} is VALID [2020-07-10 15:26:04,182 INFO L280 TraceCheckUtils]: 36: Hoare triple {4572#false} ~x~0 := 0; {4572#false} is VALID [2020-07-10 15:26:04,182 INFO L280 TraceCheckUtils]: 37: Hoare triple {4572#false} assume !(~x~0 < ~n~0); {4572#false} is VALID [2020-07-10 15:26:04,182 INFO L280 TraceCheckUtils]: 38: Hoare triple {4572#false} #t~post10 := ~v~0;~v~0 := 1 + #t~post10;havoc #t~post10; {4572#false} is VALID [2020-07-10 15:26:04,182 INFO L280 TraceCheckUtils]: 39: Hoare triple {4572#false} assume !!(~v~0 < 100000);call #t~mem11 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {4572#false} is VALID [2020-07-10 15:26:04,183 INFO L263 TraceCheckUtils]: 40: Hoare triple {4572#false} call #t~ret12 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem11); {4571#true} is VALID [2020-07-10 15:26:04,183 INFO L280 TraceCheckUtils]: 41: Hoare triple {4571#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {4571#true} is VALID [2020-07-10 15:26:04,183 INFO L280 TraceCheckUtils]: 42: Hoare triple {4571#true} assume !(~i~0 < ~size); {4571#true} is VALID [2020-07-10 15:26:04,183 INFO L280 TraceCheckUtils]: 43: Hoare triple {4571#true} #res := 0; {4571#true} is VALID [2020-07-10 15:26:04,184 INFO L280 TraceCheckUtils]: 44: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 15:26:04,184 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {4571#true} {4572#false} #182#return; {4572#false} is VALID [2020-07-10 15:26:04,184 INFO L280 TraceCheckUtils]: 46: Hoare triple {4572#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {4572#false} is VALID [2020-07-10 15:26:04,184 INFO L280 TraceCheckUtils]: 47: Hoare triple {4572#false} assume 0 != #t~ret12;havoc #t~ret12;havoc #t~mem11;call #t~mem13 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {4572#false} is VALID [2020-07-10 15:26:04,184 INFO L263 TraceCheckUtils]: 48: Hoare triple {4572#false} call #t~ret14 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem13); {4595#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:26:04,185 INFO L280 TraceCheckUtils]: 49: Hoare triple {4595#(= |#memory_int| |old(#memory_int)|)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4);#res := 1 + ~size; {4571#true} is VALID [2020-07-10 15:26:04,185 INFO L280 TraceCheckUtils]: 50: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 15:26:04,185 INFO L275 TraceCheckUtils]: 51: Hoare quadruple {4571#true} {4572#false} #184#return; {4572#false} is VALID [2020-07-10 15:26:04,185 INFO L280 TraceCheckUtils]: 52: Hoare triple {4572#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~n~0 := #t~ret14;havoc #t~mem13;havoc #t~ret14; {4572#false} is VALID [2020-07-10 15:26:04,186 INFO L280 TraceCheckUtils]: 53: Hoare triple {4572#false} ~x~0 := 0; {4572#false} is VALID [2020-07-10 15:26:04,186 INFO L280 TraceCheckUtils]: 54: Hoare triple {4572#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {4572#false} is VALID [2020-07-10 15:26:04,186 INFO L280 TraceCheckUtils]: 55: Hoare triple {4572#false} assume !!(~y~0 < ~n~0);call #t~mem17 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem18 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {4572#false} is VALID [2020-07-10 15:26:04,187 INFO L263 TraceCheckUtils]: 56: Hoare triple {4572#false} call __VERIFIER_assert((if #t~mem17 != #t~mem18 then 1 else 0)); {4572#false} is VALID [2020-07-10 15:26:04,187 INFO L280 TraceCheckUtils]: 57: Hoare triple {4572#false} ~cond := #in~cond; {4572#false} is VALID [2020-07-10 15:26:04,187 INFO L280 TraceCheckUtils]: 58: Hoare triple {4572#false} assume 0 == ~cond; {4572#false} is VALID [2020-07-10 15:26:04,187 INFO L280 TraceCheckUtils]: 59: Hoare triple {4572#false} assume !false; {4572#false} is VALID [2020-07-10 15:26:04,191 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-07-10 15:26:04,191 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636146441] [2020-07-10 15:26:04,191 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323956358] [2020-07-10 15:26:04,192 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:04,244 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-10 15:26:04,245 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:26:04,246 INFO L264 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-10 15:26:04,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:04,262 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:26:04,488 INFO L263 TraceCheckUtils]: 0: Hoare triple {4571#true} call ULTIMATE.init(); {4571#true} is VALID [2020-07-10 15:26:04,488 INFO L280 TraceCheckUtils]: 1: Hoare triple {4571#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {4571#true} is VALID [2020-07-10 15:26:04,489 INFO L280 TraceCheckUtils]: 2: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 15:26:04,489 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4571#true} {4571#true} #176#return; {4571#true} is VALID [2020-07-10 15:26:04,489 INFO L263 TraceCheckUtils]: 4: Hoare triple {4571#true} call #t~ret23 := main(); {4571#true} is VALID [2020-07-10 15:26:04,489 INFO L280 TraceCheckUtils]: 5: Hoare triple {4571#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.allocOnStack(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {4571#true} is VALID [2020-07-10 15:26:04,490 INFO L280 TraceCheckUtils]: 6: Hoare triple {4571#true} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {4571#true} is VALID [2020-07-10 15:26:04,490 INFO L280 TraceCheckUtils]: 7: Hoare triple {4571#true} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {4571#true} is VALID [2020-07-10 15:26:04,490 INFO L280 TraceCheckUtils]: 8: Hoare triple {4571#true} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {4571#true} is VALID [2020-07-10 15:26:04,490 INFO L280 TraceCheckUtils]: 9: Hoare triple {4571#true} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {4571#true} is VALID [2020-07-10 15:26:04,490 INFO L280 TraceCheckUtils]: 10: Hoare triple {4571#true} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {4571#true} is VALID [2020-07-10 15:26:04,491 INFO L280 TraceCheckUtils]: 11: Hoare triple {4571#true} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {4571#true} is VALID [2020-07-10 15:26:04,491 INFO L280 TraceCheckUtils]: 12: Hoare triple {4571#true} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {4571#true} is VALID [2020-07-10 15:26:04,491 INFO L280 TraceCheckUtils]: 13: Hoare triple {4571#true} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {4571#true} is VALID [2020-07-10 15:26:04,491 INFO L280 TraceCheckUtils]: 14: Hoare triple {4571#true} assume !(~x~0 < 100000); {4571#true} is VALID [2020-07-10 15:26:04,491 INFO L280 TraceCheckUtils]: 15: Hoare triple {4571#true} ~x~0 := 0; {4571#true} is VALID [2020-07-10 15:26:04,491 INFO L280 TraceCheckUtils]: 16: Hoare triple {4571#true} assume !(~x~0 < ~n~0); {4571#true} is VALID [2020-07-10 15:26:04,491 INFO L280 TraceCheckUtils]: 17: Hoare triple {4571#true} call ~#values~0.base, ~#values~0.offset := #Ultimate.allocOnStack(400000);havoc ~v~0;~v~0 := 0; {4571#true} is VALID [2020-07-10 15:26:04,492 INFO L280 TraceCheckUtils]: 18: Hoare triple {4571#true} assume !!(~v~0 < 100000);assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;call write~int(#t~nondet9, ~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4);havoc #t~nondet9; {4571#true} is VALID [2020-07-10 15:26:04,492 INFO L280 TraceCheckUtils]: 19: Hoare triple {4571#true} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {4571#true} is VALID [2020-07-10 15:26:04,492 INFO L280 TraceCheckUtils]: 20: Hoare triple {4571#true} assume !(~v~0 < 100000); {4571#true} is VALID [2020-07-10 15:26:04,492 INFO L280 TraceCheckUtils]: 21: Hoare triple {4571#true} ~v~0 := 0; {4571#true} is VALID [2020-07-10 15:26:04,492 INFO L280 TraceCheckUtils]: 22: Hoare triple {4571#true} assume !!(~v~0 < 100000);call #t~mem11 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {4571#true} is VALID [2020-07-10 15:26:04,492 INFO L263 TraceCheckUtils]: 23: Hoare triple {4571#true} call #t~ret12 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem11); {4571#true} is VALID [2020-07-10 15:26:04,492 INFO L280 TraceCheckUtils]: 24: Hoare triple {4571#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {4571#true} is VALID [2020-07-10 15:26:04,493 INFO L280 TraceCheckUtils]: 25: Hoare triple {4571#true} assume !(~i~0 < ~size); {4571#true} is VALID [2020-07-10 15:26:04,493 INFO L280 TraceCheckUtils]: 26: Hoare triple {4571#true} #res := 0; {4571#true} is VALID [2020-07-10 15:26:04,493 INFO L280 TraceCheckUtils]: 27: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 15:26:04,493 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {4571#true} {4571#true} #182#return; {4571#true} is VALID [2020-07-10 15:26:04,493 INFO L280 TraceCheckUtils]: 29: Hoare triple {4571#true} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {4571#true} is VALID [2020-07-10 15:26:04,493 INFO L280 TraceCheckUtils]: 30: Hoare triple {4571#true} assume 0 != #t~ret12;havoc #t~ret12;havoc #t~mem11;call #t~mem13 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {4571#true} is VALID [2020-07-10 15:26:04,493 INFO L263 TraceCheckUtils]: 31: Hoare triple {4571#true} call #t~ret14 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem13); {4571#true} is VALID [2020-07-10 15:26:04,493 INFO L280 TraceCheckUtils]: 32: Hoare triple {4571#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4);#res := 1 + ~size; {4571#true} is VALID [2020-07-10 15:26:04,494 INFO L280 TraceCheckUtils]: 33: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 15:26:04,494 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {4571#true} {4571#true} #184#return; {4571#true} is VALID [2020-07-10 15:26:04,494 INFO L280 TraceCheckUtils]: 35: Hoare triple {4571#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~n~0 := #t~ret14;havoc #t~mem13;havoc #t~ret14; {4571#true} is VALID [2020-07-10 15:26:04,494 INFO L280 TraceCheckUtils]: 36: Hoare triple {4571#true} ~x~0 := 0; {4571#true} is VALID [2020-07-10 15:26:04,494 INFO L280 TraceCheckUtils]: 37: Hoare triple {4571#true} assume !(~x~0 < ~n~0); {4571#true} is VALID [2020-07-10 15:26:04,494 INFO L280 TraceCheckUtils]: 38: Hoare triple {4571#true} #t~post10 := ~v~0;~v~0 := 1 + #t~post10;havoc #t~post10; {4571#true} is VALID [2020-07-10 15:26:04,494 INFO L280 TraceCheckUtils]: 39: Hoare triple {4571#true} assume !!(~v~0 < 100000);call #t~mem11 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {4571#true} is VALID [2020-07-10 15:26:04,495 INFO L263 TraceCheckUtils]: 40: Hoare triple {4571#true} call #t~ret12 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem11); {4571#true} is VALID [2020-07-10 15:26:04,495 INFO L280 TraceCheckUtils]: 41: Hoare triple {4571#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {4722#(and (<= elem_exists_~i~0 0) (<= |elem_exists_#in~size| elem_exists_~size))} is VALID [2020-07-10 15:26:04,496 INFO L280 TraceCheckUtils]: 42: Hoare triple {4722#(and (<= elem_exists_~i~0 0) (<= |elem_exists_#in~size| elem_exists_~size))} assume !(~i~0 < ~size); {4726#(<= |elem_exists_#in~size| 0)} is VALID [2020-07-10 15:26:04,496 INFO L280 TraceCheckUtils]: 43: Hoare triple {4726#(<= |elem_exists_#in~size| 0)} #res := 0; {4726#(<= |elem_exists_#in~size| 0)} is VALID [2020-07-10 15:26:04,497 INFO L280 TraceCheckUtils]: 44: Hoare triple {4726#(<= |elem_exists_#in~size| 0)} assume true; {4726#(<= |elem_exists_#in~size| 0)} is VALID [2020-07-10 15:26:04,498 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {4726#(<= |elem_exists_#in~size| 0)} {4571#true} #182#return; {4736#(<= main_~n~0 0)} is VALID [2020-07-10 15:26:04,498 INFO L280 TraceCheckUtils]: 46: Hoare triple {4736#(<= main_~n~0 0)} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {4736#(<= main_~n~0 0)} is VALID [2020-07-10 15:26:04,498 INFO L280 TraceCheckUtils]: 47: Hoare triple {4736#(<= main_~n~0 0)} assume 0 != #t~ret12;havoc #t~ret12;havoc #t~mem11;call #t~mem13 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {4736#(<= main_~n~0 0)} is VALID [2020-07-10 15:26:04,499 INFO L263 TraceCheckUtils]: 48: Hoare triple {4736#(<= main_~n~0 0)} call #t~ret14 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem13); {4571#true} is VALID [2020-07-10 15:26:04,499 INFO L280 TraceCheckUtils]: 49: Hoare triple {4571#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4);#res := 1 + ~size; {4749#(<= |insert_#res| (+ |insert_#in~size| 1))} is VALID [2020-07-10 15:26:04,500 INFO L280 TraceCheckUtils]: 50: Hoare triple {4749#(<= |insert_#res| (+ |insert_#in~size| 1))} assume true; {4749#(<= |insert_#res| (+ |insert_#in~size| 1))} is VALID [2020-07-10 15:26:04,501 INFO L275 TraceCheckUtils]: 51: Hoare quadruple {4749#(<= |insert_#res| (+ |insert_#in~size| 1))} {4736#(<= main_~n~0 0)} #184#return; {4756#(<= |main_#t~ret14| 1)} is VALID [2020-07-10 15:26:04,501 INFO L280 TraceCheckUtils]: 52: Hoare triple {4756#(<= |main_#t~ret14| 1)} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~n~0 := #t~ret14;havoc #t~mem13;havoc #t~ret14; {4760#(<= main_~n~0 1)} is VALID [2020-07-10 15:26:04,502 INFO L280 TraceCheckUtils]: 53: Hoare triple {4760#(<= main_~n~0 1)} ~x~0 := 0; {4764#(and (<= 0 main_~x~0) (<= main_~n~0 1))} is VALID [2020-07-10 15:26:04,503 INFO L280 TraceCheckUtils]: 54: Hoare triple {4764#(and (<= 0 main_~x~0) (<= main_~n~0 1))} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {4768#(and (<= 1 main_~y~0) (<= main_~n~0 1))} is VALID [2020-07-10 15:26:04,504 INFO L280 TraceCheckUtils]: 55: Hoare triple {4768#(and (<= 1 main_~y~0) (<= main_~n~0 1))} assume !!(~y~0 < ~n~0);call #t~mem17 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem18 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {4572#false} is VALID [2020-07-10 15:26:04,504 INFO L263 TraceCheckUtils]: 56: Hoare triple {4572#false} call __VERIFIER_assert((if #t~mem17 != #t~mem18 then 1 else 0)); {4572#false} is VALID [2020-07-10 15:26:04,504 INFO L280 TraceCheckUtils]: 57: Hoare triple {4572#false} ~cond := #in~cond; {4572#false} is VALID [2020-07-10 15:26:04,504 INFO L280 TraceCheckUtils]: 58: Hoare triple {4572#false} assume 0 == ~cond; {4572#false} is VALID [2020-07-10 15:26:04,505 INFO L280 TraceCheckUtils]: 59: Hoare triple {4572#false} assume !false; {4572#false} is VALID [2020-07-10 15:26:04,507 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-07-10 15:26:04,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:26:04,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2020-07-10 15:26:04,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024985344] [2020-07-10 15:26:04,508 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 60 [2020-07-10 15:26:04,509 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:04,509 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-10 15:26:04,564 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:04,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-10 15:26:04,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:04,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-10 15:26:04,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-07-10 15:26:04,566 INFO L87 Difference]: Start difference. First operand 77 states and 93 transitions. Second operand 10 states. [2020-07-10 15:26:06,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:06,023 INFO L93 Difference]: Finished difference Result 216 states and 294 transitions. [2020-07-10 15:26:06,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-10 15:26:06,023 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 60 [2020-07-10 15:26:06,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:06,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 15:26:06,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 213 transitions. [2020-07-10 15:26:06,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 15:26:06,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 213 transitions. [2020-07-10 15:26:06,033 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 213 transitions. [2020-07-10 15:26:06,292 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 213 edges. 213 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:06,297 INFO L225 Difference]: With dead ends: 216 [2020-07-10 15:26:06,298 INFO L226 Difference]: Without dead ends: 160 [2020-07-10 15:26:06,299 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2020-07-10 15:26:06,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-07-10 15:26:06,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 90. [2020-07-10 15:26:06,374 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:06,375 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand 90 states. [2020-07-10 15:26:06,375 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand 90 states. [2020-07-10 15:26:06,375 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 90 states. [2020-07-10 15:26:06,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:06,383 INFO L93 Difference]: Finished difference Result 160 states and 217 transitions. [2020-07-10 15:26:06,383 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 217 transitions. [2020-07-10 15:26:06,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:06,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:06,385 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 160 states. [2020-07-10 15:26:06,385 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 160 states. [2020-07-10 15:26:06,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:06,393 INFO L93 Difference]: Finished difference Result 160 states and 217 transitions. [2020-07-10 15:26:06,393 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 217 transitions. [2020-07-10 15:26:06,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:06,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:06,395 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:06,395 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:06,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-07-10 15:26:06,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 112 transitions. [2020-07-10 15:26:06,400 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 112 transitions. Word has length 60 [2020-07-10 15:26:06,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:06,400 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 112 transitions. [2020-07-10 15:26:06,400 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-10 15:26:06,400 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 112 transitions. [2020-07-10 15:26:06,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-07-10 15:26:06,401 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:06,402 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2020-07-10 15:26:06,614 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:06,615 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:06,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:06,616 INFO L82 PathProgramCache]: Analyzing trace with hash 420057297, now seen corresponding path program 1 times [2020-07-10 15:26:06,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:06,617 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326113105] [2020-07-10 15:26:06,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:06,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:06,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:06,684 INFO L280 TraceCheckUtils]: 0: Hoare triple {5573#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {5550#true} is VALID [2020-07-10 15:26:06,684 INFO L280 TraceCheckUtils]: 1: Hoare triple {5550#true} assume true; {5550#true} is VALID [2020-07-10 15:26:06,685 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5550#true} {5550#true} #176#return; {5550#true} is VALID [2020-07-10 15:26:06,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:06,691 INFO L280 TraceCheckUtils]: 0: Hoare triple {5550#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {5550#true} is VALID [2020-07-10 15:26:06,692 INFO L280 TraceCheckUtils]: 1: Hoare triple {5550#true} assume !(~i~0 < ~size); {5550#true} is VALID [2020-07-10 15:26:06,692 INFO L280 TraceCheckUtils]: 2: Hoare triple {5550#true} #res := 0; {5550#true} is VALID [2020-07-10 15:26:06,692 INFO L280 TraceCheckUtils]: 3: Hoare triple {5550#true} assume true; {5550#true} is VALID [2020-07-10 15:26:06,693 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {5550#true} {5551#false} #182#return; {5551#false} is VALID [2020-07-10 15:26:06,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:06,706 INFO L280 TraceCheckUtils]: 0: Hoare triple {5574#(= |#memory_int| |old(#memory_int)|)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4);#res := 1 + ~size; {5550#true} is VALID [2020-07-10 15:26:06,707 INFO L280 TraceCheckUtils]: 1: Hoare triple {5550#true} assume true; {5550#true} is VALID [2020-07-10 15:26:06,707 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5550#true} {5551#false} #184#return; {5551#false} is VALID [2020-07-10 15:26:06,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:06,715 INFO L280 TraceCheckUtils]: 0: Hoare triple {5550#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {5550#true} is VALID [2020-07-10 15:26:06,715 INFO L280 TraceCheckUtils]: 1: Hoare triple {5550#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {5550#true} is VALID [2020-07-10 15:26:06,715 INFO L280 TraceCheckUtils]: 2: Hoare triple {5550#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {5550#true} is VALID [2020-07-10 15:26:06,716 INFO L280 TraceCheckUtils]: 3: Hoare triple {5550#true} assume true; {5550#true} is VALID [2020-07-10 15:26:06,716 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {5550#true} {5551#false} #182#return; {5551#false} is VALID [2020-07-10 15:26:06,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:06,721 INFO L280 TraceCheckUtils]: 0: Hoare triple {5574#(= |#memory_int| |old(#memory_int)|)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4);#res := 1 + ~size; {5550#true} is VALID [2020-07-10 15:26:06,722 INFO L280 TraceCheckUtils]: 1: Hoare triple {5550#true} assume true; {5550#true} is VALID [2020-07-10 15:26:06,722 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5550#true} {5551#false} #184#return; {5551#false} is VALID [2020-07-10 15:26:06,726 INFO L263 TraceCheckUtils]: 0: Hoare triple {5550#true} call ULTIMATE.init(); {5573#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:26:06,726 INFO L280 TraceCheckUtils]: 1: Hoare triple {5573#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {5550#true} is VALID [2020-07-10 15:26:06,727 INFO L280 TraceCheckUtils]: 2: Hoare triple {5550#true} assume true; {5550#true} is VALID [2020-07-10 15:26:06,727 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5550#true} {5550#true} #176#return; {5550#true} is VALID [2020-07-10 15:26:06,727 INFO L263 TraceCheckUtils]: 4: Hoare triple {5550#true} call #t~ret23 := main(); {5550#true} is VALID [2020-07-10 15:26:06,727 INFO L280 TraceCheckUtils]: 5: Hoare triple {5550#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.allocOnStack(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {5550#true} is VALID [2020-07-10 15:26:06,728 INFO L280 TraceCheckUtils]: 6: Hoare triple {5550#true} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {5550#true} is VALID [2020-07-10 15:26:06,728 INFO L280 TraceCheckUtils]: 7: Hoare triple {5550#true} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {5550#true} is VALID [2020-07-10 15:26:06,728 INFO L280 TraceCheckUtils]: 8: Hoare triple {5550#true} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {5550#true} is VALID [2020-07-10 15:26:06,728 INFO L280 TraceCheckUtils]: 9: Hoare triple {5550#true} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {5550#true} is VALID [2020-07-10 15:26:06,728 INFO L280 TraceCheckUtils]: 10: Hoare triple {5550#true} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {5550#true} is VALID [2020-07-10 15:26:06,729 INFO L280 TraceCheckUtils]: 11: Hoare triple {5550#true} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {5550#true} is VALID [2020-07-10 15:26:06,729 INFO L280 TraceCheckUtils]: 12: Hoare triple {5550#true} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {5550#true} is VALID [2020-07-10 15:26:06,729 INFO L280 TraceCheckUtils]: 13: Hoare triple {5550#true} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {5550#true} is VALID [2020-07-10 15:26:06,729 INFO L280 TraceCheckUtils]: 14: Hoare triple {5550#true} assume !(~x~0 < 100000); {5550#true} is VALID [2020-07-10 15:26:06,729 INFO L280 TraceCheckUtils]: 15: Hoare triple {5550#true} ~x~0 := 0; {5550#true} is VALID [2020-07-10 15:26:06,730 INFO L280 TraceCheckUtils]: 16: Hoare triple {5550#true} assume !(~x~0 < ~n~0); {5550#true} is VALID [2020-07-10 15:26:06,731 INFO L280 TraceCheckUtils]: 17: Hoare triple {5550#true} call ~#values~0.base, ~#values~0.offset := #Ultimate.allocOnStack(400000);havoc ~v~0;~v~0 := 0; {5555#(= 0 main_~v~0)} is VALID [2020-07-10 15:26:06,731 INFO L280 TraceCheckUtils]: 18: Hoare triple {5555#(= 0 main_~v~0)} assume !!(~v~0 < 100000);assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;call write~int(#t~nondet9, ~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4);havoc #t~nondet9; {5555#(= 0 main_~v~0)} is VALID [2020-07-10 15:26:06,732 INFO L280 TraceCheckUtils]: 19: Hoare triple {5555#(= 0 main_~v~0)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {5556#(<= main_~v~0 1)} is VALID [2020-07-10 15:26:06,733 INFO L280 TraceCheckUtils]: 20: Hoare triple {5556#(<= main_~v~0 1)} assume !(~v~0 < 100000); {5551#false} is VALID [2020-07-10 15:26:06,733 INFO L280 TraceCheckUtils]: 21: Hoare triple {5551#false} ~v~0 := 0; {5551#false} is VALID [2020-07-10 15:26:06,734 INFO L280 TraceCheckUtils]: 22: Hoare triple {5551#false} assume !!(~v~0 < 100000);call #t~mem11 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {5551#false} is VALID [2020-07-10 15:26:06,734 INFO L263 TraceCheckUtils]: 23: Hoare triple {5551#false} call #t~ret12 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem11); {5550#true} is VALID [2020-07-10 15:26:06,734 INFO L280 TraceCheckUtils]: 24: Hoare triple {5550#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {5550#true} is VALID [2020-07-10 15:26:06,734 INFO L280 TraceCheckUtils]: 25: Hoare triple {5550#true} assume !(~i~0 < ~size); {5550#true} is VALID [2020-07-10 15:26:06,734 INFO L280 TraceCheckUtils]: 26: Hoare triple {5550#true} #res := 0; {5550#true} is VALID [2020-07-10 15:26:06,735 INFO L280 TraceCheckUtils]: 27: Hoare triple {5550#true} assume true; {5550#true} is VALID [2020-07-10 15:26:06,735 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {5550#true} {5551#false} #182#return; {5551#false} is VALID [2020-07-10 15:26:06,735 INFO L280 TraceCheckUtils]: 29: Hoare triple {5551#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {5551#false} is VALID [2020-07-10 15:26:06,735 INFO L280 TraceCheckUtils]: 30: Hoare triple {5551#false} assume 0 != #t~ret12;havoc #t~ret12;havoc #t~mem11;call #t~mem13 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {5551#false} is VALID [2020-07-10 15:26:06,735 INFO L263 TraceCheckUtils]: 31: Hoare triple {5551#false} call #t~ret14 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem13); {5574#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:26:06,736 INFO L280 TraceCheckUtils]: 32: Hoare triple {5574#(= |#memory_int| |old(#memory_int)|)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4);#res := 1 + ~size; {5550#true} is VALID [2020-07-10 15:26:06,736 INFO L280 TraceCheckUtils]: 33: Hoare triple {5550#true} assume true; {5550#true} is VALID [2020-07-10 15:26:06,736 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {5550#true} {5551#false} #184#return; {5551#false} is VALID [2020-07-10 15:26:06,736 INFO L280 TraceCheckUtils]: 35: Hoare triple {5551#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~n~0 := #t~ret14;havoc #t~mem13;havoc #t~ret14; {5551#false} is VALID [2020-07-10 15:26:06,737 INFO L280 TraceCheckUtils]: 36: Hoare triple {5551#false} ~x~0 := 0; {5551#false} is VALID [2020-07-10 15:26:06,737 INFO L280 TraceCheckUtils]: 37: Hoare triple {5551#false} assume !(~x~0 < ~n~0); {5551#false} is VALID [2020-07-10 15:26:06,737 INFO L280 TraceCheckUtils]: 38: Hoare triple {5551#false} #t~post10 := ~v~0;~v~0 := 1 + #t~post10;havoc #t~post10; {5551#false} is VALID [2020-07-10 15:26:06,737 INFO L280 TraceCheckUtils]: 39: Hoare triple {5551#false} assume !!(~v~0 < 100000);call #t~mem11 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {5551#false} is VALID [2020-07-10 15:26:06,737 INFO L263 TraceCheckUtils]: 40: Hoare triple {5551#false} call #t~ret12 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem11); {5550#true} is VALID [2020-07-10 15:26:06,738 INFO L280 TraceCheckUtils]: 41: Hoare triple {5550#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {5550#true} is VALID [2020-07-10 15:26:06,738 INFO L280 TraceCheckUtils]: 42: Hoare triple {5550#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {5550#true} is VALID [2020-07-10 15:26:06,738 INFO L280 TraceCheckUtils]: 43: Hoare triple {5550#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {5550#true} is VALID [2020-07-10 15:26:06,738 INFO L280 TraceCheckUtils]: 44: Hoare triple {5550#true} assume true; {5550#true} is VALID [2020-07-10 15:26:06,738 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {5550#true} {5551#false} #182#return; {5551#false} is VALID [2020-07-10 15:26:06,739 INFO L280 TraceCheckUtils]: 46: Hoare triple {5551#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {5551#false} is VALID [2020-07-10 15:26:06,739 INFO L280 TraceCheckUtils]: 47: Hoare triple {5551#false} assume 0 != #t~ret12;havoc #t~ret12;havoc #t~mem11;call #t~mem13 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {5551#false} is VALID [2020-07-10 15:26:06,739 INFO L263 TraceCheckUtils]: 48: Hoare triple {5551#false} call #t~ret14 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem13); {5574#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:26:06,739 INFO L280 TraceCheckUtils]: 49: Hoare triple {5574#(= |#memory_int| |old(#memory_int)|)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4);#res := 1 + ~size; {5550#true} is VALID [2020-07-10 15:26:06,739 INFO L280 TraceCheckUtils]: 50: Hoare triple {5550#true} assume true; {5550#true} is VALID [2020-07-10 15:26:06,740 INFO L275 TraceCheckUtils]: 51: Hoare quadruple {5550#true} {5551#false} #184#return; {5551#false} is VALID [2020-07-10 15:26:06,740 INFO L280 TraceCheckUtils]: 52: Hoare triple {5551#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~n~0 := #t~ret14;havoc #t~mem13;havoc #t~ret14; {5551#false} is VALID [2020-07-10 15:26:06,740 INFO L280 TraceCheckUtils]: 53: Hoare triple {5551#false} ~x~0 := 0; {5551#false} is VALID [2020-07-10 15:26:06,740 INFO L280 TraceCheckUtils]: 54: Hoare triple {5551#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {5551#false} is VALID [2020-07-10 15:26:06,740 INFO L280 TraceCheckUtils]: 55: Hoare triple {5551#false} assume !!(~y~0 < ~n~0);call #t~mem17 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem18 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {5551#false} is VALID [2020-07-10 15:26:06,741 INFO L263 TraceCheckUtils]: 56: Hoare triple {5551#false} call __VERIFIER_assert((if #t~mem17 != #t~mem18 then 1 else 0)); {5551#false} is VALID [2020-07-10 15:26:06,741 INFO L280 TraceCheckUtils]: 57: Hoare triple {5551#false} ~cond := #in~cond; {5551#false} is VALID [2020-07-10 15:26:06,741 INFO L280 TraceCheckUtils]: 58: Hoare triple {5551#false} assume 0 == ~cond; {5551#false} is VALID [2020-07-10 15:26:06,741 INFO L280 TraceCheckUtils]: 59: Hoare triple {5551#false} assume !false; {5551#false} is VALID [2020-07-10 15:26:06,744 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2020-07-10 15:26:06,744 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326113105] [2020-07-10 15:26:06,745 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598960097] [2020-07-10 15:26:06,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:06,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:06,810 INFO L264 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-10 15:26:06,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:06,827 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:26:06,964 INFO L263 TraceCheckUtils]: 0: Hoare triple {5550#true} call ULTIMATE.init(); {5550#true} is VALID [2020-07-10 15:26:06,964 INFO L280 TraceCheckUtils]: 1: Hoare triple {5550#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {5550#true} is VALID [2020-07-10 15:26:06,964 INFO L280 TraceCheckUtils]: 2: Hoare triple {5550#true} assume true; {5550#true} is VALID [2020-07-10 15:26:06,964 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5550#true} {5550#true} #176#return; {5550#true} is VALID [2020-07-10 15:26:06,965 INFO L263 TraceCheckUtils]: 4: Hoare triple {5550#true} call #t~ret23 := main(); {5550#true} is VALID [2020-07-10 15:26:06,966 INFO L280 TraceCheckUtils]: 5: Hoare triple {5550#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.allocOnStack(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {5593#(<= main_~x~0 0)} is VALID [2020-07-10 15:26:06,967 INFO L280 TraceCheckUtils]: 6: Hoare triple {5593#(<= main_~x~0 0)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {5593#(<= main_~x~0 0)} is VALID [2020-07-10 15:26:06,967 INFO L280 TraceCheckUtils]: 7: Hoare triple {5593#(<= main_~x~0 0)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {5600#(<= main_~x~0 1)} is VALID [2020-07-10 15:26:06,968 INFO L280 TraceCheckUtils]: 8: Hoare triple {5600#(<= main_~x~0 1)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {5600#(<= main_~x~0 1)} is VALID [2020-07-10 15:26:06,969 INFO L280 TraceCheckUtils]: 9: Hoare triple {5600#(<= main_~x~0 1)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {5607#(<= main_~x~0 2)} is VALID [2020-07-10 15:26:06,970 INFO L280 TraceCheckUtils]: 10: Hoare triple {5607#(<= main_~x~0 2)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {5607#(<= main_~x~0 2)} is VALID [2020-07-10 15:26:06,971 INFO L280 TraceCheckUtils]: 11: Hoare triple {5607#(<= main_~x~0 2)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {5614#(<= main_~x~0 3)} is VALID [2020-07-10 15:26:06,972 INFO L280 TraceCheckUtils]: 12: Hoare triple {5614#(<= main_~x~0 3)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {5614#(<= main_~x~0 3)} is VALID [2020-07-10 15:26:06,973 INFO L280 TraceCheckUtils]: 13: Hoare triple {5614#(<= main_~x~0 3)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {5621#(<= main_~x~0 4)} is VALID [2020-07-10 15:26:06,973 INFO L280 TraceCheckUtils]: 14: Hoare triple {5621#(<= main_~x~0 4)} assume !(~x~0 < 100000); {5551#false} is VALID [2020-07-10 15:26:06,974 INFO L280 TraceCheckUtils]: 15: Hoare triple {5551#false} ~x~0 := 0; {5551#false} is VALID [2020-07-10 15:26:06,974 INFO L280 TraceCheckUtils]: 16: Hoare triple {5551#false} assume !(~x~0 < ~n~0); {5551#false} is VALID [2020-07-10 15:26:06,974 INFO L280 TraceCheckUtils]: 17: Hoare triple {5551#false} call ~#values~0.base, ~#values~0.offset := #Ultimate.allocOnStack(400000);havoc ~v~0;~v~0 := 0; {5551#false} is VALID [2020-07-10 15:26:06,974 INFO L280 TraceCheckUtils]: 18: Hoare triple {5551#false} assume !!(~v~0 < 100000);assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;call write~int(#t~nondet9, ~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4);havoc #t~nondet9; {5551#false} is VALID [2020-07-10 15:26:06,975 INFO L280 TraceCheckUtils]: 19: Hoare triple {5551#false} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {5551#false} is VALID [2020-07-10 15:26:06,975 INFO L280 TraceCheckUtils]: 20: Hoare triple {5551#false} assume !(~v~0 < 100000); {5551#false} is VALID [2020-07-10 15:26:06,975 INFO L280 TraceCheckUtils]: 21: Hoare triple {5551#false} ~v~0 := 0; {5551#false} is VALID [2020-07-10 15:26:06,975 INFO L280 TraceCheckUtils]: 22: Hoare triple {5551#false} assume !!(~v~0 < 100000);call #t~mem11 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {5551#false} is VALID [2020-07-10 15:26:06,975 INFO L263 TraceCheckUtils]: 23: Hoare triple {5551#false} call #t~ret12 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem11); {5551#false} is VALID [2020-07-10 15:26:06,975 INFO L280 TraceCheckUtils]: 24: Hoare triple {5551#false} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {5551#false} is VALID [2020-07-10 15:26:06,976 INFO L280 TraceCheckUtils]: 25: Hoare triple {5551#false} assume !(~i~0 < ~size); {5551#false} is VALID [2020-07-10 15:26:06,976 INFO L280 TraceCheckUtils]: 26: Hoare triple {5551#false} #res := 0; {5551#false} is VALID [2020-07-10 15:26:06,976 INFO L280 TraceCheckUtils]: 27: Hoare triple {5551#false} assume true; {5551#false} is VALID [2020-07-10 15:26:06,976 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {5551#false} {5551#false} #182#return; {5551#false} is VALID [2020-07-10 15:26:06,976 INFO L280 TraceCheckUtils]: 29: Hoare triple {5551#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {5551#false} is VALID [2020-07-10 15:26:06,977 INFO L280 TraceCheckUtils]: 30: Hoare triple {5551#false} assume 0 != #t~ret12;havoc #t~ret12;havoc #t~mem11;call #t~mem13 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {5551#false} is VALID [2020-07-10 15:26:06,977 INFO L263 TraceCheckUtils]: 31: Hoare triple {5551#false} call #t~ret14 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem13); {5551#false} is VALID [2020-07-10 15:26:06,977 INFO L280 TraceCheckUtils]: 32: Hoare triple {5551#false} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4);#res := 1 + ~size; {5551#false} is VALID [2020-07-10 15:26:06,977 INFO L280 TraceCheckUtils]: 33: Hoare triple {5551#false} assume true; {5551#false} is VALID [2020-07-10 15:26:06,977 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {5551#false} {5551#false} #184#return; {5551#false} is VALID [2020-07-10 15:26:06,977 INFO L280 TraceCheckUtils]: 35: Hoare triple {5551#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~n~0 := #t~ret14;havoc #t~mem13;havoc #t~ret14; {5551#false} is VALID [2020-07-10 15:26:06,978 INFO L280 TraceCheckUtils]: 36: Hoare triple {5551#false} ~x~0 := 0; {5551#false} is VALID [2020-07-10 15:26:06,978 INFO L280 TraceCheckUtils]: 37: Hoare triple {5551#false} assume !(~x~0 < ~n~0); {5551#false} is VALID [2020-07-10 15:26:06,978 INFO L280 TraceCheckUtils]: 38: Hoare triple {5551#false} #t~post10 := ~v~0;~v~0 := 1 + #t~post10;havoc #t~post10; {5551#false} is VALID [2020-07-10 15:26:06,978 INFO L280 TraceCheckUtils]: 39: Hoare triple {5551#false} assume !!(~v~0 < 100000);call #t~mem11 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {5551#false} is VALID [2020-07-10 15:26:06,978 INFO L263 TraceCheckUtils]: 40: Hoare triple {5551#false} call #t~ret12 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem11); {5551#false} is VALID [2020-07-10 15:26:06,979 INFO L280 TraceCheckUtils]: 41: Hoare triple {5551#false} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {5551#false} is VALID [2020-07-10 15:26:06,979 INFO L280 TraceCheckUtils]: 42: Hoare triple {5551#false} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {5551#false} is VALID [2020-07-10 15:26:06,979 INFO L280 TraceCheckUtils]: 43: Hoare triple {5551#false} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {5551#false} is VALID [2020-07-10 15:26:06,979 INFO L280 TraceCheckUtils]: 44: Hoare triple {5551#false} assume true; {5551#false} is VALID [2020-07-10 15:26:06,979 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {5551#false} {5551#false} #182#return; {5551#false} is VALID [2020-07-10 15:26:06,980 INFO L280 TraceCheckUtils]: 46: Hoare triple {5551#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {5551#false} is VALID [2020-07-10 15:26:06,980 INFO L280 TraceCheckUtils]: 47: Hoare triple {5551#false} assume 0 != #t~ret12;havoc #t~ret12;havoc #t~mem11;call #t~mem13 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {5551#false} is VALID [2020-07-10 15:26:06,980 INFO L263 TraceCheckUtils]: 48: Hoare triple {5551#false} call #t~ret14 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem13); {5551#false} is VALID [2020-07-10 15:26:06,980 INFO L280 TraceCheckUtils]: 49: Hoare triple {5551#false} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4);#res := 1 + ~size; {5551#false} is VALID [2020-07-10 15:26:06,980 INFO L280 TraceCheckUtils]: 50: Hoare triple {5551#false} assume true; {5551#false} is VALID [2020-07-10 15:26:06,981 INFO L275 TraceCheckUtils]: 51: Hoare quadruple {5551#false} {5551#false} #184#return; {5551#false} is VALID [2020-07-10 15:26:06,981 INFO L280 TraceCheckUtils]: 52: Hoare triple {5551#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~n~0 := #t~ret14;havoc #t~mem13;havoc #t~ret14; {5551#false} is VALID [2020-07-10 15:26:06,981 INFO L280 TraceCheckUtils]: 53: Hoare triple {5551#false} ~x~0 := 0; {5551#false} is VALID [2020-07-10 15:26:06,981 INFO L280 TraceCheckUtils]: 54: Hoare triple {5551#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {5551#false} is VALID [2020-07-10 15:26:06,981 INFO L280 TraceCheckUtils]: 55: Hoare triple {5551#false} assume !!(~y~0 < ~n~0);call #t~mem17 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem18 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {5551#false} is VALID [2020-07-10 15:26:06,981 INFO L263 TraceCheckUtils]: 56: Hoare triple {5551#false} call __VERIFIER_assert((if #t~mem17 != #t~mem18 then 1 else 0)); {5551#false} is VALID [2020-07-10 15:26:06,982 INFO L280 TraceCheckUtils]: 57: Hoare triple {5551#false} ~cond := #in~cond; {5551#false} is VALID [2020-07-10 15:26:06,982 INFO L280 TraceCheckUtils]: 58: Hoare triple {5551#false} assume 0 == ~cond; {5551#false} is VALID [2020-07-10 15:26:06,982 INFO L280 TraceCheckUtils]: 59: Hoare triple {5551#false} assume !false; {5551#false} is VALID [2020-07-10 15:26:06,987 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-07-10 15:26:06,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:26:06,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2020-07-10 15:26:06,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341642889] [2020-07-10 15:26:06,988 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2020-07-10 15:26:06,990 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:06,991 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-10 15:26:07,085 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:07,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-10 15:26:07,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:07,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-10 15:26:07,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-07-10 15:26:07,087 INFO L87 Difference]: Start difference. First operand 90 states and 112 transitions. Second operand 11 states. [2020-07-10 15:26:09,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:09,984 INFO L93 Difference]: Finished difference Result 528 states and 725 transitions. [2020-07-10 15:26:09,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-07-10 15:26:09,984 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2020-07-10 15:26:09,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:09,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 15:26:09,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 439 transitions. [2020-07-10 15:26:09,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 15:26:09,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 439 transitions. [2020-07-10 15:26:09,998 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 439 transitions. [2020-07-10 15:26:10,607 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 439 edges. 439 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:10,624 INFO L225 Difference]: With dead ends: 528 [2020-07-10 15:26:10,624 INFO L226 Difference]: Without dead ends: 453 [2020-07-10 15:26:10,625 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=364, Unknown=0, NotChecked=0, Total=506 [2020-07-10 15:26:10,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2020-07-10 15:26:10,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 94. [2020-07-10 15:26:10,743 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:10,743 INFO L82 GeneralOperation]: Start isEquivalent. First operand 453 states. Second operand 94 states. [2020-07-10 15:26:10,743 INFO L74 IsIncluded]: Start isIncluded. First operand 453 states. Second operand 94 states. [2020-07-10 15:26:10,743 INFO L87 Difference]: Start difference. First operand 453 states. Second operand 94 states. [2020-07-10 15:26:10,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:10,768 INFO L93 Difference]: Finished difference Result 453 states and 627 transitions. [2020-07-10 15:26:10,768 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 627 transitions. [2020-07-10 15:26:10,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:10,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:10,771 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 453 states. [2020-07-10 15:26:10,772 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 453 states. [2020-07-10 15:26:10,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:10,793 INFO L93 Difference]: Finished difference Result 453 states and 627 transitions. [2020-07-10 15:26:10,794 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 627 transitions. [2020-07-10 15:26:10,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:10,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:10,797 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:10,797 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:10,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-07-10 15:26:10,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 116 transitions. [2020-07-10 15:26:10,800 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 116 transitions. Word has length 60 [2020-07-10 15:26:10,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:10,801 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 116 transitions. [2020-07-10 15:26:10,801 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-10 15:26:10,801 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2020-07-10 15:26:10,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-07-10 15:26:10,802 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:10,802 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2020-07-10 15:26:11,016 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2020-07-10 15:26:11,017 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:11,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:11,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1850595157, now seen corresponding path program 2 times [2020-07-10 15:26:11,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:11,018 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555632485] [2020-07-10 15:26:11,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:11,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:11,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:11,182 INFO L280 TraceCheckUtils]: 0: Hoare triple {7588#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {7561#true} is VALID [2020-07-10 15:26:11,183 INFO L280 TraceCheckUtils]: 1: Hoare triple {7561#true} assume true; {7561#true} is VALID [2020-07-10 15:26:11,183 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {7561#true} {7561#true} #176#return; {7561#true} is VALID [2020-07-10 15:26:11,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:11,189 INFO L280 TraceCheckUtils]: 0: Hoare triple {7561#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {7561#true} is VALID [2020-07-10 15:26:11,189 INFO L280 TraceCheckUtils]: 1: Hoare triple {7561#true} assume !(~i~0 < ~size); {7561#true} is VALID [2020-07-10 15:26:11,189 INFO L280 TraceCheckUtils]: 2: Hoare triple {7561#true} #res := 0; {7561#true} is VALID [2020-07-10 15:26:11,189 INFO L280 TraceCheckUtils]: 3: Hoare triple {7561#true} assume true; {7561#true} is VALID [2020-07-10 15:26:11,190 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {7561#true} {7562#false} #182#return; {7562#false} is VALID [2020-07-10 15:26:11,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:11,214 INFO L280 TraceCheckUtils]: 0: Hoare triple {7589#(= |#memory_int| |old(#memory_int)|)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4);#res := 1 + ~size; {7561#true} is VALID [2020-07-10 15:26:11,214 INFO L280 TraceCheckUtils]: 1: Hoare triple {7561#true} assume true; {7561#true} is VALID [2020-07-10 15:26:11,214 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {7561#true} {7562#false} #184#return; {7562#false} is VALID [2020-07-10 15:26:11,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:11,221 INFO L280 TraceCheckUtils]: 0: Hoare triple {7561#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {7561#true} is VALID [2020-07-10 15:26:11,221 INFO L280 TraceCheckUtils]: 1: Hoare triple {7561#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {7561#true} is VALID [2020-07-10 15:26:11,221 INFO L280 TraceCheckUtils]: 2: Hoare triple {7561#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {7561#true} is VALID [2020-07-10 15:26:11,221 INFO L280 TraceCheckUtils]: 3: Hoare triple {7561#true} assume true; {7561#true} is VALID [2020-07-10 15:26:11,222 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {7561#true} {7562#false} #182#return; {7562#false} is VALID [2020-07-10 15:26:11,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:11,228 INFO L280 TraceCheckUtils]: 0: Hoare triple {7589#(= |#memory_int| |old(#memory_int)|)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4);#res := 1 + ~size; {7561#true} is VALID [2020-07-10 15:26:11,228 INFO L280 TraceCheckUtils]: 1: Hoare triple {7561#true} assume true; {7561#true} is VALID [2020-07-10 15:26:11,229 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {7561#true} {7562#false} #184#return; {7562#false} is VALID [2020-07-10 15:26:11,230 INFO L263 TraceCheckUtils]: 0: Hoare triple {7561#true} call ULTIMATE.init(); {7588#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:26:11,230 INFO L280 TraceCheckUtils]: 1: Hoare triple {7588#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {7561#true} is VALID [2020-07-10 15:26:11,230 INFO L280 TraceCheckUtils]: 2: Hoare triple {7561#true} assume true; {7561#true} is VALID [2020-07-10 15:26:11,230 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7561#true} {7561#true} #176#return; {7561#true} is VALID [2020-07-10 15:26:11,230 INFO L263 TraceCheckUtils]: 4: Hoare triple {7561#true} call #t~ret23 := main(); {7561#true} is VALID [2020-07-10 15:26:11,231 INFO L280 TraceCheckUtils]: 5: Hoare triple {7561#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.allocOnStack(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {7566#(= 0 main_~x~0)} is VALID [2020-07-10 15:26:11,232 INFO L280 TraceCheckUtils]: 6: Hoare triple {7566#(= 0 main_~x~0)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {7566#(= 0 main_~x~0)} is VALID [2020-07-10 15:26:11,233 INFO L280 TraceCheckUtils]: 7: Hoare triple {7566#(= 0 main_~x~0)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {7567#(<= main_~x~0 1)} is VALID [2020-07-10 15:26:11,233 INFO L280 TraceCheckUtils]: 8: Hoare triple {7567#(<= main_~x~0 1)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {7567#(<= main_~x~0 1)} is VALID [2020-07-10 15:26:11,234 INFO L280 TraceCheckUtils]: 9: Hoare triple {7567#(<= main_~x~0 1)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {7568#(<= main_~x~0 2)} is VALID [2020-07-10 15:26:11,235 INFO L280 TraceCheckUtils]: 10: Hoare triple {7568#(<= main_~x~0 2)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {7568#(<= main_~x~0 2)} is VALID [2020-07-10 15:26:11,235 INFO L280 TraceCheckUtils]: 11: Hoare triple {7568#(<= main_~x~0 2)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {7569#(<= main_~x~0 3)} is VALID [2020-07-10 15:26:11,236 INFO L280 TraceCheckUtils]: 12: Hoare triple {7569#(<= main_~x~0 3)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {7569#(<= main_~x~0 3)} is VALID [2020-07-10 15:26:11,236 INFO L280 TraceCheckUtils]: 13: Hoare triple {7569#(<= main_~x~0 3)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {7570#(<= main_~x~0 4)} is VALID [2020-07-10 15:26:11,237 INFO L280 TraceCheckUtils]: 14: Hoare triple {7570#(<= main_~x~0 4)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {7570#(<= main_~x~0 4)} is VALID [2020-07-10 15:26:11,238 INFO L280 TraceCheckUtils]: 15: Hoare triple {7570#(<= main_~x~0 4)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {7571#(<= main_~x~0 5)} is VALID [2020-07-10 15:26:11,239 INFO L280 TraceCheckUtils]: 16: Hoare triple {7571#(<= main_~x~0 5)} assume !(~x~0 < 100000); {7562#false} is VALID [2020-07-10 15:26:11,239 INFO L280 TraceCheckUtils]: 17: Hoare triple {7562#false} ~x~0 := 0; {7562#false} is VALID [2020-07-10 15:26:11,239 INFO L280 TraceCheckUtils]: 18: Hoare triple {7562#false} assume !(~x~0 < ~n~0); {7562#false} is VALID [2020-07-10 15:26:11,239 INFO L280 TraceCheckUtils]: 19: Hoare triple {7562#false} call ~#values~0.base, ~#values~0.offset := #Ultimate.allocOnStack(400000);havoc ~v~0;~v~0 := 0; {7562#false} is VALID [2020-07-10 15:26:11,239 INFO L280 TraceCheckUtils]: 20: Hoare triple {7562#false} assume !!(~v~0 < 100000);assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;call write~int(#t~nondet9, ~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4);havoc #t~nondet9; {7562#false} is VALID [2020-07-10 15:26:11,239 INFO L280 TraceCheckUtils]: 21: Hoare triple {7562#false} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {7562#false} is VALID [2020-07-10 15:26:11,240 INFO L280 TraceCheckUtils]: 22: Hoare triple {7562#false} assume !!(~v~0 < 100000);assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;call write~int(#t~nondet9, ~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4);havoc #t~nondet9; {7562#false} is VALID [2020-07-10 15:26:11,240 INFO L280 TraceCheckUtils]: 23: Hoare triple {7562#false} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {7562#false} is VALID [2020-07-10 15:26:11,240 INFO L280 TraceCheckUtils]: 24: Hoare triple {7562#false} assume !(~v~0 < 100000); {7562#false} is VALID [2020-07-10 15:26:11,240 INFO L280 TraceCheckUtils]: 25: Hoare triple {7562#false} ~v~0 := 0; {7562#false} is VALID [2020-07-10 15:26:11,240 INFO L280 TraceCheckUtils]: 26: Hoare triple {7562#false} assume !!(~v~0 < 100000);call #t~mem11 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {7562#false} is VALID [2020-07-10 15:26:11,241 INFO L263 TraceCheckUtils]: 27: Hoare triple {7562#false} call #t~ret12 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem11); {7561#true} is VALID [2020-07-10 15:26:11,241 INFO L280 TraceCheckUtils]: 28: Hoare triple {7561#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {7561#true} is VALID [2020-07-10 15:26:11,241 INFO L280 TraceCheckUtils]: 29: Hoare triple {7561#true} assume !(~i~0 < ~size); {7561#true} is VALID [2020-07-10 15:26:11,241 INFO L280 TraceCheckUtils]: 30: Hoare triple {7561#true} #res := 0; {7561#true} is VALID [2020-07-10 15:26:11,241 INFO L280 TraceCheckUtils]: 31: Hoare triple {7561#true} assume true; {7561#true} is VALID [2020-07-10 15:26:11,241 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {7561#true} {7562#false} #182#return; {7562#false} is VALID [2020-07-10 15:26:11,242 INFO L280 TraceCheckUtils]: 33: Hoare triple {7562#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {7562#false} is VALID [2020-07-10 15:26:11,242 INFO L280 TraceCheckUtils]: 34: Hoare triple {7562#false} assume 0 != #t~ret12;havoc #t~ret12;havoc #t~mem11;call #t~mem13 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {7562#false} is VALID [2020-07-10 15:26:11,242 INFO L263 TraceCheckUtils]: 35: Hoare triple {7562#false} call #t~ret14 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem13); {7589#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:26:11,242 INFO L280 TraceCheckUtils]: 36: Hoare triple {7589#(= |#memory_int| |old(#memory_int)|)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4);#res := 1 + ~size; {7561#true} is VALID [2020-07-10 15:26:11,242 INFO L280 TraceCheckUtils]: 37: Hoare triple {7561#true} assume true; {7561#true} is VALID [2020-07-10 15:26:11,243 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {7561#true} {7562#false} #184#return; {7562#false} is VALID [2020-07-10 15:26:11,243 INFO L280 TraceCheckUtils]: 39: Hoare triple {7562#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~n~0 := #t~ret14;havoc #t~mem13;havoc #t~ret14; {7562#false} is VALID [2020-07-10 15:26:11,243 INFO L280 TraceCheckUtils]: 40: Hoare triple {7562#false} ~x~0 := 0; {7562#false} is VALID [2020-07-10 15:26:11,243 INFO L280 TraceCheckUtils]: 41: Hoare triple {7562#false} assume !(~x~0 < ~n~0); {7562#false} is VALID [2020-07-10 15:26:11,243 INFO L280 TraceCheckUtils]: 42: Hoare triple {7562#false} #t~post10 := ~v~0;~v~0 := 1 + #t~post10;havoc #t~post10; {7562#false} is VALID [2020-07-10 15:26:11,244 INFO L280 TraceCheckUtils]: 43: Hoare triple {7562#false} assume !!(~v~0 < 100000);call #t~mem11 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {7562#false} is VALID [2020-07-10 15:26:11,244 INFO L263 TraceCheckUtils]: 44: Hoare triple {7562#false} call #t~ret12 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem11); {7561#true} is VALID [2020-07-10 15:26:11,244 INFO L280 TraceCheckUtils]: 45: Hoare triple {7561#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {7561#true} is VALID [2020-07-10 15:26:11,244 INFO L280 TraceCheckUtils]: 46: Hoare triple {7561#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {7561#true} is VALID [2020-07-10 15:26:11,244 INFO L280 TraceCheckUtils]: 47: Hoare triple {7561#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {7561#true} is VALID [2020-07-10 15:26:11,244 INFO L280 TraceCheckUtils]: 48: Hoare triple {7561#true} assume true; {7561#true} is VALID [2020-07-10 15:26:11,245 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {7561#true} {7562#false} #182#return; {7562#false} is VALID [2020-07-10 15:26:11,245 INFO L280 TraceCheckUtils]: 50: Hoare triple {7562#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {7562#false} is VALID [2020-07-10 15:26:11,245 INFO L280 TraceCheckUtils]: 51: Hoare triple {7562#false} assume 0 != #t~ret12;havoc #t~ret12;havoc #t~mem11;call #t~mem13 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {7562#false} is VALID [2020-07-10 15:26:11,245 INFO L263 TraceCheckUtils]: 52: Hoare triple {7562#false} call #t~ret14 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem13); {7589#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:26:11,245 INFO L280 TraceCheckUtils]: 53: Hoare triple {7589#(= |#memory_int| |old(#memory_int)|)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4);#res := 1 + ~size; {7561#true} is VALID [2020-07-10 15:26:11,246 INFO L280 TraceCheckUtils]: 54: Hoare triple {7561#true} assume true; {7561#true} is VALID [2020-07-10 15:26:11,246 INFO L275 TraceCheckUtils]: 55: Hoare quadruple {7561#true} {7562#false} #184#return; {7562#false} is VALID [2020-07-10 15:26:11,246 INFO L280 TraceCheckUtils]: 56: Hoare triple {7562#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~n~0 := #t~ret14;havoc #t~mem13;havoc #t~ret14; {7562#false} is VALID [2020-07-10 15:26:11,246 INFO L280 TraceCheckUtils]: 57: Hoare triple {7562#false} ~x~0 := 0; {7562#false} is VALID [2020-07-10 15:26:11,246 INFO L280 TraceCheckUtils]: 58: Hoare triple {7562#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {7562#false} is VALID [2020-07-10 15:26:11,247 INFO L280 TraceCheckUtils]: 59: Hoare triple {7562#false} assume !!(~y~0 < ~n~0);call #t~mem17 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem18 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {7562#false} is VALID [2020-07-10 15:26:11,247 INFO L263 TraceCheckUtils]: 60: Hoare triple {7562#false} call __VERIFIER_assert((if #t~mem17 != #t~mem18 then 1 else 0)); {7562#false} is VALID [2020-07-10 15:26:11,247 INFO L280 TraceCheckUtils]: 61: Hoare triple {7562#false} ~cond := #in~cond; {7562#false} is VALID [2020-07-10 15:26:11,247 INFO L280 TraceCheckUtils]: 62: Hoare triple {7562#false} assume 0 == ~cond; {7562#false} is VALID [2020-07-10 15:26:11,247 INFO L280 TraceCheckUtils]: 63: Hoare triple {7562#false} assume !false; {7562#false} is VALID [2020-07-10 15:26:11,250 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-07-10 15:26:11,251 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555632485] [2020-07-10 15:26:11,251 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978367437] [2020-07-10 15:26:11,251 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:11,335 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 15:26:11,335 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:26:11,337 INFO L264 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-10 15:26:11,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:11,358 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:26:11,487 INFO L263 TraceCheckUtils]: 0: Hoare triple {7561#true} call ULTIMATE.init(); {7561#true} is VALID [2020-07-10 15:26:11,488 INFO L280 TraceCheckUtils]: 1: Hoare triple {7561#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {7561#true} is VALID [2020-07-10 15:26:11,488 INFO L280 TraceCheckUtils]: 2: Hoare triple {7561#true} assume true; {7561#true} is VALID [2020-07-10 15:26:11,488 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7561#true} {7561#true} #176#return; {7561#true} is VALID [2020-07-10 15:26:11,488 INFO L263 TraceCheckUtils]: 4: Hoare triple {7561#true} call #t~ret23 := main(); {7561#true} is VALID [2020-07-10 15:26:11,490 INFO L280 TraceCheckUtils]: 5: Hoare triple {7561#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.allocOnStack(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {7608#(<= main_~x~0 0)} is VALID [2020-07-10 15:26:11,491 INFO L280 TraceCheckUtils]: 6: Hoare triple {7608#(<= main_~x~0 0)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {7608#(<= main_~x~0 0)} is VALID [2020-07-10 15:26:11,492 INFO L280 TraceCheckUtils]: 7: Hoare triple {7608#(<= main_~x~0 0)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {7567#(<= main_~x~0 1)} is VALID [2020-07-10 15:26:11,493 INFO L280 TraceCheckUtils]: 8: Hoare triple {7567#(<= main_~x~0 1)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {7567#(<= main_~x~0 1)} is VALID [2020-07-10 15:26:11,494 INFO L280 TraceCheckUtils]: 9: Hoare triple {7567#(<= main_~x~0 1)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {7568#(<= main_~x~0 2)} is VALID [2020-07-10 15:26:11,494 INFO L280 TraceCheckUtils]: 10: Hoare triple {7568#(<= main_~x~0 2)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {7568#(<= main_~x~0 2)} is VALID [2020-07-10 15:26:11,495 INFO L280 TraceCheckUtils]: 11: Hoare triple {7568#(<= main_~x~0 2)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {7569#(<= main_~x~0 3)} is VALID [2020-07-10 15:26:11,496 INFO L280 TraceCheckUtils]: 12: Hoare triple {7569#(<= main_~x~0 3)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {7569#(<= main_~x~0 3)} is VALID [2020-07-10 15:26:11,497 INFO L280 TraceCheckUtils]: 13: Hoare triple {7569#(<= main_~x~0 3)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {7570#(<= main_~x~0 4)} is VALID [2020-07-10 15:26:11,498 INFO L280 TraceCheckUtils]: 14: Hoare triple {7570#(<= main_~x~0 4)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {7570#(<= main_~x~0 4)} is VALID [2020-07-10 15:26:11,498 INFO L280 TraceCheckUtils]: 15: Hoare triple {7570#(<= main_~x~0 4)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {7571#(<= main_~x~0 5)} is VALID [2020-07-10 15:26:11,499 INFO L280 TraceCheckUtils]: 16: Hoare triple {7571#(<= main_~x~0 5)} assume !(~x~0 < 100000); {7562#false} is VALID [2020-07-10 15:26:11,499 INFO L280 TraceCheckUtils]: 17: Hoare triple {7562#false} ~x~0 := 0; {7562#false} is VALID [2020-07-10 15:26:11,500 INFO L280 TraceCheckUtils]: 18: Hoare triple {7562#false} assume !(~x~0 < ~n~0); {7562#false} is VALID [2020-07-10 15:26:11,500 INFO L280 TraceCheckUtils]: 19: Hoare triple {7562#false} call ~#values~0.base, ~#values~0.offset := #Ultimate.allocOnStack(400000);havoc ~v~0;~v~0 := 0; {7562#false} is VALID [2020-07-10 15:26:11,500 INFO L280 TraceCheckUtils]: 20: Hoare triple {7562#false} assume !!(~v~0 < 100000);assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;call write~int(#t~nondet9, ~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4);havoc #t~nondet9; {7562#false} is VALID [2020-07-10 15:26:11,500 INFO L280 TraceCheckUtils]: 21: Hoare triple {7562#false} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {7562#false} is VALID [2020-07-10 15:26:11,500 INFO L280 TraceCheckUtils]: 22: Hoare triple {7562#false} assume !!(~v~0 < 100000);assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;call write~int(#t~nondet9, ~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4);havoc #t~nondet9; {7562#false} is VALID [2020-07-10 15:26:11,500 INFO L280 TraceCheckUtils]: 23: Hoare triple {7562#false} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {7562#false} is VALID [2020-07-10 15:26:11,501 INFO L280 TraceCheckUtils]: 24: Hoare triple {7562#false} assume !(~v~0 < 100000); {7562#false} is VALID [2020-07-10 15:26:11,501 INFO L280 TraceCheckUtils]: 25: Hoare triple {7562#false} ~v~0 := 0; {7562#false} is VALID [2020-07-10 15:26:11,501 INFO L280 TraceCheckUtils]: 26: Hoare triple {7562#false} assume !!(~v~0 < 100000);call #t~mem11 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {7562#false} is VALID [2020-07-10 15:26:11,501 INFO L263 TraceCheckUtils]: 27: Hoare triple {7562#false} call #t~ret12 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem11); {7562#false} is VALID [2020-07-10 15:26:11,501 INFO L280 TraceCheckUtils]: 28: Hoare triple {7562#false} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {7562#false} is VALID [2020-07-10 15:26:11,502 INFO L280 TraceCheckUtils]: 29: Hoare triple {7562#false} assume !(~i~0 < ~size); {7562#false} is VALID [2020-07-10 15:26:11,502 INFO L280 TraceCheckUtils]: 30: Hoare triple {7562#false} #res := 0; {7562#false} is VALID [2020-07-10 15:26:11,502 INFO L280 TraceCheckUtils]: 31: Hoare triple {7562#false} assume true; {7562#false} is VALID [2020-07-10 15:26:11,502 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {7562#false} {7562#false} #182#return; {7562#false} is VALID [2020-07-10 15:26:11,502 INFO L280 TraceCheckUtils]: 33: Hoare triple {7562#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {7562#false} is VALID [2020-07-10 15:26:11,502 INFO L280 TraceCheckUtils]: 34: Hoare triple {7562#false} assume 0 != #t~ret12;havoc #t~ret12;havoc #t~mem11;call #t~mem13 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {7562#false} is VALID [2020-07-10 15:26:11,503 INFO L263 TraceCheckUtils]: 35: Hoare triple {7562#false} call #t~ret14 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem13); {7562#false} is VALID [2020-07-10 15:26:11,503 INFO L280 TraceCheckUtils]: 36: Hoare triple {7562#false} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4);#res := 1 + ~size; {7562#false} is VALID [2020-07-10 15:26:11,503 INFO L280 TraceCheckUtils]: 37: Hoare triple {7562#false} assume true; {7562#false} is VALID [2020-07-10 15:26:11,503 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {7562#false} {7562#false} #184#return; {7562#false} is VALID [2020-07-10 15:26:11,503 INFO L280 TraceCheckUtils]: 39: Hoare triple {7562#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~n~0 := #t~ret14;havoc #t~mem13;havoc #t~ret14; {7562#false} is VALID [2020-07-10 15:26:11,504 INFO L280 TraceCheckUtils]: 40: Hoare triple {7562#false} ~x~0 := 0; {7562#false} is VALID [2020-07-10 15:26:11,504 INFO L280 TraceCheckUtils]: 41: Hoare triple {7562#false} assume !(~x~0 < ~n~0); {7562#false} is VALID [2020-07-10 15:26:11,504 INFO L280 TraceCheckUtils]: 42: Hoare triple {7562#false} #t~post10 := ~v~0;~v~0 := 1 + #t~post10;havoc #t~post10; {7562#false} is VALID [2020-07-10 15:26:11,504 INFO L280 TraceCheckUtils]: 43: Hoare triple {7562#false} assume !!(~v~0 < 100000);call #t~mem11 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {7562#false} is VALID [2020-07-10 15:26:11,504 INFO L263 TraceCheckUtils]: 44: Hoare triple {7562#false} call #t~ret12 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem11); {7562#false} is VALID [2020-07-10 15:26:11,504 INFO L280 TraceCheckUtils]: 45: Hoare triple {7562#false} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {7562#false} is VALID [2020-07-10 15:26:11,505 INFO L280 TraceCheckUtils]: 46: Hoare triple {7562#false} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {7562#false} is VALID [2020-07-10 15:26:11,505 INFO L280 TraceCheckUtils]: 47: Hoare triple {7562#false} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {7562#false} is VALID [2020-07-10 15:26:11,505 INFO L280 TraceCheckUtils]: 48: Hoare triple {7562#false} assume true; {7562#false} is VALID [2020-07-10 15:26:11,505 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {7562#false} {7562#false} #182#return; {7562#false} is VALID [2020-07-10 15:26:11,505 INFO L280 TraceCheckUtils]: 50: Hoare triple {7562#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {7562#false} is VALID [2020-07-10 15:26:11,506 INFO L280 TraceCheckUtils]: 51: Hoare triple {7562#false} assume 0 != #t~ret12;havoc #t~ret12;havoc #t~mem11;call #t~mem13 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {7562#false} is VALID [2020-07-10 15:26:11,506 INFO L263 TraceCheckUtils]: 52: Hoare triple {7562#false} call #t~ret14 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem13); {7562#false} is VALID [2020-07-10 15:26:11,506 INFO L280 TraceCheckUtils]: 53: Hoare triple {7562#false} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4);#res := 1 + ~size; {7562#false} is VALID [2020-07-10 15:26:11,506 INFO L280 TraceCheckUtils]: 54: Hoare triple {7562#false} assume true; {7562#false} is VALID [2020-07-10 15:26:11,506 INFO L275 TraceCheckUtils]: 55: Hoare quadruple {7562#false} {7562#false} #184#return; {7562#false} is VALID [2020-07-10 15:26:11,506 INFO L280 TraceCheckUtils]: 56: Hoare triple {7562#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~n~0 := #t~ret14;havoc #t~mem13;havoc #t~ret14; {7562#false} is VALID [2020-07-10 15:26:11,507 INFO L280 TraceCheckUtils]: 57: Hoare triple {7562#false} ~x~0 := 0; {7562#false} is VALID [2020-07-10 15:26:11,507 INFO L280 TraceCheckUtils]: 58: Hoare triple {7562#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {7562#false} is VALID [2020-07-10 15:26:11,507 INFO L280 TraceCheckUtils]: 59: Hoare triple {7562#false} assume !!(~y~0 < ~n~0);call #t~mem17 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem18 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {7562#false} is VALID [2020-07-10 15:26:11,507 INFO L263 TraceCheckUtils]: 60: Hoare triple {7562#false} call __VERIFIER_assert((if #t~mem17 != #t~mem18 then 1 else 0)); {7562#false} is VALID [2020-07-10 15:26:11,507 INFO L280 TraceCheckUtils]: 61: Hoare triple {7562#false} ~cond := #in~cond; {7562#false} is VALID [2020-07-10 15:26:11,507 INFO L280 TraceCheckUtils]: 62: Hoare triple {7562#false} assume 0 == ~cond; {7562#false} is VALID [2020-07-10 15:26:11,508 INFO L280 TraceCheckUtils]: 63: Hoare triple {7562#false} assume !false; {7562#false} is VALID [2020-07-10 15:26:11,511 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-07-10 15:26:11,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:26:11,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 11 [2020-07-10 15:26:11,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368560591] [2020-07-10 15:26:11,514 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2020-07-10 15:26:11,516 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:11,516 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-10 15:26:11,591 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:11,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-10 15:26:11,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:11,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-10 15:26:11,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-07-10 15:26:11,592 INFO L87 Difference]: Start difference. First operand 94 states and 116 transitions. Second operand 11 states. [2020-07-10 15:26:13,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:13,377 INFO L93 Difference]: Finished difference Result 384 states and 524 transitions. [2020-07-10 15:26:13,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-10 15:26:13,378 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2020-07-10 15:26:13,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:13,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 15:26:13,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 306 transitions. [2020-07-10 15:26:13,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 15:26:13,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 306 transitions. [2020-07-10 15:26:13,387 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 306 transitions. [2020-07-10 15:26:13,779 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 306 edges. 306 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:13,792 INFO L225 Difference]: With dead ends: 384 [2020-07-10 15:26:13,792 INFO L226 Difference]: Without dead ends: 307 [2020-07-10 15:26:13,802 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-07-10 15:26:13,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2020-07-10 15:26:13,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 96. [2020-07-10 15:26:13,934 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:13,934 INFO L82 GeneralOperation]: Start isEquivalent. First operand 307 states. Second operand 96 states. [2020-07-10 15:26:13,934 INFO L74 IsIncluded]: Start isIncluded. First operand 307 states. Second operand 96 states. [2020-07-10 15:26:13,935 INFO L87 Difference]: Start difference. First operand 307 states. Second operand 96 states. [2020-07-10 15:26:13,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:13,949 INFO L93 Difference]: Finished difference Result 307 states and 425 transitions. [2020-07-10 15:26:13,949 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 425 transitions. [2020-07-10 15:26:13,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:13,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:13,951 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 307 states. [2020-07-10 15:26:13,952 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 307 states. [2020-07-10 15:26:13,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:13,967 INFO L93 Difference]: Finished difference Result 307 states and 425 transitions. [2020-07-10 15:26:13,967 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 425 transitions. [2020-07-10 15:26:13,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:13,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:13,969 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:13,969 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:13,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-07-10 15:26:13,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 118 transitions. [2020-07-10 15:26:13,973 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 118 transitions. Word has length 64 [2020-07-10 15:26:13,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:13,973 INFO L479 AbstractCegarLoop]: Abstraction has 96 states and 118 transitions. [2020-07-10 15:26:13,973 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-10 15:26:13,973 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2020-07-10 15:26:13,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-10 15:26:13,974 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:13,974 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2020-07-10 15:26:14,187 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:14,189 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:14,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:14,190 INFO L82 PathProgramCache]: Analyzing trace with hash 728782455, now seen corresponding path program 3 times [2020-07-10 15:26:14,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:14,191 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6295021] [2020-07-10 15:26:14,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:14,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:14,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:14,373 INFO L280 TraceCheckUtils]: 0: Hoare triple {9102#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {9074#true} is VALID [2020-07-10 15:26:14,373 INFO L280 TraceCheckUtils]: 1: Hoare triple {9074#true} assume true; {9074#true} is VALID [2020-07-10 15:26:14,374 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {9074#true} {9074#true} #176#return; {9074#true} is VALID [2020-07-10 15:26:14,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:14,379 INFO L280 TraceCheckUtils]: 0: Hoare triple {9074#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {9074#true} is VALID [2020-07-10 15:26:14,379 INFO L280 TraceCheckUtils]: 1: Hoare triple {9074#true} assume !(~i~0 < ~size); {9074#true} is VALID [2020-07-10 15:26:14,379 INFO L280 TraceCheckUtils]: 2: Hoare triple {9074#true} #res := 0; {9074#true} is VALID [2020-07-10 15:26:14,380 INFO L280 TraceCheckUtils]: 3: Hoare triple {9074#true} assume true; {9074#true} is VALID [2020-07-10 15:26:14,380 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {9074#true} {9075#false} #182#return; {9075#false} is VALID [2020-07-10 15:26:14,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:14,396 INFO L280 TraceCheckUtils]: 0: Hoare triple {9103#(= |#memory_int| |old(#memory_int)|)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4);#res := 1 + ~size; {9074#true} is VALID [2020-07-10 15:26:14,397 INFO L280 TraceCheckUtils]: 1: Hoare triple {9074#true} assume true; {9074#true} is VALID [2020-07-10 15:26:14,397 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {9074#true} {9075#false} #184#return; {9075#false} is VALID [2020-07-10 15:26:14,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:14,403 INFO L280 TraceCheckUtils]: 0: Hoare triple {9074#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {9074#true} is VALID [2020-07-10 15:26:14,404 INFO L280 TraceCheckUtils]: 1: Hoare triple {9074#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {9074#true} is VALID [2020-07-10 15:26:14,404 INFO L280 TraceCheckUtils]: 2: Hoare triple {9074#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {9074#true} is VALID [2020-07-10 15:26:14,404 INFO L280 TraceCheckUtils]: 3: Hoare triple {9074#true} assume true; {9074#true} is VALID [2020-07-10 15:26:14,404 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {9074#true} {9075#false} #182#return; {9075#false} is VALID [2020-07-10 15:26:14,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:14,410 INFO L280 TraceCheckUtils]: 0: Hoare triple {9103#(= |#memory_int| |old(#memory_int)|)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4);#res := 1 + ~size; {9074#true} is VALID [2020-07-10 15:26:14,410 INFO L280 TraceCheckUtils]: 1: Hoare triple {9074#true} assume true; {9074#true} is VALID [2020-07-10 15:26:14,411 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {9074#true} {9075#false} #184#return; {9075#false} is VALID [2020-07-10 15:26:14,412 INFO L263 TraceCheckUtils]: 0: Hoare triple {9074#true} call ULTIMATE.init(); {9102#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:26:14,412 INFO L280 TraceCheckUtils]: 1: Hoare triple {9102#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {9074#true} is VALID [2020-07-10 15:26:14,413 INFO L280 TraceCheckUtils]: 2: Hoare triple {9074#true} assume true; {9074#true} is VALID [2020-07-10 15:26:14,413 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {9074#true} {9074#true} #176#return; {9074#true} is VALID [2020-07-10 15:26:14,413 INFO L263 TraceCheckUtils]: 4: Hoare triple {9074#true} call #t~ret23 := main(); {9074#true} is VALID [2020-07-10 15:26:14,414 INFO L280 TraceCheckUtils]: 5: Hoare triple {9074#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.allocOnStack(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {9079#(= 0 main_~x~0)} is VALID [2020-07-10 15:26:14,415 INFO L280 TraceCheckUtils]: 6: Hoare triple {9079#(= 0 main_~x~0)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {9079#(= 0 main_~x~0)} is VALID [2020-07-10 15:26:14,415 INFO L280 TraceCheckUtils]: 7: Hoare triple {9079#(= 0 main_~x~0)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {9080#(<= main_~x~0 1)} is VALID [2020-07-10 15:26:14,416 INFO L280 TraceCheckUtils]: 8: Hoare triple {9080#(<= main_~x~0 1)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {9080#(<= main_~x~0 1)} is VALID [2020-07-10 15:26:14,417 INFO L280 TraceCheckUtils]: 9: Hoare triple {9080#(<= main_~x~0 1)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {9081#(<= main_~x~0 2)} is VALID [2020-07-10 15:26:14,417 INFO L280 TraceCheckUtils]: 10: Hoare triple {9081#(<= main_~x~0 2)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {9081#(<= main_~x~0 2)} is VALID [2020-07-10 15:26:14,419 INFO L280 TraceCheckUtils]: 11: Hoare triple {9081#(<= main_~x~0 2)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {9082#(<= main_~x~0 3)} is VALID [2020-07-10 15:26:14,420 INFO L280 TraceCheckUtils]: 12: Hoare triple {9082#(<= main_~x~0 3)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {9082#(<= main_~x~0 3)} is VALID [2020-07-10 15:26:14,420 INFO L280 TraceCheckUtils]: 13: Hoare triple {9082#(<= main_~x~0 3)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {9083#(<= main_~x~0 4)} is VALID [2020-07-10 15:26:14,421 INFO L280 TraceCheckUtils]: 14: Hoare triple {9083#(<= main_~x~0 4)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {9083#(<= main_~x~0 4)} is VALID [2020-07-10 15:26:14,422 INFO L280 TraceCheckUtils]: 15: Hoare triple {9083#(<= main_~x~0 4)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {9084#(<= main_~x~0 5)} is VALID [2020-07-10 15:26:14,423 INFO L280 TraceCheckUtils]: 16: Hoare triple {9084#(<= main_~x~0 5)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {9084#(<= main_~x~0 5)} is VALID [2020-07-10 15:26:14,424 INFO L280 TraceCheckUtils]: 17: Hoare triple {9084#(<= main_~x~0 5)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {9085#(<= main_~x~0 6)} is VALID [2020-07-10 15:26:14,425 INFO L280 TraceCheckUtils]: 18: Hoare triple {9085#(<= main_~x~0 6)} assume !(~x~0 < 100000); {9075#false} is VALID [2020-07-10 15:26:14,425 INFO L280 TraceCheckUtils]: 19: Hoare triple {9075#false} ~x~0 := 0; {9075#false} is VALID [2020-07-10 15:26:14,425 INFO L280 TraceCheckUtils]: 20: Hoare triple {9075#false} assume !(~x~0 < ~n~0); {9075#false} is VALID [2020-07-10 15:26:14,425 INFO L280 TraceCheckUtils]: 21: Hoare triple {9075#false} call ~#values~0.base, ~#values~0.offset := #Ultimate.allocOnStack(400000);havoc ~v~0;~v~0 := 0; {9075#false} is VALID [2020-07-10 15:26:14,426 INFO L280 TraceCheckUtils]: 22: Hoare triple {9075#false} assume !!(~v~0 < 100000);assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;call write~int(#t~nondet9, ~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4);havoc #t~nondet9; {9075#false} is VALID [2020-07-10 15:26:14,426 INFO L280 TraceCheckUtils]: 23: Hoare triple {9075#false} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {9075#false} is VALID [2020-07-10 15:26:14,426 INFO L280 TraceCheckUtils]: 24: Hoare triple {9075#false} assume !!(~v~0 < 100000);assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;call write~int(#t~nondet9, ~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4);havoc #t~nondet9; {9075#false} is VALID [2020-07-10 15:26:14,426 INFO L280 TraceCheckUtils]: 25: Hoare triple {9075#false} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {9075#false} is VALID [2020-07-10 15:26:14,426 INFO L280 TraceCheckUtils]: 26: Hoare triple {9075#false} assume !(~v~0 < 100000); {9075#false} is VALID [2020-07-10 15:26:14,426 INFO L280 TraceCheckUtils]: 27: Hoare triple {9075#false} ~v~0 := 0; {9075#false} is VALID [2020-07-10 15:26:14,427 INFO L280 TraceCheckUtils]: 28: Hoare triple {9075#false} assume !!(~v~0 < 100000);call #t~mem11 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {9075#false} is VALID [2020-07-10 15:26:14,427 INFO L263 TraceCheckUtils]: 29: Hoare triple {9075#false} call #t~ret12 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem11); {9074#true} is VALID [2020-07-10 15:26:14,427 INFO L280 TraceCheckUtils]: 30: Hoare triple {9074#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {9074#true} is VALID [2020-07-10 15:26:14,427 INFO L280 TraceCheckUtils]: 31: Hoare triple {9074#true} assume !(~i~0 < ~size); {9074#true} is VALID [2020-07-10 15:26:14,427 INFO L280 TraceCheckUtils]: 32: Hoare triple {9074#true} #res := 0; {9074#true} is VALID [2020-07-10 15:26:14,428 INFO L280 TraceCheckUtils]: 33: Hoare triple {9074#true} assume true; {9074#true} is VALID [2020-07-10 15:26:14,428 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {9074#true} {9075#false} #182#return; {9075#false} is VALID [2020-07-10 15:26:14,428 INFO L280 TraceCheckUtils]: 35: Hoare triple {9075#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {9075#false} is VALID [2020-07-10 15:26:14,428 INFO L280 TraceCheckUtils]: 36: Hoare triple {9075#false} assume 0 != #t~ret12;havoc #t~ret12;havoc #t~mem11;call #t~mem13 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {9075#false} is VALID [2020-07-10 15:26:14,428 INFO L263 TraceCheckUtils]: 37: Hoare triple {9075#false} call #t~ret14 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem13); {9103#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:26:14,429 INFO L280 TraceCheckUtils]: 38: Hoare triple {9103#(= |#memory_int| |old(#memory_int)|)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4);#res := 1 + ~size; {9074#true} is VALID [2020-07-10 15:26:14,429 INFO L280 TraceCheckUtils]: 39: Hoare triple {9074#true} assume true; {9074#true} is VALID [2020-07-10 15:26:14,429 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {9074#true} {9075#false} #184#return; {9075#false} is VALID [2020-07-10 15:26:14,429 INFO L280 TraceCheckUtils]: 41: Hoare triple {9075#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~n~0 := #t~ret14;havoc #t~mem13;havoc #t~ret14; {9075#false} is VALID [2020-07-10 15:26:14,429 INFO L280 TraceCheckUtils]: 42: Hoare triple {9075#false} ~x~0 := 0; {9075#false} is VALID [2020-07-10 15:26:14,430 INFO L280 TraceCheckUtils]: 43: Hoare triple {9075#false} assume !(~x~0 < ~n~0); {9075#false} is VALID [2020-07-10 15:26:14,430 INFO L280 TraceCheckUtils]: 44: Hoare triple {9075#false} #t~post10 := ~v~0;~v~0 := 1 + #t~post10;havoc #t~post10; {9075#false} is VALID [2020-07-10 15:26:14,430 INFO L280 TraceCheckUtils]: 45: Hoare triple {9075#false} assume !!(~v~0 < 100000);call #t~mem11 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {9075#false} is VALID [2020-07-10 15:26:14,430 INFO L263 TraceCheckUtils]: 46: Hoare triple {9075#false} call #t~ret12 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem11); {9074#true} is VALID [2020-07-10 15:26:14,430 INFO L280 TraceCheckUtils]: 47: Hoare triple {9074#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {9074#true} is VALID [2020-07-10 15:26:14,430 INFO L280 TraceCheckUtils]: 48: Hoare triple {9074#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {9074#true} is VALID [2020-07-10 15:26:14,431 INFO L280 TraceCheckUtils]: 49: Hoare triple {9074#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {9074#true} is VALID [2020-07-10 15:26:14,431 INFO L280 TraceCheckUtils]: 50: Hoare triple {9074#true} assume true; {9074#true} is VALID [2020-07-10 15:26:14,431 INFO L275 TraceCheckUtils]: 51: Hoare quadruple {9074#true} {9075#false} #182#return; {9075#false} is VALID [2020-07-10 15:26:14,431 INFO L280 TraceCheckUtils]: 52: Hoare triple {9075#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {9075#false} is VALID [2020-07-10 15:26:14,431 INFO L280 TraceCheckUtils]: 53: Hoare triple {9075#false} assume 0 != #t~ret12;havoc #t~ret12;havoc #t~mem11;call #t~mem13 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {9075#false} is VALID [2020-07-10 15:26:14,432 INFO L263 TraceCheckUtils]: 54: Hoare triple {9075#false} call #t~ret14 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem13); {9103#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:26:14,432 INFO L280 TraceCheckUtils]: 55: Hoare triple {9103#(= |#memory_int| |old(#memory_int)|)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4);#res := 1 + ~size; {9074#true} is VALID [2020-07-10 15:26:14,432 INFO L280 TraceCheckUtils]: 56: Hoare triple {9074#true} assume true; {9074#true} is VALID [2020-07-10 15:26:14,432 INFO L275 TraceCheckUtils]: 57: Hoare quadruple {9074#true} {9075#false} #184#return; {9075#false} is VALID [2020-07-10 15:26:14,432 INFO L280 TraceCheckUtils]: 58: Hoare triple {9075#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~n~0 := #t~ret14;havoc #t~mem13;havoc #t~ret14; {9075#false} is VALID [2020-07-10 15:26:14,432 INFO L280 TraceCheckUtils]: 59: Hoare triple {9075#false} ~x~0 := 0; {9075#false} is VALID [2020-07-10 15:26:14,433 INFO L280 TraceCheckUtils]: 60: Hoare triple {9075#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {9075#false} is VALID [2020-07-10 15:26:14,433 INFO L280 TraceCheckUtils]: 61: Hoare triple {9075#false} assume !!(~y~0 < ~n~0);call #t~mem17 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem18 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {9075#false} is VALID [2020-07-10 15:26:14,433 INFO L263 TraceCheckUtils]: 62: Hoare triple {9075#false} call __VERIFIER_assert((if #t~mem17 != #t~mem18 then 1 else 0)); {9075#false} is VALID [2020-07-10 15:26:14,433 INFO L280 TraceCheckUtils]: 63: Hoare triple {9075#false} ~cond := #in~cond; {9075#false} is VALID [2020-07-10 15:26:14,433 INFO L280 TraceCheckUtils]: 64: Hoare triple {9075#false} assume 0 == ~cond; {9075#false} is VALID [2020-07-10 15:26:14,434 INFO L280 TraceCheckUtils]: 65: Hoare triple {9075#false} assume !false; {9075#false} is VALID [2020-07-10 15:26:14,437 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-07-10 15:26:14,437 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6295021] [2020-07-10 15:26:14,437 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116709851] [2020-07-10 15:26:14,437 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:14,502 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-07-10 15:26:14,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:26:14,503 INFO L264 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-10 15:26:14,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:14,519 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:26:14,663 INFO L263 TraceCheckUtils]: 0: Hoare triple {9074#true} call ULTIMATE.init(); {9074#true} is VALID [2020-07-10 15:26:14,663 INFO L280 TraceCheckUtils]: 1: Hoare triple {9074#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {9074#true} is VALID [2020-07-10 15:26:14,663 INFO L280 TraceCheckUtils]: 2: Hoare triple {9074#true} assume true; {9074#true} is VALID [2020-07-10 15:26:14,663 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {9074#true} {9074#true} #176#return; {9074#true} is VALID [2020-07-10 15:26:14,663 INFO L263 TraceCheckUtils]: 4: Hoare triple {9074#true} call #t~ret23 := main(); {9074#true} is VALID [2020-07-10 15:26:14,664 INFO L280 TraceCheckUtils]: 5: Hoare triple {9074#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.allocOnStack(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {9074#true} is VALID [2020-07-10 15:26:14,664 INFO L280 TraceCheckUtils]: 6: Hoare triple {9074#true} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {9074#true} is VALID [2020-07-10 15:26:14,664 INFO L280 TraceCheckUtils]: 7: Hoare triple {9074#true} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {9074#true} is VALID [2020-07-10 15:26:14,664 INFO L280 TraceCheckUtils]: 8: Hoare triple {9074#true} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {9074#true} is VALID [2020-07-10 15:26:14,664 INFO L280 TraceCheckUtils]: 9: Hoare triple {9074#true} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {9074#true} is VALID [2020-07-10 15:26:14,664 INFO L280 TraceCheckUtils]: 10: Hoare triple {9074#true} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {9074#true} is VALID [2020-07-10 15:26:14,664 INFO L280 TraceCheckUtils]: 11: Hoare triple {9074#true} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {9074#true} is VALID [2020-07-10 15:26:14,665 INFO L280 TraceCheckUtils]: 12: Hoare triple {9074#true} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {9074#true} is VALID [2020-07-10 15:26:14,665 INFO L280 TraceCheckUtils]: 13: Hoare triple {9074#true} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {9074#true} is VALID [2020-07-10 15:26:14,665 INFO L280 TraceCheckUtils]: 14: Hoare triple {9074#true} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {9074#true} is VALID [2020-07-10 15:26:14,665 INFO L280 TraceCheckUtils]: 15: Hoare triple {9074#true} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {9074#true} is VALID [2020-07-10 15:26:14,665 INFO L280 TraceCheckUtils]: 16: Hoare triple {9074#true} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {9074#true} is VALID [2020-07-10 15:26:14,665 INFO L280 TraceCheckUtils]: 17: Hoare triple {9074#true} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {9074#true} is VALID [2020-07-10 15:26:14,665 INFO L280 TraceCheckUtils]: 18: Hoare triple {9074#true} assume !(~x~0 < 100000); {9074#true} is VALID [2020-07-10 15:26:14,665 INFO L280 TraceCheckUtils]: 19: Hoare triple {9074#true} ~x~0 := 0; {9074#true} is VALID [2020-07-10 15:26:14,666 INFO L280 TraceCheckUtils]: 20: Hoare triple {9074#true} assume !(~x~0 < ~n~0); {9074#true} is VALID [2020-07-10 15:26:14,666 INFO L280 TraceCheckUtils]: 21: Hoare triple {9074#true} call ~#values~0.base, ~#values~0.offset := #Ultimate.allocOnStack(400000);havoc ~v~0;~v~0 := 0; {9074#true} is VALID [2020-07-10 15:26:14,666 INFO L280 TraceCheckUtils]: 22: Hoare triple {9074#true} assume !!(~v~0 < 100000);assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;call write~int(#t~nondet9, ~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4);havoc #t~nondet9; {9074#true} is VALID [2020-07-10 15:26:14,666 INFO L280 TraceCheckUtils]: 23: Hoare triple {9074#true} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {9074#true} is VALID [2020-07-10 15:26:14,666 INFO L280 TraceCheckUtils]: 24: Hoare triple {9074#true} assume !!(~v~0 < 100000);assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;call write~int(#t~nondet9, ~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4);havoc #t~nondet9; {9074#true} is VALID [2020-07-10 15:26:14,666 INFO L280 TraceCheckUtils]: 25: Hoare triple {9074#true} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {9074#true} is VALID [2020-07-10 15:26:14,667 INFO L280 TraceCheckUtils]: 26: Hoare triple {9074#true} assume !(~v~0 < 100000); {9074#true} is VALID [2020-07-10 15:26:14,667 INFO L280 TraceCheckUtils]: 27: Hoare triple {9074#true} ~v~0 := 0; {9074#true} is VALID [2020-07-10 15:26:14,667 INFO L280 TraceCheckUtils]: 28: Hoare triple {9074#true} assume !!(~v~0 < 100000);call #t~mem11 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {9074#true} is VALID [2020-07-10 15:26:14,667 INFO L263 TraceCheckUtils]: 29: Hoare triple {9074#true} call #t~ret12 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem11); {9074#true} is VALID [2020-07-10 15:26:14,668 INFO L280 TraceCheckUtils]: 30: Hoare triple {9074#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {9074#true} is VALID [2020-07-10 15:26:14,668 INFO L280 TraceCheckUtils]: 31: Hoare triple {9074#true} assume !(~i~0 < ~size); {9074#true} is VALID [2020-07-10 15:26:14,668 INFO L280 TraceCheckUtils]: 32: Hoare triple {9074#true} #res := 0; {9074#true} is VALID [2020-07-10 15:26:14,668 INFO L280 TraceCheckUtils]: 33: Hoare triple {9074#true} assume true; {9074#true} is VALID [2020-07-10 15:26:14,668 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {9074#true} {9074#true} #182#return; {9074#true} is VALID [2020-07-10 15:26:14,669 INFO L280 TraceCheckUtils]: 35: Hoare triple {9074#true} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {9074#true} is VALID [2020-07-10 15:26:14,669 INFO L280 TraceCheckUtils]: 36: Hoare triple {9074#true} assume 0 != #t~ret12;havoc #t~ret12;havoc #t~mem11;call #t~mem13 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {9074#true} is VALID [2020-07-10 15:26:14,669 INFO L263 TraceCheckUtils]: 37: Hoare triple {9074#true} call #t~ret14 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem13); {9074#true} is VALID [2020-07-10 15:26:14,669 INFO L280 TraceCheckUtils]: 38: Hoare triple {9074#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4);#res := 1 + ~size; {9074#true} is VALID [2020-07-10 15:26:14,669 INFO L280 TraceCheckUtils]: 39: Hoare triple {9074#true} assume true; {9074#true} is VALID [2020-07-10 15:26:14,670 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {9074#true} {9074#true} #184#return; {9074#true} is VALID [2020-07-10 15:26:14,670 INFO L280 TraceCheckUtils]: 41: Hoare triple {9074#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~n~0 := #t~ret14;havoc #t~mem13;havoc #t~ret14; {9074#true} is VALID [2020-07-10 15:26:14,670 INFO L280 TraceCheckUtils]: 42: Hoare triple {9074#true} ~x~0 := 0; {9233#(<= main_~x~0 0)} is VALID [2020-07-10 15:26:14,671 INFO L280 TraceCheckUtils]: 43: Hoare triple {9233#(<= main_~x~0 0)} assume !(~x~0 < ~n~0); {9237#(<= main_~n~0 0)} is VALID [2020-07-10 15:26:14,672 INFO L280 TraceCheckUtils]: 44: Hoare triple {9237#(<= main_~n~0 0)} #t~post10 := ~v~0;~v~0 := 1 + #t~post10;havoc #t~post10; {9237#(<= main_~n~0 0)} is VALID [2020-07-10 15:26:14,672 INFO L280 TraceCheckUtils]: 45: Hoare triple {9237#(<= main_~n~0 0)} assume !!(~v~0 < 100000);call #t~mem11 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {9237#(<= main_~n~0 0)} is VALID [2020-07-10 15:26:14,672 INFO L263 TraceCheckUtils]: 46: Hoare triple {9237#(<= main_~n~0 0)} call #t~ret12 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem11); {9074#true} is VALID [2020-07-10 15:26:14,673 INFO L280 TraceCheckUtils]: 47: Hoare triple {9074#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {9250#(and (<= elem_exists_~size |elem_exists_#in~size|) (<= 0 elem_exists_~i~0))} is VALID [2020-07-10 15:26:14,674 INFO L280 TraceCheckUtils]: 48: Hoare triple {9250#(and (<= elem_exists_~size |elem_exists_#in~size|) (<= 0 elem_exists_~i~0))} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {9254#(<= 1 |elem_exists_#in~size|)} is VALID [2020-07-10 15:26:14,674 INFO L280 TraceCheckUtils]: 49: Hoare triple {9254#(<= 1 |elem_exists_#in~size|)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {9254#(<= 1 |elem_exists_#in~size|)} is VALID [2020-07-10 15:26:14,675 INFO L280 TraceCheckUtils]: 50: Hoare triple {9254#(<= 1 |elem_exists_#in~size|)} assume true; {9254#(<= 1 |elem_exists_#in~size|)} is VALID [2020-07-10 15:26:14,677 INFO L275 TraceCheckUtils]: 51: Hoare quadruple {9254#(<= 1 |elem_exists_#in~size|)} {9237#(<= main_~n~0 0)} #182#return; {9075#false} is VALID [2020-07-10 15:26:14,677 INFO L280 TraceCheckUtils]: 52: Hoare triple {9075#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {9075#false} is VALID [2020-07-10 15:26:14,677 INFO L280 TraceCheckUtils]: 53: Hoare triple {9075#false} assume 0 != #t~ret12;havoc #t~ret12;havoc #t~mem11;call #t~mem13 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {9075#false} is VALID [2020-07-10 15:26:14,678 INFO L263 TraceCheckUtils]: 54: Hoare triple {9075#false} call #t~ret14 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem13); {9075#false} is VALID [2020-07-10 15:26:14,678 INFO L280 TraceCheckUtils]: 55: Hoare triple {9075#false} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4);#res := 1 + ~size; {9075#false} is VALID [2020-07-10 15:26:14,678 INFO L280 TraceCheckUtils]: 56: Hoare triple {9075#false} assume true; {9075#false} is VALID [2020-07-10 15:26:14,678 INFO L275 TraceCheckUtils]: 57: Hoare quadruple {9075#false} {9075#false} #184#return; {9075#false} is VALID [2020-07-10 15:26:14,678 INFO L280 TraceCheckUtils]: 58: Hoare triple {9075#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~n~0 := #t~ret14;havoc #t~mem13;havoc #t~ret14; {9075#false} is VALID [2020-07-10 15:26:14,678 INFO L280 TraceCheckUtils]: 59: Hoare triple {9075#false} ~x~0 := 0; {9075#false} is VALID [2020-07-10 15:26:14,679 INFO L280 TraceCheckUtils]: 60: Hoare triple {9075#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {9075#false} is VALID [2020-07-10 15:26:14,679 INFO L280 TraceCheckUtils]: 61: Hoare triple {9075#false} assume !!(~y~0 < ~n~0);call #t~mem17 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem18 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {9075#false} is VALID [2020-07-10 15:26:14,679 INFO L263 TraceCheckUtils]: 62: Hoare triple {9075#false} call __VERIFIER_assert((if #t~mem17 != #t~mem18 then 1 else 0)); {9075#false} is VALID [2020-07-10 15:26:14,679 INFO L280 TraceCheckUtils]: 63: Hoare triple {9075#false} ~cond := #in~cond; {9075#false} is VALID [2020-07-10 15:26:14,679 INFO L280 TraceCheckUtils]: 64: Hoare triple {9075#false} assume 0 == ~cond; {9075#false} is VALID [2020-07-10 15:26:14,679 INFO L280 TraceCheckUtils]: 65: Hoare triple {9075#false} assume !false; {9075#false} is VALID [2020-07-10 15:26:14,685 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2020-07-10 15:26:14,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:26:14,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2020-07-10 15:26:14,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378075806] [2020-07-10 15:26:14,687 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2020-07-10 15:26:14,687 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:14,687 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:26:14,761 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:14,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:26:14,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:14,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:26:14,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2020-07-10 15:26:14,763 INFO L87 Difference]: Start difference. First operand 96 states and 118 transitions. Second operand 6 states. [2020-07-10 15:26:15,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:15,403 INFO L93 Difference]: Finished difference Result 202 states and 259 transitions. [2020-07-10 15:26:15,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:26:15,403 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2020-07-10 15:26:15,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:15,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:26:15,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 155 transitions. [2020-07-10 15:26:15,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:26:15,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 155 transitions. [2020-07-10 15:26:15,408 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 155 transitions. [2020-07-10 15:26:15,593 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:15,603 INFO L225 Difference]: With dead ends: 202 [2020-07-10 15:26:15,603 INFO L226 Difference]: Without dead ends: 125 [2020-07-10 15:26:15,604 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2020-07-10 15:26:15,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-07-10 15:26:15,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 96. [2020-07-10 15:26:15,739 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:15,740 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand 96 states. [2020-07-10 15:26:15,740 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 96 states. [2020-07-10 15:26:15,740 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 96 states. [2020-07-10 15:26:15,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:15,747 INFO L93 Difference]: Finished difference Result 125 states and 156 transitions. [2020-07-10 15:26:15,747 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 156 transitions. [2020-07-10 15:26:15,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:15,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:15,749 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 125 states. [2020-07-10 15:26:15,749 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 125 states. [2020-07-10 15:26:15,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:15,755 INFO L93 Difference]: Finished difference Result 125 states and 156 transitions. [2020-07-10 15:26:15,755 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 156 transitions. [2020-07-10 15:26:15,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:15,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:15,757 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:15,757 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:15,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-07-10 15:26:15,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 118 transitions. [2020-07-10 15:26:15,761 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 118 transitions. Word has length 66 [2020-07-10 15:26:15,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:15,762 INFO L479 AbstractCegarLoop]: Abstraction has 96 states and 118 transitions. [2020-07-10 15:26:15,762 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:26:15,762 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2020-07-10 15:26:15,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-07-10 15:26:15,763 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:15,764 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2020-07-10 15:26:15,978 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:15,979 INFO L427 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:15,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:15,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1402871403, now seen corresponding path program 1 times [2020-07-10 15:26:15,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:15,980 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251675676] [2020-07-10 15:26:15,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:16,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:16,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:16,123 INFO L280 TraceCheckUtils]: 0: Hoare triple {10014#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {9986#true} is VALID [2020-07-10 15:26:16,124 INFO L280 TraceCheckUtils]: 1: Hoare triple {9986#true} assume true; {9986#true} is VALID [2020-07-10 15:26:16,124 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {9986#true} {9986#true} #176#return; {9986#true} is VALID [2020-07-10 15:26:16,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:16,130 INFO L280 TraceCheckUtils]: 0: Hoare triple {9986#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {9986#true} is VALID [2020-07-10 15:26:16,130 INFO L280 TraceCheckUtils]: 1: Hoare triple {9986#true} assume !(~i~0 < ~size); {9986#true} is VALID [2020-07-10 15:26:16,130 INFO L280 TraceCheckUtils]: 2: Hoare triple {9986#true} #res := 0; {9986#true} is VALID [2020-07-10 15:26:16,131 INFO L280 TraceCheckUtils]: 3: Hoare triple {9986#true} assume true; {9986#true} is VALID [2020-07-10 15:26:16,131 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {9986#true} {9987#false} #182#return; {9987#false} is VALID [2020-07-10 15:26:16,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:16,145 INFO L280 TraceCheckUtils]: 0: Hoare triple {10015#(= |#memory_int| |old(#memory_int)|)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4);#res := 1 + ~size; {9986#true} is VALID [2020-07-10 15:26:16,145 INFO L280 TraceCheckUtils]: 1: Hoare triple {9986#true} assume true; {9986#true} is VALID [2020-07-10 15:26:16,145 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {9986#true} {9987#false} #184#return; {9987#false} is VALID [2020-07-10 15:26:16,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:16,151 INFO L280 TraceCheckUtils]: 0: Hoare triple {9986#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {9986#true} is VALID [2020-07-10 15:26:16,152 INFO L280 TraceCheckUtils]: 1: Hoare triple {9986#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {9986#true} is VALID [2020-07-10 15:26:16,152 INFO L280 TraceCheckUtils]: 2: Hoare triple {9986#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {9986#true} is VALID [2020-07-10 15:26:16,152 INFO L280 TraceCheckUtils]: 3: Hoare triple {9986#true} assume true; {9986#true} is VALID [2020-07-10 15:26:16,153 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {9986#true} {9987#false} #182#return; {9987#false} is VALID [2020-07-10 15:26:16,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:16,164 INFO L280 TraceCheckUtils]: 0: Hoare triple {10015#(= |#memory_int| |old(#memory_int)|)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4);#res := 1 + ~size; {9986#true} is VALID [2020-07-10 15:26:16,164 INFO L280 TraceCheckUtils]: 1: Hoare triple {9986#true} assume true; {9986#true} is VALID [2020-07-10 15:26:16,164 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {9986#true} {9987#false} #184#return; {9987#false} is VALID [2020-07-10 15:26:16,165 INFO L263 TraceCheckUtils]: 0: Hoare triple {9986#true} call ULTIMATE.init(); {10014#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:26:16,166 INFO L280 TraceCheckUtils]: 1: Hoare triple {10014#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {9986#true} is VALID [2020-07-10 15:26:16,166 INFO L280 TraceCheckUtils]: 2: Hoare triple {9986#true} assume true; {9986#true} is VALID [2020-07-10 15:26:16,166 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {9986#true} {9986#true} #176#return; {9986#true} is VALID [2020-07-10 15:26:16,167 INFO L263 TraceCheckUtils]: 4: Hoare triple {9986#true} call #t~ret23 := main(); {9986#true} is VALID [2020-07-10 15:26:16,168 INFO L280 TraceCheckUtils]: 5: Hoare triple {9986#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.allocOnStack(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {9991#(= 0 main_~x~0)} is VALID [2020-07-10 15:26:16,169 INFO L280 TraceCheckUtils]: 6: Hoare triple {9991#(= 0 main_~x~0)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {9991#(= 0 main_~x~0)} is VALID [2020-07-10 15:26:16,170 INFO L280 TraceCheckUtils]: 7: Hoare triple {9991#(= 0 main_~x~0)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {9992#(<= main_~x~0 1)} is VALID [2020-07-10 15:26:16,170 INFO L280 TraceCheckUtils]: 8: Hoare triple {9992#(<= main_~x~0 1)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {9992#(<= main_~x~0 1)} is VALID [2020-07-10 15:26:16,171 INFO L280 TraceCheckUtils]: 9: Hoare triple {9992#(<= main_~x~0 1)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {9993#(<= main_~x~0 2)} is VALID [2020-07-10 15:26:16,172 INFO L280 TraceCheckUtils]: 10: Hoare triple {9993#(<= main_~x~0 2)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {9993#(<= main_~x~0 2)} is VALID [2020-07-10 15:26:16,172 INFO L280 TraceCheckUtils]: 11: Hoare triple {9993#(<= main_~x~0 2)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {9994#(<= main_~x~0 3)} is VALID [2020-07-10 15:26:16,173 INFO L280 TraceCheckUtils]: 12: Hoare triple {9994#(<= main_~x~0 3)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {9994#(<= main_~x~0 3)} is VALID [2020-07-10 15:26:16,174 INFO L280 TraceCheckUtils]: 13: Hoare triple {9994#(<= main_~x~0 3)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {9995#(<= main_~x~0 4)} is VALID [2020-07-10 15:26:16,175 INFO L280 TraceCheckUtils]: 14: Hoare triple {9995#(<= main_~x~0 4)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {9995#(<= main_~x~0 4)} is VALID [2020-07-10 15:26:16,176 INFO L280 TraceCheckUtils]: 15: Hoare triple {9995#(<= main_~x~0 4)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {9996#(<= main_~x~0 5)} is VALID [2020-07-10 15:26:16,177 INFO L280 TraceCheckUtils]: 16: Hoare triple {9996#(<= main_~x~0 5)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {9996#(<= main_~x~0 5)} is VALID [2020-07-10 15:26:16,178 INFO L280 TraceCheckUtils]: 17: Hoare triple {9996#(<= main_~x~0 5)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {9997#(<= main_~x~0 6)} is VALID [2020-07-10 15:26:16,178 INFO L280 TraceCheckUtils]: 18: Hoare triple {9997#(<= main_~x~0 6)} assume !(~x~0 < 100000); {9987#false} is VALID [2020-07-10 15:26:16,179 INFO L280 TraceCheckUtils]: 19: Hoare triple {9987#false} ~x~0 := 0; {9987#false} is VALID [2020-07-10 15:26:16,179 INFO L280 TraceCheckUtils]: 20: Hoare triple {9987#false} assume !(~x~0 < ~n~0); {9987#false} is VALID [2020-07-10 15:26:16,179 INFO L280 TraceCheckUtils]: 21: Hoare triple {9987#false} call ~#values~0.base, ~#values~0.offset := #Ultimate.allocOnStack(400000);havoc ~v~0;~v~0 := 0; {9987#false} is VALID [2020-07-10 15:26:16,179 INFO L280 TraceCheckUtils]: 22: Hoare triple {9987#false} assume !!(~v~0 < 100000);assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;call write~int(#t~nondet9, ~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4);havoc #t~nondet9; {9987#false} is VALID [2020-07-10 15:26:16,180 INFO L280 TraceCheckUtils]: 23: Hoare triple {9987#false} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {9987#false} is VALID [2020-07-10 15:26:16,180 INFO L280 TraceCheckUtils]: 24: Hoare triple {9987#false} assume !!(~v~0 < 100000);assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;call write~int(#t~nondet9, ~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4);havoc #t~nondet9; {9987#false} is VALID [2020-07-10 15:26:16,180 INFO L280 TraceCheckUtils]: 25: Hoare triple {9987#false} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {9987#false} is VALID [2020-07-10 15:26:16,180 INFO L280 TraceCheckUtils]: 26: Hoare triple {9987#false} assume !(~v~0 < 100000); {9987#false} is VALID [2020-07-10 15:26:16,180 INFO L280 TraceCheckUtils]: 27: Hoare triple {9987#false} ~v~0 := 0; {9987#false} is VALID [2020-07-10 15:26:16,180 INFO L280 TraceCheckUtils]: 28: Hoare triple {9987#false} assume !!(~v~0 < 100000);call #t~mem11 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {9987#false} is VALID [2020-07-10 15:26:16,181 INFO L263 TraceCheckUtils]: 29: Hoare triple {9987#false} call #t~ret12 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem11); {9986#true} is VALID [2020-07-10 15:26:16,181 INFO L280 TraceCheckUtils]: 30: Hoare triple {9986#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {9986#true} is VALID [2020-07-10 15:26:16,181 INFO L280 TraceCheckUtils]: 31: Hoare triple {9986#true} assume !(~i~0 < ~size); {9986#true} is VALID [2020-07-10 15:26:16,181 INFO L280 TraceCheckUtils]: 32: Hoare triple {9986#true} #res := 0; {9986#true} is VALID [2020-07-10 15:26:16,181 INFO L280 TraceCheckUtils]: 33: Hoare triple {9986#true} assume true; {9986#true} is VALID [2020-07-10 15:26:16,182 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {9986#true} {9987#false} #182#return; {9987#false} is VALID [2020-07-10 15:26:16,182 INFO L280 TraceCheckUtils]: 35: Hoare triple {9987#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {9987#false} is VALID [2020-07-10 15:26:16,182 INFO L280 TraceCheckUtils]: 36: Hoare triple {9987#false} assume 0 != #t~ret12;havoc #t~ret12;havoc #t~mem11;call #t~mem13 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {9987#false} is VALID [2020-07-10 15:26:16,182 INFO L263 TraceCheckUtils]: 37: Hoare triple {9987#false} call #t~ret14 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem13); {10015#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:26:16,182 INFO L280 TraceCheckUtils]: 38: Hoare triple {10015#(= |#memory_int| |old(#memory_int)|)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4);#res := 1 + ~size; {9986#true} is VALID [2020-07-10 15:26:16,182 INFO L280 TraceCheckUtils]: 39: Hoare triple {9986#true} assume true; {9986#true} is VALID [2020-07-10 15:26:16,183 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {9986#true} {9987#false} #184#return; {9987#false} is VALID [2020-07-10 15:26:16,183 INFO L280 TraceCheckUtils]: 41: Hoare triple {9987#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~n~0 := #t~ret14;havoc #t~mem13;havoc #t~ret14; {9987#false} is VALID [2020-07-10 15:26:16,183 INFO L280 TraceCheckUtils]: 42: Hoare triple {9987#false} ~x~0 := 0; {9987#false} is VALID [2020-07-10 15:26:16,183 INFO L280 TraceCheckUtils]: 43: Hoare triple {9987#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {9987#false} is VALID [2020-07-10 15:26:16,183 INFO L280 TraceCheckUtils]: 44: Hoare triple {9987#false} assume !(~y~0 < ~n~0); {9987#false} is VALID [2020-07-10 15:26:16,184 INFO L280 TraceCheckUtils]: 45: Hoare triple {9987#false} #t~post15 := ~x~0;~x~0 := 1 + #t~post15;havoc #t~post15; {9987#false} is VALID [2020-07-10 15:26:16,184 INFO L280 TraceCheckUtils]: 46: Hoare triple {9987#false} assume !(~x~0 < ~n~0); {9987#false} is VALID [2020-07-10 15:26:16,184 INFO L280 TraceCheckUtils]: 47: Hoare triple {9987#false} #t~post10 := ~v~0;~v~0 := 1 + #t~post10;havoc #t~post10; {9987#false} is VALID [2020-07-10 15:26:16,184 INFO L280 TraceCheckUtils]: 48: Hoare triple {9987#false} assume !!(~v~0 < 100000);call #t~mem11 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {9987#false} is VALID [2020-07-10 15:26:16,184 INFO L263 TraceCheckUtils]: 49: Hoare triple {9987#false} call #t~ret12 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem11); {9986#true} is VALID [2020-07-10 15:26:16,184 INFO L280 TraceCheckUtils]: 50: Hoare triple {9986#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {9986#true} is VALID [2020-07-10 15:26:16,185 INFO L280 TraceCheckUtils]: 51: Hoare triple {9986#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {9986#true} is VALID [2020-07-10 15:26:16,185 INFO L280 TraceCheckUtils]: 52: Hoare triple {9986#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {9986#true} is VALID [2020-07-10 15:26:16,185 INFO L280 TraceCheckUtils]: 53: Hoare triple {9986#true} assume true; {9986#true} is VALID [2020-07-10 15:26:16,185 INFO L275 TraceCheckUtils]: 54: Hoare quadruple {9986#true} {9987#false} #182#return; {9987#false} is VALID [2020-07-10 15:26:16,185 INFO L280 TraceCheckUtils]: 55: Hoare triple {9987#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {9987#false} is VALID [2020-07-10 15:26:16,186 INFO L280 TraceCheckUtils]: 56: Hoare triple {9987#false} assume 0 != #t~ret12;havoc #t~ret12;havoc #t~mem11;call #t~mem13 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {9987#false} is VALID [2020-07-10 15:26:16,186 INFO L263 TraceCheckUtils]: 57: Hoare triple {9987#false} call #t~ret14 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem13); {10015#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:26:16,186 INFO L280 TraceCheckUtils]: 58: Hoare triple {10015#(= |#memory_int| |old(#memory_int)|)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4);#res := 1 + ~size; {9986#true} is VALID [2020-07-10 15:26:16,186 INFO L280 TraceCheckUtils]: 59: Hoare triple {9986#true} assume true; {9986#true} is VALID [2020-07-10 15:26:16,186 INFO L275 TraceCheckUtils]: 60: Hoare quadruple {9986#true} {9987#false} #184#return; {9987#false} is VALID [2020-07-10 15:26:16,186 INFO L280 TraceCheckUtils]: 61: Hoare triple {9987#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~n~0 := #t~ret14;havoc #t~mem13;havoc #t~ret14; {9987#false} is VALID [2020-07-10 15:26:16,187 INFO L280 TraceCheckUtils]: 62: Hoare triple {9987#false} ~x~0 := 0; {9987#false} is VALID [2020-07-10 15:26:16,187 INFO L280 TraceCheckUtils]: 63: Hoare triple {9987#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {9987#false} is VALID [2020-07-10 15:26:16,187 INFO L280 TraceCheckUtils]: 64: Hoare triple {9987#false} assume !!(~y~0 < ~n~0);call #t~mem17 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem18 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {9987#false} is VALID [2020-07-10 15:26:16,187 INFO L263 TraceCheckUtils]: 65: Hoare triple {9987#false} call __VERIFIER_assert((if #t~mem17 != #t~mem18 then 1 else 0)); {9987#false} is VALID [2020-07-10 15:26:16,187 INFO L280 TraceCheckUtils]: 66: Hoare triple {9987#false} ~cond := #in~cond; {9987#false} is VALID [2020-07-10 15:26:16,188 INFO L280 TraceCheckUtils]: 67: Hoare triple {9987#false} assume 0 == ~cond; {9987#false} is VALID [2020-07-10 15:26:16,188 INFO L280 TraceCheckUtils]: 68: Hoare triple {9987#false} assume !false; {9987#false} is VALID [2020-07-10 15:26:16,191 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2020-07-10 15:26:16,191 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251675676] [2020-07-10 15:26:16,192 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980736983] [2020-07-10 15:26:16,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:16,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:16,250 INFO L264 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-10 15:26:16,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:16,267 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:26:16,393 INFO L263 TraceCheckUtils]: 0: Hoare triple {9986#true} call ULTIMATE.init(); {9986#true} is VALID [2020-07-10 15:26:16,394 INFO L280 TraceCheckUtils]: 1: Hoare triple {9986#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {9986#true} is VALID [2020-07-10 15:26:16,394 INFO L280 TraceCheckUtils]: 2: Hoare triple {9986#true} assume true; {9986#true} is VALID [2020-07-10 15:26:16,394 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {9986#true} {9986#true} #176#return; {9986#true} is VALID [2020-07-10 15:26:16,394 INFO L263 TraceCheckUtils]: 4: Hoare triple {9986#true} call #t~ret23 := main(); {9986#true} is VALID [2020-07-10 15:26:16,397 INFO L280 TraceCheckUtils]: 5: Hoare triple {9986#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.allocOnStack(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {10034#(<= main_~x~0 0)} is VALID [2020-07-10 15:26:16,398 INFO L280 TraceCheckUtils]: 6: Hoare triple {10034#(<= main_~x~0 0)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {10034#(<= main_~x~0 0)} is VALID [2020-07-10 15:26:16,398 INFO L280 TraceCheckUtils]: 7: Hoare triple {10034#(<= main_~x~0 0)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {9992#(<= main_~x~0 1)} is VALID [2020-07-10 15:26:16,399 INFO L280 TraceCheckUtils]: 8: Hoare triple {9992#(<= main_~x~0 1)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {9992#(<= main_~x~0 1)} is VALID [2020-07-10 15:26:16,400 INFO L280 TraceCheckUtils]: 9: Hoare triple {9992#(<= main_~x~0 1)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {9993#(<= main_~x~0 2)} is VALID [2020-07-10 15:26:16,400 INFO L280 TraceCheckUtils]: 10: Hoare triple {9993#(<= main_~x~0 2)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {9993#(<= main_~x~0 2)} is VALID [2020-07-10 15:26:16,401 INFO L280 TraceCheckUtils]: 11: Hoare triple {9993#(<= main_~x~0 2)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {9994#(<= main_~x~0 3)} is VALID [2020-07-10 15:26:16,401 INFO L280 TraceCheckUtils]: 12: Hoare triple {9994#(<= main_~x~0 3)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {9994#(<= main_~x~0 3)} is VALID [2020-07-10 15:26:16,402 INFO L280 TraceCheckUtils]: 13: Hoare triple {9994#(<= main_~x~0 3)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {9995#(<= main_~x~0 4)} is VALID [2020-07-10 15:26:16,403 INFO L280 TraceCheckUtils]: 14: Hoare triple {9995#(<= main_~x~0 4)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {9995#(<= main_~x~0 4)} is VALID [2020-07-10 15:26:16,403 INFO L280 TraceCheckUtils]: 15: Hoare triple {9995#(<= main_~x~0 4)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {9996#(<= main_~x~0 5)} is VALID [2020-07-10 15:26:16,404 INFO L280 TraceCheckUtils]: 16: Hoare triple {9996#(<= main_~x~0 5)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {9996#(<= main_~x~0 5)} is VALID [2020-07-10 15:26:16,408 INFO L280 TraceCheckUtils]: 17: Hoare triple {9996#(<= main_~x~0 5)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {9997#(<= main_~x~0 6)} is VALID [2020-07-10 15:26:16,411 INFO L280 TraceCheckUtils]: 18: Hoare triple {9997#(<= main_~x~0 6)} assume !(~x~0 < 100000); {9987#false} is VALID [2020-07-10 15:26:16,411 INFO L280 TraceCheckUtils]: 19: Hoare triple {9987#false} ~x~0 := 0; {9987#false} is VALID [2020-07-10 15:26:16,411 INFO L280 TraceCheckUtils]: 20: Hoare triple {9987#false} assume !(~x~0 < ~n~0); {9987#false} is VALID [2020-07-10 15:26:16,412 INFO L280 TraceCheckUtils]: 21: Hoare triple {9987#false} call ~#values~0.base, ~#values~0.offset := #Ultimate.allocOnStack(400000);havoc ~v~0;~v~0 := 0; {9987#false} is VALID [2020-07-10 15:26:16,412 INFO L280 TraceCheckUtils]: 22: Hoare triple {9987#false} assume !!(~v~0 < 100000);assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;call write~int(#t~nondet9, ~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4);havoc #t~nondet9; {9987#false} is VALID [2020-07-10 15:26:16,412 INFO L280 TraceCheckUtils]: 23: Hoare triple {9987#false} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {9987#false} is VALID [2020-07-10 15:26:16,412 INFO L280 TraceCheckUtils]: 24: Hoare triple {9987#false} assume !!(~v~0 < 100000);assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;call write~int(#t~nondet9, ~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4);havoc #t~nondet9; {9987#false} is VALID [2020-07-10 15:26:16,412 INFO L280 TraceCheckUtils]: 25: Hoare triple {9987#false} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {9987#false} is VALID [2020-07-10 15:26:16,412 INFO L280 TraceCheckUtils]: 26: Hoare triple {9987#false} assume !(~v~0 < 100000); {9987#false} is VALID [2020-07-10 15:26:16,413 INFO L280 TraceCheckUtils]: 27: Hoare triple {9987#false} ~v~0 := 0; {9987#false} is VALID [2020-07-10 15:26:16,413 INFO L280 TraceCheckUtils]: 28: Hoare triple {9987#false} assume !!(~v~0 < 100000);call #t~mem11 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {9987#false} is VALID [2020-07-10 15:26:16,413 INFO L263 TraceCheckUtils]: 29: Hoare triple {9987#false} call #t~ret12 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem11); {9987#false} is VALID [2020-07-10 15:26:16,413 INFO L280 TraceCheckUtils]: 30: Hoare triple {9987#false} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {9987#false} is VALID [2020-07-10 15:26:16,413 INFO L280 TraceCheckUtils]: 31: Hoare triple {9987#false} assume !(~i~0 < ~size); {9987#false} is VALID [2020-07-10 15:26:16,414 INFO L280 TraceCheckUtils]: 32: Hoare triple {9987#false} #res := 0; {9987#false} is VALID [2020-07-10 15:26:16,414 INFO L280 TraceCheckUtils]: 33: Hoare triple {9987#false} assume true; {9987#false} is VALID [2020-07-10 15:26:16,414 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {9987#false} {9987#false} #182#return; {9987#false} is VALID [2020-07-10 15:26:16,414 INFO L280 TraceCheckUtils]: 35: Hoare triple {9987#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {9987#false} is VALID [2020-07-10 15:26:16,414 INFO L280 TraceCheckUtils]: 36: Hoare triple {9987#false} assume 0 != #t~ret12;havoc #t~ret12;havoc #t~mem11;call #t~mem13 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {9987#false} is VALID [2020-07-10 15:26:16,415 INFO L263 TraceCheckUtils]: 37: Hoare triple {9987#false} call #t~ret14 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem13); {9987#false} is VALID [2020-07-10 15:26:16,415 INFO L280 TraceCheckUtils]: 38: Hoare triple {9987#false} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4);#res := 1 + ~size; {9987#false} is VALID [2020-07-10 15:26:16,415 INFO L280 TraceCheckUtils]: 39: Hoare triple {9987#false} assume true; {9987#false} is VALID [2020-07-10 15:26:16,415 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {9987#false} {9987#false} #184#return; {9987#false} is VALID [2020-07-10 15:26:16,415 INFO L280 TraceCheckUtils]: 41: Hoare triple {9987#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~n~0 := #t~ret14;havoc #t~mem13;havoc #t~ret14; {9987#false} is VALID [2020-07-10 15:26:16,415 INFO L280 TraceCheckUtils]: 42: Hoare triple {9987#false} ~x~0 := 0; {9987#false} is VALID [2020-07-10 15:26:16,416 INFO L280 TraceCheckUtils]: 43: Hoare triple {9987#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {9987#false} is VALID [2020-07-10 15:26:16,416 INFO L280 TraceCheckUtils]: 44: Hoare triple {9987#false} assume !(~y~0 < ~n~0); {9987#false} is VALID [2020-07-10 15:26:16,416 INFO L280 TraceCheckUtils]: 45: Hoare triple {9987#false} #t~post15 := ~x~0;~x~0 := 1 + #t~post15;havoc #t~post15; {9987#false} is VALID [2020-07-10 15:26:16,416 INFO L280 TraceCheckUtils]: 46: Hoare triple {9987#false} assume !(~x~0 < ~n~0); {9987#false} is VALID [2020-07-10 15:26:16,416 INFO L280 TraceCheckUtils]: 47: Hoare triple {9987#false} #t~post10 := ~v~0;~v~0 := 1 + #t~post10;havoc #t~post10; {9987#false} is VALID [2020-07-10 15:26:16,417 INFO L280 TraceCheckUtils]: 48: Hoare triple {9987#false} assume !!(~v~0 < 100000);call #t~mem11 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {9987#false} is VALID [2020-07-10 15:26:16,417 INFO L263 TraceCheckUtils]: 49: Hoare triple {9987#false} call #t~ret12 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem11); {9987#false} is VALID [2020-07-10 15:26:16,417 INFO L280 TraceCheckUtils]: 50: Hoare triple {9987#false} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {9987#false} is VALID [2020-07-10 15:26:16,417 INFO L280 TraceCheckUtils]: 51: Hoare triple {9987#false} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {9987#false} is VALID [2020-07-10 15:26:16,417 INFO L280 TraceCheckUtils]: 52: Hoare triple {9987#false} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {9987#false} is VALID [2020-07-10 15:26:16,417 INFO L280 TraceCheckUtils]: 53: Hoare triple {9987#false} assume true; {9987#false} is VALID [2020-07-10 15:26:16,418 INFO L275 TraceCheckUtils]: 54: Hoare quadruple {9987#false} {9987#false} #182#return; {9987#false} is VALID [2020-07-10 15:26:16,418 INFO L280 TraceCheckUtils]: 55: Hoare triple {9987#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {9987#false} is VALID [2020-07-10 15:26:16,418 INFO L280 TraceCheckUtils]: 56: Hoare triple {9987#false} assume 0 != #t~ret12;havoc #t~ret12;havoc #t~mem11;call #t~mem13 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {9987#false} is VALID [2020-07-10 15:26:16,418 INFO L263 TraceCheckUtils]: 57: Hoare triple {9987#false} call #t~ret14 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem13); {9987#false} is VALID [2020-07-10 15:26:16,418 INFO L280 TraceCheckUtils]: 58: Hoare triple {9987#false} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4);#res := 1 + ~size; {9987#false} is VALID [2020-07-10 15:26:16,419 INFO L280 TraceCheckUtils]: 59: Hoare triple {9987#false} assume true; {9987#false} is VALID [2020-07-10 15:26:16,419 INFO L275 TraceCheckUtils]: 60: Hoare quadruple {9987#false} {9987#false} #184#return; {9987#false} is VALID [2020-07-10 15:26:16,419 INFO L280 TraceCheckUtils]: 61: Hoare triple {9987#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~n~0 := #t~ret14;havoc #t~mem13;havoc #t~ret14; {9987#false} is VALID [2020-07-10 15:26:16,419 INFO L280 TraceCheckUtils]: 62: Hoare triple {9987#false} ~x~0 := 0; {9987#false} is VALID [2020-07-10 15:26:16,419 INFO L280 TraceCheckUtils]: 63: Hoare triple {9987#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {9987#false} is VALID [2020-07-10 15:26:16,420 INFO L280 TraceCheckUtils]: 64: Hoare triple {9987#false} assume !!(~y~0 < ~n~0);call #t~mem17 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem18 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {9987#false} is VALID [2020-07-10 15:26:16,420 INFO L263 TraceCheckUtils]: 65: Hoare triple {9987#false} call __VERIFIER_assert((if #t~mem17 != #t~mem18 then 1 else 0)); {9987#false} is VALID [2020-07-10 15:26:16,420 INFO L280 TraceCheckUtils]: 66: Hoare triple {9987#false} ~cond := #in~cond; {9987#false} is VALID [2020-07-10 15:26:16,420 INFO L280 TraceCheckUtils]: 67: Hoare triple {9987#false} assume 0 == ~cond; {9987#false} is VALID [2020-07-10 15:26:16,420 INFO L280 TraceCheckUtils]: 68: Hoare triple {9987#false} assume !false; {9987#false} is VALID [2020-07-10 15:26:16,424 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2020-07-10 15:26:16,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:26:16,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 12 [2020-07-10 15:26:16,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876328109] [2020-07-10 15:26:16,425 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 69 [2020-07-10 15:26:16,428 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:16,429 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-10 15:26:16,518 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:16,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-10 15:26:16,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:16,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-10 15:26:16,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-07-10 15:26:16,520 INFO L87 Difference]: Start difference. First operand 96 states and 118 transitions. Second operand 12 states. [2020-07-10 15:26:19,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:19,355 INFO L93 Difference]: Finished difference Result 406 states and 552 transitions. [2020-07-10 15:26:19,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-10 15:26:19,355 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 69 [2020-07-10 15:26:19,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:19,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 15:26:19,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 338 transitions. [2020-07-10 15:26:19,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 15:26:19,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 338 transitions. [2020-07-10 15:26:19,370 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 338 transitions. [2020-07-10 15:26:19,951 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 338 edges. 338 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:19,976 INFO L225 Difference]: With dead ends: 406 [2020-07-10 15:26:19,977 INFO L226 Difference]: Without dead ends: 329 [2020-07-10 15:26:19,978 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2020-07-10 15:26:19,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2020-07-10 15:26:20,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 98. [2020-07-10 15:26:20,144 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:20,144 INFO L82 GeneralOperation]: Start isEquivalent. First operand 329 states. Second operand 98 states. [2020-07-10 15:26:20,144 INFO L74 IsIncluded]: Start isIncluded. First operand 329 states. Second operand 98 states. [2020-07-10 15:26:20,145 INFO L87 Difference]: Start difference. First operand 329 states. Second operand 98 states. [2020-07-10 15:26:20,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:20,169 INFO L93 Difference]: Finished difference Result 329 states and 453 transitions. [2020-07-10 15:26:20,169 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 453 transitions. [2020-07-10 15:26:20,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:20,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:20,172 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 329 states. [2020-07-10 15:26:20,172 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 329 states. [2020-07-10 15:26:20,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:20,197 INFO L93 Difference]: Finished difference Result 329 states and 453 transitions. [2020-07-10 15:26:20,197 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 453 transitions. [2020-07-10 15:26:20,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:20,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:20,200 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:20,200 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:20,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-07-10 15:26:20,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 120 transitions. [2020-07-10 15:26:20,205 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 120 transitions. Word has length 69 [2020-07-10 15:26:20,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:20,205 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 120 transitions. [2020-07-10 15:26:20,206 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-10 15:26:20,206 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 120 transitions. [2020-07-10 15:26:20,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-07-10 15:26:20,207 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:20,208 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2020-07-10 15:26:20,421 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-07-10 15:26:20,422 INFO L427 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:20,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:20,423 INFO L82 PathProgramCache]: Analyzing trace with hash -973371469, now seen corresponding path program 2 times [2020-07-10 15:26:20,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:20,423 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700479511] [2020-07-10 15:26:20,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:20,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:20,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:20,630 INFO L280 TraceCheckUtils]: 0: Hoare triple {11633#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {11604#true} is VALID [2020-07-10 15:26:20,630 INFO L280 TraceCheckUtils]: 1: Hoare triple {11604#true} assume true; {11604#true} is VALID [2020-07-10 15:26:20,631 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {11604#true} {11604#true} #176#return; {11604#true} is VALID [2020-07-10 15:26:20,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:20,645 INFO L280 TraceCheckUtils]: 0: Hoare triple {11604#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {11604#true} is VALID [2020-07-10 15:26:20,645 INFO L280 TraceCheckUtils]: 1: Hoare triple {11604#true} assume !(~i~0 < ~size); {11604#true} is VALID [2020-07-10 15:26:20,645 INFO L280 TraceCheckUtils]: 2: Hoare triple {11604#true} #res := 0; {11604#true} is VALID [2020-07-10 15:26:20,646 INFO L280 TraceCheckUtils]: 3: Hoare triple {11604#true} assume true; {11604#true} is VALID [2020-07-10 15:26:20,646 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {11604#true} {11605#false} #182#return; {11605#false} is VALID [2020-07-10 15:26:20,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:20,664 INFO L280 TraceCheckUtils]: 0: Hoare triple {11634#(= |#memory_int| |old(#memory_int)|)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4);#res := 1 + ~size; {11604#true} is VALID [2020-07-10 15:26:20,665 INFO L280 TraceCheckUtils]: 1: Hoare triple {11604#true} assume true; {11604#true} is VALID [2020-07-10 15:26:20,665 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {11604#true} {11605#false} #184#return; {11605#false} is VALID [2020-07-10 15:26:20,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:20,671 INFO L280 TraceCheckUtils]: 0: Hoare triple {11604#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {11604#true} is VALID [2020-07-10 15:26:20,672 INFO L280 TraceCheckUtils]: 1: Hoare triple {11604#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {11604#true} is VALID [2020-07-10 15:26:20,672 INFO L280 TraceCheckUtils]: 2: Hoare triple {11604#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {11604#true} is VALID [2020-07-10 15:26:20,673 INFO L280 TraceCheckUtils]: 3: Hoare triple {11604#true} assume true; {11604#true} is VALID [2020-07-10 15:26:20,673 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {11604#true} {11605#false} #182#return; {11605#false} is VALID [2020-07-10 15:26:20,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:20,682 INFO L280 TraceCheckUtils]: 0: Hoare triple {11634#(= |#memory_int| |old(#memory_int)|)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4);#res := 1 + ~size; {11604#true} is VALID [2020-07-10 15:26:20,682 INFO L280 TraceCheckUtils]: 1: Hoare triple {11604#true} assume true; {11604#true} is VALID [2020-07-10 15:26:20,682 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {11604#true} {11605#false} #184#return; {11605#false} is VALID [2020-07-10 15:26:20,684 INFO L263 TraceCheckUtils]: 0: Hoare triple {11604#true} call ULTIMATE.init(); {11633#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:26:20,684 INFO L280 TraceCheckUtils]: 1: Hoare triple {11633#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {11604#true} is VALID [2020-07-10 15:26:20,684 INFO L280 TraceCheckUtils]: 2: Hoare triple {11604#true} assume true; {11604#true} is VALID [2020-07-10 15:26:20,685 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {11604#true} {11604#true} #176#return; {11604#true} is VALID [2020-07-10 15:26:20,685 INFO L263 TraceCheckUtils]: 4: Hoare triple {11604#true} call #t~ret23 := main(); {11604#true} is VALID [2020-07-10 15:26:20,686 INFO L280 TraceCheckUtils]: 5: Hoare triple {11604#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.allocOnStack(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {11609#(= 0 main_~x~0)} is VALID [2020-07-10 15:26:20,687 INFO L280 TraceCheckUtils]: 6: Hoare triple {11609#(= 0 main_~x~0)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {11609#(= 0 main_~x~0)} is VALID [2020-07-10 15:26:20,688 INFO L280 TraceCheckUtils]: 7: Hoare triple {11609#(= 0 main_~x~0)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {11610#(<= main_~x~0 1)} is VALID [2020-07-10 15:26:20,689 INFO L280 TraceCheckUtils]: 8: Hoare triple {11610#(<= main_~x~0 1)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {11610#(<= main_~x~0 1)} is VALID [2020-07-10 15:26:20,690 INFO L280 TraceCheckUtils]: 9: Hoare triple {11610#(<= main_~x~0 1)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {11611#(<= main_~x~0 2)} is VALID [2020-07-10 15:26:20,691 INFO L280 TraceCheckUtils]: 10: Hoare triple {11611#(<= main_~x~0 2)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {11611#(<= main_~x~0 2)} is VALID [2020-07-10 15:26:20,692 INFO L280 TraceCheckUtils]: 11: Hoare triple {11611#(<= main_~x~0 2)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {11612#(<= main_~x~0 3)} is VALID [2020-07-10 15:26:20,693 INFO L280 TraceCheckUtils]: 12: Hoare triple {11612#(<= main_~x~0 3)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {11612#(<= main_~x~0 3)} is VALID [2020-07-10 15:26:20,694 INFO L280 TraceCheckUtils]: 13: Hoare triple {11612#(<= main_~x~0 3)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {11613#(<= main_~x~0 4)} is VALID [2020-07-10 15:26:20,695 INFO L280 TraceCheckUtils]: 14: Hoare triple {11613#(<= main_~x~0 4)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {11613#(<= main_~x~0 4)} is VALID [2020-07-10 15:26:20,696 INFO L280 TraceCheckUtils]: 15: Hoare triple {11613#(<= main_~x~0 4)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {11614#(<= main_~x~0 5)} is VALID [2020-07-10 15:26:20,697 INFO L280 TraceCheckUtils]: 16: Hoare triple {11614#(<= main_~x~0 5)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {11614#(<= main_~x~0 5)} is VALID [2020-07-10 15:26:20,698 INFO L280 TraceCheckUtils]: 17: Hoare triple {11614#(<= main_~x~0 5)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {11615#(<= main_~x~0 6)} is VALID [2020-07-10 15:26:20,699 INFO L280 TraceCheckUtils]: 18: Hoare triple {11615#(<= main_~x~0 6)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {11615#(<= main_~x~0 6)} is VALID [2020-07-10 15:26:20,700 INFO L280 TraceCheckUtils]: 19: Hoare triple {11615#(<= main_~x~0 6)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {11616#(<= main_~x~0 7)} is VALID [2020-07-10 15:26:20,701 INFO L280 TraceCheckUtils]: 20: Hoare triple {11616#(<= main_~x~0 7)} assume !(~x~0 < 100000); {11605#false} is VALID [2020-07-10 15:26:20,701 INFO L280 TraceCheckUtils]: 21: Hoare triple {11605#false} ~x~0 := 0; {11605#false} is VALID [2020-07-10 15:26:20,702 INFO L280 TraceCheckUtils]: 22: Hoare triple {11605#false} assume !(~x~0 < ~n~0); {11605#false} is VALID [2020-07-10 15:26:20,702 INFO L280 TraceCheckUtils]: 23: Hoare triple {11605#false} call ~#values~0.base, ~#values~0.offset := #Ultimate.allocOnStack(400000);havoc ~v~0;~v~0 := 0; {11605#false} is VALID [2020-07-10 15:26:20,702 INFO L280 TraceCheckUtils]: 24: Hoare triple {11605#false} assume !!(~v~0 < 100000);assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;call write~int(#t~nondet9, ~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4);havoc #t~nondet9; {11605#false} is VALID [2020-07-10 15:26:20,703 INFO L280 TraceCheckUtils]: 25: Hoare triple {11605#false} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {11605#false} is VALID [2020-07-10 15:26:20,703 INFO L280 TraceCheckUtils]: 26: Hoare triple {11605#false} assume !!(~v~0 < 100000);assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;call write~int(#t~nondet9, ~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4);havoc #t~nondet9; {11605#false} is VALID [2020-07-10 15:26:20,703 INFO L280 TraceCheckUtils]: 27: Hoare triple {11605#false} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {11605#false} is VALID [2020-07-10 15:26:20,703 INFO L280 TraceCheckUtils]: 28: Hoare triple {11605#false} assume !(~v~0 < 100000); {11605#false} is VALID [2020-07-10 15:26:20,704 INFO L280 TraceCheckUtils]: 29: Hoare triple {11605#false} ~v~0 := 0; {11605#false} is VALID [2020-07-10 15:26:20,704 INFO L280 TraceCheckUtils]: 30: Hoare triple {11605#false} assume !!(~v~0 < 100000);call #t~mem11 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {11605#false} is VALID [2020-07-10 15:26:20,704 INFO L263 TraceCheckUtils]: 31: Hoare triple {11605#false} call #t~ret12 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem11); {11604#true} is VALID [2020-07-10 15:26:20,705 INFO L280 TraceCheckUtils]: 32: Hoare triple {11604#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {11604#true} is VALID [2020-07-10 15:26:20,705 INFO L280 TraceCheckUtils]: 33: Hoare triple {11604#true} assume !(~i~0 < ~size); {11604#true} is VALID [2020-07-10 15:26:20,705 INFO L280 TraceCheckUtils]: 34: Hoare triple {11604#true} #res := 0; {11604#true} is VALID [2020-07-10 15:26:20,705 INFO L280 TraceCheckUtils]: 35: Hoare triple {11604#true} assume true; {11604#true} is VALID [2020-07-10 15:26:20,706 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {11604#true} {11605#false} #182#return; {11605#false} is VALID [2020-07-10 15:26:20,706 INFO L280 TraceCheckUtils]: 37: Hoare triple {11605#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {11605#false} is VALID [2020-07-10 15:26:20,706 INFO L280 TraceCheckUtils]: 38: Hoare triple {11605#false} assume 0 != #t~ret12;havoc #t~ret12;havoc #t~mem11;call #t~mem13 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {11605#false} is VALID [2020-07-10 15:26:20,707 INFO L263 TraceCheckUtils]: 39: Hoare triple {11605#false} call #t~ret14 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem13); {11634#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:26:20,707 INFO L280 TraceCheckUtils]: 40: Hoare triple {11634#(= |#memory_int| |old(#memory_int)|)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4);#res := 1 + ~size; {11604#true} is VALID [2020-07-10 15:26:20,707 INFO L280 TraceCheckUtils]: 41: Hoare triple {11604#true} assume true; {11604#true} is VALID [2020-07-10 15:26:20,708 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {11604#true} {11605#false} #184#return; {11605#false} is VALID [2020-07-10 15:26:20,708 INFO L280 TraceCheckUtils]: 43: Hoare triple {11605#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~n~0 := #t~ret14;havoc #t~mem13;havoc #t~ret14; {11605#false} is VALID [2020-07-10 15:26:20,708 INFO L280 TraceCheckUtils]: 44: Hoare triple {11605#false} ~x~0 := 0; {11605#false} is VALID [2020-07-10 15:26:20,708 INFO L280 TraceCheckUtils]: 45: Hoare triple {11605#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {11605#false} is VALID [2020-07-10 15:26:20,709 INFO L280 TraceCheckUtils]: 46: Hoare triple {11605#false} assume !(~y~0 < ~n~0); {11605#false} is VALID [2020-07-10 15:26:20,709 INFO L280 TraceCheckUtils]: 47: Hoare triple {11605#false} #t~post15 := ~x~0;~x~0 := 1 + #t~post15;havoc #t~post15; {11605#false} is VALID [2020-07-10 15:26:20,709 INFO L280 TraceCheckUtils]: 48: Hoare triple {11605#false} assume !(~x~0 < ~n~0); {11605#false} is VALID [2020-07-10 15:26:20,710 INFO L280 TraceCheckUtils]: 49: Hoare triple {11605#false} #t~post10 := ~v~0;~v~0 := 1 + #t~post10;havoc #t~post10; {11605#false} is VALID [2020-07-10 15:26:20,710 INFO L280 TraceCheckUtils]: 50: Hoare triple {11605#false} assume !!(~v~0 < 100000);call #t~mem11 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {11605#false} is VALID [2020-07-10 15:26:20,710 INFO L263 TraceCheckUtils]: 51: Hoare triple {11605#false} call #t~ret12 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem11); {11604#true} is VALID [2020-07-10 15:26:20,710 INFO L280 TraceCheckUtils]: 52: Hoare triple {11604#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {11604#true} is VALID [2020-07-10 15:26:20,711 INFO L280 TraceCheckUtils]: 53: Hoare triple {11604#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {11604#true} is VALID [2020-07-10 15:26:20,711 INFO L280 TraceCheckUtils]: 54: Hoare triple {11604#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {11604#true} is VALID [2020-07-10 15:26:20,711 INFO L280 TraceCheckUtils]: 55: Hoare triple {11604#true} assume true; {11604#true} is VALID [2020-07-10 15:26:20,712 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {11604#true} {11605#false} #182#return; {11605#false} is VALID [2020-07-10 15:26:20,712 INFO L280 TraceCheckUtils]: 57: Hoare triple {11605#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {11605#false} is VALID [2020-07-10 15:26:20,712 INFO L280 TraceCheckUtils]: 58: Hoare triple {11605#false} assume 0 != #t~ret12;havoc #t~ret12;havoc #t~mem11;call #t~mem13 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {11605#false} is VALID [2020-07-10 15:26:20,712 INFO L263 TraceCheckUtils]: 59: Hoare triple {11605#false} call #t~ret14 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem13); {11634#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:26:20,713 INFO L280 TraceCheckUtils]: 60: Hoare triple {11634#(= |#memory_int| |old(#memory_int)|)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4);#res := 1 + ~size; {11604#true} is VALID [2020-07-10 15:26:20,713 INFO L280 TraceCheckUtils]: 61: Hoare triple {11604#true} assume true; {11604#true} is VALID [2020-07-10 15:26:20,713 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {11604#true} {11605#false} #184#return; {11605#false} is VALID [2020-07-10 15:26:20,713 INFO L280 TraceCheckUtils]: 63: Hoare triple {11605#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~n~0 := #t~ret14;havoc #t~mem13;havoc #t~ret14; {11605#false} is VALID [2020-07-10 15:26:20,714 INFO L280 TraceCheckUtils]: 64: Hoare triple {11605#false} ~x~0 := 0; {11605#false} is VALID [2020-07-10 15:26:20,714 INFO L280 TraceCheckUtils]: 65: Hoare triple {11605#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {11605#false} is VALID [2020-07-10 15:26:20,714 INFO L280 TraceCheckUtils]: 66: Hoare triple {11605#false} assume !!(~y~0 < ~n~0);call #t~mem17 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem18 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {11605#false} is VALID [2020-07-10 15:26:20,715 INFO L263 TraceCheckUtils]: 67: Hoare triple {11605#false} call __VERIFIER_assert((if #t~mem17 != #t~mem18 then 1 else 0)); {11605#false} is VALID [2020-07-10 15:26:20,715 INFO L280 TraceCheckUtils]: 68: Hoare triple {11605#false} ~cond := #in~cond; {11605#false} is VALID [2020-07-10 15:26:20,715 INFO L280 TraceCheckUtils]: 69: Hoare triple {11605#false} assume 0 == ~cond; {11605#false} is VALID [2020-07-10 15:26:20,715 INFO L280 TraceCheckUtils]: 70: Hoare triple {11605#false} assume !false; {11605#false} is VALID [2020-07-10 15:26:20,723 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2020-07-10 15:26:20,724 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700479511] [2020-07-10 15:26:20,724 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331329672] [2020-07-10 15:26:20,724 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:20,847 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 15:26:20,848 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:26:20,850 INFO L264 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-10 15:26:20,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:20,875 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:26:21,049 INFO L263 TraceCheckUtils]: 0: Hoare triple {11604#true} call ULTIMATE.init(); {11604#true} is VALID [2020-07-10 15:26:21,050 INFO L280 TraceCheckUtils]: 1: Hoare triple {11604#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {11604#true} is VALID [2020-07-10 15:26:21,050 INFO L280 TraceCheckUtils]: 2: Hoare triple {11604#true} assume true; {11604#true} is VALID [2020-07-10 15:26:21,050 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {11604#true} {11604#true} #176#return; {11604#true} is VALID [2020-07-10 15:26:21,051 INFO L263 TraceCheckUtils]: 4: Hoare triple {11604#true} call #t~ret23 := main(); {11604#true} is VALID [2020-07-10 15:26:21,053 INFO L280 TraceCheckUtils]: 5: Hoare triple {11604#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.allocOnStack(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {11653#(<= main_~x~0 0)} is VALID [2020-07-10 15:26:21,054 INFO L280 TraceCheckUtils]: 6: Hoare triple {11653#(<= main_~x~0 0)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {11653#(<= main_~x~0 0)} is VALID [2020-07-10 15:26:21,055 INFO L280 TraceCheckUtils]: 7: Hoare triple {11653#(<= main_~x~0 0)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {11610#(<= main_~x~0 1)} is VALID [2020-07-10 15:26:21,056 INFO L280 TraceCheckUtils]: 8: Hoare triple {11610#(<= main_~x~0 1)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {11610#(<= main_~x~0 1)} is VALID [2020-07-10 15:26:21,057 INFO L280 TraceCheckUtils]: 9: Hoare triple {11610#(<= main_~x~0 1)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {11611#(<= main_~x~0 2)} is VALID [2020-07-10 15:26:21,058 INFO L280 TraceCheckUtils]: 10: Hoare triple {11611#(<= main_~x~0 2)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {11611#(<= main_~x~0 2)} is VALID [2020-07-10 15:26:21,060 INFO L280 TraceCheckUtils]: 11: Hoare triple {11611#(<= main_~x~0 2)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {11612#(<= main_~x~0 3)} is VALID [2020-07-10 15:26:21,060 INFO L280 TraceCheckUtils]: 12: Hoare triple {11612#(<= main_~x~0 3)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {11612#(<= main_~x~0 3)} is VALID [2020-07-10 15:26:21,062 INFO L280 TraceCheckUtils]: 13: Hoare triple {11612#(<= main_~x~0 3)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {11613#(<= main_~x~0 4)} is VALID [2020-07-10 15:26:21,064 INFO L280 TraceCheckUtils]: 14: Hoare triple {11613#(<= main_~x~0 4)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {11613#(<= main_~x~0 4)} is VALID [2020-07-10 15:26:21,065 INFO L280 TraceCheckUtils]: 15: Hoare triple {11613#(<= main_~x~0 4)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {11614#(<= main_~x~0 5)} is VALID [2020-07-10 15:26:21,066 INFO L280 TraceCheckUtils]: 16: Hoare triple {11614#(<= main_~x~0 5)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {11614#(<= main_~x~0 5)} is VALID [2020-07-10 15:26:21,067 INFO L280 TraceCheckUtils]: 17: Hoare triple {11614#(<= main_~x~0 5)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {11615#(<= main_~x~0 6)} is VALID [2020-07-10 15:26:21,068 INFO L280 TraceCheckUtils]: 18: Hoare triple {11615#(<= main_~x~0 6)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {11615#(<= main_~x~0 6)} is VALID [2020-07-10 15:26:21,069 INFO L280 TraceCheckUtils]: 19: Hoare triple {11615#(<= main_~x~0 6)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {11616#(<= main_~x~0 7)} is VALID [2020-07-10 15:26:21,070 INFO L280 TraceCheckUtils]: 20: Hoare triple {11616#(<= main_~x~0 7)} assume !(~x~0 < 100000); {11605#false} is VALID [2020-07-10 15:26:21,071 INFO L280 TraceCheckUtils]: 21: Hoare triple {11605#false} ~x~0 := 0; {11605#false} is VALID [2020-07-10 15:26:21,071 INFO L280 TraceCheckUtils]: 22: Hoare triple {11605#false} assume !(~x~0 < ~n~0); {11605#false} is VALID [2020-07-10 15:26:21,071 INFO L280 TraceCheckUtils]: 23: Hoare triple {11605#false} call ~#values~0.base, ~#values~0.offset := #Ultimate.allocOnStack(400000);havoc ~v~0;~v~0 := 0; {11605#false} is VALID [2020-07-10 15:26:21,072 INFO L280 TraceCheckUtils]: 24: Hoare triple {11605#false} assume !!(~v~0 < 100000);assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;call write~int(#t~nondet9, ~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4);havoc #t~nondet9; {11605#false} is VALID [2020-07-10 15:26:21,072 INFO L280 TraceCheckUtils]: 25: Hoare triple {11605#false} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {11605#false} is VALID [2020-07-10 15:26:21,072 INFO L280 TraceCheckUtils]: 26: Hoare triple {11605#false} assume !!(~v~0 < 100000);assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;call write~int(#t~nondet9, ~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4);havoc #t~nondet9; {11605#false} is VALID [2020-07-10 15:26:21,073 INFO L280 TraceCheckUtils]: 27: Hoare triple {11605#false} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {11605#false} is VALID [2020-07-10 15:26:21,073 INFO L280 TraceCheckUtils]: 28: Hoare triple {11605#false} assume !(~v~0 < 100000); {11605#false} is VALID [2020-07-10 15:26:21,073 INFO L280 TraceCheckUtils]: 29: Hoare triple {11605#false} ~v~0 := 0; {11605#false} is VALID [2020-07-10 15:26:21,074 INFO L280 TraceCheckUtils]: 30: Hoare triple {11605#false} assume !!(~v~0 < 100000);call #t~mem11 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {11605#false} is VALID [2020-07-10 15:26:21,074 INFO L263 TraceCheckUtils]: 31: Hoare triple {11605#false} call #t~ret12 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem11); {11605#false} is VALID [2020-07-10 15:26:21,074 INFO L280 TraceCheckUtils]: 32: Hoare triple {11605#false} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {11605#false} is VALID [2020-07-10 15:26:21,075 INFO L280 TraceCheckUtils]: 33: Hoare triple {11605#false} assume !(~i~0 < ~size); {11605#false} is VALID [2020-07-10 15:26:21,075 INFO L280 TraceCheckUtils]: 34: Hoare triple {11605#false} #res := 0; {11605#false} is VALID [2020-07-10 15:26:21,075 INFO L280 TraceCheckUtils]: 35: Hoare triple {11605#false} assume true; {11605#false} is VALID [2020-07-10 15:26:21,076 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {11605#false} {11605#false} #182#return; {11605#false} is VALID [2020-07-10 15:26:21,076 INFO L280 TraceCheckUtils]: 37: Hoare triple {11605#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {11605#false} is VALID [2020-07-10 15:26:21,076 INFO L280 TraceCheckUtils]: 38: Hoare triple {11605#false} assume 0 != #t~ret12;havoc #t~ret12;havoc #t~mem11;call #t~mem13 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {11605#false} is VALID [2020-07-10 15:26:21,076 INFO L263 TraceCheckUtils]: 39: Hoare triple {11605#false} call #t~ret14 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem13); {11605#false} is VALID [2020-07-10 15:26:21,077 INFO L280 TraceCheckUtils]: 40: Hoare triple {11605#false} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4);#res := 1 + ~size; {11605#false} is VALID [2020-07-10 15:26:21,077 INFO L280 TraceCheckUtils]: 41: Hoare triple {11605#false} assume true; {11605#false} is VALID [2020-07-10 15:26:21,077 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {11605#false} {11605#false} #184#return; {11605#false} is VALID [2020-07-10 15:26:21,078 INFO L280 TraceCheckUtils]: 43: Hoare triple {11605#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~n~0 := #t~ret14;havoc #t~mem13;havoc #t~ret14; {11605#false} is VALID [2020-07-10 15:26:21,078 INFO L280 TraceCheckUtils]: 44: Hoare triple {11605#false} ~x~0 := 0; {11605#false} is VALID [2020-07-10 15:26:21,078 INFO L280 TraceCheckUtils]: 45: Hoare triple {11605#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {11605#false} is VALID [2020-07-10 15:26:21,079 INFO L280 TraceCheckUtils]: 46: Hoare triple {11605#false} assume !(~y~0 < ~n~0); {11605#false} is VALID [2020-07-10 15:26:21,079 INFO L280 TraceCheckUtils]: 47: Hoare triple {11605#false} #t~post15 := ~x~0;~x~0 := 1 + #t~post15;havoc #t~post15; {11605#false} is VALID [2020-07-10 15:26:21,079 INFO L280 TraceCheckUtils]: 48: Hoare triple {11605#false} assume !(~x~0 < ~n~0); {11605#false} is VALID [2020-07-10 15:26:21,080 INFO L280 TraceCheckUtils]: 49: Hoare triple {11605#false} #t~post10 := ~v~0;~v~0 := 1 + #t~post10;havoc #t~post10; {11605#false} is VALID [2020-07-10 15:26:21,080 INFO L280 TraceCheckUtils]: 50: Hoare triple {11605#false} assume !!(~v~0 < 100000);call #t~mem11 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {11605#false} is VALID [2020-07-10 15:26:21,080 INFO L263 TraceCheckUtils]: 51: Hoare triple {11605#false} call #t~ret12 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem11); {11605#false} is VALID [2020-07-10 15:26:21,081 INFO L280 TraceCheckUtils]: 52: Hoare triple {11605#false} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {11605#false} is VALID [2020-07-10 15:26:21,081 INFO L280 TraceCheckUtils]: 53: Hoare triple {11605#false} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {11605#false} is VALID [2020-07-10 15:26:21,081 INFO L280 TraceCheckUtils]: 54: Hoare triple {11605#false} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {11605#false} is VALID [2020-07-10 15:26:21,082 INFO L280 TraceCheckUtils]: 55: Hoare triple {11605#false} assume true; {11605#false} is VALID [2020-07-10 15:26:21,082 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {11605#false} {11605#false} #182#return; {11605#false} is VALID [2020-07-10 15:26:21,082 INFO L280 TraceCheckUtils]: 57: Hoare triple {11605#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {11605#false} is VALID [2020-07-10 15:26:21,083 INFO L280 TraceCheckUtils]: 58: Hoare triple {11605#false} assume 0 != #t~ret12;havoc #t~ret12;havoc #t~mem11;call #t~mem13 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {11605#false} is VALID [2020-07-10 15:26:21,083 INFO L263 TraceCheckUtils]: 59: Hoare triple {11605#false} call #t~ret14 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem13); {11605#false} is VALID [2020-07-10 15:26:21,083 INFO L280 TraceCheckUtils]: 60: Hoare triple {11605#false} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4);#res := 1 + ~size; {11605#false} is VALID [2020-07-10 15:26:21,083 INFO L280 TraceCheckUtils]: 61: Hoare triple {11605#false} assume true; {11605#false} is VALID [2020-07-10 15:26:21,084 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {11605#false} {11605#false} #184#return; {11605#false} is VALID [2020-07-10 15:26:21,084 INFO L280 TraceCheckUtils]: 63: Hoare triple {11605#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~n~0 := #t~ret14;havoc #t~mem13;havoc #t~ret14; {11605#false} is VALID [2020-07-10 15:26:21,084 INFO L280 TraceCheckUtils]: 64: Hoare triple {11605#false} ~x~0 := 0; {11605#false} is VALID [2020-07-10 15:26:21,085 INFO L280 TraceCheckUtils]: 65: Hoare triple {11605#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {11605#false} is VALID [2020-07-10 15:26:21,085 INFO L280 TraceCheckUtils]: 66: Hoare triple {11605#false} assume !!(~y~0 < ~n~0);call #t~mem17 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem18 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {11605#false} is VALID [2020-07-10 15:26:21,085 INFO L263 TraceCheckUtils]: 67: Hoare triple {11605#false} call __VERIFIER_assert((if #t~mem17 != #t~mem18 then 1 else 0)); {11605#false} is VALID [2020-07-10 15:26:21,086 INFO L280 TraceCheckUtils]: 68: Hoare triple {11605#false} ~cond := #in~cond; {11605#false} is VALID [2020-07-10 15:26:21,086 INFO L280 TraceCheckUtils]: 69: Hoare triple {11605#false} assume 0 == ~cond; {11605#false} is VALID [2020-07-10 15:26:21,086 INFO L280 TraceCheckUtils]: 70: Hoare triple {11605#false} assume !false; {11605#false} is VALID [2020-07-10 15:26:21,093 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2020-07-10 15:26:21,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:26:21,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 13 [2020-07-10 15:26:21,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924645318] [2020-07-10 15:26:21,095 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 71 [2020-07-10 15:26:21,098 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:21,098 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-10 15:26:21,214 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:21,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-10 15:26:21,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:21,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-10 15:26:21,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2020-07-10 15:26:21,216 INFO L87 Difference]: Start difference. First operand 98 states and 120 transitions. Second operand 13 states. [2020-07-10 15:26:24,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:24,079 INFO L93 Difference]: Finished difference Result 443 states and 605 transitions. [2020-07-10 15:26:24,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-10 15:26:24,079 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 71 [2020-07-10 15:26:24,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:24,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 15:26:24,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 370 transitions. [2020-07-10 15:26:24,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 15:26:24,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 370 transitions. [2020-07-10 15:26:24,088 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 370 transitions. [2020-07-10 15:26:24,570 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 370 edges. 370 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:24,592 INFO L225 Difference]: With dead ends: 443 [2020-07-10 15:26:24,592 INFO L226 Difference]: Without dead ends: 366 [2020-07-10 15:26:24,595 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2020-07-10 15:26:24,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2020-07-10 15:26:24,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 100. [2020-07-10 15:26:24,761 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:24,761 INFO L82 GeneralOperation]: Start isEquivalent. First operand 366 states. Second operand 100 states. [2020-07-10 15:26:24,761 INFO L74 IsIncluded]: Start isIncluded. First operand 366 states. Second operand 100 states. [2020-07-10 15:26:24,762 INFO L87 Difference]: Start difference. First operand 366 states. Second operand 100 states. [2020-07-10 15:26:24,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:24,784 INFO L93 Difference]: Finished difference Result 366 states and 506 transitions. [2020-07-10 15:26:24,784 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 506 transitions. [2020-07-10 15:26:24,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:24,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:24,788 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 366 states. [2020-07-10 15:26:24,788 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 366 states. [2020-07-10 15:26:24,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:24,815 INFO L93 Difference]: Finished difference Result 366 states and 506 transitions. [2020-07-10 15:26:24,815 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 506 transitions. [2020-07-10 15:26:24,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:24,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:24,818 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:24,818 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:24,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-07-10 15:26:24,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 122 transitions. [2020-07-10 15:26:24,822 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 122 transitions. Word has length 71 [2020-07-10 15:26:24,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:24,822 INFO L479 AbstractCegarLoop]: Abstraction has 100 states and 122 transitions. [2020-07-10 15:26:24,822 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-10 15:26:24,822 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 122 transitions. [2020-07-10 15:26:24,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-07-10 15:26:24,824 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:24,824 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2020-07-10 15:26:25,038 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-07-10 15:26:25,039 INFO L427 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:25,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:25,039 INFO L82 PathProgramCache]: Analyzing trace with hash -540795311, now seen corresponding path program 3 times [2020-07-10 15:26:25,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:25,040 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407982357] [2020-07-10 15:26:25,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:25,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:25,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:25,195 INFO L280 TraceCheckUtils]: 0: Hoare triple {13388#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {13358#true} is VALID [2020-07-10 15:26:25,195 INFO L280 TraceCheckUtils]: 1: Hoare triple {13358#true} assume true; {13358#true} is VALID [2020-07-10 15:26:25,196 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {13358#true} {13358#true} #176#return; {13358#true} is VALID [2020-07-10 15:26:25,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:25,200 INFO L280 TraceCheckUtils]: 0: Hoare triple {13358#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {13358#true} is VALID [2020-07-10 15:26:25,200 INFO L280 TraceCheckUtils]: 1: Hoare triple {13358#true} assume !(~i~0 < ~size); {13358#true} is VALID [2020-07-10 15:26:25,201 INFO L280 TraceCheckUtils]: 2: Hoare triple {13358#true} #res := 0; {13358#true} is VALID [2020-07-10 15:26:25,201 INFO L280 TraceCheckUtils]: 3: Hoare triple {13358#true} assume true; {13358#true} is VALID [2020-07-10 15:26:25,201 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {13358#true} {13359#false} #182#return; {13359#false} is VALID [2020-07-10 15:26:25,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:25,232 INFO L280 TraceCheckUtils]: 0: Hoare triple {13389#(= |#memory_int| |old(#memory_int)|)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4);#res := 1 + ~size; {13358#true} is VALID [2020-07-10 15:26:25,232 INFO L280 TraceCheckUtils]: 1: Hoare triple {13358#true} assume true; {13358#true} is VALID [2020-07-10 15:26:25,233 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {13358#true} {13359#false} #184#return; {13359#false} is VALID [2020-07-10 15:26:25,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:25,238 INFO L280 TraceCheckUtils]: 0: Hoare triple {13358#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {13358#true} is VALID [2020-07-10 15:26:25,239 INFO L280 TraceCheckUtils]: 1: Hoare triple {13358#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {13358#true} is VALID [2020-07-10 15:26:25,239 INFO L280 TraceCheckUtils]: 2: Hoare triple {13358#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {13358#true} is VALID [2020-07-10 15:26:25,239 INFO L280 TraceCheckUtils]: 3: Hoare triple {13358#true} assume true; {13358#true} is VALID [2020-07-10 15:26:25,239 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {13358#true} {13359#false} #182#return; {13359#false} is VALID [2020-07-10 15:26:25,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:25,244 INFO L280 TraceCheckUtils]: 0: Hoare triple {13389#(= |#memory_int| |old(#memory_int)|)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4);#res := 1 + ~size; {13358#true} is VALID [2020-07-10 15:26:25,244 INFO L280 TraceCheckUtils]: 1: Hoare triple {13358#true} assume true; {13358#true} is VALID [2020-07-10 15:26:25,244 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {13358#true} {13359#false} #184#return; {13359#false} is VALID [2020-07-10 15:26:25,245 INFO L263 TraceCheckUtils]: 0: Hoare triple {13358#true} call ULTIMATE.init(); {13388#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:26:25,245 INFO L280 TraceCheckUtils]: 1: Hoare triple {13388#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {13358#true} is VALID [2020-07-10 15:26:25,246 INFO L280 TraceCheckUtils]: 2: Hoare triple {13358#true} assume true; {13358#true} is VALID [2020-07-10 15:26:25,246 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {13358#true} {13358#true} #176#return; {13358#true} is VALID [2020-07-10 15:26:25,246 INFO L263 TraceCheckUtils]: 4: Hoare triple {13358#true} call #t~ret23 := main(); {13358#true} is VALID [2020-07-10 15:26:25,247 INFO L280 TraceCheckUtils]: 5: Hoare triple {13358#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.allocOnStack(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {13363#(= 0 main_~x~0)} is VALID [2020-07-10 15:26:25,248 INFO L280 TraceCheckUtils]: 6: Hoare triple {13363#(= 0 main_~x~0)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {13363#(= 0 main_~x~0)} is VALID [2020-07-10 15:26:25,249 INFO L280 TraceCheckUtils]: 7: Hoare triple {13363#(= 0 main_~x~0)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {13364#(<= main_~x~0 1)} is VALID [2020-07-10 15:26:25,250 INFO L280 TraceCheckUtils]: 8: Hoare triple {13364#(<= main_~x~0 1)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {13364#(<= main_~x~0 1)} is VALID [2020-07-10 15:26:25,251 INFO L280 TraceCheckUtils]: 9: Hoare triple {13364#(<= main_~x~0 1)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {13365#(<= main_~x~0 2)} is VALID [2020-07-10 15:26:25,252 INFO L280 TraceCheckUtils]: 10: Hoare triple {13365#(<= main_~x~0 2)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {13365#(<= main_~x~0 2)} is VALID [2020-07-10 15:26:25,253 INFO L280 TraceCheckUtils]: 11: Hoare triple {13365#(<= main_~x~0 2)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {13366#(<= main_~x~0 3)} is VALID [2020-07-10 15:26:25,254 INFO L280 TraceCheckUtils]: 12: Hoare triple {13366#(<= main_~x~0 3)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {13366#(<= main_~x~0 3)} is VALID [2020-07-10 15:26:25,255 INFO L280 TraceCheckUtils]: 13: Hoare triple {13366#(<= main_~x~0 3)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {13367#(<= main_~x~0 4)} is VALID [2020-07-10 15:26:25,255 INFO L280 TraceCheckUtils]: 14: Hoare triple {13367#(<= main_~x~0 4)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {13367#(<= main_~x~0 4)} is VALID [2020-07-10 15:26:25,256 INFO L280 TraceCheckUtils]: 15: Hoare triple {13367#(<= main_~x~0 4)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {13368#(<= main_~x~0 5)} is VALID [2020-07-10 15:26:25,256 INFO L280 TraceCheckUtils]: 16: Hoare triple {13368#(<= main_~x~0 5)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {13368#(<= main_~x~0 5)} is VALID [2020-07-10 15:26:25,257 INFO L280 TraceCheckUtils]: 17: Hoare triple {13368#(<= main_~x~0 5)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {13369#(<= main_~x~0 6)} is VALID [2020-07-10 15:26:25,258 INFO L280 TraceCheckUtils]: 18: Hoare triple {13369#(<= main_~x~0 6)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {13369#(<= main_~x~0 6)} is VALID [2020-07-10 15:26:25,258 INFO L280 TraceCheckUtils]: 19: Hoare triple {13369#(<= main_~x~0 6)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {13370#(<= main_~x~0 7)} is VALID [2020-07-10 15:26:25,259 INFO L280 TraceCheckUtils]: 20: Hoare triple {13370#(<= main_~x~0 7)} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {13370#(<= main_~x~0 7)} is VALID [2020-07-10 15:26:25,260 INFO L280 TraceCheckUtils]: 21: Hoare triple {13370#(<= main_~x~0 7)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {13371#(<= main_~x~0 8)} is VALID [2020-07-10 15:26:25,260 INFO L280 TraceCheckUtils]: 22: Hoare triple {13371#(<= main_~x~0 8)} assume !(~x~0 < 100000); {13359#false} is VALID [2020-07-10 15:26:25,261 INFO L280 TraceCheckUtils]: 23: Hoare triple {13359#false} ~x~0 := 0; {13359#false} is VALID [2020-07-10 15:26:25,261 INFO L280 TraceCheckUtils]: 24: Hoare triple {13359#false} assume !(~x~0 < ~n~0); {13359#false} is VALID [2020-07-10 15:26:25,261 INFO L280 TraceCheckUtils]: 25: Hoare triple {13359#false} call ~#values~0.base, ~#values~0.offset := #Ultimate.allocOnStack(400000);havoc ~v~0;~v~0 := 0; {13359#false} is VALID [2020-07-10 15:26:25,261 INFO L280 TraceCheckUtils]: 26: Hoare triple {13359#false} assume !!(~v~0 < 100000);assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;call write~int(#t~nondet9, ~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4);havoc #t~nondet9; {13359#false} is VALID [2020-07-10 15:26:25,261 INFO L280 TraceCheckUtils]: 27: Hoare triple {13359#false} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {13359#false} is VALID [2020-07-10 15:26:25,262 INFO L280 TraceCheckUtils]: 28: Hoare triple {13359#false} assume !!(~v~0 < 100000);assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;call write~int(#t~nondet9, ~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4);havoc #t~nondet9; {13359#false} is VALID [2020-07-10 15:26:25,262 INFO L280 TraceCheckUtils]: 29: Hoare triple {13359#false} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {13359#false} is VALID [2020-07-10 15:26:25,262 INFO L280 TraceCheckUtils]: 30: Hoare triple {13359#false} assume !(~v~0 < 100000); {13359#false} is VALID [2020-07-10 15:26:25,262 INFO L280 TraceCheckUtils]: 31: Hoare triple {13359#false} ~v~0 := 0; {13359#false} is VALID [2020-07-10 15:26:25,262 INFO L280 TraceCheckUtils]: 32: Hoare triple {13359#false} assume !!(~v~0 < 100000);call #t~mem11 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {13359#false} is VALID [2020-07-10 15:26:25,262 INFO L263 TraceCheckUtils]: 33: Hoare triple {13359#false} call #t~ret12 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem11); {13358#true} is VALID [2020-07-10 15:26:25,263 INFO L280 TraceCheckUtils]: 34: Hoare triple {13358#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {13358#true} is VALID [2020-07-10 15:26:25,263 INFO L280 TraceCheckUtils]: 35: Hoare triple {13358#true} assume !(~i~0 < ~size); {13358#true} is VALID [2020-07-10 15:26:25,263 INFO L280 TraceCheckUtils]: 36: Hoare triple {13358#true} #res := 0; {13358#true} is VALID [2020-07-10 15:26:25,263 INFO L280 TraceCheckUtils]: 37: Hoare triple {13358#true} assume true; {13358#true} is VALID [2020-07-10 15:26:25,263 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {13358#true} {13359#false} #182#return; {13359#false} is VALID [2020-07-10 15:26:25,263 INFO L280 TraceCheckUtils]: 39: Hoare triple {13359#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {13359#false} is VALID [2020-07-10 15:26:25,264 INFO L280 TraceCheckUtils]: 40: Hoare triple {13359#false} assume 0 != #t~ret12;havoc #t~ret12;havoc #t~mem11;call #t~mem13 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {13359#false} is VALID [2020-07-10 15:26:25,264 INFO L263 TraceCheckUtils]: 41: Hoare triple {13359#false} call #t~ret14 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem13); {13389#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:26:25,264 INFO L280 TraceCheckUtils]: 42: Hoare triple {13389#(= |#memory_int| |old(#memory_int)|)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4);#res := 1 + ~size; {13358#true} is VALID [2020-07-10 15:26:25,264 INFO L280 TraceCheckUtils]: 43: Hoare triple {13358#true} assume true; {13358#true} is VALID [2020-07-10 15:26:25,264 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {13358#true} {13359#false} #184#return; {13359#false} is VALID [2020-07-10 15:26:25,264 INFO L280 TraceCheckUtils]: 45: Hoare triple {13359#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~n~0 := #t~ret14;havoc #t~mem13;havoc #t~ret14; {13359#false} is VALID [2020-07-10 15:26:25,265 INFO L280 TraceCheckUtils]: 46: Hoare triple {13359#false} ~x~0 := 0; {13359#false} is VALID [2020-07-10 15:26:25,265 INFO L280 TraceCheckUtils]: 47: Hoare triple {13359#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {13359#false} is VALID [2020-07-10 15:26:25,265 INFO L280 TraceCheckUtils]: 48: Hoare triple {13359#false} assume !(~y~0 < ~n~0); {13359#false} is VALID [2020-07-10 15:26:25,265 INFO L280 TraceCheckUtils]: 49: Hoare triple {13359#false} #t~post15 := ~x~0;~x~0 := 1 + #t~post15;havoc #t~post15; {13359#false} is VALID [2020-07-10 15:26:25,265 INFO L280 TraceCheckUtils]: 50: Hoare triple {13359#false} assume !(~x~0 < ~n~0); {13359#false} is VALID [2020-07-10 15:26:25,265 INFO L280 TraceCheckUtils]: 51: Hoare triple {13359#false} #t~post10 := ~v~0;~v~0 := 1 + #t~post10;havoc #t~post10; {13359#false} is VALID [2020-07-10 15:26:25,266 INFO L280 TraceCheckUtils]: 52: Hoare triple {13359#false} assume !!(~v~0 < 100000);call #t~mem11 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {13359#false} is VALID [2020-07-10 15:26:25,266 INFO L263 TraceCheckUtils]: 53: Hoare triple {13359#false} call #t~ret12 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem11); {13358#true} is VALID [2020-07-10 15:26:25,266 INFO L280 TraceCheckUtils]: 54: Hoare triple {13358#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {13358#true} is VALID [2020-07-10 15:26:25,266 INFO L280 TraceCheckUtils]: 55: Hoare triple {13358#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {13358#true} is VALID [2020-07-10 15:26:25,266 INFO L280 TraceCheckUtils]: 56: Hoare triple {13358#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {13358#true} is VALID [2020-07-10 15:26:25,267 INFO L280 TraceCheckUtils]: 57: Hoare triple {13358#true} assume true; {13358#true} is VALID [2020-07-10 15:26:25,267 INFO L275 TraceCheckUtils]: 58: Hoare quadruple {13358#true} {13359#false} #182#return; {13359#false} is VALID [2020-07-10 15:26:25,267 INFO L280 TraceCheckUtils]: 59: Hoare triple {13359#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {13359#false} is VALID [2020-07-10 15:26:25,267 INFO L280 TraceCheckUtils]: 60: Hoare triple {13359#false} assume 0 != #t~ret12;havoc #t~ret12;havoc #t~mem11;call #t~mem13 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {13359#false} is VALID [2020-07-10 15:26:25,267 INFO L263 TraceCheckUtils]: 61: Hoare triple {13359#false} call #t~ret14 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem13); {13389#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:26:25,267 INFO L280 TraceCheckUtils]: 62: Hoare triple {13389#(= |#memory_int| |old(#memory_int)|)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4);#res := 1 + ~size; {13358#true} is VALID [2020-07-10 15:26:25,268 INFO L280 TraceCheckUtils]: 63: Hoare triple {13358#true} assume true; {13358#true} is VALID [2020-07-10 15:26:25,268 INFO L275 TraceCheckUtils]: 64: Hoare quadruple {13358#true} {13359#false} #184#return; {13359#false} is VALID [2020-07-10 15:26:25,268 INFO L280 TraceCheckUtils]: 65: Hoare triple {13359#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~n~0 := #t~ret14;havoc #t~mem13;havoc #t~ret14; {13359#false} is VALID [2020-07-10 15:26:25,268 INFO L280 TraceCheckUtils]: 66: Hoare triple {13359#false} ~x~0 := 0; {13359#false} is VALID [2020-07-10 15:26:25,268 INFO L280 TraceCheckUtils]: 67: Hoare triple {13359#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {13359#false} is VALID [2020-07-10 15:26:25,268 INFO L280 TraceCheckUtils]: 68: Hoare triple {13359#false} assume !!(~y~0 < ~n~0);call #t~mem17 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem18 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {13359#false} is VALID [2020-07-10 15:26:25,269 INFO L263 TraceCheckUtils]: 69: Hoare triple {13359#false} call __VERIFIER_assert((if #t~mem17 != #t~mem18 then 1 else 0)); {13359#false} is VALID [2020-07-10 15:26:25,269 INFO L280 TraceCheckUtils]: 70: Hoare triple {13359#false} ~cond := #in~cond; {13359#false} is VALID [2020-07-10 15:26:25,269 INFO L280 TraceCheckUtils]: 71: Hoare triple {13359#false} assume 0 == ~cond; {13359#false} is VALID [2020-07-10 15:26:25,269 INFO L280 TraceCheckUtils]: 72: Hoare triple {13359#false} assume !false; {13359#false} is VALID [2020-07-10 15:26:25,272 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2020-07-10 15:26:25,273 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407982357] [2020-07-10 15:26:25,273 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714615133] [2020-07-10 15:26:25,273 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:25,344 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-07-10 15:26:25,344 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:26:25,346 INFO L264 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-10 15:26:25,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:25,366 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:26:25,460 INFO L263 TraceCheckUtils]: 0: Hoare triple {13358#true} call ULTIMATE.init(); {13358#true} is VALID [2020-07-10 15:26:25,461 INFO L280 TraceCheckUtils]: 1: Hoare triple {13358#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {13358#true} is VALID [2020-07-10 15:26:25,461 INFO L280 TraceCheckUtils]: 2: Hoare triple {13358#true} assume true; {13358#true} is VALID [2020-07-10 15:26:25,461 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {13358#true} {13358#true} #176#return; {13358#true} is VALID [2020-07-10 15:26:25,461 INFO L263 TraceCheckUtils]: 4: Hoare triple {13358#true} call #t~ret23 := main(); {13358#true} is VALID [2020-07-10 15:26:25,462 INFO L280 TraceCheckUtils]: 5: Hoare triple {13358#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.allocOnStack(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {13358#true} is VALID [2020-07-10 15:26:25,462 INFO L280 TraceCheckUtils]: 6: Hoare triple {13358#true} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {13358#true} is VALID [2020-07-10 15:26:25,462 INFO L280 TraceCheckUtils]: 7: Hoare triple {13358#true} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {13358#true} is VALID [2020-07-10 15:26:25,462 INFO L280 TraceCheckUtils]: 8: Hoare triple {13358#true} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {13358#true} is VALID [2020-07-10 15:26:25,463 INFO L280 TraceCheckUtils]: 9: Hoare triple {13358#true} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {13358#true} is VALID [2020-07-10 15:26:25,463 INFO L280 TraceCheckUtils]: 10: Hoare triple {13358#true} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {13358#true} is VALID [2020-07-10 15:26:25,463 INFO L280 TraceCheckUtils]: 11: Hoare triple {13358#true} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {13358#true} is VALID [2020-07-10 15:26:25,463 INFO L280 TraceCheckUtils]: 12: Hoare triple {13358#true} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {13358#true} is VALID [2020-07-10 15:26:25,464 INFO L280 TraceCheckUtils]: 13: Hoare triple {13358#true} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {13358#true} is VALID [2020-07-10 15:26:25,464 INFO L280 TraceCheckUtils]: 14: Hoare triple {13358#true} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {13358#true} is VALID [2020-07-10 15:26:25,464 INFO L280 TraceCheckUtils]: 15: Hoare triple {13358#true} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {13358#true} is VALID [2020-07-10 15:26:25,464 INFO L280 TraceCheckUtils]: 16: Hoare triple {13358#true} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {13358#true} is VALID [2020-07-10 15:26:25,464 INFO L280 TraceCheckUtils]: 17: Hoare triple {13358#true} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {13358#true} is VALID [2020-07-10 15:26:25,464 INFO L280 TraceCheckUtils]: 18: Hoare triple {13358#true} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {13358#true} is VALID [2020-07-10 15:26:25,465 INFO L280 TraceCheckUtils]: 19: Hoare triple {13358#true} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {13358#true} is VALID [2020-07-10 15:26:25,465 INFO L280 TraceCheckUtils]: 20: Hoare triple {13358#true} assume !!(~x~0 < 100000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);havoc #t~nondet3; {13358#true} is VALID [2020-07-10 15:26:25,465 INFO L280 TraceCheckUtils]: 21: Hoare triple {13358#true} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {13358#true} is VALID [2020-07-10 15:26:25,465 INFO L280 TraceCheckUtils]: 22: Hoare triple {13358#true} assume !(~x~0 < 100000); {13358#true} is VALID [2020-07-10 15:26:25,465 INFO L280 TraceCheckUtils]: 23: Hoare triple {13358#true} ~x~0 := 0; {13358#true} is VALID [2020-07-10 15:26:25,465 INFO L280 TraceCheckUtils]: 24: Hoare triple {13358#true} assume !(~x~0 < ~n~0); {13358#true} is VALID [2020-07-10 15:26:25,466 INFO L280 TraceCheckUtils]: 25: Hoare triple {13358#true} call ~#values~0.base, ~#values~0.offset := #Ultimate.allocOnStack(400000);havoc ~v~0;~v~0 := 0; {13358#true} is VALID [2020-07-10 15:26:25,466 INFO L280 TraceCheckUtils]: 26: Hoare triple {13358#true} assume !!(~v~0 < 100000);assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;call write~int(#t~nondet9, ~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4);havoc #t~nondet9; {13358#true} is VALID [2020-07-10 15:26:25,466 INFO L280 TraceCheckUtils]: 27: Hoare triple {13358#true} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {13358#true} is VALID [2020-07-10 15:26:25,466 INFO L280 TraceCheckUtils]: 28: Hoare triple {13358#true} assume !!(~v~0 < 100000);assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;call write~int(#t~nondet9, ~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4);havoc #t~nondet9; {13358#true} is VALID [2020-07-10 15:26:25,466 INFO L280 TraceCheckUtils]: 29: Hoare triple {13358#true} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {13358#true} is VALID [2020-07-10 15:26:25,466 INFO L280 TraceCheckUtils]: 30: Hoare triple {13358#true} assume !(~v~0 < 100000); {13358#true} is VALID [2020-07-10 15:26:25,467 INFO L280 TraceCheckUtils]: 31: Hoare triple {13358#true} ~v~0 := 0; {13358#true} is VALID [2020-07-10 15:26:25,467 INFO L280 TraceCheckUtils]: 32: Hoare triple {13358#true} assume !!(~v~0 < 100000);call #t~mem11 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {13358#true} is VALID [2020-07-10 15:26:25,467 INFO L263 TraceCheckUtils]: 33: Hoare triple {13358#true} call #t~ret12 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem11); {13358#true} is VALID [2020-07-10 15:26:25,467 INFO L280 TraceCheckUtils]: 34: Hoare triple {13358#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {13358#true} is VALID [2020-07-10 15:26:25,467 INFO L280 TraceCheckUtils]: 35: Hoare triple {13358#true} assume !(~i~0 < ~size); {13358#true} is VALID [2020-07-10 15:26:25,468 INFO L280 TraceCheckUtils]: 36: Hoare triple {13358#true} #res := 0; {13501#(= 0 |elem_exists_#res|)} is VALID [2020-07-10 15:26:25,469 INFO L280 TraceCheckUtils]: 37: Hoare triple {13501#(= 0 |elem_exists_#res|)} assume true; {13501#(= 0 |elem_exists_#res|)} is VALID [2020-07-10 15:26:25,470 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {13501#(= 0 |elem_exists_#res|)} {13358#true} #182#return; {13508#(= |main_#t~ret12| 0)} is VALID [2020-07-10 15:26:25,470 INFO L280 TraceCheckUtils]: 39: Hoare triple {13508#(= |main_#t~ret12| 0)} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {13508#(= |main_#t~ret12| 0)} is VALID [2020-07-10 15:26:25,471 INFO L280 TraceCheckUtils]: 40: Hoare triple {13508#(= |main_#t~ret12| 0)} assume 0 != #t~ret12;havoc #t~ret12;havoc #t~mem11;call #t~mem13 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {13359#false} is VALID [2020-07-10 15:26:25,471 INFO L263 TraceCheckUtils]: 41: Hoare triple {13359#false} call #t~ret14 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem13); {13359#false} is VALID [2020-07-10 15:26:25,471 INFO L280 TraceCheckUtils]: 42: Hoare triple {13359#false} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4);#res := 1 + ~size; {13359#false} is VALID [2020-07-10 15:26:25,472 INFO L280 TraceCheckUtils]: 43: Hoare triple {13359#false} assume true; {13359#false} is VALID [2020-07-10 15:26:25,472 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {13359#false} {13359#false} #184#return; {13359#false} is VALID [2020-07-10 15:26:25,472 INFO L280 TraceCheckUtils]: 45: Hoare triple {13359#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~n~0 := #t~ret14;havoc #t~mem13;havoc #t~ret14; {13359#false} is VALID [2020-07-10 15:26:25,472 INFO L280 TraceCheckUtils]: 46: Hoare triple {13359#false} ~x~0 := 0; {13359#false} is VALID [2020-07-10 15:26:25,472 INFO L280 TraceCheckUtils]: 47: Hoare triple {13359#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {13359#false} is VALID [2020-07-10 15:26:25,472 INFO L280 TraceCheckUtils]: 48: Hoare triple {13359#false} assume !(~y~0 < ~n~0); {13359#false} is VALID [2020-07-10 15:26:25,473 INFO L280 TraceCheckUtils]: 49: Hoare triple {13359#false} #t~post15 := ~x~0;~x~0 := 1 + #t~post15;havoc #t~post15; {13359#false} is VALID [2020-07-10 15:26:25,473 INFO L280 TraceCheckUtils]: 50: Hoare triple {13359#false} assume !(~x~0 < ~n~0); {13359#false} is VALID [2020-07-10 15:26:25,473 INFO L280 TraceCheckUtils]: 51: Hoare triple {13359#false} #t~post10 := ~v~0;~v~0 := 1 + #t~post10;havoc #t~post10; {13359#false} is VALID [2020-07-10 15:26:25,473 INFO L280 TraceCheckUtils]: 52: Hoare triple {13359#false} assume !!(~v~0 < 100000);call #t~mem11 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {13359#false} is VALID [2020-07-10 15:26:25,473 INFO L263 TraceCheckUtils]: 53: Hoare triple {13359#false} call #t~ret12 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem11); {13359#false} is VALID [2020-07-10 15:26:25,473 INFO L280 TraceCheckUtils]: 54: Hoare triple {13359#false} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {13359#false} is VALID [2020-07-10 15:26:25,474 INFO L280 TraceCheckUtils]: 55: Hoare triple {13359#false} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {13359#false} is VALID [2020-07-10 15:26:25,474 INFO L280 TraceCheckUtils]: 56: Hoare triple {13359#false} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {13359#false} is VALID [2020-07-10 15:26:25,474 INFO L280 TraceCheckUtils]: 57: Hoare triple {13359#false} assume true; {13359#false} is VALID [2020-07-10 15:26:25,474 INFO L275 TraceCheckUtils]: 58: Hoare quadruple {13359#false} {13359#false} #182#return; {13359#false} is VALID [2020-07-10 15:26:25,474 INFO L280 TraceCheckUtils]: 59: Hoare triple {13359#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {13359#false} is VALID [2020-07-10 15:26:25,475 INFO L280 TraceCheckUtils]: 60: Hoare triple {13359#false} assume 0 != #t~ret12;havoc #t~ret12;havoc #t~mem11;call #t~mem13 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {13359#false} is VALID [2020-07-10 15:26:25,475 INFO L263 TraceCheckUtils]: 61: Hoare triple {13359#false} call #t~ret14 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem13); {13359#false} is VALID [2020-07-10 15:26:25,475 INFO L280 TraceCheckUtils]: 62: Hoare triple {13359#false} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4);#res := 1 + ~size; {13359#false} is VALID [2020-07-10 15:26:25,475 INFO L280 TraceCheckUtils]: 63: Hoare triple {13359#false} assume true; {13359#false} is VALID [2020-07-10 15:26:25,475 INFO L275 TraceCheckUtils]: 64: Hoare quadruple {13359#false} {13359#false} #184#return; {13359#false} is VALID [2020-07-10 15:26:25,475 INFO L280 TraceCheckUtils]: 65: Hoare triple {13359#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~n~0 := #t~ret14;havoc #t~mem13;havoc #t~ret14; {13359#false} is VALID [2020-07-10 15:26:25,476 INFO L280 TraceCheckUtils]: 66: Hoare triple {13359#false} ~x~0 := 0; {13359#false} is VALID [2020-07-10 15:26:25,476 INFO L280 TraceCheckUtils]: 67: Hoare triple {13359#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {13359#false} is VALID [2020-07-10 15:26:25,476 INFO L280 TraceCheckUtils]: 68: Hoare triple {13359#false} assume !!(~y~0 < ~n~0);call #t~mem17 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem18 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {13359#false} is VALID [2020-07-10 15:26:25,476 INFO L263 TraceCheckUtils]: 69: Hoare triple {13359#false} call __VERIFIER_assert((if #t~mem17 != #t~mem18 then 1 else 0)); {13359#false} is VALID [2020-07-10 15:26:25,476 INFO L280 TraceCheckUtils]: 70: Hoare triple {13359#false} ~cond := #in~cond; {13359#false} is VALID [2020-07-10 15:26:25,476 INFO L280 TraceCheckUtils]: 71: Hoare triple {13359#false} assume 0 == ~cond; {13359#false} is VALID [2020-07-10 15:26:25,477 INFO L280 TraceCheckUtils]: 72: Hoare triple {13359#false} assume !false; {13359#false} is VALID [2020-07-10 15:26:25,479 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-07-10 15:26:25,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:26:25,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [13] total 15 [2020-07-10 15:26:25,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556312776] [2020-07-10 15:26:25,481 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2020-07-10 15:26:25,481 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:25,481 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 15:26:25,530 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:25,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 15:26:25,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:25,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 15:26:25,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2020-07-10 15:26:25,531 INFO L87 Difference]: Start difference. First operand 100 states and 122 transitions. Second operand 4 states. [2020-07-10 15:26:25,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:25,639 INFO L93 Difference]: Finished difference Result 112 states and 135 transitions. [2020-07-10 15:26:25,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 15:26:25,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2020-07-10 15:26:25,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:25,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:26:25,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2020-07-10 15:26:25,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:26:25,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2020-07-10 15:26:25,642 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 74 transitions. [2020-07-10 15:26:25,726 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:25,727 INFO L225 Difference]: With dead ends: 112 [2020-07-10 15:26:25,727 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 15:26:25,728 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2020-07-10 15:26:25,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 15:26:25,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 15:26:25,728 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:25,728 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 15:26:25,728 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:26:25,729 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:26:25,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:25,729 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:26:25,729 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:26:25,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:25,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:25,729 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:26:25,730 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:26:25,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:25,730 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:26:25,730 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:26:25,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:25,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:25,730 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:25,730 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:25,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 15:26:25,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 15:26:25,731 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 73 [2020-07-10 15:26:25,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:25,731 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 15:26:25,731 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 15:26:25,731 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:26:25,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:25,939 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-07-10 15:26:25,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 15:26:26,356 INFO L271 CegarLoopResult]: At program point elem_existsENTRY(lines 9 15) the Hoare annotation is: true [2020-07-10 15:26:26,356 INFO L268 CegarLoopResult]: For program point elem_existsEXIT(lines 9 15) no Hoare annotation was computed. [2020-07-10 15:26:26,356 INFO L268 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-07-10 15:26:26,357 INFO L268 CegarLoopResult]: For program point L11-2(lines 11 13) no Hoare annotation was computed. [2020-07-10 15:26:26,357 INFO L268 CegarLoopResult]: For program point elem_existsFINAL(lines 9 15) no Hoare annotation was computed. [2020-07-10 15:26:26,357 INFO L264 CegarLoopResult]: At program point L11-3(lines 11 13) the Hoare annotation is: (or (not (<= |elem_exists_#in~size| 0)) (and (<= elem_exists_~i~0 0) (<= |elem_exists_#in~size| elem_exists_~size) (<= elem_exists_~size |elem_exists_#in~size|) (<= 0 elem_exists_~i~0))) [2020-07-10 15:26:26,357 INFO L268 CegarLoopResult]: For program point L11-4(lines 11 13) no Hoare annotation was computed. [2020-07-10 15:26:26,357 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:26:26,357 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#NULL.base)| |#NULL.base|) (= |#NULL.offset| |old(#NULL.offset)|)) [2020-07-10 15:26:26,358 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:26:26,358 INFO L271 CegarLoopResult]: At program point insertENTRY(lines 5 8) the Hoare annotation is: true [2020-07-10 15:26:26,358 INFO L268 CegarLoopResult]: For program point insertFINAL(lines 5 8) no Hoare annotation was computed. [2020-07-10 15:26:26,358 INFO L268 CegarLoopResult]: For program point insertEXIT(lines 5 8) no Hoare annotation was computed. [2020-07-10 15:26:26,358 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:26:26,358 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 15:26:26,358 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 15:26:26,358 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:26:26,359 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 16 56) no Hoare annotation was computed. [2020-07-10 15:26:26,359 INFO L264 CegarLoopResult]: At program point L52(line 52) the Hoare annotation is: false [2020-07-10 15:26:26,359 INFO L268 CegarLoopResult]: For program point L52-1(line 52) no Hoare annotation was computed. [2020-07-10 15:26:26,359 INFO L268 CegarLoopResult]: For program point L44-2(lines 44 48) no Hoare annotation was computed. [2020-07-10 15:26:26,359 INFO L264 CegarLoopResult]: At program point L44-3(lines 44 48) the Hoare annotation is: (and (<= main_~n~0 0) (= 0 main_~x~0)) [2020-07-10 15:26:26,359 INFO L268 CegarLoopResult]: For program point L36-2(lines 36 39) no Hoare annotation was computed. [2020-07-10 15:26:26,359 INFO L264 CegarLoopResult]: At program point L36-3(lines 36 39) the Hoare annotation is: (and (<= main_~n~0 0) (= 0 main_~x~0)) [2020-07-10 15:26:26,360 INFO L268 CegarLoopResult]: For program point L36-4(lines 36 39) no Hoare annotation was computed. [2020-07-10 15:26:26,360 INFO L268 CegarLoopResult]: For program point L28-2(lines 28 32) no Hoare annotation was computed. [2020-07-10 15:26:26,360 INFO L264 CegarLoopResult]: At program point L28-3(lines 28 32) the Hoare annotation is: (and (<= main_~n~0 0) (= 0 main_~x~0)) [2020-07-10 15:26:26,361 INFO L268 CegarLoopResult]: For program point L28-4(lines 28 32) no Hoare annotation was computed. [2020-07-10 15:26:26,361 INFO L268 CegarLoopResult]: For program point L45-2(lines 45 47) no Hoare annotation was computed. [2020-07-10 15:26:26,361 INFO L264 CegarLoopResult]: At program point L45-3(lines 45 47) the Hoare annotation is: false [2020-07-10 15:26:26,362 INFO L268 CegarLoopResult]: For program point L29-2(lines 29 31) no Hoare annotation was computed. [2020-07-10 15:26:26,362 INFO L264 CegarLoopResult]: At program point L29-3(lines 29 31) the Hoare annotation is: false [2020-07-10 15:26:26,362 INFO L264 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: false [2020-07-10 15:26:26,362 INFO L268 CegarLoopResult]: For program point L46-1(line 46) no Hoare annotation was computed. [2020-07-10 15:26:26,362 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 16 56) no Hoare annotation was computed. [2020-07-10 15:26:26,362 INFO L264 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: false [2020-07-10 15:26:26,362 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 16 56) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-10 15:26:26,363 INFO L268 CegarLoopResult]: For program point L30-1(line 30) no Hoare annotation was computed. [2020-07-10 15:26:26,363 INFO L268 CegarLoopResult]: For program point L22-2(lines 22 25) no Hoare annotation was computed. [2020-07-10 15:26:26,363 INFO L264 CegarLoopResult]: At program point L22-3(lines 22 25) the Hoare annotation is: (and (<= main_~n~0 0) (<= 0 main_~x~0)) [2020-07-10 15:26:26,363 INFO L268 CegarLoopResult]: For program point L22-4(lines 22 25) no Hoare annotation was computed. [2020-07-10 15:26:26,364 INFO L268 CegarLoopResult]: For program point L40-2(lines 40 49) no Hoare annotation was computed. [2020-07-10 15:26:26,364 INFO L264 CegarLoopResult]: At program point L40-3(lines 40 49) the Hoare annotation is: (and (<= main_~n~0 0) (= 0 main_~x~0)) [2020-07-10 15:26:26,365 INFO L268 CegarLoopResult]: For program point L40-4(lines 40 49) no Hoare annotation was computed. [2020-07-10 15:26:26,365 INFO L264 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: (and (<= main_~n~0 0) (= 0 main_~x~0)) [2020-07-10 15:26:26,365 INFO L268 CegarLoopResult]: For program point L41-1(line 41) no Hoare annotation was computed. [2020-07-10 15:26:26,365 INFO L268 CegarLoopResult]: For program point L41-2(lines 41 43) no Hoare annotation was computed. [2020-07-10 15:26:26,365 INFO L268 CegarLoopResult]: For program point L41-4(lines 41 43) no Hoare annotation was computed. [2020-07-10 15:26:26,365 INFO L268 CegarLoopResult]: For program point L50-2(lines 50 54) no Hoare annotation was computed. [2020-07-10 15:26:26,365 INFO L264 CegarLoopResult]: At program point L50-3(lines 50 54) the Hoare annotation is: (and (<= 0 main_~x~0) (<= main_~n~0 1)) [2020-07-10 15:26:26,365 INFO L268 CegarLoopResult]: For program point L50-4(lines 50 54) no Hoare annotation was computed. [2020-07-10 15:26:26,365 INFO L264 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: false [2020-07-10 15:26:26,366 INFO L268 CegarLoopResult]: For program point L42-1(line 42) no Hoare annotation was computed. [2020-07-10 15:26:26,366 INFO L268 CegarLoopResult]: For program point L51-2(lines 51 53) no Hoare annotation was computed. [2020-07-10 15:26:26,366 INFO L264 CegarLoopResult]: At program point L51-3(lines 51 53) the Hoare annotation is: (and (<= 0 main_~x~0) (<= 1 main_~y~0) (<= main_~n~0 1)) [2020-07-10 15:26:26,366 INFO L268 CegarLoopResult]: For program point L2-1(line 2) no Hoare annotation was computed. [2020-07-10 15:26:26,366 INFO L268 CegarLoopResult]: For program point L2-3(line 2) no Hoare annotation was computed. [2020-07-10 15:26:26,367 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(line 2) the Hoare annotation is: true [2020-07-10 15:26:26,367 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(line 2) no Hoare annotation was computed. [2020-07-10 15:26:26,367 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2) no Hoare annotation was computed. [2020-07-10 15:26:26,367 INFO L268 CegarLoopResult]: For program point L2(line 2) no Hoare annotation was computed. [2020-07-10 15:26:26,373 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:26:26,374 WARN L170 areAnnotationChecker]: insertFINAL has no Hoare annotation [2020-07-10 15:26:26,374 WARN L170 areAnnotationChecker]: L2 has no Hoare annotation [2020-07-10 15:26:26,375 WARN L170 areAnnotationChecker]: L11-4 has no Hoare annotation [2020-07-10 15:26:26,375 WARN L170 areAnnotationChecker]: L11-4 has no Hoare annotation [2020-07-10 15:26:26,375 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2020-07-10 15:26:26,375 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:26:26,375 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:26:26,376 WARN L170 areAnnotationChecker]: insertFINAL has no Hoare annotation [2020-07-10 15:26:26,376 WARN L170 areAnnotationChecker]: L22-4 has no Hoare annotation [2020-07-10 15:26:26,376 WARN L170 areAnnotationChecker]: L22-4 has no Hoare annotation [2020-07-10 15:26:26,376 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2020-07-10 15:26:26,376 WARN L170 areAnnotationChecker]: L2 has no Hoare annotation [2020-07-10 15:26:26,376 WARN L170 areAnnotationChecker]: L2 has no Hoare annotation [2020-07-10 15:26:26,377 WARN L170 areAnnotationChecker]: L11-4 has no Hoare annotation [2020-07-10 15:26:26,377 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2020-07-10 15:26:26,377 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2020-07-10 15:26:26,377 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:26:26,377 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:26:26,377 WARN L170 areAnnotationChecker]: insertEXIT has no Hoare annotation [2020-07-10 15:26:26,377 WARN L170 areAnnotationChecker]: L22-4 has no Hoare annotation [2020-07-10 15:26:26,377 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2020-07-10 15:26:26,377 WARN L170 areAnnotationChecker]: L2-1 has no Hoare annotation [2020-07-10 15:26:26,378 WARN L170 areAnnotationChecker]: L2-1 has no Hoare annotation [2020-07-10 15:26:26,378 WARN L170 areAnnotationChecker]: L2-3 has no Hoare annotation [2020-07-10 15:26:26,378 WARN L170 areAnnotationChecker]: elem_existsFINAL has no Hoare annotation [2020-07-10 15:26:26,378 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-10 15:26:26,378 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2020-07-10 15:26:26,378 WARN L170 areAnnotationChecker]: L28-4 has no Hoare annotation [2020-07-10 15:26:26,378 WARN L170 areAnnotationChecker]: L28-4 has no Hoare annotation [2020-07-10 15:26:26,379 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:26:26,379 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:26:26,380 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:26:26,380 WARN L170 areAnnotationChecker]: elem_existsEXIT has no Hoare annotation [2020-07-10 15:26:26,380 WARN L170 areAnnotationChecker]: L41-4 has no Hoare annotation [2020-07-10 15:26:26,380 WARN L170 areAnnotationChecker]: L28-4 has no Hoare annotation [2020-07-10 15:26:26,380 WARN L170 areAnnotationChecker]: L28-2 has no Hoare annotation [2020-07-10 15:26:26,380 WARN L170 areAnnotationChecker]: L28-2 has no Hoare annotation [2020-07-10 15:26:26,380 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2020-07-10 15:26:26,380 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2020-07-10 15:26:26,380 WARN L170 areAnnotationChecker]: L52-1 has no Hoare annotation [2020-07-10 15:26:26,381 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2020-07-10 15:26:26,381 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2020-07-10 15:26:26,381 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2020-07-10 15:26:26,382 WARN L170 areAnnotationChecker]: L36-4 has no Hoare annotation [2020-07-10 15:26:26,382 WARN L170 areAnnotationChecker]: L36-4 has no Hoare annotation [2020-07-10 15:26:26,382 WARN L170 areAnnotationChecker]: L36-2 has no Hoare annotation [2020-07-10 15:26:26,382 WARN L170 areAnnotationChecker]: L28-2 has no Hoare annotation [2020-07-10 15:26:26,382 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2020-07-10 15:26:26,382 WARN L170 areAnnotationChecker]: L29-2 has no Hoare annotation [2020-07-10 15:26:26,382 WARN L170 areAnnotationChecker]: L45-2 has no Hoare annotation [2020-07-10 15:26:26,383 WARN L170 areAnnotationChecker]: L51-2 has no Hoare annotation [2020-07-10 15:26:26,383 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2020-07-10 15:26:26,383 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2020-07-10 15:26:26,383 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2020-07-10 15:26:26,383 WARN L170 areAnnotationChecker]: L44-2 has no Hoare annotation [2020-07-10 15:26:26,383 WARN L170 areAnnotationChecker]: L44-2 has no Hoare annotation [2020-07-10 15:26:26,383 WARN L170 areAnnotationChecker]: L36-4 has no Hoare annotation [2020-07-10 15:26:26,383 WARN L170 areAnnotationChecker]: L36-2 has no Hoare annotation [2020-07-10 15:26:26,384 WARN L170 areAnnotationChecker]: L50-2 has no Hoare annotation [2020-07-10 15:26:26,384 WARN L170 areAnnotationChecker]: L50-2 has no Hoare annotation [2020-07-10 15:26:26,385 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2020-07-10 15:26:26,385 WARN L170 areAnnotationChecker]: L40-4 has no Hoare annotation [2020-07-10 15:26:26,385 WARN L170 areAnnotationChecker]: L40-4 has no Hoare annotation [2020-07-10 15:26:26,386 WARN L170 areAnnotationChecker]: L44-2 has no Hoare annotation [2020-07-10 15:26:26,386 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2020-07-10 15:26:26,386 WARN L170 areAnnotationChecker]: L50-2 has no Hoare annotation [2020-07-10 15:26:26,386 WARN L170 areAnnotationChecker]: L52-1 has no Hoare annotation [2020-07-10 15:26:26,386 WARN L170 areAnnotationChecker]: L40-4 has no Hoare annotation [2020-07-10 15:26:26,386 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2020-07-10 15:26:26,387 WARN L170 areAnnotationChecker]: L50-4 has no Hoare annotation [2020-07-10 15:26:26,387 WARN L170 areAnnotationChecker]: L50-4 has no Hoare annotation [2020-07-10 15:26:26,388 WARN L170 areAnnotationChecker]: L50-4 has no Hoare annotation [2020-07-10 15:26:26,388 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:26:26,388 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:26:26,388 INFO L163 areAnnotationChecker]: CFG has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:26:26,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:26:26 BoogieIcfgContainer [2020-07-10 15:26:26,421 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:26:26,425 INFO L168 Benchmark]: Toolchain (without parser) took 35000.28 ms. Allocated memory was 136.3 MB in the beginning and 500.7 MB in the end (delta: 364.4 MB). Free memory was 101.1 MB in the beginning and 274.2 MB in the end (delta: -173.1 MB). Peak memory consumption was 191.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:26,426 INFO L168 Benchmark]: CDTParser took 0.78 ms. Allocated memory is still 136.3 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 15:26:26,426 INFO L168 Benchmark]: CACSL2BoogieTranslator took 418.34 ms. Allocated memory was 136.3 MB in the beginning and 200.3 MB in the end (delta: 64.0 MB). Free memory was 100.9 MB in the beginning and 178.9 MB in the end (delta: -78.1 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:26,426 INFO L168 Benchmark]: Boogie Preprocessor took 64.29 ms. Allocated memory is still 200.3 MB. Free memory was 178.9 MB in the beginning and 176.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:26,427 INFO L168 Benchmark]: RCFGBuilder took 744.63 ms. Allocated memory is still 200.3 MB. Free memory was 176.8 MB in the beginning and 136.2 MB in the end (delta: 40.6 MB). Peak memory consumption was 40.6 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:26,427 INFO L168 Benchmark]: TraceAbstraction took 33761.16 ms. Allocated memory was 200.3 MB in the beginning and 500.7 MB in the end (delta: 300.4 MB). Free memory was 135.6 MB in the beginning and 274.2 MB in the end (delta: -138.7 MB). Peak memory consumption was 161.8 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:26,431 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.78 ms. Allocated memory is still 136.3 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 418.34 ms. Allocated memory was 136.3 MB in the beginning and 200.3 MB in the end (delta: 64.0 MB). Free memory was 100.9 MB in the beginning and 178.9 MB in the end (delta: -78.1 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 64.29 ms. Allocated memory is still 200.3 MB. Free memory was 178.9 MB in the beginning and 176.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 744.63 ms. Allocated memory is still 200.3 MB. Free memory was 176.8 MB in the beginning and 136.2 MB in the end (delta: 40.6 MB). Peak memory consumption was 40.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 33761.16 ms. Allocated memory was 200.3 MB in the beginning and 500.7 MB in the end (delta: 300.4 MB). Free memory was 135.6 MB in the beginning and 274.2 MB in the end (delta: -138.7 MB). Peak memory consumption was 161.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 2]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: n <= 0 && 0 == x - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: n <= 0 && 0 <= x - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: n <= 0 && 0 == x - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: n <= 0 && 0 == x - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: !(\old(size) <= 0) || (((i <= 0 && \old(size) <= size) && size <= \old(size)) && 0 <= i) - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: 0 <= x && n <= 1 - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: n <= 0 && 0 == x - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: (0 <= x && 1 <= y) && n <= 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 33.2s, OverallIterations: 14, TraceHistogramMax: 8, AutomataDifference: 22.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 903 SDtfs, 1731 SDslu, 2222 SDs, 0 SdLazy, 2513 SolverSat, 881 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 898 GetRequests, 744 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=100occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 14 MinimizatonAttempts, 1477 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 140 PreInvPairs, 167 NumberOfFragments, 105 HoareAnnotationTreeSize, 140 FomulaSimplifications, 3522 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 22 FomulaSimplificationsInter, 107 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 1358 NumberOfCodeBlocks, 1288 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1331 ConstructedInterpolants, 0 QuantifiedInterpolants, 111711 SizeOfPredicates, 26 NumberOfNonLiveVariables, 2401 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 27 InterpolantComputations, 7 PerfectInterpolantSequences, 475/858 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...