java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/data_structures_set_multi_proc_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:55:24,715 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:55:24,720 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:55:24,733 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:55:24,733 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:55:24,734 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:55:24,736 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:55:24,738 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:55:24,739 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:55:24,740 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:55:24,741 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:55:24,741 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:55:24,742 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:55:24,744 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:55:24,745 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:55:24,746 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:55:24,748 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:55:24,753 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:55:24,757 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:55:24,762 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:55:24,764 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:55:24,767 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:55:24,774 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:55:24,774 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:55:24,774 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:55:24,775 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:55:24,776 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:55:24,777 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:55:24,780 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:55:24,781 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:55:24,781 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:55:24,782 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:55:24,782 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:55:24,782 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:55:24,785 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:55:24,787 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:55:24,787 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 11:55:24,809 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:55:24,810 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:55:24,810 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:55:24,811 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:55:24,811 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:55:24,811 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:55:24,812 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:55:24,812 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:55:24,812 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:55:24,812 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 11:55:24,813 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:55:24,814 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:55:24,814 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:55:24,814 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:55:24,815 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:55:24,815 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:55:24,815 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:55:24,815 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:55:24,815 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:55:24,816 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:55:24,817 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:55:24,817 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:55:24,817 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:55:24,817 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:55:24,818 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:55:24,818 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:55:24,818 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:55:24,818 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 11:55:24,818 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:55:24,819 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 11:55:24,819 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:55:24,872 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:55:24,885 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:55:24,888 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:55:24,890 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:55:24,890 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:55:24,891 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/data_structures_set_multi_proc_true-unreach-call_ground.i [2018-11-23 11:55:24,948 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bae46293/3a84f5e5f7af4d049f9c8ef2253cda1b/FLAG2b24764d4 [2018-11-23 11:55:25,360 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:55:25,361 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/data_structures_set_multi_proc_true-unreach-call_ground.i [2018-11-23 11:55:25,368 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bae46293/3a84f5e5f7af4d049f9c8ef2253cda1b/FLAG2b24764d4 [2018-11-23 11:55:25,729 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bae46293/3a84f5e5f7af4d049f9c8ef2253cda1b [2018-11-23 11:55:25,738 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:55:25,739 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:55:25,740 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:55:25,740 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:55:25,744 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:55:25,746 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:55:25" (1/1) ... [2018-11-23 11:55:25,749 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fef57ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:25, skipping insertion in model container [2018-11-23 11:55:25,749 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:55:25" (1/1) ... [2018-11-23 11:55:25,760 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:55:25,788 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:55:26,031 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:55:26,042 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:55:26,084 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:55:26,100 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:55:26,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:26 WrapperNode [2018-11-23 11:55:26,101 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:55:26,102 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:55:26,102 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:55:26,102 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:55:26,109 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:26" (1/1) ... [2018-11-23 11:55:26,119 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:26" (1/1) ... [2018-11-23 11:55:26,127 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:55:26,127 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:55:26,127 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:55:26,127 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:55:26,135 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:26" (1/1) ... [2018-11-23 11:55:26,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:26" (1/1) ... [2018-11-23 11:55:26,138 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:26" (1/1) ... [2018-11-23 11:55:26,138 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:26" (1/1) ... [2018-11-23 11:55:26,152 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:26" (1/1) ... [2018-11-23 11:55:26,161 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:26" (1/1) ... [2018-11-23 11:55:26,163 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:26" (1/1) ... [2018-11-23 11:55:26,165 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:55:26,166 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:55:26,166 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:55:26,166 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:55:26,167 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:26" (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 [2018-11-23 11:55:26,304 INFO L130 BoogieDeclarations]: Found specification of procedure elem_exists [2018-11-23 11:55:26,304 INFO L138 BoogieDeclarations]: Found implementation of procedure elem_exists [2018-11-23 11:55:26,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 11:55:26,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:55:26,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:55:26,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:55:26,305 INFO L130 BoogieDeclarations]: Found specification of procedure insert [2018-11-23 11:55:26,305 INFO L138 BoogieDeclarations]: Found implementation of procedure insert [2018-11-23 11:55:26,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:55:26,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:55:26,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 11:55:26,306 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:55:26,306 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:55:26,306 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:55:26,306 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:55:26,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:55:27,289 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:55:27,290 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 11:55:27,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:55:27 BoogieIcfgContainer [2018-11-23 11:55:27,290 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:55:27,291 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:55:27,291 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:55:27,294 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:55:27,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:55:25" (1/3) ... [2018-11-23 11:55:27,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a090e18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:55:27, skipping insertion in model container [2018-11-23 11:55:27,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:26" (2/3) ... [2018-11-23 11:55:27,296 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a090e18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:55:27, skipping insertion in model container [2018-11-23 11:55:27,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:55:27" (3/3) ... [2018-11-23 11:55:27,297 INFO L112 eAbstractionObserver]: Analyzing ICFG data_structures_set_multi_proc_true-unreach-call_ground.i [2018-11-23 11:55:27,305 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:55:27,312 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:55:27,329 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:55:27,365 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:55:27,365 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:55:27,366 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:55:27,366 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:55:27,366 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:55:27,366 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:55:27,366 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:55:27,367 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:55:27,367 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:55:27,385 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2018-11-23 11:55:27,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 11:55:27,392 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:27,393 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:27,395 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:27,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:27,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1709785250, now seen corresponding path program 1 times [2018-11-23 11:55:27,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:27,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:27,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:27,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:27,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:27,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:27,669 INFO L256 TraceCheckUtils]: 0: Hoare triple {51#true} call ULTIMATE.init(); {51#true} is VALID [2018-11-23 11:55:27,673 INFO L273 TraceCheckUtils]: 1: Hoare triple {51#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {51#true} is VALID [2018-11-23 11:55:27,674 INFO L273 TraceCheckUtils]: 2: Hoare triple {51#true} assume true; {51#true} is VALID [2018-11-23 11:55:27,674 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {51#true} {51#true} #120#return; {51#true} is VALID [2018-11-23 11:55:27,674 INFO L256 TraceCheckUtils]: 4: Hoare triple {51#true} call #t~ret15 := main(); {51#true} is VALID [2018-11-23 11:55:27,676 INFO L273 TraceCheckUtils]: 5: Hoare triple {51#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {53#(and (= main_~n~0 0) (= main_~x~0 0))} is VALID [2018-11-23 11:55:27,677 INFO L273 TraceCheckUtils]: 6: Hoare triple {53#(and (= main_~n~0 0) (= main_~x~0 0))} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {54#(and (= main_~n~0 0) (<= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0))} is VALID [2018-11-23 11:55:27,678 INFO L273 TraceCheckUtils]: 7: Hoare triple {54#(and (= main_~n~0 0) (<= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0))} assume !!(~y~0 < ~n~0);call #t~mem4 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {52#false} is VALID [2018-11-23 11:55:27,678 INFO L256 TraceCheckUtils]: 8: Hoare triple {52#false} call __VERIFIER_assert((if #t~mem4 != #t~mem5 then 1 else 0)); {52#false} is VALID [2018-11-23 11:55:27,679 INFO L273 TraceCheckUtils]: 9: Hoare triple {52#false} ~cond := #in~cond; {52#false} is VALID [2018-11-23 11:55:27,679 INFO L273 TraceCheckUtils]: 10: Hoare triple {52#false} assume 0 == ~cond; {52#false} is VALID [2018-11-23 11:55:27,679 INFO L273 TraceCheckUtils]: 11: Hoare triple {52#false} assume !false; {52#false} is VALID [2018-11-23 11:55:27,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:27,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:55:27,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:55:27,689 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-23 11:55:27,692 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:27,695 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:55:27,738 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:27,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:55:27,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:55:27,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:55:27,751 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 4 states. [2018-11-23 11:55:28,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:28,386 INFO L93 Difference]: Finished difference Result 97 states and 134 transitions. [2018-11-23 11:55:28,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:55:28,387 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-23 11:55:28,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:28,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:55:28,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2018-11-23 11:55:28,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:55:28,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2018-11-23 11:55:28,419 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 134 transitions. [2018-11-23 11:55:29,026 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:29,040 INFO L225 Difference]: With dead ends: 97 [2018-11-23 11:55:29,040 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 11:55:29,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:55:29,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 11:55:29,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-11-23 11:55:29,118 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:29,119 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 43 states. [2018-11-23 11:55:29,119 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 43 states. [2018-11-23 11:55:29,119 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 43 states. [2018-11-23 11:55:29,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:29,127 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2018-11-23 11:55:29,127 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2018-11-23 11:55:29,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:29,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:29,129 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 45 states. [2018-11-23 11:55:29,129 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 45 states. [2018-11-23 11:55:29,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:29,137 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2018-11-23 11:55:29,137 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2018-11-23 11:55:29,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:29,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:29,139 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:29,139 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:29,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 11:55:29,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2018-11-23 11:55:29,145 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 12 [2018-11-23 11:55:29,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:29,146 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2018-11-23 11:55:29,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:55:29,146 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2018-11-23 11:55:29,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 11:55:29,148 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:29,148 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:29,149 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:29,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:29,149 INFO L82 PathProgramCache]: Analyzing trace with hash 497867501, now seen corresponding path program 1 times [2018-11-23 11:55:29,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:29,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:29,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:29,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:29,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:29,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:29,357 INFO L256 TraceCheckUtils]: 0: Hoare triple {336#true} call ULTIMATE.init(); {336#true} is VALID [2018-11-23 11:55:29,358 INFO L273 TraceCheckUtils]: 1: Hoare triple {336#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {336#true} is VALID [2018-11-23 11:55:29,358 INFO L273 TraceCheckUtils]: 2: Hoare triple {336#true} assume true; {336#true} is VALID [2018-11-23 11:55:29,358 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {336#true} {336#true} #120#return; {336#true} is VALID [2018-11-23 11:55:29,358 INFO L256 TraceCheckUtils]: 4: Hoare triple {336#true} call #t~ret15 := main(); {336#true} is VALID [2018-11-23 11:55:29,359 INFO L273 TraceCheckUtils]: 5: Hoare triple {336#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {336#true} is VALID [2018-11-23 11:55:29,359 INFO L273 TraceCheckUtils]: 6: Hoare triple {336#true} assume !(~x~0 < ~n~0); {336#true} is VALID [2018-11-23 11:55:29,362 INFO L273 TraceCheckUtils]: 7: Hoare triple {336#true} call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(400000);havoc ~v~0;~v~0 := 0; {338#(= main_~v~0 0)} is VALID [2018-11-23 11:55:29,362 INFO L273 TraceCheckUtils]: 8: Hoare triple {338#(= main_~v~0 0)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {338#(= main_~v~0 0)} is VALID [2018-11-23 11:55:29,363 INFO L256 TraceCheckUtils]: 9: Hoare triple {338#(= main_~v~0 0)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {336#true} is VALID [2018-11-23 11:55:29,363 INFO L273 TraceCheckUtils]: 10: Hoare triple {336#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {336#true} is VALID [2018-11-23 11:55:29,364 INFO L273 TraceCheckUtils]: 11: Hoare triple {336#true} assume !(~i~0 < ~size); {336#true} is VALID [2018-11-23 11:55:29,364 INFO L273 TraceCheckUtils]: 12: Hoare triple {336#true} #res := 0; {336#true} is VALID [2018-11-23 11:55:29,364 INFO L273 TraceCheckUtils]: 13: Hoare triple {336#true} assume true; {336#true} is VALID [2018-11-23 11:55:29,367 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {336#true} {338#(= main_~v~0 0)} #126#return; {338#(= main_~v~0 0)} is VALID [2018-11-23 11:55:29,367 INFO L273 TraceCheckUtils]: 15: Hoare triple {338#(= main_~v~0 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {338#(= main_~v~0 0)} is VALID [2018-11-23 11:55:29,369 INFO L273 TraceCheckUtils]: 16: Hoare triple {338#(= main_~v~0 0)} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {338#(= main_~v~0 0)} is VALID [2018-11-23 11:55:29,369 INFO L256 TraceCheckUtils]: 17: Hoare triple {338#(= main_~v~0 0)} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {336#true} is VALID [2018-11-23 11:55:29,369 INFO L273 TraceCheckUtils]: 18: Hoare triple {336#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; {336#true} is VALID [2018-11-23 11:55:29,370 INFO L273 TraceCheckUtils]: 19: Hoare triple {336#true} assume true; {336#true} is VALID [2018-11-23 11:55:29,375 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {336#true} {338#(= main_~v~0 0)} #128#return; {338#(= main_~v~0 0)} is VALID [2018-11-23 11:55:29,376 INFO L273 TraceCheckUtils]: 21: Hoare triple {338#(= main_~v~0 0)} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~mem9;havoc #t~ret10; {338#(= main_~v~0 0)} is VALID [2018-11-23 11:55:29,377 INFO L273 TraceCheckUtils]: 22: Hoare triple {338#(= main_~v~0 0)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {339#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:29,380 INFO L273 TraceCheckUtils]: 23: Hoare triple {339#(<= main_~v~0 1)} assume !(~v~0 < 100000); {337#false} is VALID [2018-11-23 11:55:29,380 INFO L273 TraceCheckUtils]: 24: Hoare triple {337#false} ~x~0 := 0; {337#false} is VALID [2018-11-23 11:55:29,381 INFO L273 TraceCheckUtils]: 25: Hoare triple {337#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {337#false} is VALID [2018-11-23 11:55:29,381 INFO L273 TraceCheckUtils]: 26: Hoare triple {337#false} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {337#false} is VALID [2018-11-23 11:55:29,381 INFO L256 TraceCheckUtils]: 27: Hoare triple {337#false} call __VERIFIER_assert((if #t~mem13 != #t~mem14 then 1 else 0)); {337#false} is VALID [2018-11-23 11:55:29,382 INFO L273 TraceCheckUtils]: 28: Hoare triple {337#false} ~cond := #in~cond; {337#false} is VALID [2018-11-23 11:55:29,382 INFO L273 TraceCheckUtils]: 29: Hoare triple {337#false} assume 0 == ~cond; {337#false} is VALID [2018-11-23 11:55:29,382 INFO L273 TraceCheckUtils]: 30: Hoare triple {337#false} assume !false; {337#false} is VALID [2018-11-23 11:55:29,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:29,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:29,387 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:29,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:29,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:29,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:29,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:30,082 INFO L256 TraceCheckUtils]: 0: Hoare triple {336#true} call ULTIMATE.init(); {336#true} is VALID [2018-11-23 11:55:30,082 INFO L273 TraceCheckUtils]: 1: Hoare triple {336#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {336#true} is VALID [2018-11-23 11:55:30,083 INFO L273 TraceCheckUtils]: 2: Hoare triple {336#true} assume true; {336#true} is VALID [2018-11-23 11:55:30,083 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {336#true} {336#true} #120#return; {336#true} is VALID [2018-11-23 11:55:30,083 INFO L256 TraceCheckUtils]: 4: Hoare triple {336#true} call #t~ret15 := main(); {336#true} is VALID [2018-11-23 11:55:30,084 INFO L273 TraceCheckUtils]: 5: Hoare triple {336#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {336#true} is VALID [2018-11-23 11:55:30,084 INFO L273 TraceCheckUtils]: 6: Hoare triple {336#true} assume !(~x~0 < ~n~0); {336#true} is VALID [2018-11-23 11:55:30,085 INFO L273 TraceCheckUtils]: 7: Hoare triple {336#true} call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(400000);havoc ~v~0;~v~0 := 0; {364#(<= main_~v~0 0)} is VALID [2018-11-23 11:55:30,089 INFO L273 TraceCheckUtils]: 8: Hoare triple {364#(<= main_~v~0 0)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {364#(<= main_~v~0 0)} is VALID [2018-11-23 11:55:30,089 INFO L256 TraceCheckUtils]: 9: Hoare triple {364#(<= main_~v~0 0)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {336#true} is VALID [2018-11-23 11:55:30,090 INFO L273 TraceCheckUtils]: 10: Hoare triple {336#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {336#true} is VALID [2018-11-23 11:55:30,090 INFO L273 TraceCheckUtils]: 11: Hoare triple {336#true} assume !(~i~0 < ~size); {336#true} is VALID [2018-11-23 11:55:30,090 INFO L273 TraceCheckUtils]: 12: Hoare triple {336#true} #res := 0; {336#true} is VALID [2018-11-23 11:55:30,090 INFO L273 TraceCheckUtils]: 13: Hoare triple {336#true} assume true; {336#true} is VALID [2018-11-23 11:55:30,095 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {336#true} {364#(<= main_~v~0 0)} #126#return; {364#(<= main_~v~0 0)} is VALID [2018-11-23 11:55:30,095 INFO L273 TraceCheckUtils]: 15: Hoare triple {364#(<= main_~v~0 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {364#(<= main_~v~0 0)} is VALID [2018-11-23 11:55:30,097 INFO L273 TraceCheckUtils]: 16: Hoare triple {364#(<= main_~v~0 0)} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {364#(<= main_~v~0 0)} is VALID [2018-11-23 11:55:30,097 INFO L256 TraceCheckUtils]: 17: Hoare triple {364#(<= main_~v~0 0)} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {336#true} is VALID [2018-11-23 11:55:30,097 INFO L273 TraceCheckUtils]: 18: Hoare triple {336#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; {336#true} is VALID [2018-11-23 11:55:30,097 INFO L273 TraceCheckUtils]: 19: Hoare triple {336#true} assume true; {336#true} is VALID [2018-11-23 11:55:30,100 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {336#true} {364#(<= main_~v~0 0)} #128#return; {364#(<= main_~v~0 0)} is VALID [2018-11-23 11:55:30,101 INFO L273 TraceCheckUtils]: 21: Hoare triple {364#(<= main_~v~0 0)} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~mem9;havoc #t~ret10; {364#(<= main_~v~0 0)} is VALID [2018-11-23 11:55:30,101 INFO L273 TraceCheckUtils]: 22: Hoare triple {364#(<= main_~v~0 0)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {339#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:30,106 INFO L273 TraceCheckUtils]: 23: Hoare triple {339#(<= main_~v~0 1)} assume !(~v~0 < 100000); {337#false} is VALID [2018-11-23 11:55:30,106 INFO L273 TraceCheckUtils]: 24: Hoare triple {337#false} ~x~0 := 0; {337#false} is VALID [2018-11-23 11:55:30,106 INFO L273 TraceCheckUtils]: 25: Hoare triple {337#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {337#false} is VALID [2018-11-23 11:55:30,106 INFO L273 TraceCheckUtils]: 26: Hoare triple {337#false} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {337#false} is VALID [2018-11-23 11:55:30,107 INFO L256 TraceCheckUtils]: 27: Hoare triple {337#false} call __VERIFIER_assert((if #t~mem13 != #t~mem14 then 1 else 0)); {337#false} is VALID [2018-11-23 11:55:30,107 INFO L273 TraceCheckUtils]: 28: Hoare triple {337#false} ~cond := #in~cond; {337#false} is VALID [2018-11-23 11:55:30,107 INFO L273 TraceCheckUtils]: 29: Hoare triple {337#false} assume 0 == ~cond; {337#false} is VALID [2018-11-23 11:55:30,107 INFO L273 TraceCheckUtils]: 30: Hoare triple {337#false} assume !false; {337#false} is VALID [2018-11-23 11:55:30,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:30,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:30,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 11:55:30,131 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-11-23 11:55:30,132 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:30,132 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:55:30,358 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:30,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:55:30,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:55:30,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:55:30,359 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand 5 states. [2018-11-23 11:55:30,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:30,702 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2018-11-23 11:55:30,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:55:30,703 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-11-23 11:55:30,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:30,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:55:30,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2018-11-23 11:55:30,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:55:30,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2018-11-23 11:55:30,712 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 78 transitions. [2018-11-23 11:55:30,905 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:30,909 INFO L225 Difference]: With dead ends: 76 [2018-11-23 11:55:30,909 INFO L226 Difference]: Without dead ends: 63 [2018-11-23 11:55:30,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:55:30,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-23 11:55:30,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 51. [2018-11-23 11:55:30,964 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:30,964 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 51 states. [2018-11-23 11:55:30,964 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 51 states. [2018-11-23 11:55:30,965 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 51 states. [2018-11-23 11:55:30,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:30,970 INFO L93 Difference]: Finished difference Result 63 states and 78 transitions. [2018-11-23 11:55:30,970 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 78 transitions. [2018-11-23 11:55:30,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:30,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:30,972 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 63 states. [2018-11-23 11:55:30,972 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 63 states. [2018-11-23 11:55:30,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:30,978 INFO L93 Difference]: Finished difference Result 63 states and 78 transitions. [2018-11-23 11:55:30,978 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 78 transitions. [2018-11-23 11:55:30,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:30,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:30,980 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:30,980 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:30,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 11:55:30,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2018-11-23 11:55:30,984 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 31 [2018-11-23 11:55:30,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:30,984 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2018-11-23 11:55:30,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:55:30,985 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2018-11-23 11:55:30,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 11:55:30,987 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:30,987 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 11:55:30,987 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:30,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:30,988 INFO L82 PathProgramCache]: Analyzing trace with hash -239394985, now seen corresponding path program 1 times [2018-11-23 11:55:30,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:30,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:30,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:30,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:30,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:31,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:31,165 INFO L256 TraceCheckUtils]: 0: Hoare triple {736#true} call ULTIMATE.init(); {736#true} is VALID [2018-11-23 11:55:31,165 INFO L273 TraceCheckUtils]: 1: Hoare triple {736#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {736#true} is VALID [2018-11-23 11:55:31,166 INFO L273 TraceCheckUtils]: 2: Hoare triple {736#true} assume true; {736#true} is VALID [2018-11-23 11:55:31,166 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {736#true} {736#true} #120#return; {736#true} is VALID [2018-11-23 11:55:31,166 INFO L256 TraceCheckUtils]: 4: Hoare triple {736#true} call #t~ret15 := main(); {736#true} is VALID [2018-11-23 11:55:31,166 INFO L273 TraceCheckUtils]: 5: Hoare triple {736#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {736#true} is VALID [2018-11-23 11:55:31,167 INFO L273 TraceCheckUtils]: 6: Hoare triple {736#true} assume !(~x~0 < ~n~0); {736#true} is VALID [2018-11-23 11:55:31,167 INFO L273 TraceCheckUtils]: 7: Hoare triple {736#true} call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(400000);havoc ~v~0;~v~0 := 0; {736#true} is VALID [2018-11-23 11:55:31,167 INFO L273 TraceCheckUtils]: 8: Hoare triple {736#true} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {736#true} is VALID [2018-11-23 11:55:31,168 INFO L256 TraceCheckUtils]: 9: Hoare triple {736#true} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {736#true} is VALID [2018-11-23 11:55:31,168 INFO L273 TraceCheckUtils]: 10: Hoare triple {736#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {736#true} is VALID [2018-11-23 11:55:31,168 INFO L273 TraceCheckUtils]: 11: Hoare triple {736#true} assume !(~i~0 < ~size); {736#true} is VALID [2018-11-23 11:55:31,169 INFO L273 TraceCheckUtils]: 12: Hoare triple {736#true} #res := 0; {736#true} is VALID [2018-11-23 11:55:31,169 INFO L273 TraceCheckUtils]: 13: Hoare triple {736#true} assume true; {736#true} is VALID [2018-11-23 11:55:31,169 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {736#true} {736#true} #126#return; {736#true} is VALID [2018-11-23 11:55:31,170 INFO L273 TraceCheckUtils]: 15: Hoare triple {736#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {736#true} is VALID [2018-11-23 11:55:31,170 INFO L273 TraceCheckUtils]: 16: Hoare triple {736#true} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {736#true} is VALID [2018-11-23 11:55:31,170 INFO L256 TraceCheckUtils]: 17: Hoare triple {736#true} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {736#true} is VALID [2018-11-23 11:55:31,171 INFO L273 TraceCheckUtils]: 18: Hoare triple {736#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; {736#true} is VALID [2018-11-23 11:55:31,171 INFO L273 TraceCheckUtils]: 19: Hoare triple {736#true} assume true; {736#true} is VALID [2018-11-23 11:55:31,171 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {736#true} {736#true} #128#return; {736#true} is VALID [2018-11-23 11:55:31,171 INFO L273 TraceCheckUtils]: 21: Hoare triple {736#true} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~mem9;havoc #t~ret10; {736#true} is VALID [2018-11-23 11:55:31,172 INFO L273 TraceCheckUtils]: 22: Hoare triple {736#true} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {736#true} is VALID [2018-11-23 11:55:31,172 INFO L273 TraceCheckUtils]: 23: Hoare triple {736#true} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {736#true} is VALID [2018-11-23 11:55:31,172 INFO L256 TraceCheckUtils]: 24: Hoare triple {736#true} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {736#true} is VALID [2018-11-23 11:55:31,173 INFO L273 TraceCheckUtils]: 25: Hoare triple {736#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {736#true} is VALID [2018-11-23 11:55:31,173 INFO L273 TraceCheckUtils]: 26: Hoare triple {736#true} assume !(~i~0 < ~size); {736#true} is VALID [2018-11-23 11:55:31,175 INFO L273 TraceCheckUtils]: 27: Hoare triple {736#true} #res := 0; {738#(= 0 |elem_exists_#res|)} is VALID [2018-11-23 11:55:31,176 INFO L273 TraceCheckUtils]: 28: Hoare triple {738#(= 0 |elem_exists_#res|)} assume true; {738#(= 0 |elem_exists_#res|)} is VALID [2018-11-23 11:55:31,180 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {738#(= 0 |elem_exists_#res|)} {736#true} #126#return; {739#(= |main_#t~ret8| 0)} is VALID [2018-11-23 11:55:31,185 INFO L273 TraceCheckUtils]: 30: Hoare triple {739#(= |main_#t~ret8| 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {739#(= |main_#t~ret8| 0)} is VALID [2018-11-23 11:55:31,186 INFO L273 TraceCheckUtils]: 31: Hoare triple {739#(= |main_#t~ret8| 0)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {737#false} is VALID [2018-11-23 11:55:31,186 INFO L273 TraceCheckUtils]: 32: Hoare triple {737#false} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {737#false} is VALID [2018-11-23 11:55:31,186 INFO L273 TraceCheckUtils]: 33: Hoare triple {737#false} assume !(~v~0 < 100000); {737#false} is VALID [2018-11-23 11:55:31,187 INFO L273 TraceCheckUtils]: 34: Hoare triple {737#false} ~x~0 := 0; {737#false} is VALID [2018-11-23 11:55:31,187 INFO L273 TraceCheckUtils]: 35: Hoare triple {737#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {737#false} is VALID [2018-11-23 11:55:31,187 INFO L273 TraceCheckUtils]: 36: Hoare triple {737#false} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {737#false} is VALID [2018-11-23 11:55:31,187 INFO L256 TraceCheckUtils]: 37: Hoare triple {737#false} call __VERIFIER_assert((if #t~mem13 != #t~mem14 then 1 else 0)); {737#false} is VALID [2018-11-23 11:55:31,187 INFO L273 TraceCheckUtils]: 38: Hoare triple {737#false} ~cond := #in~cond; {737#false} is VALID [2018-11-23 11:55:31,188 INFO L273 TraceCheckUtils]: 39: Hoare triple {737#false} assume 0 == ~cond; {737#false} is VALID [2018-11-23 11:55:31,188 INFO L273 TraceCheckUtils]: 40: Hoare triple {737#false} assume !false; {737#false} is VALID [2018-11-23 11:55:31,190 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 11:55:31,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:55:31,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:55:31,191 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-11-23 11:55:31,192 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:31,192 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:55:31,240 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:31,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:55:31,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:55:31,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:55:31,242 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand 4 states. [2018-11-23 11:55:31,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:31,428 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2018-11-23 11:55:31,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:55:31,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-11-23 11:55:31,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:31,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:55:31,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2018-11-23 11:55:31,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:55:31,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2018-11-23 11:55:31,435 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 83 transitions. [2018-11-23 11:55:31,590 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:31,594 INFO L225 Difference]: With dead ends: 94 [2018-11-23 11:55:31,594 INFO L226 Difference]: Without dead ends: 59 [2018-11-23 11:55:31,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:55:31,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-23 11:55:31,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2018-11-23 11:55:31,641 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:31,641 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 57 states. [2018-11-23 11:55:31,641 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 57 states. [2018-11-23 11:55:31,641 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 57 states. [2018-11-23 11:55:31,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:31,645 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2018-11-23 11:55:31,645 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 71 transitions. [2018-11-23 11:55:31,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:31,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:31,647 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 59 states. [2018-11-23 11:55:31,647 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 59 states. [2018-11-23 11:55:31,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:31,651 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2018-11-23 11:55:31,651 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 71 transitions. [2018-11-23 11:55:31,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:31,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:31,653 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:31,653 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:31,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 11:55:31,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2018-11-23 11:55:31,657 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 41 [2018-11-23 11:55:31,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:31,657 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2018-11-23 11:55:31,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:55:31,658 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2018-11-23 11:55:31,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 11:55:31,659 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:31,659 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:31,660 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:31,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:31,660 INFO L82 PathProgramCache]: Analyzing trace with hash 2019651712, now seen corresponding path program 1 times [2018-11-23 11:55:31,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:31,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:31,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:31,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:31,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:31,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:31,824 INFO L256 TraceCheckUtils]: 0: Hoare triple {1065#true} call ULTIMATE.init(); {1065#true} is VALID [2018-11-23 11:55:31,824 INFO L273 TraceCheckUtils]: 1: Hoare triple {1065#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1065#true} is VALID [2018-11-23 11:55:31,824 INFO L273 TraceCheckUtils]: 2: Hoare triple {1065#true} assume true; {1065#true} is VALID [2018-11-23 11:55:31,825 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1065#true} {1065#true} #120#return; {1065#true} is VALID [2018-11-23 11:55:31,825 INFO L256 TraceCheckUtils]: 4: Hoare triple {1065#true} call #t~ret15 := main(); {1065#true} is VALID [2018-11-23 11:55:31,825 INFO L273 TraceCheckUtils]: 5: Hoare triple {1065#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {1065#true} is VALID [2018-11-23 11:55:31,825 INFO L273 TraceCheckUtils]: 6: Hoare triple {1065#true} assume !(~x~0 < ~n~0); {1065#true} is VALID [2018-11-23 11:55:31,841 INFO L273 TraceCheckUtils]: 7: Hoare triple {1065#true} call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(400000);havoc ~v~0;~v~0 := 0; {1067#(= main_~v~0 0)} is VALID [2018-11-23 11:55:31,842 INFO L273 TraceCheckUtils]: 8: Hoare triple {1067#(= main_~v~0 0)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {1067#(= main_~v~0 0)} is VALID [2018-11-23 11:55:31,842 INFO L256 TraceCheckUtils]: 9: Hoare triple {1067#(= main_~v~0 0)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {1065#true} is VALID [2018-11-23 11:55:31,842 INFO L273 TraceCheckUtils]: 10: Hoare triple {1065#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {1065#true} is VALID [2018-11-23 11:55:31,843 INFO L273 TraceCheckUtils]: 11: Hoare triple {1065#true} assume !(~i~0 < ~size); {1065#true} is VALID [2018-11-23 11:55:31,843 INFO L273 TraceCheckUtils]: 12: Hoare triple {1065#true} #res := 0; {1065#true} is VALID [2018-11-23 11:55:31,843 INFO L273 TraceCheckUtils]: 13: Hoare triple {1065#true} assume true; {1065#true} is VALID [2018-11-23 11:55:31,846 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {1065#true} {1067#(= main_~v~0 0)} #126#return; {1067#(= main_~v~0 0)} is VALID [2018-11-23 11:55:31,848 INFO L273 TraceCheckUtils]: 15: Hoare triple {1067#(= main_~v~0 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {1067#(= main_~v~0 0)} is VALID [2018-11-23 11:55:31,848 INFO L273 TraceCheckUtils]: 16: Hoare triple {1067#(= main_~v~0 0)} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {1067#(= main_~v~0 0)} is VALID [2018-11-23 11:55:31,848 INFO L256 TraceCheckUtils]: 17: Hoare triple {1067#(= main_~v~0 0)} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {1065#true} is VALID [2018-11-23 11:55:31,849 INFO L273 TraceCheckUtils]: 18: Hoare triple {1065#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; {1065#true} is VALID [2018-11-23 11:55:31,849 INFO L273 TraceCheckUtils]: 19: Hoare triple {1065#true} assume true; {1065#true} is VALID [2018-11-23 11:55:31,853 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {1065#true} {1067#(= main_~v~0 0)} #128#return; {1067#(= main_~v~0 0)} is VALID [2018-11-23 11:55:31,853 INFO L273 TraceCheckUtils]: 21: Hoare triple {1067#(= main_~v~0 0)} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~mem9;havoc #t~ret10; {1067#(= main_~v~0 0)} is VALID [2018-11-23 11:55:31,857 INFO L273 TraceCheckUtils]: 22: Hoare triple {1067#(= main_~v~0 0)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {1068#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:31,857 INFO L273 TraceCheckUtils]: 23: Hoare triple {1068#(<= main_~v~0 1)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {1068#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:31,858 INFO L256 TraceCheckUtils]: 24: Hoare triple {1068#(<= main_~v~0 1)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {1065#true} is VALID [2018-11-23 11:55:31,858 INFO L273 TraceCheckUtils]: 25: Hoare triple {1065#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {1065#true} is VALID [2018-11-23 11:55:31,858 INFO L273 TraceCheckUtils]: 26: Hoare triple {1065#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {1065#true} is VALID [2018-11-23 11:55:31,858 INFO L273 TraceCheckUtils]: 27: Hoare triple {1065#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {1065#true} is VALID [2018-11-23 11:55:31,859 INFO L273 TraceCheckUtils]: 28: Hoare triple {1065#true} assume true; {1065#true} is VALID [2018-11-23 11:55:31,862 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1065#true} {1068#(<= main_~v~0 1)} #126#return; {1068#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:31,862 INFO L273 TraceCheckUtils]: 30: Hoare triple {1068#(<= main_~v~0 1)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {1068#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:31,863 INFO L273 TraceCheckUtils]: 31: Hoare triple {1068#(<= main_~v~0 1)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {1068#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:31,864 INFO L273 TraceCheckUtils]: 32: Hoare triple {1068#(<= main_~v~0 1)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {1069#(<= main_~v~0 2)} is VALID [2018-11-23 11:55:31,864 INFO L273 TraceCheckUtils]: 33: Hoare triple {1069#(<= main_~v~0 2)} assume !(~v~0 < 100000); {1066#false} is VALID [2018-11-23 11:55:31,864 INFO L273 TraceCheckUtils]: 34: Hoare triple {1066#false} ~x~0 := 0; {1066#false} is VALID [2018-11-23 11:55:31,865 INFO L273 TraceCheckUtils]: 35: Hoare triple {1066#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {1066#false} is VALID [2018-11-23 11:55:31,865 INFO L273 TraceCheckUtils]: 36: Hoare triple {1066#false} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {1066#false} is VALID [2018-11-23 11:55:31,865 INFO L256 TraceCheckUtils]: 37: Hoare triple {1066#false} call __VERIFIER_assert((if #t~mem13 != #t~mem14 then 1 else 0)); {1066#false} is VALID [2018-11-23 11:55:31,866 INFO L273 TraceCheckUtils]: 38: Hoare triple {1066#false} ~cond := #in~cond; {1066#false} is VALID [2018-11-23 11:55:31,866 INFO L273 TraceCheckUtils]: 39: Hoare triple {1066#false} assume 0 == ~cond; {1066#false} is VALID [2018-11-23 11:55:31,867 INFO L273 TraceCheckUtils]: 40: Hoare triple {1066#false} assume !false; {1066#false} is VALID [2018-11-23 11:55:31,870 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:55:31,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:31,871 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:31,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:31,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:31,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:31,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:32,103 INFO L256 TraceCheckUtils]: 0: Hoare triple {1065#true} call ULTIMATE.init(); {1065#true} is VALID [2018-11-23 11:55:32,103 INFO L273 TraceCheckUtils]: 1: Hoare triple {1065#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1065#true} is VALID [2018-11-23 11:55:32,104 INFO L273 TraceCheckUtils]: 2: Hoare triple {1065#true} assume true; {1065#true} is VALID [2018-11-23 11:55:32,104 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1065#true} {1065#true} #120#return; {1065#true} is VALID [2018-11-23 11:55:32,105 INFO L256 TraceCheckUtils]: 4: Hoare triple {1065#true} call #t~ret15 := main(); {1065#true} is VALID [2018-11-23 11:55:32,105 INFO L273 TraceCheckUtils]: 5: Hoare triple {1065#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {1065#true} is VALID [2018-11-23 11:55:32,105 INFO L273 TraceCheckUtils]: 6: Hoare triple {1065#true} assume !(~x~0 < ~n~0); {1065#true} is VALID [2018-11-23 11:55:32,106 INFO L273 TraceCheckUtils]: 7: Hoare triple {1065#true} call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(400000);havoc ~v~0;~v~0 := 0; {1094#(<= main_~v~0 0)} is VALID [2018-11-23 11:55:32,108 INFO L273 TraceCheckUtils]: 8: Hoare triple {1094#(<= main_~v~0 0)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {1094#(<= main_~v~0 0)} is VALID [2018-11-23 11:55:32,108 INFO L256 TraceCheckUtils]: 9: Hoare triple {1094#(<= main_~v~0 0)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {1065#true} is VALID [2018-11-23 11:55:32,108 INFO L273 TraceCheckUtils]: 10: Hoare triple {1065#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {1065#true} is VALID [2018-11-23 11:55:32,108 INFO L273 TraceCheckUtils]: 11: Hoare triple {1065#true} assume !(~i~0 < ~size); {1065#true} is VALID [2018-11-23 11:55:32,109 INFO L273 TraceCheckUtils]: 12: Hoare triple {1065#true} #res := 0; {1065#true} is VALID [2018-11-23 11:55:32,109 INFO L273 TraceCheckUtils]: 13: Hoare triple {1065#true} assume true; {1065#true} is VALID [2018-11-23 11:55:32,111 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {1065#true} {1094#(<= main_~v~0 0)} #126#return; {1094#(<= main_~v~0 0)} is VALID [2018-11-23 11:55:32,111 INFO L273 TraceCheckUtils]: 15: Hoare triple {1094#(<= main_~v~0 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {1094#(<= main_~v~0 0)} is VALID [2018-11-23 11:55:32,113 INFO L273 TraceCheckUtils]: 16: Hoare triple {1094#(<= main_~v~0 0)} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {1094#(<= main_~v~0 0)} is VALID [2018-11-23 11:55:32,113 INFO L256 TraceCheckUtils]: 17: Hoare triple {1094#(<= main_~v~0 0)} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {1065#true} is VALID [2018-11-23 11:55:32,113 INFO L273 TraceCheckUtils]: 18: Hoare triple {1065#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; {1065#true} is VALID [2018-11-23 11:55:32,113 INFO L273 TraceCheckUtils]: 19: Hoare triple {1065#true} assume true; {1065#true} is VALID [2018-11-23 11:55:32,116 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {1065#true} {1094#(<= main_~v~0 0)} #128#return; {1094#(<= main_~v~0 0)} is VALID [2018-11-23 11:55:32,116 INFO L273 TraceCheckUtils]: 21: Hoare triple {1094#(<= main_~v~0 0)} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~mem9;havoc #t~ret10; {1094#(<= main_~v~0 0)} is VALID [2018-11-23 11:55:32,118 INFO L273 TraceCheckUtils]: 22: Hoare triple {1094#(<= main_~v~0 0)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {1068#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:32,118 INFO L273 TraceCheckUtils]: 23: Hoare triple {1068#(<= main_~v~0 1)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {1068#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:32,118 INFO L256 TraceCheckUtils]: 24: Hoare triple {1068#(<= main_~v~0 1)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {1065#true} is VALID [2018-11-23 11:55:32,119 INFO L273 TraceCheckUtils]: 25: Hoare triple {1065#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {1065#true} is VALID [2018-11-23 11:55:32,119 INFO L273 TraceCheckUtils]: 26: Hoare triple {1065#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {1065#true} is VALID [2018-11-23 11:55:32,119 INFO L273 TraceCheckUtils]: 27: Hoare triple {1065#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {1065#true} is VALID [2018-11-23 11:55:32,119 INFO L273 TraceCheckUtils]: 28: Hoare triple {1065#true} assume true; {1065#true} is VALID [2018-11-23 11:55:32,120 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1065#true} {1068#(<= main_~v~0 1)} #126#return; {1068#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:32,125 INFO L273 TraceCheckUtils]: 30: Hoare triple {1068#(<= main_~v~0 1)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {1068#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:32,125 INFO L273 TraceCheckUtils]: 31: Hoare triple {1068#(<= main_~v~0 1)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {1068#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:32,126 INFO L273 TraceCheckUtils]: 32: Hoare triple {1068#(<= main_~v~0 1)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {1069#(<= main_~v~0 2)} is VALID [2018-11-23 11:55:32,127 INFO L273 TraceCheckUtils]: 33: Hoare triple {1069#(<= main_~v~0 2)} assume !(~v~0 < 100000); {1066#false} is VALID [2018-11-23 11:55:32,127 INFO L273 TraceCheckUtils]: 34: Hoare triple {1066#false} ~x~0 := 0; {1066#false} is VALID [2018-11-23 11:55:32,127 INFO L273 TraceCheckUtils]: 35: Hoare triple {1066#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {1066#false} is VALID [2018-11-23 11:55:32,128 INFO L273 TraceCheckUtils]: 36: Hoare triple {1066#false} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {1066#false} is VALID [2018-11-23 11:55:32,128 INFO L256 TraceCheckUtils]: 37: Hoare triple {1066#false} call __VERIFIER_assert((if #t~mem13 != #t~mem14 then 1 else 0)); {1066#false} is VALID [2018-11-23 11:55:32,129 INFO L273 TraceCheckUtils]: 38: Hoare triple {1066#false} ~cond := #in~cond; {1066#false} is VALID [2018-11-23 11:55:32,129 INFO L273 TraceCheckUtils]: 39: Hoare triple {1066#false} assume 0 == ~cond; {1066#false} is VALID [2018-11-23 11:55:32,129 INFO L273 TraceCheckUtils]: 40: Hoare triple {1066#false} assume !false; {1066#false} is VALID [2018-11-23 11:55:32,132 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:55:32,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:32,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 11:55:32,160 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-11-23 11:55:32,161 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:32,161 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:55:32,230 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:32,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:55:32,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:55:32,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:55:32,232 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand 6 states. [2018-11-23 11:55:32,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:32,605 INFO L93 Difference]: Finished difference Result 98 states and 126 transitions. [2018-11-23 11:55:32,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:55:32,606 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-11-23 11:55:32,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:32,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:55:32,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2018-11-23 11:55:32,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:55:32,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2018-11-23 11:55:32,616 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 88 transitions. [2018-11-23 11:55:32,729 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:32,733 INFO L225 Difference]: With dead ends: 98 [2018-11-23 11:55:32,733 INFO L226 Difference]: Without dead ends: 85 [2018-11-23 11:55:32,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:55:32,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-23 11:55:32,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 71. [2018-11-23 11:55:32,809 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:32,809 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand 71 states. [2018-11-23 11:55:32,809 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 71 states. [2018-11-23 11:55:32,809 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 71 states. [2018-11-23 11:55:32,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:32,816 INFO L93 Difference]: Finished difference Result 85 states and 111 transitions. [2018-11-23 11:55:32,817 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 111 transitions. [2018-11-23 11:55:32,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:32,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:32,818 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 85 states. [2018-11-23 11:55:32,818 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 85 states. [2018-11-23 11:55:32,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:32,825 INFO L93 Difference]: Finished difference Result 85 states and 111 transitions. [2018-11-23 11:55:32,825 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 111 transitions. [2018-11-23 11:55:32,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:32,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:32,826 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:32,826 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:32,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-23 11:55:32,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 90 transitions. [2018-11-23 11:55:32,831 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 90 transitions. Word has length 41 [2018-11-23 11:55:32,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:32,831 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 90 transitions. [2018-11-23 11:55:32,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:55:32,831 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2018-11-23 11:55:32,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 11:55:32,833 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:32,834 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2018-11-23 11:55:32,835 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:32,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:32,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1653446061, now seen corresponding path program 2 times [2018-11-23 11:55:32,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:32,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:32,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:32,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:32,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:32,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:33,160 INFO L256 TraceCheckUtils]: 0: Hoare triple {1592#true} call ULTIMATE.init(); {1592#true} is VALID [2018-11-23 11:55:33,161 INFO L273 TraceCheckUtils]: 1: Hoare triple {1592#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1592#true} is VALID [2018-11-23 11:55:33,161 INFO L273 TraceCheckUtils]: 2: Hoare triple {1592#true} assume true; {1592#true} is VALID [2018-11-23 11:55:33,162 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1592#true} {1592#true} #120#return; {1592#true} is VALID [2018-11-23 11:55:33,163 INFO L256 TraceCheckUtils]: 4: Hoare triple {1592#true} call #t~ret15 := main(); {1592#true} is VALID [2018-11-23 11:55:33,163 INFO L273 TraceCheckUtils]: 5: Hoare triple {1592#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {1592#true} is VALID [2018-11-23 11:55:33,164 INFO L273 TraceCheckUtils]: 6: Hoare triple {1592#true} assume !(~x~0 < ~n~0); {1592#true} is VALID [2018-11-23 11:55:33,170 INFO L273 TraceCheckUtils]: 7: Hoare triple {1592#true} call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(400000);havoc ~v~0;~v~0 := 0; {1594#(= main_~v~0 0)} is VALID [2018-11-23 11:55:33,170 INFO L273 TraceCheckUtils]: 8: Hoare triple {1594#(= main_~v~0 0)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {1594#(= main_~v~0 0)} is VALID [2018-11-23 11:55:33,171 INFO L256 TraceCheckUtils]: 9: Hoare triple {1594#(= main_~v~0 0)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {1592#true} is VALID [2018-11-23 11:55:33,171 INFO L273 TraceCheckUtils]: 10: Hoare triple {1592#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {1592#true} is VALID [2018-11-23 11:55:33,171 INFO L273 TraceCheckUtils]: 11: Hoare triple {1592#true} assume !(~i~0 < ~size); {1592#true} is VALID [2018-11-23 11:55:33,171 INFO L273 TraceCheckUtils]: 12: Hoare triple {1592#true} #res := 0; {1592#true} is VALID [2018-11-23 11:55:33,171 INFO L273 TraceCheckUtils]: 13: Hoare triple {1592#true} assume true; {1592#true} is VALID [2018-11-23 11:55:33,180 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {1592#true} {1594#(= main_~v~0 0)} #126#return; {1594#(= main_~v~0 0)} is VALID [2018-11-23 11:55:33,181 INFO L273 TraceCheckUtils]: 15: Hoare triple {1594#(= main_~v~0 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {1594#(= main_~v~0 0)} is VALID [2018-11-23 11:55:33,182 INFO L273 TraceCheckUtils]: 16: Hoare triple {1594#(= main_~v~0 0)} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {1594#(= main_~v~0 0)} is VALID [2018-11-23 11:55:33,182 INFO L256 TraceCheckUtils]: 17: Hoare triple {1594#(= main_~v~0 0)} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {1592#true} is VALID [2018-11-23 11:55:33,182 INFO L273 TraceCheckUtils]: 18: Hoare triple {1592#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; {1592#true} is VALID [2018-11-23 11:55:33,182 INFO L273 TraceCheckUtils]: 19: Hoare triple {1592#true} assume true; {1592#true} is VALID [2018-11-23 11:55:33,184 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {1592#true} {1594#(= main_~v~0 0)} #128#return; {1594#(= main_~v~0 0)} is VALID [2018-11-23 11:55:33,184 INFO L273 TraceCheckUtils]: 21: Hoare triple {1594#(= main_~v~0 0)} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~mem9;havoc #t~ret10; {1594#(= main_~v~0 0)} is VALID [2018-11-23 11:55:33,185 INFO L273 TraceCheckUtils]: 22: Hoare triple {1594#(= main_~v~0 0)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {1595#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:33,185 INFO L273 TraceCheckUtils]: 23: Hoare triple {1595#(<= main_~v~0 1)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {1595#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:33,185 INFO L256 TraceCheckUtils]: 24: Hoare triple {1595#(<= main_~v~0 1)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {1592#true} is VALID [2018-11-23 11:55:33,186 INFO L273 TraceCheckUtils]: 25: Hoare triple {1592#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {1592#true} is VALID [2018-11-23 11:55:33,186 INFO L273 TraceCheckUtils]: 26: Hoare triple {1592#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {1592#true} is VALID [2018-11-23 11:55:33,186 INFO L273 TraceCheckUtils]: 27: Hoare triple {1592#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {1592#true} is VALID [2018-11-23 11:55:33,187 INFO L273 TraceCheckUtils]: 28: Hoare triple {1592#true} assume true; {1592#true} is VALID [2018-11-23 11:55:33,188 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1592#true} {1595#(<= main_~v~0 1)} #126#return; {1595#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:33,190 INFO L273 TraceCheckUtils]: 30: Hoare triple {1595#(<= main_~v~0 1)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {1595#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:33,190 INFO L273 TraceCheckUtils]: 31: Hoare triple {1595#(<= main_~v~0 1)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {1595#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:33,193 INFO L273 TraceCheckUtils]: 32: Hoare triple {1595#(<= main_~v~0 1)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {1596#(<= main_~v~0 2)} is VALID [2018-11-23 11:55:33,193 INFO L273 TraceCheckUtils]: 33: Hoare triple {1596#(<= main_~v~0 2)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {1596#(<= main_~v~0 2)} is VALID [2018-11-23 11:55:33,193 INFO L256 TraceCheckUtils]: 34: Hoare triple {1596#(<= main_~v~0 2)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {1592#true} is VALID [2018-11-23 11:55:33,194 INFO L273 TraceCheckUtils]: 35: Hoare triple {1592#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {1592#true} is VALID [2018-11-23 11:55:33,194 INFO L273 TraceCheckUtils]: 36: Hoare triple {1592#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {1592#true} is VALID [2018-11-23 11:55:33,194 INFO L273 TraceCheckUtils]: 37: Hoare triple {1592#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {1592#true} is VALID [2018-11-23 11:55:33,194 INFO L273 TraceCheckUtils]: 38: Hoare triple {1592#true} assume true; {1592#true} is VALID [2018-11-23 11:55:33,197 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {1592#true} {1596#(<= main_~v~0 2)} #126#return; {1596#(<= main_~v~0 2)} is VALID [2018-11-23 11:55:33,199 INFO L273 TraceCheckUtils]: 40: Hoare triple {1596#(<= main_~v~0 2)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {1596#(<= main_~v~0 2)} is VALID [2018-11-23 11:55:33,199 INFO L273 TraceCheckUtils]: 41: Hoare triple {1596#(<= main_~v~0 2)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {1596#(<= main_~v~0 2)} is VALID [2018-11-23 11:55:33,200 INFO L273 TraceCheckUtils]: 42: Hoare triple {1596#(<= main_~v~0 2)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {1597#(<= main_~v~0 3)} is VALID [2018-11-23 11:55:33,201 INFO L273 TraceCheckUtils]: 43: Hoare triple {1597#(<= main_~v~0 3)} assume !(~v~0 < 100000); {1593#false} is VALID [2018-11-23 11:55:33,201 INFO L273 TraceCheckUtils]: 44: Hoare triple {1593#false} ~x~0 := 0; {1593#false} is VALID [2018-11-23 11:55:33,201 INFO L273 TraceCheckUtils]: 45: Hoare triple {1593#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {1593#false} is VALID [2018-11-23 11:55:33,201 INFO L273 TraceCheckUtils]: 46: Hoare triple {1593#false} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {1593#false} is VALID [2018-11-23 11:55:33,201 INFO L256 TraceCheckUtils]: 47: Hoare triple {1593#false} call __VERIFIER_assert((if #t~mem13 != #t~mem14 then 1 else 0)); {1593#false} is VALID [2018-11-23 11:55:33,202 INFO L273 TraceCheckUtils]: 48: Hoare triple {1593#false} ~cond := #in~cond; {1593#false} is VALID [2018-11-23 11:55:33,202 INFO L273 TraceCheckUtils]: 49: Hoare triple {1593#false} assume 0 == ~cond; {1593#false} is VALID [2018-11-23 11:55:33,202 INFO L273 TraceCheckUtils]: 50: Hoare triple {1593#false} assume !false; {1593#false} is VALID [2018-11-23 11:55:33,207 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-23 11:55:33,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:33,207 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:33,217 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:55:33,272 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:55:33,272 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:33,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:33,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:33,511 INFO L256 TraceCheckUtils]: 0: Hoare triple {1592#true} call ULTIMATE.init(); {1592#true} is VALID [2018-11-23 11:55:33,512 INFO L273 TraceCheckUtils]: 1: Hoare triple {1592#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1592#true} is VALID [2018-11-23 11:55:33,512 INFO L273 TraceCheckUtils]: 2: Hoare triple {1592#true} assume true; {1592#true} is VALID [2018-11-23 11:55:33,513 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1592#true} {1592#true} #120#return; {1592#true} is VALID [2018-11-23 11:55:33,513 INFO L256 TraceCheckUtils]: 4: Hoare triple {1592#true} call #t~ret15 := main(); {1592#true} is VALID [2018-11-23 11:55:33,533 INFO L273 TraceCheckUtils]: 5: Hoare triple {1592#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {1616#(<= main_~n~0 0)} is VALID [2018-11-23 11:55:33,542 INFO L273 TraceCheckUtils]: 6: Hoare triple {1616#(<= main_~n~0 0)} assume !(~x~0 < ~n~0); {1616#(<= main_~n~0 0)} is VALID [2018-11-23 11:55:33,554 INFO L273 TraceCheckUtils]: 7: Hoare triple {1616#(<= main_~n~0 0)} call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(400000);havoc ~v~0;~v~0 := 0; {1616#(<= main_~n~0 0)} is VALID [2018-11-23 11:55:33,562 INFO L273 TraceCheckUtils]: 8: Hoare triple {1616#(<= main_~n~0 0)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {1616#(<= main_~n~0 0)} is VALID [2018-11-23 11:55:33,562 INFO L256 TraceCheckUtils]: 9: Hoare triple {1616#(<= main_~n~0 0)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {1592#true} is VALID [2018-11-23 11:55:33,562 INFO L273 TraceCheckUtils]: 10: Hoare triple {1592#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {1592#true} is VALID [2018-11-23 11:55:33,563 INFO L273 TraceCheckUtils]: 11: Hoare triple {1592#true} assume !(~i~0 < ~size); {1592#true} is VALID [2018-11-23 11:55:33,563 INFO L273 TraceCheckUtils]: 12: Hoare triple {1592#true} #res := 0; {1592#true} is VALID [2018-11-23 11:55:33,563 INFO L273 TraceCheckUtils]: 13: Hoare triple {1592#true} assume true; {1592#true} is VALID [2018-11-23 11:55:33,564 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {1592#true} {1616#(<= main_~n~0 0)} #126#return; {1616#(<= main_~n~0 0)} is VALID [2018-11-23 11:55:33,568 INFO L273 TraceCheckUtils]: 15: Hoare triple {1616#(<= main_~n~0 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {1616#(<= main_~n~0 0)} is VALID [2018-11-23 11:55:33,568 INFO L273 TraceCheckUtils]: 16: Hoare triple {1616#(<= main_~n~0 0)} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {1616#(<= main_~n~0 0)} is VALID [2018-11-23 11:55:33,568 INFO L256 TraceCheckUtils]: 17: Hoare triple {1616#(<= main_~n~0 0)} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {1592#true} is VALID [2018-11-23 11:55:33,570 INFO L273 TraceCheckUtils]: 18: Hoare triple {1592#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; {1656#(<= |insert_#res| (+ |insert_#in~size| 1))} is VALID [2018-11-23 11:55:33,570 INFO L273 TraceCheckUtils]: 19: Hoare triple {1656#(<= |insert_#res| (+ |insert_#in~size| 1))} assume true; {1656#(<= |insert_#res| (+ |insert_#in~size| 1))} is VALID [2018-11-23 11:55:33,573 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {1656#(<= |insert_#res| (+ |insert_#in~size| 1))} {1616#(<= main_~n~0 0)} #128#return; {1663#(<= |main_#t~ret10| 1)} is VALID [2018-11-23 11:55:33,574 INFO L273 TraceCheckUtils]: 21: Hoare triple {1663#(<= |main_#t~ret10| 1)} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~mem9;havoc #t~ret10; {1667#(<= main_~n~0 1)} is VALID [2018-11-23 11:55:33,574 INFO L273 TraceCheckUtils]: 22: Hoare triple {1667#(<= main_~n~0 1)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {1667#(<= main_~n~0 1)} is VALID [2018-11-23 11:55:33,575 INFO L273 TraceCheckUtils]: 23: Hoare triple {1667#(<= main_~n~0 1)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {1667#(<= main_~n~0 1)} is VALID [2018-11-23 11:55:33,575 INFO L256 TraceCheckUtils]: 24: Hoare triple {1667#(<= main_~n~0 1)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {1592#true} is VALID [2018-11-23 11:55:33,575 INFO L273 TraceCheckUtils]: 25: Hoare triple {1592#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {1592#true} is VALID [2018-11-23 11:55:33,576 INFO L273 TraceCheckUtils]: 26: Hoare triple {1592#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {1592#true} is VALID [2018-11-23 11:55:33,576 INFO L273 TraceCheckUtils]: 27: Hoare triple {1592#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {1592#true} is VALID [2018-11-23 11:55:33,576 INFO L273 TraceCheckUtils]: 28: Hoare triple {1592#true} assume true; {1592#true} is VALID [2018-11-23 11:55:33,578 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1592#true} {1667#(<= main_~n~0 1)} #126#return; {1667#(<= main_~n~0 1)} is VALID [2018-11-23 11:55:33,595 INFO L273 TraceCheckUtils]: 30: Hoare triple {1667#(<= main_~n~0 1)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {1667#(<= main_~n~0 1)} is VALID [2018-11-23 11:55:33,595 INFO L273 TraceCheckUtils]: 31: Hoare triple {1667#(<= main_~n~0 1)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {1667#(<= main_~n~0 1)} is VALID [2018-11-23 11:55:33,600 INFO L273 TraceCheckUtils]: 32: Hoare triple {1667#(<= main_~n~0 1)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {1667#(<= main_~n~0 1)} is VALID [2018-11-23 11:55:33,600 INFO L273 TraceCheckUtils]: 33: Hoare triple {1667#(<= main_~n~0 1)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {1667#(<= main_~n~0 1)} is VALID [2018-11-23 11:55:33,600 INFO L256 TraceCheckUtils]: 34: Hoare triple {1667#(<= main_~n~0 1)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {1592#true} is VALID [2018-11-23 11:55:33,600 INFO L273 TraceCheckUtils]: 35: Hoare triple {1592#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {1592#true} is VALID [2018-11-23 11:55:33,601 INFO L273 TraceCheckUtils]: 36: Hoare triple {1592#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {1592#true} is VALID [2018-11-23 11:55:33,601 INFO L273 TraceCheckUtils]: 37: Hoare triple {1592#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {1592#true} is VALID [2018-11-23 11:55:33,601 INFO L273 TraceCheckUtils]: 38: Hoare triple {1592#true} assume true; {1592#true} is VALID [2018-11-23 11:55:33,602 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {1592#true} {1667#(<= main_~n~0 1)} #126#return; {1667#(<= main_~n~0 1)} is VALID [2018-11-23 11:55:33,602 INFO L273 TraceCheckUtils]: 40: Hoare triple {1667#(<= main_~n~0 1)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {1667#(<= main_~n~0 1)} is VALID [2018-11-23 11:55:33,603 INFO L273 TraceCheckUtils]: 41: Hoare triple {1667#(<= main_~n~0 1)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {1667#(<= main_~n~0 1)} is VALID [2018-11-23 11:55:33,603 INFO L273 TraceCheckUtils]: 42: Hoare triple {1667#(<= main_~n~0 1)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {1667#(<= main_~n~0 1)} is VALID [2018-11-23 11:55:33,603 INFO L273 TraceCheckUtils]: 43: Hoare triple {1667#(<= main_~n~0 1)} assume !(~v~0 < 100000); {1667#(<= main_~n~0 1)} is VALID [2018-11-23 11:55:33,604 INFO L273 TraceCheckUtils]: 44: Hoare triple {1667#(<= main_~n~0 1)} ~x~0 := 0; {1737#(and (<= main_~n~0 1) (<= 0 main_~x~0))} is VALID [2018-11-23 11:55:33,604 INFO L273 TraceCheckUtils]: 45: Hoare triple {1737#(and (<= main_~n~0 1) (<= 0 main_~x~0))} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {1741#(and (<= 1 main_~y~0) (<= main_~n~0 1))} is VALID [2018-11-23 11:55:33,605 INFO L273 TraceCheckUtils]: 46: Hoare triple {1741#(and (<= 1 main_~y~0) (<= main_~n~0 1))} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {1593#false} is VALID [2018-11-23 11:55:33,605 INFO L256 TraceCheckUtils]: 47: Hoare triple {1593#false} call __VERIFIER_assert((if #t~mem13 != #t~mem14 then 1 else 0)); {1593#false} is VALID [2018-11-23 11:55:33,606 INFO L273 TraceCheckUtils]: 48: Hoare triple {1593#false} ~cond := #in~cond; {1593#false} is VALID [2018-11-23 11:55:33,606 INFO L273 TraceCheckUtils]: 49: Hoare triple {1593#false} assume 0 == ~cond; {1593#false} is VALID [2018-11-23 11:55:33,606 INFO L273 TraceCheckUtils]: 50: Hoare triple {1593#false} assume !false; {1593#false} is VALID [2018-11-23 11:55:33,610 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-23 11:55:33,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:33,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2018-11-23 11:55:33,631 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2018-11-23 11:55:33,631 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:33,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:55:33,721 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:33,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:55:33,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:55:33,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:55:33,722 INFO L87 Difference]: Start difference. First operand 71 states and 90 transitions. Second operand 12 states. [2018-11-23 11:55:34,939 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-23 11:55:36,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:36,554 INFO L93 Difference]: Finished difference Result 161 states and 215 transitions. [2018-11-23 11:55:36,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 11:55:36,555 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2018-11-23 11:55:36,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:36,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:55:36,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 178 transitions. [2018-11-23 11:55:36,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:55:36,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 178 transitions. [2018-11-23 11:55:36,569 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 178 transitions. [2018-11-23 11:55:36,800 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:36,805 INFO L225 Difference]: With dead ends: 161 [2018-11-23 11:55:36,805 INFO L226 Difference]: Without dead ends: 143 [2018-11-23 11:55:36,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=197, Invalid=505, Unknown=0, NotChecked=0, Total=702 [2018-11-23 11:55:36,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-11-23 11:55:36,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 98. [2018-11-23 11:55:36,907 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:36,907 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand 98 states. [2018-11-23 11:55:36,907 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand 98 states. [2018-11-23 11:55:36,908 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 98 states. [2018-11-23 11:55:36,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:36,916 INFO L93 Difference]: Finished difference Result 143 states and 192 transitions. [2018-11-23 11:55:36,916 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 192 transitions. [2018-11-23 11:55:36,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:36,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:36,917 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 143 states. [2018-11-23 11:55:36,918 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 143 states. [2018-11-23 11:55:36,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:36,926 INFO L93 Difference]: Finished difference Result 143 states and 192 transitions. [2018-11-23 11:55:36,926 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 192 transitions. [2018-11-23 11:55:36,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:36,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:36,927 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:36,927 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:36,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-23 11:55:36,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 129 transitions. [2018-11-23 11:55:36,932 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 129 transitions. Word has length 51 [2018-11-23 11:55:36,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:36,933 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 129 transitions. [2018-11-23 11:55:36,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:55:36,933 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 129 transitions. [2018-11-23 11:55:36,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-23 11:55:36,934 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:36,934 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2018-11-23 11:55:36,935 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:36,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:36,935 INFO L82 PathProgramCache]: Analyzing trace with hash 44769349, now seen corresponding path program 3 times [2018-11-23 11:55:36,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:36,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:36,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:36,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:36,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:36,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:37,097 INFO L256 TraceCheckUtils]: 0: Hoare triple {2422#true} call ULTIMATE.init(); {2422#true} is VALID [2018-11-23 11:55:37,098 INFO L273 TraceCheckUtils]: 1: Hoare triple {2422#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2422#true} is VALID [2018-11-23 11:55:37,098 INFO L273 TraceCheckUtils]: 2: Hoare triple {2422#true} assume true; {2422#true} is VALID [2018-11-23 11:55:37,098 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2422#true} {2422#true} #120#return; {2422#true} is VALID [2018-11-23 11:55:37,099 INFO L256 TraceCheckUtils]: 4: Hoare triple {2422#true} call #t~ret15 := main(); {2422#true} is VALID [2018-11-23 11:55:37,099 INFO L273 TraceCheckUtils]: 5: Hoare triple {2422#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {2422#true} is VALID [2018-11-23 11:55:37,099 INFO L273 TraceCheckUtils]: 6: Hoare triple {2422#true} assume !(~x~0 < ~n~0); {2422#true} is VALID [2018-11-23 11:55:37,100 INFO L273 TraceCheckUtils]: 7: Hoare triple {2422#true} call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(400000);havoc ~v~0;~v~0 := 0; {2424#(= main_~v~0 0)} is VALID [2018-11-23 11:55:37,101 INFO L273 TraceCheckUtils]: 8: Hoare triple {2424#(= main_~v~0 0)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {2424#(= main_~v~0 0)} is VALID [2018-11-23 11:55:37,101 INFO L256 TraceCheckUtils]: 9: Hoare triple {2424#(= main_~v~0 0)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {2422#true} is VALID [2018-11-23 11:55:37,102 INFO L273 TraceCheckUtils]: 10: Hoare triple {2422#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {2422#true} is VALID [2018-11-23 11:55:37,102 INFO L273 TraceCheckUtils]: 11: Hoare triple {2422#true} assume !(~i~0 < ~size); {2422#true} is VALID [2018-11-23 11:55:37,102 INFO L273 TraceCheckUtils]: 12: Hoare triple {2422#true} #res := 0; {2422#true} is VALID [2018-11-23 11:55:37,102 INFO L273 TraceCheckUtils]: 13: Hoare triple {2422#true} assume true; {2422#true} is VALID [2018-11-23 11:55:37,103 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {2422#true} {2424#(= main_~v~0 0)} #126#return; {2424#(= main_~v~0 0)} is VALID [2018-11-23 11:55:37,103 INFO L273 TraceCheckUtils]: 15: Hoare triple {2424#(= main_~v~0 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {2424#(= main_~v~0 0)} is VALID [2018-11-23 11:55:37,104 INFO L273 TraceCheckUtils]: 16: Hoare triple {2424#(= main_~v~0 0)} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {2424#(= main_~v~0 0)} is VALID [2018-11-23 11:55:37,104 INFO L256 TraceCheckUtils]: 17: Hoare triple {2424#(= main_~v~0 0)} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {2422#true} is VALID [2018-11-23 11:55:37,104 INFO L273 TraceCheckUtils]: 18: Hoare triple {2422#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; {2422#true} is VALID [2018-11-23 11:55:37,104 INFO L273 TraceCheckUtils]: 19: Hoare triple {2422#true} assume true; {2422#true} is VALID [2018-11-23 11:55:37,105 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {2422#true} {2424#(= main_~v~0 0)} #128#return; {2424#(= main_~v~0 0)} is VALID [2018-11-23 11:55:37,106 INFO L273 TraceCheckUtils]: 21: Hoare triple {2424#(= main_~v~0 0)} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~mem9;havoc #t~ret10; {2424#(= main_~v~0 0)} is VALID [2018-11-23 11:55:37,107 INFO L273 TraceCheckUtils]: 22: Hoare triple {2424#(= main_~v~0 0)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {2425#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:37,107 INFO L273 TraceCheckUtils]: 23: Hoare triple {2425#(<= main_~v~0 1)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {2425#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:37,108 INFO L256 TraceCheckUtils]: 24: Hoare triple {2425#(<= main_~v~0 1)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {2422#true} is VALID [2018-11-23 11:55:37,108 INFO L273 TraceCheckUtils]: 25: Hoare triple {2422#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {2422#true} is VALID [2018-11-23 11:55:37,108 INFO L273 TraceCheckUtils]: 26: Hoare triple {2422#true} assume !(~i~0 < ~size); {2422#true} is VALID [2018-11-23 11:55:37,108 INFO L273 TraceCheckUtils]: 27: Hoare triple {2422#true} #res := 0; {2422#true} is VALID [2018-11-23 11:55:37,109 INFO L273 TraceCheckUtils]: 28: Hoare triple {2422#true} assume true; {2422#true} is VALID [2018-11-23 11:55:37,110 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {2422#true} {2425#(<= main_~v~0 1)} #126#return; {2425#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:37,111 INFO L273 TraceCheckUtils]: 30: Hoare triple {2425#(<= main_~v~0 1)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {2425#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:37,111 INFO L273 TraceCheckUtils]: 31: Hoare triple {2425#(<= main_~v~0 1)} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {2425#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:37,112 INFO L256 TraceCheckUtils]: 32: Hoare triple {2425#(<= main_~v~0 1)} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {2422#true} is VALID [2018-11-23 11:55:37,112 INFO L273 TraceCheckUtils]: 33: Hoare triple {2422#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; {2422#true} is VALID [2018-11-23 11:55:37,112 INFO L273 TraceCheckUtils]: 34: Hoare triple {2422#true} assume true; {2422#true} is VALID [2018-11-23 11:55:37,114 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {2422#true} {2425#(<= main_~v~0 1)} #128#return; {2425#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:37,114 INFO L273 TraceCheckUtils]: 36: Hoare triple {2425#(<= main_~v~0 1)} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~mem9;havoc #t~ret10; {2425#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:37,115 INFO L273 TraceCheckUtils]: 37: Hoare triple {2425#(<= main_~v~0 1)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {2426#(<= main_~v~0 2)} is VALID [2018-11-23 11:55:37,115 INFO L273 TraceCheckUtils]: 38: Hoare triple {2426#(<= main_~v~0 2)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {2426#(<= main_~v~0 2)} is VALID [2018-11-23 11:55:37,116 INFO L256 TraceCheckUtils]: 39: Hoare triple {2426#(<= main_~v~0 2)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {2422#true} is VALID [2018-11-23 11:55:37,116 INFO L273 TraceCheckUtils]: 40: Hoare triple {2422#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {2422#true} is VALID [2018-11-23 11:55:37,116 INFO L273 TraceCheckUtils]: 41: Hoare triple {2422#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {2422#true} is VALID [2018-11-23 11:55:37,116 INFO L273 TraceCheckUtils]: 42: Hoare triple {2422#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {2422#true} is VALID [2018-11-23 11:55:37,116 INFO L273 TraceCheckUtils]: 43: Hoare triple {2422#true} assume true; {2422#true} is VALID [2018-11-23 11:55:37,119 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {2422#true} {2426#(<= main_~v~0 2)} #126#return; {2426#(<= main_~v~0 2)} is VALID [2018-11-23 11:55:37,120 INFO L273 TraceCheckUtils]: 45: Hoare triple {2426#(<= main_~v~0 2)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {2426#(<= main_~v~0 2)} is VALID [2018-11-23 11:55:37,120 INFO L273 TraceCheckUtils]: 46: Hoare triple {2426#(<= main_~v~0 2)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {2426#(<= main_~v~0 2)} is VALID [2018-11-23 11:55:37,121 INFO L273 TraceCheckUtils]: 47: Hoare triple {2426#(<= main_~v~0 2)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {2427#(<= main_~v~0 3)} is VALID [2018-11-23 11:55:37,122 INFO L273 TraceCheckUtils]: 48: Hoare triple {2427#(<= main_~v~0 3)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {2427#(<= main_~v~0 3)} is VALID [2018-11-23 11:55:37,122 INFO L256 TraceCheckUtils]: 49: Hoare triple {2427#(<= main_~v~0 3)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {2422#true} is VALID [2018-11-23 11:55:37,122 INFO L273 TraceCheckUtils]: 50: Hoare triple {2422#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {2422#true} is VALID [2018-11-23 11:55:37,122 INFO L273 TraceCheckUtils]: 51: Hoare triple {2422#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {2422#true} is VALID [2018-11-23 11:55:37,123 INFO L273 TraceCheckUtils]: 52: Hoare triple {2422#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {2422#true} is VALID [2018-11-23 11:55:37,123 INFO L273 TraceCheckUtils]: 53: Hoare triple {2422#true} assume true; {2422#true} is VALID [2018-11-23 11:55:37,124 INFO L268 TraceCheckUtils]: 54: Hoare quadruple {2422#true} {2427#(<= main_~v~0 3)} #126#return; {2427#(<= main_~v~0 3)} is VALID [2018-11-23 11:55:37,125 INFO L273 TraceCheckUtils]: 55: Hoare triple {2427#(<= main_~v~0 3)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {2427#(<= main_~v~0 3)} is VALID [2018-11-23 11:55:37,126 INFO L273 TraceCheckUtils]: 56: Hoare triple {2427#(<= main_~v~0 3)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {2427#(<= main_~v~0 3)} is VALID [2018-11-23 11:55:37,126 INFO L273 TraceCheckUtils]: 57: Hoare triple {2427#(<= main_~v~0 3)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {2428#(<= main_~v~0 4)} is VALID [2018-11-23 11:55:37,133 INFO L273 TraceCheckUtils]: 58: Hoare triple {2428#(<= main_~v~0 4)} assume !(~v~0 < 100000); {2423#false} is VALID [2018-11-23 11:55:37,133 INFO L273 TraceCheckUtils]: 59: Hoare triple {2423#false} ~x~0 := 0; {2423#false} is VALID [2018-11-23 11:55:37,133 INFO L273 TraceCheckUtils]: 60: Hoare triple {2423#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {2423#false} is VALID [2018-11-23 11:55:37,134 INFO L273 TraceCheckUtils]: 61: Hoare triple {2423#false} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {2423#false} is VALID [2018-11-23 11:55:37,134 INFO L256 TraceCheckUtils]: 62: Hoare triple {2423#false} call __VERIFIER_assert((if #t~mem13 != #t~mem14 then 1 else 0)); {2423#false} is VALID [2018-11-23 11:55:37,134 INFO L273 TraceCheckUtils]: 63: Hoare triple {2423#false} ~cond := #in~cond; {2423#false} is VALID [2018-11-23 11:55:37,134 INFO L273 TraceCheckUtils]: 64: Hoare triple {2423#false} assume 0 == ~cond; {2423#false} is VALID [2018-11-23 11:55:37,134 INFO L273 TraceCheckUtils]: 65: Hoare triple {2423#false} assume !false; {2423#false} is VALID [2018-11-23 11:55:37,138 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-23 11:55:37,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:37,138 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:37,155 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:55:37,224 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-23 11:55:37,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:37,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:37,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:37,442 INFO L256 TraceCheckUtils]: 0: Hoare triple {2422#true} call ULTIMATE.init(); {2422#true} is VALID [2018-11-23 11:55:37,442 INFO L273 TraceCheckUtils]: 1: Hoare triple {2422#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2422#true} is VALID [2018-11-23 11:55:37,442 INFO L273 TraceCheckUtils]: 2: Hoare triple {2422#true} assume true; {2422#true} is VALID [2018-11-23 11:55:37,443 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2422#true} {2422#true} #120#return; {2422#true} is VALID [2018-11-23 11:55:37,443 INFO L256 TraceCheckUtils]: 4: Hoare triple {2422#true} call #t~ret15 := main(); {2422#true} is VALID [2018-11-23 11:55:37,443 INFO L273 TraceCheckUtils]: 5: Hoare triple {2422#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {2422#true} is VALID [2018-11-23 11:55:37,443 INFO L273 TraceCheckUtils]: 6: Hoare triple {2422#true} assume !(~x~0 < ~n~0); {2422#true} is VALID [2018-11-23 11:55:37,444 INFO L273 TraceCheckUtils]: 7: Hoare triple {2422#true} call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(400000);havoc ~v~0;~v~0 := 0; {2453#(<= main_~v~0 0)} is VALID [2018-11-23 11:55:37,445 INFO L273 TraceCheckUtils]: 8: Hoare triple {2453#(<= main_~v~0 0)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {2453#(<= main_~v~0 0)} is VALID [2018-11-23 11:55:37,445 INFO L256 TraceCheckUtils]: 9: Hoare triple {2453#(<= main_~v~0 0)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {2422#true} is VALID [2018-11-23 11:55:37,445 INFO L273 TraceCheckUtils]: 10: Hoare triple {2422#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {2422#true} is VALID [2018-11-23 11:55:37,445 INFO L273 TraceCheckUtils]: 11: Hoare triple {2422#true} assume !(~i~0 < ~size); {2422#true} is VALID [2018-11-23 11:55:37,445 INFO L273 TraceCheckUtils]: 12: Hoare triple {2422#true} #res := 0; {2422#true} is VALID [2018-11-23 11:55:37,445 INFO L273 TraceCheckUtils]: 13: Hoare triple {2422#true} assume true; {2422#true} is VALID [2018-11-23 11:55:37,448 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {2422#true} {2453#(<= main_~v~0 0)} #126#return; {2453#(<= main_~v~0 0)} is VALID [2018-11-23 11:55:37,448 INFO L273 TraceCheckUtils]: 15: Hoare triple {2453#(<= main_~v~0 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {2453#(<= main_~v~0 0)} is VALID [2018-11-23 11:55:37,449 INFO L273 TraceCheckUtils]: 16: Hoare triple {2453#(<= main_~v~0 0)} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {2453#(<= main_~v~0 0)} is VALID [2018-11-23 11:55:37,449 INFO L256 TraceCheckUtils]: 17: Hoare triple {2453#(<= main_~v~0 0)} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {2422#true} is VALID [2018-11-23 11:55:37,449 INFO L273 TraceCheckUtils]: 18: Hoare triple {2422#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; {2422#true} is VALID [2018-11-23 11:55:37,449 INFO L273 TraceCheckUtils]: 19: Hoare triple {2422#true} assume true; {2422#true} is VALID [2018-11-23 11:55:37,452 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {2422#true} {2453#(<= main_~v~0 0)} #128#return; {2453#(<= main_~v~0 0)} is VALID [2018-11-23 11:55:37,452 INFO L273 TraceCheckUtils]: 21: Hoare triple {2453#(<= main_~v~0 0)} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~mem9;havoc #t~ret10; {2453#(<= main_~v~0 0)} is VALID [2018-11-23 11:55:37,453 INFO L273 TraceCheckUtils]: 22: Hoare triple {2453#(<= main_~v~0 0)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {2425#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:37,453 INFO L273 TraceCheckUtils]: 23: Hoare triple {2425#(<= main_~v~0 1)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {2425#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:37,454 INFO L256 TraceCheckUtils]: 24: Hoare triple {2425#(<= main_~v~0 1)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {2422#true} is VALID [2018-11-23 11:55:37,454 INFO L273 TraceCheckUtils]: 25: Hoare triple {2422#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {2422#true} is VALID [2018-11-23 11:55:37,454 INFO L273 TraceCheckUtils]: 26: Hoare triple {2422#true} assume !(~i~0 < ~size); {2422#true} is VALID [2018-11-23 11:55:37,454 INFO L273 TraceCheckUtils]: 27: Hoare triple {2422#true} #res := 0; {2422#true} is VALID [2018-11-23 11:55:37,454 INFO L273 TraceCheckUtils]: 28: Hoare triple {2422#true} assume true; {2422#true} is VALID [2018-11-23 11:55:37,455 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {2422#true} {2425#(<= main_~v~0 1)} #126#return; {2425#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:37,455 INFO L273 TraceCheckUtils]: 30: Hoare triple {2425#(<= main_~v~0 1)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {2425#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:37,456 INFO L273 TraceCheckUtils]: 31: Hoare triple {2425#(<= main_~v~0 1)} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {2425#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:37,456 INFO L256 TraceCheckUtils]: 32: Hoare triple {2425#(<= main_~v~0 1)} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {2422#true} is VALID [2018-11-23 11:55:37,456 INFO L273 TraceCheckUtils]: 33: Hoare triple {2422#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; {2422#true} is VALID [2018-11-23 11:55:37,456 INFO L273 TraceCheckUtils]: 34: Hoare triple {2422#true} assume true; {2422#true} is VALID [2018-11-23 11:55:37,464 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {2422#true} {2425#(<= main_~v~0 1)} #128#return; {2425#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:37,465 INFO L273 TraceCheckUtils]: 36: Hoare triple {2425#(<= main_~v~0 1)} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~mem9;havoc #t~ret10; {2425#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:37,466 INFO L273 TraceCheckUtils]: 37: Hoare triple {2425#(<= main_~v~0 1)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {2426#(<= main_~v~0 2)} is VALID [2018-11-23 11:55:37,466 INFO L273 TraceCheckUtils]: 38: Hoare triple {2426#(<= main_~v~0 2)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {2426#(<= main_~v~0 2)} is VALID [2018-11-23 11:55:37,467 INFO L256 TraceCheckUtils]: 39: Hoare triple {2426#(<= main_~v~0 2)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {2422#true} is VALID [2018-11-23 11:55:37,467 INFO L273 TraceCheckUtils]: 40: Hoare triple {2422#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {2422#true} is VALID [2018-11-23 11:55:37,467 INFO L273 TraceCheckUtils]: 41: Hoare triple {2422#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {2422#true} is VALID [2018-11-23 11:55:37,467 INFO L273 TraceCheckUtils]: 42: Hoare triple {2422#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {2422#true} is VALID [2018-11-23 11:55:37,467 INFO L273 TraceCheckUtils]: 43: Hoare triple {2422#true} assume true; {2422#true} is VALID [2018-11-23 11:55:37,469 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {2422#true} {2426#(<= main_~v~0 2)} #126#return; {2426#(<= main_~v~0 2)} is VALID [2018-11-23 11:55:37,470 INFO L273 TraceCheckUtils]: 45: Hoare triple {2426#(<= main_~v~0 2)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {2426#(<= main_~v~0 2)} is VALID [2018-11-23 11:55:37,470 INFO L273 TraceCheckUtils]: 46: Hoare triple {2426#(<= main_~v~0 2)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {2426#(<= main_~v~0 2)} is VALID [2018-11-23 11:55:37,471 INFO L273 TraceCheckUtils]: 47: Hoare triple {2426#(<= main_~v~0 2)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {2427#(<= main_~v~0 3)} is VALID [2018-11-23 11:55:37,472 INFO L273 TraceCheckUtils]: 48: Hoare triple {2427#(<= main_~v~0 3)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {2427#(<= main_~v~0 3)} is VALID [2018-11-23 11:55:37,472 INFO L256 TraceCheckUtils]: 49: Hoare triple {2427#(<= main_~v~0 3)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {2422#true} is VALID [2018-11-23 11:55:37,472 INFO L273 TraceCheckUtils]: 50: Hoare triple {2422#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {2422#true} is VALID [2018-11-23 11:55:37,472 INFO L273 TraceCheckUtils]: 51: Hoare triple {2422#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {2422#true} is VALID [2018-11-23 11:55:37,472 INFO L273 TraceCheckUtils]: 52: Hoare triple {2422#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {2422#true} is VALID [2018-11-23 11:55:37,473 INFO L273 TraceCheckUtils]: 53: Hoare triple {2422#true} assume true; {2422#true} is VALID [2018-11-23 11:55:37,474 INFO L268 TraceCheckUtils]: 54: Hoare quadruple {2422#true} {2427#(<= main_~v~0 3)} #126#return; {2427#(<= main_~v~0 3)} is VALID [2018-11-23 11:55:37,475 INFO L273 TraceCheckUtils]: 55: Hoare triple {2427#(<= main_~v~0 3)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {2427#(<= main_~v~0 3)} is VALID [2018-11-23 11:55:37,475 INFO L273 TraceCheckUtils]: 56: Hoare triple {2427#(<= main_~v~0 3)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {2427#(<= main_~v~0 3)} is VALID [2018-11-23 11:55:37,476 INFO L273 TraceCheckUtils]: 57: Hoare triple {2427#(<= main_~v~0 3)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {2428#(<= main_~v~0 4)} is VALID [2018-11-23 11:55:37,476 INFO L273 TraceCheckUtils]: 58: Hoare triple {2428#(<= main_~v~0 4)} assume !(~v~0 < 100000); {2423#false} is VALID [2018-11-23 11:55:37,476 INFO L273 TraceCheckUtils]: 59: Hoare triple {2423#false} ~x~0 := 0; {2423#false} is VALID [2018-11-23 11:55:37,477 INFO L273 TraceCheckUtils]: 60: Hoare triple {2423#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {2423#false} is VALID [2018-11-23 11:55:37,477 INFO L273 TraceCheckUtils]: 61: Hoare triple {2423#false} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {2423#false} is VALID [2018-11-23 11:55:37,477 INFO L256 TraceCheckUtils]: 62: Hoare triple {2423#false} call __VERIFIER_assert((if #t~mem13 != #t~mem14 then 1 else 0)); {2423#false} is VALID [2018-11-23 11:55:37,477 INFO L273 TraceCheckUtils]: 63: Hoare triple {2423#false} ~cond := #in~cond; {2423#false} is VALID [2018-11-23 11:55:37,477 INFO L273 TraceCheckUtils]: 64: Hoare triple {2423#false} assume 0 == ~cond; {2423#false} is VALID [2018-11-23 11:55:37,477 INFO L273 TraceCheckUtils]: 65: Hoare triple {2423#false} assume !false; {2423#false} is VALID [2018-11-23 11:55:37,480 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-23 11:55:37,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:37,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 11:55:37,501 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2018-11-23 11:55:37,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:37,502 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:55:37,616 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:37,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:55:37,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:55:37,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:55:37,617 INFO L87 Difference]: Start difference. First operand 98 states and 129 transitions. Second operand 8 states. [2018-11-23 11:55:38,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:38,253 INFO L93 Difference]: Finished difference Result 167 states and 226 transitions. [2018-11-23 11:55:38,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:55:38,253 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2018-11-23 11:55:38,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:38,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:55:38,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 108 transitions. [2018-11-23 11:55:38,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:55:38,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 108 transitions. [2018-11-23 11:55:38,259 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 108 transitions. [2018-11-23 11:55:38,414 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:38,419 INFO L225 Difference]: With dead ends: 167 [2018-11-23 11:55:38,420 INFO L226 Difference]: Without dead ends: 154 [2018-11-23 11:55:38,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:55:38,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-11-23 11:55:38,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 121. [2018-11-23 11:55:38,559 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:38,559 INFO L82 GeneralOperation]: Start isEquivalent. First operand 154 states. Second operand 121 states. [2018-11-23 11:55:38,559 INFO L74 IsIncluded]: Start isIncluded. First operand 154 states. Second operand 121 states. [2018-11-23 11:55:38,559 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 121 states. [2018-11-23 11:55:38,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:38,568 INFO L93 Difference]: Finished difference Result 154 states and 211 transitions. [2018-11-23 11:55:38,568 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 211 transitions. [2018-11-23 11:55:38,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:38,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:38,569 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 154 states. [2018-11-23 11:55:38,570 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 154 states. [2018-11-23 11:55:38,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:38,578 INFO L93 Difference]: Finished difference Result 154 states and 211 transitions. [2018-11-23 11:55:38,578 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 211 transitions. [2018-11-23 11:55:38,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:38,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:38,580 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:38,580 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:38,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-11-23 11:55:38,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 163 transitions. [2018-11-23 11:55:38,586 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 163 transitions. Word has length 66 [2018-11-23 11:55:38,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:38,586 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 163 transitions. [2018-11-23 11:55:38,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:55:38,586 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 163 transitions. [2018-11-23 11:55:38,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-23 11:55:38,588 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:38,588 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:38,588 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:38,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:38,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1968511016, now seen corresponding path program 4 times [2018-11-23 11:55:38,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:38,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:38,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:38,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:38,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:38,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:38,854 INFO L256 TraceCheckUtils]: 0: Hoare triple {3323#true} call ULTIMATE.init(); {3323#true} is VALID [2018-11-23 11:55:38,855 INFO L273 TraceCheckUtils]: 1: Hoare triple {3323#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3323#true} is VALID [2018-11-23 11:55:38,855 INFO L273 TraceCheckUtils]: 2: Hoare triple {3323#true} assume true; {3323#true} is VALID [2018-11-23 11:55:38,855 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3323#true} {3323#true} #120#return; {3323#true} is VALID [2018-11-23 11:55:38,856 INFO L256 TraceCheckUtils]: 4: Hoare triple {3323#true} call #t~ret15 := main(); {3323#true} is VALID [2018-11-23 11:55:38,856 INFO L273 TraceCheckUtils]: 5: Hoare triple {3323#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {3323#true} is VALID [2018-11-23 11:55:38,856 INFO L273 TraceCheckUtils]: 6: Hoare triple {3323#true} assume !(~x~0 < ~n~0); {3323#true} is VALID [2018-11-23 11:55:38,857 INFO L273 TraceCheckUtils]: 7: Hoare triple {3323#true} call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(400000);havoc ~v~0;~v~0 := 0; {3325#(= main_~v~0 0)} is VALID [2018-11-23 11:55:38,857 INFO L273 TraceCheckUtils]: 8: Hoare triple {3325#(= main_~v~0 0)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {3325#(= main_~v~0 0)} is VALID [2018-11-23 11:55:38,858 INFO L256 TraceCheckUtils]: 9: Hoare triple {3325#(= main_~v~0 0)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {3323#true} is VALID [2018-11-23 11:55:38,858 INFO L273 TraceCheckUtils]: 10: Hoare triple {3323#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {3323#true} is VALID [2018-11-23 11:55:38,858 INFO L273 TraceCheckUtils]: 11: Hoare triple {3323#true} assume !(~i~0 < ~size); {3323#true} is VALID [2018-11-23 11:55:38,858 INFO L273 TraceCheckUtils]: 12: Hoare triple {3323#true} #res := 0; {3323#true} is VALID [2018-11-23 11:55:38,859 INFO L273 TraceCheckUtils]: 13: Hoare triple {3323#true} assume true; {3323#true} is VALID [2018-11-23 11:55:38,860 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {3323#true} {3325#(= main_~v~0 0)} #126#return; {3325#(= main_~v~0 0)} is VALID [2018-11-23 11:55:38,860 INFO L273 TraceCheckUtils]: 15: Hoare triple {3325#(= main_~v~0 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {3325#(= main_~v~0 0)} is VALID [2018-11-23 11:55:38,861 INFO L273 TraceCheckUtils]: 16: Hoare triple {3325#(= main_~v~0 0)} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {3325#(= main_~v~0 0)} is VALID [2018-11-23 11:55:38,861 INFO L256 TraceCheckUtils]: 17: Hoare triple {3325#(= main_~v~0 0)} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {3323#true} is VALID [2018-11-23 11:55:38,861 INFO L273 TraceCheckUtils]: 18: Hoare triple {3323#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; {3323#true} is VALID [2018-11-23 11:55:38,861 INFO L273 TraceCheckUtils]: 19: Hoare triple {3323#true} assume true; {3323#true} is VALID [2018-11-23 11:55:38,862 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {3323#true} {3325#(= main_~v~0 0)} #128#return; {3325#(= main_~v~0 0)} is VALID [2018-11-23 11:55:38,862 INFO L273 TraceCheckUtils]: 21: Hoare triple {3325#(= main_~v~0 0)} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~mem9;havoc #t~ret10; {3325#(= main_~v~0 0)} is VALID [2018-11-23 11:55:38,863 INFO L273 TraceCheckUtils]: 22: Hoare triple {3325#(= main_~v~0 0)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {3326#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:38,863 INFO L273 TraceCheckUtils]: 23: Hoare triple {3326#(<= main_~v~0 1)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {3326#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:38,864 INFO L256 TraceCheckUtils]: 24: Hoare triple {3326#(<= main_~v~0 1)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {3323#true} is VALID [2018-11-23 11:55:38,864 INFO L273 TraceCheckUtils]: 25: Hoare triple {3323#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {3323#true} is VALID [2018-11-23 11:55:38,864 INFO L273 TraceCheckUtils]: 26: Hoare triple {3323#true} assume !(~i~0 < ~size); {3323#true} is VALID [2018-11-23 11:55:38,864 INFO L273 TraceCheckUtils]: 27: Hoare triple {3323#true} #res := 0; {3323#true} is VALID [2018-11-23 11:55:38,865 INFO L273 TraceCheckUtils]: 28: Hoare triple {3323#true} assume true; {3323#true} is VALID [2018-11-23 11:55:38,866 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {3323#true} {3326#(<= main_~v~0 1)} #126#return; {3326#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:38,867 INFO L273 TraceCheckUtils]: 30: Hoare triple {3326#(<= main_~v~0 1)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {3326#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:38,867 INFO L273 TraceCheckUtils]: 31: Hoare triple {3326#(<= main_~v~0 1)} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {3326#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:38,868 INFO L256 TraceCheckUtils]: 32: Hoare triple {3326#(<= main_~v~0 1)} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {3323#true} is VALID [2018-11-23 11:55:38,868 INFO L273 TraceCheckUtils]: 33: Hoare triple {3323#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; {3323#true} is VALID [2018-11-23 11:55:38,868 INFO L273 TraceCheckUtils]: 34: Hoare triple {3323#true} assume true; {3323#true} is VALID [2018-11-23 11:55:38,870 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {3323#true} {3326#(<= main_~v~0 1)} #128#return; {3326#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:38,870 INFO L273 TraceCheckUtils]: 36: Hoare triple {3326#(<= main_~v~0 1)} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~mem9;havoc #t~ret10; {3326#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:38,871 INFO L273 TraceCheckUtils]: 37: Hoare triple {3326#(<= main_~v~0 1)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {3327#(<= main_~v~0 2)} is VALID [2018-11-23 11:55:38,872 INFO L273 TraceCheckUtils]: 38: Hoare triple {3327#(<= main_~v~0 2)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {3327#(<= main_~v~0 2)} is VALID [2018-11-23 11:55:38,872 INFO L256 TraceCheckUtils]: 39: Hoare triple {3327#(<= main_~v~0 2)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {3323#true} is VALID [2018-11-23 11:55:38,872 INFO L273 TraceCheckUtils]: 40: Hoare triple {3323#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {3323#true} is VALID [2018-11-23 11:55:38,872 INFO L273 TraceCheckUtils]: 41: Hoare triple {3323#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {3323#true} is VALID [2018-11-23 11:55:38,873 INFO L273 TraceCheckUtils]: 42: Hoare triple {3323#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {3323#true} is VALID [2018-11-23 11:55:38,873 INFO L273 TraceCheckUtils]: 43: Hoare triple {3323#true} assume true; {3323#true} is VALID [2018-11-23 11:55:38,875 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {3323#true} {3327#(<= main_~v~0 2)} #126#return; {3327#(<= main_~v~0 2)} is VALID [2018-11-23 11:55:38,875 INFO L273 TraceCheckUtils]: 45: Hoare triple {3327#(<= main_~v~0 2)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {3327#(<= main_~v~0 2)} is VALID [2018-11-23 11:55:38,876 INFO L273 TraceCheckUtils]: 46: Hoare triple {3327#(<= main_~v~0 2)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {3327#(<= main_~v~0 2)} is VALID [2018-11-23 11:55:38,876 INFO L273 TraceCheckUtils]: 47: Hoare triple {3327#(<= main_~v~0 2)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {3328#(<= main_~v~0 3)} is VALID [2018-11-23 11:55:38,877 INFO L273 TraceCheckUtils]: 48: Hoare triple {3328#(<= main_~v~0 3)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {3328#(<= main_~v~0 3)} is VALID [2018-11-23 11:55:38,877 INFO L256 TraceCheckUtils]: 49: Hoare triple {3328#(<= main_~v~0 3)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {3323#true} is VALID [2018-11-23 11:55:38,877 INFO L273 TraceCheckUtils]: 50: Hoare triple {3323#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {3323#true} is VALID [2018-11-23 11:55:38,877 INFO L273 TraceCheckUtils]: 51: Hoare triple {3323#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {3323#true} is VALID [2018-11-23 11:55:38,877 INFO L273 TraceCheckUtils]: 52: Hoare triple {3323#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {3323#true} is VALID [2018-11-23 11:55:38,877 INFO L273 TraceCheckUtils]: 53: Hoare triple {3323#true} assume true; {3323#true} is VALID [2018-11-23 11:55:38,879 INFO L268 TraceCheckUtils]: 54: Hoare quadruple {3323#true} {3328#(<= main_~v~0 3)} #126#return; {3328#(<= main_~v~0 3)} is VALID [2018-11-23 11:55:38,879 INFO L273 TraceCheckUtils]: 55: Hoare triple {3328#(<= main_~v~0 3)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {3328#(<= main_~v~0 3)} is VALID [2018-11-23 11:55:38,880 INFO L273 TraceCheckUtils]: 56: Hoare triple {3328#(<= main_~v~0 3)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {3328#(<= main_~v~0 3)} is VALID [2018-11-23 11:55:38,881 INFO L273 TraceCheckUtils]: 57: Hoare triple {3328#(<= main_~v~0 3)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {3329#(<= main_~v~0 4)} is VALID [2018-11-23 11:55:38,881 INFO L273 TraceCheckUtils]: 58: Hoare triple {3329#(<= main_~v~0 4)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {3329#(<= main_~v~0 4)} is VALID [2018-11-23 11:55:38,881 INFO L256 TraceCheckUtils]: 59: Hoare triple {3329#(<= main_~v~0 4)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {3323#true} is VALID [2018-11-23 11:55:38,882 INFO L273 TraceCheckUtils]: 60: Hoare triple {3323#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {3323#true} is VALID [2018-11-23 11:55:38,882 INFO L273 TraceCheckUtils]: 61: Hoare triple {3323#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {3323#true} is VALID [2018-11-23 11:55:38,882 INFO L273 TraceCheckUtils]: 62: Hoare triple {3323#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {3323#true} is VALID [2018-11-23 11:55:38,883 INFO L273 TraceCheckUtils]: 63: Hoare triple {3323#true} assume true; {3323#true} is VALID [2018-11-23 11:55:38,903 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {3323#true} {3329#(<= main_~v~0 4)} #126#return; {3329#(<= main_~v~0 4)} is VALID [2018-11-23 11:55:38,916 INFO L273 TraceCheckUtils]: 65: Hoare triple {3329#(<= main_~v~0 4)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {3329#(<= main_~v~0 4)} is VALID [2018-11-23 11:55:38,925 INFO L273 TraceCheckUtils]: 66: Hoare triple {3329#(<= main_~v~0 4)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {3329#(<= main_~v~0 4)} is VALID [2018-11-23 11:55:38,932 INFO L273 TraceCheckUtils]: 67: Hoare triple {3329#(<= main_~v~0 4)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {3330#(<= main_~v~0 5)} is VALID [2018-11-23 11:55:38,933 INFO L273 TraceCheckUtils]: 68: Hoare triple {3330#(<= main_~v~0 5)} assume !(~v~0 < 100000); {3324#false} is VALID [2018-11-23 11:55:38,933 INFO L273 TraceCheckUtils]: 69: Hoare triple {3324#false} ~x~0 := 0; {3324#false} is VALID [2018-11-23 11:55:38,934 INFO L273 TraceCheckUtils]: 70: Hoare triple {3324#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {3324#false} is VALID [2018-11-23 11:55:38,934 INFO L273 TraceCheckUtils]: 71: Hoare triple {3324#false} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {3324#false} is VALID [2018-11-23 11:55:38,934 INFO L256 TraceCheckUtils]: 72: Hoare triple {3324#false} call __VERIFIER_assert((if #t~mem13 != #t~mem14 then 1 else 0)); {3324#false} is VALID [2018-11-23 11:55:38,934 INFO L273 TraceCheckUtils]: 73: Hoare triple {3324#false} ~cond := #in~cond; {3324#false} is VALID [2018-11-23 11:55:38,934 INFO L273 TraceCheckUtils]: 74: Hoare triple {3324#false} assume 0 == ~cond; {3324#false} is VALID [2018-11-23 11:55:38,934 INFO L273 TraceCheckUtils]: 75: Hoare triple {3324#false} assume !false; {3324#false} is VALID [2018-11-23 11:55:38,937 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-23 11:55:38,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:38,938 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:38,948 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:55:39,017 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:55:39,018 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:39,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:39,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:39,468 INFO L256 TraceCheckUtils]: 0: Hoare triple {3323#true} call ULTIMATE.init(); {3323#true} is VALID [2018-11-23 11:55:39,469 INFO L273 TraceCheckUtils]: 1: Hoare triple {3323#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3323#true} is VALID [2018-11-23 11:55:39,469 INFO L273 TraceCheckUtils]: 2: Hoare triple {3323#true} assume true; {3323#true} is VALID [2018-11-23 11:55:39,469 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3323#true} {3323#true} #120#return; {3323#true} is VALID [2018-11-23 11:55:39,469 INFO L256 TraceCheckUtils]: 4: Hoare triple {3323#true} call #t~ret15 := main(); {3323#true} is VALID [2018-11-23 11:55:39,470 INFO L273 TraceCheckUtils]: 5: Hoare triple {3323#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {3323#true} is VALID [2018-11-23 11:55:39,470 INFO L273 TraceCheckUtils]: 6: Hoare triple {3323#true} assume !(~x~0 < ~n~0); {3323#true} is VALID [2018-11-23 11:55:39,483 INFO L273 TraceCheckUtils]: 7: Hoare triple {3323#true} call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(400000);havoc ~v~0;~v~0 := 0; {3355#(<= main_~v~0 0)} is VALID [2018-11-23 11:55:39,485 INFO L273 TraceCheckUtils]: 8: Hoare triple {3355#(<= main_~v~0 0)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {3355#(<= main_~v~0 0)} is VALID [2018-11-23 11:55:39,485 INFO L256 TraceCheckUtils]: 9: Hoare triple {3355#(<= main_~v~0 0)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {3323#true} is VALID [2018-11-23 11:55:39,485 INFO L273 TraceCheckUtils]: 10: Hoare triple {3323#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {3323#true} is VALID [2018-11-23 11:55:39,485 INFO L273 TraceCheckUtils]: 11: Hoare triple {3323#true} assume !(~i~0 < ~size); {3323#true} is VALID [2018-11-23 11:55:39,485 INFO L273 TraceCheckUtils]: 12: Hoare triple {3323#true} #res := 0; {3323#true} is VALID [2018-11-23 11:55:39,486 INFO L273 TraceCheckUtils]: 13: Hoare triple {3323#true} assume true; {3323#true} is VALID [2018-11-23 11:55:39,487 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {3323#true} {3355#(<= main_~v~0 0)} #126#return; {3355#(<= main_~v~0 0)} is VALID [2018-11-23 11:55:39,487 INFO L273 TraceCheckUtils]: 15: Hoare triple {3355#(<= main_~v~0 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {3355#(<= main_~v~0 0)} is VALID [2018-11-23 11:55:39,491 INFO L273 TraceCheckUtils]: 16: Hoare triple {3355#(<= main_~v~0 0)} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {3355#(<= main_~v~0 0)} is VALID [2018-11-23 11:55:39,492 INFO L256 TraceCheckUtils]: 17: Hoare triple {3355#(<= main_~v~0 0)} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {3323#true} is VALID [2018-11-23 11:55:39,492 INFO L273 TraceCheckUtils]: 18: Hoare triple {3323#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; {3323#true} is VALID [2018-11-23 11:55:39,492 INFO L273 TraceCheckUtils]: 19: Hoare triple {3323#true} assume true; {3323#true} is VALID [2018-11-23 11:55:39,493 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {3323#true} {3355#(<= main_~v~0 0)} #128#return; {3355#(<= main_~v~0 0)} is VALID [2018-11-23 11:55:39,493 INFO L273 TraceCheckUtils]: 21: Hoare triple {3355#(<= main_~v~0 0)} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~mem9;havoc #t~ret10; {3355#(<= main_~v~0 0)} is VALID [2018-11-23 11:55:39,494 INFO L273 TraceCheckUtils]: 22: Hoare triple {3355#(<= main_~v~0 0)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {3326#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:39,494 INFO L273 TraceCheckUtils]: 23: Hoare triple {3326#(<= main_~v~0 1)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {3326#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:39,494 INFO L256 TraceCheckUtils]: 24: Hoare triple {3326#(<= main_~v~0 1)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {3323#true} is VALID [2018-11-23 11:55:39,495 INFO L273 TraceCheckUtils]: 25: Hoare triple {3323#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {3323#true} is VALID [2018-11-23 11:55:39,495 INFO L273 TraceCheckUtils]: 26: Hoare triple {3323#true} assume !(~i~0 < ~size); {3323#true} is VALID [2018-11-23 11:55:39,495 INFO L273 TraceCheckUtils]: 27: Hoare triple {3323#true} #res := 0; {3323#true} is VALID [2018-11-23 11:55:39,495 INFO L273 TraceCheckUtils]: 28: Hoare triple {3323#true} assume true; {3323#true} is VALID [2018-11-23 11:55:39,496 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {3323#true} {3326#(<= main_~v~0 1)} #126#return; {3326#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:39,496 INFO L273 TraceCheckUtils]: 30: Hoare triple {3326#(<= main_~v~0 1)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {3326#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:39,497 INFO L273 TraceCheckUtils]: 31: Hoare triple {3326#(<= main_~v~0 1)} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {3326#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:39,497 INFO L256 TraceCheckUtils]: 32: Hoare triple {3326#(<= main_~v~0 1)} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {3323#true} is VALID [2018-11-23 11:55:39,497 INFO L273 TraceCheckUtils]: 33: Hoare triple {3323#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; {3323#true} is VALID [2018-11-23 11:55:39,497 INFO L273 TraceCheckUtils]: 34: Hoare triple {3323#true} assume true; {3323#true} is VALID [2018-11-23 11:55:39,499 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {3323#true} {3326#(<= main_~v~0 1)} #128#return; {3326#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:39,499 INFO L273 TraceCheckUtils]: 36: Hoare triple {3326#(<= main_~v~0 1)} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~mem9;havoc #t~ret10; {3326#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:39,500 INFO L273 TraceCheckUtils]: 37: Hoare triple {3326#(<= main_~v~0 1)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {3327#(<= main_~v~0 2)} is VALID [2018-11-23 11:55:39,501 INFO L273 TraceCheckUtils]: 38: Hoare triple {3327#(<= main_~v~0 2)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {3327#(<= main_~v~0 2)} is VALID [2018-11-23 11:55:39,501 INFO L256 TraceCheckUtils]: 39: Hoare triple {3327#(<= main_~v~0 2)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {3323#true} is VALID [2018-11-23 11:55:39,501 INFO L273 TraceCheckUtils]: 40: Hoare triple {3323#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {3323#true} is VALID [2018-11-23 11:55:39,501 INFO L273 TraceCheckUtils]: 41: Hoare triple {3323#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {3323#true} is VALID [2018-11-23 11:55:39,501 INFO L273 TraceCheckUtils]: 42: Hoare triple {3323#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {3323#true} is VALID [2018-11-23 11:55:39,502 INFO L273 TraceCheckUtils]: 43: Hoare triple {3323#true} assume true; {3323#true} is VALID [2018-11-23 11:55:39,503 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {3323#true} {3327#(<= main_~v~0 2)} #126#return; {3327#(<= main_~v~0 2)} is VALID [2018-11-23 11:55:39,504 INFO L273 TraceCheckUtils]: 45: Hoare triple {3327#(<= main_~v~0 2)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {3327#(<= main_~v~0 2)} is VALID [2018-11-23 11:55:39,504 INFO L273 TraceCheckUtils]: 46: Hoare triple {3327#(<= main_~v~0 2)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {3327#(<= main_~v~0 2)} is VALID [2018-11-23 11:55:39,505 INFO L273 TraceCheckUtils]: 47: Hoare triple {3327#(<= main_~v~0 2)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {3328#(<= main_~v~0 3)} is VALID [2018-11-23 11:55:39,506 INFO L273 TraceCheckUtils]: 48: Hoare triple {3328#(<= main_~v~0 3)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {3328#(<= main_~v~0 3)} is VALID [2018-11-23 11:55:39,506 INFO L256 TraceCheckUtils]: 49: Hoare triple {3328#(<= main_~v~0 3)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {3323#true} is VALID [2018-11-23 11:55:39,506 INFO L273 TraceCheckUtils]: 50: Hoare triple {3323#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {3323#true} is VALID [2018-11-23 11:55:39,506 INFO L273 TraceCheckUtils]: 51: Hoare triple {3323#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {3323#true} is VALID [2018-11-23 11:55:39,507 INFO L273 TraceCheckUtils]: 52: Hoare triple {3323#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {3323#true} is VALID [2018-11-23 11:55:39,507 INFO L273 TraceCheckUtils]: 53: Hoare triple {3323#true} assume true; {3323#true} is VALID [2018-11-23 11:55:39,508 INFO L268 TraceCheckUtils]: 54: Hoare quadruple {3323#true} {3328#(<= main_~v~0 3)} #126#return; {3328#(<= main_~v~0 3)} is VALID [2018-11-23 11:55:39,509 INFO L273 TraceCheckUtils]: 55: Hoare triple {3328#(<= main_~v~0 3)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {3328#(<= main_~v~0 3)} is VALID [2018-11-23 11:55:39,510 INFO L273 TraceCheckUtils]: 56: Hoare triple {3328#(<= main_~v~0 3)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {3328#(<= main_~v~0 3)} is VALID [2018-11-23 11:55:39,510 INFO L273 TraceCheckUtils]: 57: Hoare triple {3328#(<= main_~v~0 3)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {3329#(<= main_~v~0 4)} is VALID [2018-11-23 11:55:39,511 INFO L273 TraceCheckUtils]: 58: Hoare triple {3329#(<= main_~v~0 4)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {3329#(<= main_~v~0 4)} is VALID [2018-11-23 11:55:39,511 INFO L256 TraceCheckUtils]: 59: Hoare triple {3329#(<= main_~v~0 4)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {3323#true} is VALID [2018-11-23 11:55:39,511 INFO L273 TraceCheckUtils]: 60: Hoare triple {3323#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {3323#true} is VALID [2018-11-23 11:55:39,512 INFO L273 TraceCheckUtils]: 61: Hoare triple {3323#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {3323#true} is VALID [2018-11-23 11:55:39,512 INFO L273 TraceCheckUtils]: 62: Hoare triple {3323#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {3323#true} is VALID [2018-11-23 11:55:39,512 INFO L273 TraceCheckUtils]: 63: Hoare triple {3323#true} assume true; {3323#true} is VALID [2018-11-23 11:55:39,514 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {3323#true} {3329#(<= main_~v~0 4)} #126#return; {3329#(<= main_~v~0 4)} is VALID [2018-11-23 11:55:39,514 INFO L273 TraceCheckUtils]: 65: Hoare triple {3329#(<= main_~v~0 4)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {3329#(<= main_~v~0 4)} is VALID [2018-11-23 11:55:39,515 INFO L273 TraceCheckUtils]: 66: Hoare triple {3329#(<= main_~v~0 4)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {3329#(<= main_~v~0 4)} is VALID [2018-11-23 11:55:39,516 INFO L273 TraceCheckUtils]: 67: Hoare triple {3329#(<= main_~v~0 4)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {3330#(<= main_~v~0 5)} is VALID [2018-11-23 11:55:39,516 INFO L273 TraceCheckUtils]: 68: Hoare triple {3330#(<= main_~v~0 5)} assume !(~v~0 < 100000); {3324#false} is VALID [2018-11-23 11:55:39,517 INFO L273 TraceCheckUtils]: 69: Hoare triple {3324#false} ~x~0 := 0; {3324#false} is VALID [2018-11-23 11:55:39,517 INFO L273 TraceCheckUtils]: 70: Hoare triple {3324#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {3324#false} is VALID [2018-11-23 11:55:39,517 INFO L273 TraceCheckUtils]: 71: Hoare triple {3324#false} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {3324#false} is VALID [2018-11-23 11:55:39,517 INFO L256 TraceCheckUtils]: 72: Hoare triple {3324#false} call __VERIFIER_assert((if #t~mem13 != #t~mem14 then 1 else 0)); {3324#false} is VALID [2018-11-23 11:55:39,518 INFO L273 TraceCheckUtils]: 73: Hoare triple {3324#false} ~cond := #in~cond; {3324#false} is VALID [2018-11-23 11:55:39,518 INFO L273 TraceCheckUtils]: 74: Hoare triple {3324#false} assume 0 == ~cond; {3324#false} is VALID [2018-11-23 11:55:39,518 INFO L273 TraceCheckUtils]: 75: Hoare triple {3324#false} assume !false; {3324#false} is VALID [2018-11-23 11:55:39,522 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-23 11:55:39,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:39,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 11:55:39,542 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 76 [2018-11-23 11:55:39,543 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:39,543 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:55:39,629 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:39,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:55:39,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:55:39,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:55:39,630 INFO L87 Difference]: Start difference. First operand 121 states and 163 transitions. Second operand 9 states. [2018-11-23 11:55:40,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:40,189 INFO L93 Difference]: Finished difference Result 190 states and 260 transitions. [2018-11-23 11:55:40,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:55:40,189 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 76 [2018-11-23 11:55:40,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:40,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:55:40,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 118 transitions. [2018-11-23 11:55:40,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:55:40,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 118 transitions. [2018-11-23 11:55:40,197 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 118 transitions. [2018-11-23 11:55:40,380 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:40,385 INFO L225 Difference]: With dead ends: 190 [2018-11-23 11:55:40,385 INFO L226 Difference]: Without dead ends: 177 [2018-11-23 11:55:40,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:55:40,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-11-23 11:55:41,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 144. [2018-11-23 11:55:41,076 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:41,077 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states. Second operand 144 states. [2018-11-23 11:55:41,077 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand 144 states. [2018-11-23 11:55:41,077 INFO L87 Difference]: Start difference. First operand 177 states. Second operand 144 states. [2018-11-23 11:55:41,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:41,088 INFO L93 Difference]: Finished difference Result 177 states and 245 transitions. [2018-11-23 11:55:41,088 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 245 transitions. [2018-11-23 11:55:41,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:41,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:41,089 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand 177 states. [2018-11-23 11:55:41,090 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 177 states. [2018-11-23 11:55:41,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:41,101 INFO L93 Difference]: Finished difference Result 177 states and 245 transitions. [2018-11-23 11:55:41,101 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 245 transitions. [2018-11-23 11:55:41,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:41,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:41,102 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:41,102 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:41,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-23 11:55:41,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 197 transitions. [2018-11-23 11:55:41,110 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 197 transitions. Word has length 76 [2018-11-23 11:55:41,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:41,111 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 197 transitions. [2018-11-23 11:55:41,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:55:41,111 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 197 transitions. [2018-11-23 11:55:41,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-23 11:55:41,113 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:41,113 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:41,113 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:41,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:41,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1506765909, now seen corresponding path program 5 times [2018-11-23 11:55:41,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:41,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:41,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:41,115 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:41,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:41,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:41,596 INFO L256 TraceCheckUtils]: 0: Hoare triple {4363#true} call ULTIMATE.init(); {4363#true} is VALID [2018-11-23 11:55:41,596 INFO L273 TraceCheckUtils]: 1: Hoare triple {4363#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4363#true} is VALID [2018-11-23 11:55:41,596 INFO L273 TraceCheckUtils]: 2: Hoare triple {4363#true} assume true; {4363#true} is VALID [2018-11-23 11:55:41,597 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4363#true} {4363#true} #120#return; {4363#true} is VALID [2018-11-23 11:55:41,597 INFO L256 TraceCheckUtils]: 4: Hoare triple {4363#true} call #t~ret15 := main(); {4363#true} is VALID [2018-11-23 11:55:41,597 INFO L273 TraceCheckUtils]: 5: Hoare triple {4363#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {4363#true} is VALID [2018-11-23 11:55:41,597 INFO L273 TraceCheckUtils]: 6: Hoare triple {4363#true} assume !(~x~0 < ~n~0); {4363#true} is VALID [2018-11-23 11:55:41,598 INFO L273 TraceCheckUtils]: 7: Hoare triple {4363#true} call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(400000);havoc ~v~0;~v~0 := 0; {4365#(= main_~v~0 0)} is VALID [2018-11-23 11:55:41,598 INFO L273 TraceCheckUtils]: 8: Hoare triple {4365#(= main_~v~0 0)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {4365#(= main_~v~0 0)} is VALID [2018-11-23 11:55:41,598 INFO L256 TraceCheckUtils]: 9: Hoare triple {4365#(= main_~v~0 0)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {4363#true} is VALID [2018-11-23 11:55:41,599 INFO L273 TraceCheckUtils]: 10: Hoare triple {4363#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {4363#true} is VALID [2018-11-23 11:55:41,599 INFO L273 TraceCheckUtils]: 11: Hoare triple {4363#true} assume !(~i~0 < ~size); {4363#true} is VALID [2018-11-23 11:55:41,599 INFO L273 TraceCheckUtils]: 12: Hoare triple {4363#true} #res := 0; {4363#true} is VALID [2018-11-23 11:55:41,599 INFO L273 TraceCheckUtils]: 13: Hoare triple {4363#true} assume true; {4363#true} is VALID [2018-11-23 11:55:41,601 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {4363#true} {4365#(= main_~v~0 0)} #126#return; {4365#(= main_~v~0 0)} is VALID [2018-11-23 11:55:41,601 INFO L273 TraceCheckUtils]: 15: Hoare triple {4365#(= main_~v~0 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {4365#(= main_~v~0 0)} is VALID [2018-11-23 11:55:41,601 INFO L273 TraceCheckUtils]: 16: Hoare triple {4365#(= main_~v~0 0)} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {4365#(= main_~v~0 0)} is VALID [2018-11-23 11:55:41,602 INFO L256 TraceCheckUtils]: 17: Hoare triple {4365#(= main_~v~0 0)} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {4363#true} is VALID [2018-11-23 11:55:41,602 INFO L273 TraceCheckUtils]: 18: Hoare triple {4363#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; {4363#true} is VALID [2018-11-23 11:55:41,602 INFO L273 TraceCheckUtils]: 19: Hoare triple {4363#true} assume true; {4363#true} is VALID [2018-11-23 11:55:41,603 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {4363#true} {4365#(= main_~v~0 0)} #128#return; {4365#(= main_~v~0 0)} is VALID [2018-11-23 11:55:41,604 INFO L273 TraceCheckUtils]: 21: Hoare triple {4365#(= main_~v~0 0)} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~mem9;havoc #t~ret10; {4365#(= main_~v~0 0)} is VALID [2018-11-23 11:55:41,605 INFO L273 TraceCheckUtils]: 22: Hoare triple {4365#(= main_~v~0 0)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {4366#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:41,605 INFO L273 TraceCheckUtils]: 23: Hoare triple {4366#(<= main_~v~0 1)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {4366#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:41,606 INFO L256 TraceCheckUtils]: 24: Hoare triple {4366#(<= main_~v~0 1)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {4363#true} is VALID [2018-11-23 11:55:41,606 INFO L273 TraceCheckUtils]: 25: Hoare triple {4363#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {4363#true} is VALID [2018-11-23 11:55:41,606 INFO L273 TraceCheckUtils]: 26: Hoare triple {4363#true} assume !(~i~0 < ~size); {4363#true} is VALID [2018-11-23 11:55:41,607 INFO L273 TraceCheckUtils]: 27: Hoare triple {4363#true} #res := 0; {4363#true} is VALID [2018-11-23 11:55:41,607 INFO L273 TraceCheckUtils]: 28: Hoare triple {4363#true} assume true; {4363#true} is VALID [2018-11-23 11:55:41,609 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {4363#true} {4366#(<= main_~v~0 1)} #126#return; {4366#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:41,609 INFO L273 TraceCheckUtils]: 30: Hoare triple {4366#(<= main_~v~0 1)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {4366#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:41,610 INFO L273 TraceCheckUtils]: 31: Hoare triple {4366#(<= main_~v~0 1)} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {4366#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:41,611 INFO L256 TraceCheckUtils]: 32: Hoare triple {4366#(<= main_~v~0 1)} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {4363#true} is VALID [2018-11-23 11:55:41,611 INFO L273 TraceCheckUtils]: 33: Hoare triple {4363#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; {4363#true} is VALID [2018-11-23 11:55:41,611 INFO L273 TraceCheckUtils]: 34: Hoare triple {4363#true} assume true; {4363#true} is VALID [2018-11-23 11:55:41,613 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {4363#true} {4366#(<= main_~v~0 1)} #128#return; {4366#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:41,613 INFO L273 TraceCheckUtils]: 36: Hoare triple {4366#(<= main_~v~0 1)} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~mem9;havoc #t~ret10; {4366#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:41,614 INFO L273 TraceCheckUtils]: 37: Hoare triple {4366#(<= main_~v~0 1)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {4367#(<= main_~v~0 2)} is VALID [2018-11-23 11:55:41,614 INFO L273 TraceCheckUtils]: 38: Hoare triple {4367#(<= main_~v~0 2)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {4367#(<= main_~v~0 2)} is VALID [2018-11-23 11:55:41,614 INFO L256 TraceCheckUtils]: 39: Hoare triple {4367#(<= main_~v~0 2)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {4363#true} is VALID [2018-11-23 11:55:41,615 INFO L273 TraceCheckUtils]: 40: Hoare triple {4363#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {4363#true} is VALID [2018-11-23 11:55:41,615 INFO L273 TraceCheckUtils]: 41: Hoare triple {4363#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {4363#true} is VALID [2018-11-23 11:55:41,615 INFO L273 TraceCheckUtils]: 42: Hoare triple {4363#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {4363#true} is VALID [2018-11-23 11:55:41,615 INFO L273 TraceCheckUtils]: 43: Hoare triple {4363#true} assume true; {4363#true} is VALID [2018-11-23 11:55:41,617 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {4363#true} {4367#(<= main_~v~0 2)} #126#return; {4367#(<= main_~v~0 2)} is VALID [2018-11-23 11:55:41,618 INFO L273 TraceCheckUtils]: 45: Hoare triple {4367#(<= main_~v~0 2)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {4367#(<= main_~v~0 2)} is VALID [2018-11-23 11:55:41,618 INFO L273 TraceCheckUtils]: 46: Hoare triple {4367#(<= main_~v~0 2)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {4367#(<= main_~v~0 2)} is VALID [2018-11-23 11:55:41,619 INFO L273 TraceCheckUtils]: 47: Hoare triple {4367#(<= main_~v~0 2)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {4368#(<= main_~v~0 3)} is VALID [2018-11-23 11:55:41,620 INFO L273 TraceCheckUtils]: 48: Hoare triple {4368#(<= main_~v~0 3)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {4368#(<= main_~v~0 3)} is VALID [2018-11-23 11:55:41,620 INFO L256 TraceCheckUtils]: 49: Hoare triple {4368#(<= main_~v~0 3)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {4363#true} is VALID [2018-11-23 11:55:41,621 INFO L273 TraceCheckUtils]: 50: Hoare triple {4363#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {4363#true} is VALID [2018-11-23 11:55:41,621 INFO L273 TraceCheckUtils]: 51: Hoare triple {4363#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {4363#true} is VALID [2018-11-23 11:55:41,621 INFO L273 TraceCheckUtils]: 52: Hoare triple {4363#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {4363#true} is VALID [2018-11-23 11:55:41,621 INFO L273 TraceCheckUtils]: 53: Hoare triple {4363#true} assume true; {4363#true} is VALID [2018-11-23 11:55:41,623 INFO L268 TraceCheckUtils]: 54: Hoare quadruple {4363#true} {4368#(<= main_~v~0 3)} #126#return; {4368#(<= main_~v~0 3)} is VALID [2018-11-23 11:55:41,624 INFO L273 TraceCheckUtils]: 55: Hoare triple {4368#(<= main_~v~0 3)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {4368#(<= main_~v~0 3)} is VALID [2018-11-23 11:55:41,624 INFO L273 TraceCheckUtils]: 56: Hoare triple {4368#(<= main_~v~0 3)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {4368#(<= main_~v~0 3)} is VALID [2018-11-23 11:55:41,625 INFO L273 TraceCheckUtils]: 57: Hoare triple {4368#(<= main_~v~0 3)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {4369#(<= main_~v~0 4)} is VALID [2018-11-23 11:55:41,625 INFO L273 TraceCheckUtils]: 58: Hoare triple {4369#(<= main_~v~0 4)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {4369#(<= main_~v~0 4)} is VALID [2018-11-23 11:55:41,626 INFO L256 TraceCheckUtils]: 59: Hoare triple {4369#(<= main_~v~0 4)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {4363#true} is VALID [2018-11-23 11:55:41,626 INFO L273 TraceCheckUtils]: 60: Hoare triple {4363#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {4363#true} is VALID [2018-11-23 11:55:41,626 INFO L273 TraceCheckUtils]: 61: Hoare triple {4363#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {4363#true} is VALID [2018-11-23 11:55:41,626 INFO L273 TraceCheckUtils]: 62: Hoare triple {4363#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {4363#true} is VALID [2018-11-23 11:55:41,627 INFO L273 TraceCheckUtils]: 63: Hoare triple {4363#true} assume true; {4363#true} is VALID [2018-11-23 11:55:41,629 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {4363#true} {4369#(<= main_~v~0 4)} #126#return; {4369#(<= main_~v~0 4)} is VALID [2018-11-23 11:55:41,629 INFO L273 TraceCheckUtils]: 65: Hoare triple {4369#(<= main_~v~0 4)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {4369#(<= main_~v~0 4)} is VALID [2018-11-23 11:55:41,629 INFO L273 TraceCheckUtils]: 66: Hoare triple {4369#(<= main_~v~0 4)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {4369#(<= main_~v~0 4)} is VALID [2018-11-23 11:55:41,630 INFO L273 TraceCheckUtils]: 67: Hoare triple {4369#(<= main_~v~0 4)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {4370#(<= main_~v~0 5)} is VALID [2018-11-23 11:55:41,630 INFO L273 TraceCheckUtils]: 68: Hoare triple {4370#(<= main_~v~0 5)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {4370#(<= main_~v~0 5)} is VALID [2018-11-23 11:55:41,631 INFO L256 TraceCheckUtils]: 69: Hoare triple {4370#(<= main_~v~0 5)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {4363#true} is VALID [2018-11-23 11:55:41,631 INFO L273 TraceCheckUtils]: 70: Hoare triple {4363#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {4363#true} is VALID [2018-11-23 11:55:41,631 INFO L273 TraceCheckUtils]: 71: Hoare triple {4363#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {4363#true} is VALID [2018-11-23 11:55:41,631 INFO L273 TraceCheckUtils]: 72: Hoare triple {4363#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {4363#true} is VALID [2018-11-23 11:55:41,631 INFO L273 TraceCheckUtils]: 73: Hoare triple {4363#true} assume true; {4363#true} is VALID [2018-11-23 11:55:41,650 INFO L268 TraceCheckUtils]: 74: Hoare quadruple {4363#true} {4370#(<= main_~v~0 5)} #126#return; {4370#(<= main_~v~0 5)} is VALID [2018-11-23 11:55:41,656 INFO L273 TraceCheckUtils]: 75: Hoare triple {4370#(<= main_~v~0 5)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {4370#(<= main_~v~0 5)} is VALID [2018-11-23 11:55:41,656 INFO L273 TraceCheckUtils]: 76: Hoare triple {4370#(<= main_~v~0 5)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {4370#(<= main_~v~0 5)} is VALID [2018-11-23 11:55:41,657 INFO L273 TraceCheckUtils]: 77: Hoare triple {4370#(<= main_~v~0 5)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {4371#(<= main_~v~0 6)} is VALID [2018-11-23 11:55:41,657 INFO L273 TraceCheckUtils]: 78: Hoare triple {4371#(<= main_~v~0 6)} assume !(~v~0 < 100000); {4364#false} is VALID [2018-11-23 11:55:41,658 INFO L273 TraceCheckUtils]: 79: Hoare triple {4364#false} ~x~0 := 0; {4364#false} is VALID [2018-11-23 11:55:41,658 INFO L273 TraceCheckUtils]: 80: Hoare triple {4364#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {4364#false} is VALID [2018-11-23 11:55:41,658 INFO L273 TraceCheckUtils]: 81: Hoare triple {4364#false} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {4364#false} is VALID [2018-11-23 11:55:41,658 INFO L256 TraceCheckUtils]: 82: Hoare triple {4364#false} call __VERIFIER_assert((if #t~mem13 != #t~mem14 then 1 else 0)); {4364#false} is VALID [2018-11-23 11:55:41,658 INFO L273 TraceCheckUtils]: 83: Hoare triple {4364#false} ~cond := #in~cond; {4364#false} is VALID [2018-11-23 11:55:41,659 INFO L273 TraceCheckUtils]: 84: Hoare triple {4364#false} assume 0 == ~cond; {4364#false} is VALID [2018-11-23 11:55:41,659 INFO L273 TraceCheckUtils]: 85: Hoare triple {4364#false} assume !false; {4364#false} is VALID [2018-11-23 11:55:41,667 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-23 11:55:41,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:41,668 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:41,676 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:55:41,744 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 11:55:41,744 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:41,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:41,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:42,017 INFO L256 TraceCheckUtils]: 0: Hoare triple {4363#true} call ULTIMATE.init(); {4363#true} is VALID [2018-11-23 11:55:42,017 INFO L273 TraceCheckUtils]: 1: Hoare triple {4363#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4363#true} is VALID [2018-11-23 11:55:42,018 INFO L273 TraceCheckUtils]: 2: Hoare triple {4363#true} assume true; {4363#true} is VALID [2018-11-23 11:55:42,018 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4363#true} {4363#true} #120#return; {4363#true} is VALID [2018-11-23 11:55:42,018 INFO L256 TraceCheckUtils]: 4: Hoare triple {4363#true} call #t~ret15 := main(); {4363#true} is VALID [2018-11-23 11:55:42,019 INFO L273 TraceCheckUtils]: 5: Hoare triple {4363#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {4390#(<= 0 main_~n~0)} is VALID [2018-11-23 11:55:42,019 INFO L273 TraceCheckUtils]: 6: Hoare triple {4390#(<= 0 main_~n~0)} assume !(~x~0 < ~n~0); {4390#(<= 0 main_~n~0)} is VALID [2018-11-23 11:55:42,020 INFO L273 TraceCheckUtils]: 7: Hoare triple {4390#(<= 0 main_~n~0)} call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(400000);havoc ~v~0;~v~0 := 0; {4390#(<= 0 main_~n~0)} is VALID [2018-11-23 11:55:42,020 INFO L273 TraceCheckUtils]: 8: Hoare triple {4390#(<= 0 main_~n~0)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {4390#(<= 0 main_~n~0)} is VALID [2018-11-23 11:55:42,020 INFO L256 TraceCheckUtils]: 9: Hoare triple {4390#(<= 0 main_~n~0)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {4363#true} is VALID [2018-11-23 11:55:42,020 INFO L273 TraceCheckUtils]: 10: Hoare triple {4363#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {4363#true} is VALID [2018-11-23 11:55:42,020 INFO L273 TraceCheckUtils]: 11: Hoare triple {4363#true} assume !(~i~0 < ~size); {4363#true} is VALID [2018-11-23 11:55:42,020 INFO L273 TraceCheckUtils]: 12: Hoare triple {4363#true} #res := 0; {4363#true} is VALID [2018-11-23 11:55:42,021 INFO L273 TraceCheckUtils]: 13: Hoare triple {4363#true} assume true; {4363#true} is VALID [2018-11-23 11:55:42,021 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {4363#true} {4390#(<= 0 main_~n~0)} #126#return; {4390#(<= 0 main_~n~0)} is VALID [2018-11-23 11:55:42,022 INFO L273 TraceCheckUtils]: 15: Hoare triple {4390#(<= 0 main_~n~0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {4390#(<= 0 main_~n~0)} is VALID [2018-11-23 11:55:42,022 INFO L273 TraceCheckUtils]: 16: Hoare triple {4390#(<= 0 main_~n~0)} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {4390#(<= 0 main_~n~0)} is VALID [2018-11-23 11:55:42,022 INFO L256 TraceCheckUtils]: 17: Hoare triple {4390#(<= 0 main_~n~0)} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {4363#true} is VALID [2018-11-23 11:55:42,023 INFO L273 TraceCheckUtils]: 18: Hoare triple {4363#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; {4430#(<= (+ |insert_#in~size| 1) |insert_#res|)} is VALID [2018-11-23 11:55:42,024 INFO L273 TraceCheckUtils]: 19: Hoare triple {4430#(<= (+ |insert_#in~size| 1) |insert_#res|)} assume true; {4430#(<= (+ |insert_#in~size| 1) |insert_#res|)} is VALID [2018-11-23 11:55:42,025 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {4430#(<= (+ |insert_#in~size| 1) |insert_#res|)} {4390#(<= 0 main_~n~0)} #128#return; {4437#(<= 1 |main_#t~ret10|)} is VALID [2018-11-23 11:55:42,026 INFO L273 TraceCheckUtils]: 21: Hoare triple {4437#(<= 1 |main_#t~ret10|)} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~mem9;havoc #t~ret10; {4441#(<= 1 main_~n~0)} is VALID [2018-11-23 11:55:42,027 INFO L273 TraceCheckUtils]: 22: Hoare triple {4441#(<= 1 main_~n~0)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {4441#(<= 1 main_~n~0)} is VALID [2018-11-23 11:55:42,027 INFO L273 TraceCheckUtils]: 23: Hoare triple {4441#(<= 1 main_~n~0)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {4441#(<= 1 main_~n~0)} is VALID [2018-11-23 11:55:42,027 INFO L256 TraceCheckUtils]: 24: Hoare triple {4441#(<= 1 main_~n~0)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {4363#true} is VALID [2018-11-23 11:55:42,028 INFO L273 TraceCheckUtils]: 25: Hoare triple {4363#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {4454#(and (<= |elem_exists_#in~size| elem_exists_~size) (<= elem_exists_~i~0 0))} is VALID [2018-11-23 11:55:42,029 INFO L273 TraceCheckUtils]: 26: Hoare triple {4454#(and (<= |elem_exists_#in~size| elem_exists_~size) (<= elem_exists_~i~0 0))} assume !(~i~0 < ~size); {4458#(<= |elem_exists_#in~size| 0)} is VALID [2018-11-23 11:55:42,029 INFO L273 TraceCheckUtils]: 27: Hoare triple {4458#(<= |elem_exists_#in~size| 0)} #res := 0; {4458#(<= |elem_exists_#in~size| 0)} is VALID [2018-11-23 11:55:42,030 INFO L273 TraceCheckUtils]: 28: Hoare triple {4458#(<= |elem_exists_#in~size| 0)} assume true; {4458#(<= |elem_exists_#in~size| 0)} is VALID [2018-11-23 11:55:42,031 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {4458#(<= |elem_exists_#in~size| 0)} {4441#(<= 1 main_~n~0)} #126#return; {4364#false} is VALID [2018-11-23 11:55:42,032 INFO L273 TraceCheckUtils]: 30: Hoare triple {4364#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {4364#false} is VALID [2018-11-23 11:55:42,032 INFO L273 TraceCheckUtils]: 31: Hoare triple {4364#false} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {4364#false} is VALID [2018-11-23 11:55:42,032 INFO L256 TraceCheckUtils]: 32: Hoare triple {4364#false} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {4364#false} is VALID [2018-11-23 11:55:42,032 INFO L273 TraceCheckUtils]: 33: Hoare triple {4364#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; {4364#false} is VALID [2018-11-23 11:55:42,033 INFO L273 TraceCheckUtils]: 34: Hoare triple {4364#false} assume true; {4364#false} is VALID [2018-11-23 11:55:42,033 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {4364#false} {4364#false} #128#return; {4364#false} is VALID [2018-11-23 11:55:42,033 INFO L273 TraceCheckUtils]: 36: Hoare triple {4364#false} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~mem9;havoc #t~ret10; {4364#false} is VALID [2018-11-23 11:55:42,033 INFO L273 TraceCheckUtils]: 37: Hoare triple {4364#false} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {4364#false} is VALID [2018-11-23 11:55:42,033 INFO L273 TraceCheckUtils]: 38: Hoare triple {4364#false} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {4364#false} is VALID [2018-11-23 11:55:42,033 INFO L256 TraceCheckUtils]: 39: Hoare triple {4364#false} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {4364#false} is VALID [2018-11-23 11:55:42,034 INFO L273 TraceCheckUtils]: 40: Hoare triple {4364#false} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {4364#false} is VALID [2018-11-23 11:55:42,034 INFO L273 TraceCheckUtils]: 41: Hoare triple {4364#false} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {4364#false} is VALID [2018-11-23 11:55:42,034 INFO L273 TraceCheckUtils]: 42: Hoare triple {4364#false} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {4364#false} is VALID [2018-11-23 11:55:42,034 INFO L273 TraceCheckUtils]: 43: Hoare triple {4364#false} assume true; {4364#false} is VALID [2018-11-23 11:55:42,034 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {4364#false} {4364#false} #126#return; {4364#false} is VALID [2018-11-23 11:55:42,035 INFO L273 TraceCheckUtils]: 45: Hoare triple {4364#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {4364#false} is VALID [2018-11-23 11:55:42,035 INFO L273 TraceCheckUtils]: 46: Hoare triple {4364#false} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {4364#false} is VALID [2018-11-23 11:55:42,035 INFO L273 TraceCheckUtils]: 47: Hoare triple {4364#false} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {4364#false} is VALID [2018-11-23 11:55:42,035 INFO L273 TraceCheckUtils]: 48: Hoare triple {4364#false} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {4364#false} is VALID [2018-11-23 11:55:42,035 INFO L256 TraceCheckUtils]: 49: Hoare triple {4364#false} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {4364#false} is VALID [2018-11-23 11:55:42,035 INFO L273 TraceCheckUtils]: 50: Hoare triple {4364#false} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {4364#false} is VALID [2018-11-23 11:55:42,035 INFO L273 TraceCheckUtils]: 51: Hoare triple {4364#false} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {4364#false} is VALID [2018-11-23 11:55:42,035 INFO L273 TraceCheckUtils]: 52: Hoare triple {4364#false} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {4364#false} is VALID [2018-11-23 11:55:42,036 INFO L273 TraceCheckUtils]: 53: Hoare triple {4364#false} assume true; {4364#false} is VALID [2018-11-23 11:55:42,036 INFO L268 TraceCheckUtils]: 54: Hoare quadruple {4364#false} {4364#false} #126#return; {4364#false} is VALID [2018-11-23 11:55:42,036 INFO L273 TraceCheckUtils]: 55: Hoare triple {4364#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {4364#false} is VALID [2018-11-23 11:55:42,036 INFO L273 TraceCheckUtils]: 56: Hoare triple {4364#false} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {4364#false} is VALID [2018-11-23 11:55:42,036 INFO L273 TraceCheckUtils]: 57: Hoare triple {4364#false} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {4364#false} is VALID [2018-11-23 11:55:42,036 INFO L273 TraceCheckUtils]: 58: Hoare triple {4364#false} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {4364#false} is VALID [2018-11-23 11:55:42,036 INFO L256 TraceCheckUtils]: 59: Hoare triple {4364#false} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {4364#false} is VALID [2018-11-23 11:55:42,036 INFO L273 TraceCheckUtils]: 60: Hoare triple {4364#false} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {4364#false} is VALID [2018-11-23 11:55:42,037 INFO L273 TraceCheckUtils]: 61: Hoare triple {4364#false} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {4364#false} is VALID [2018-11-23 11:55:42,037 INFO L273 TraceCheckUtils]: 62: Hoare triple {4364#false} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {4364#false} is VALID [2018-11-23 11:55:42,037 INFO L273 TraceCheckUtils]: 63: Hoare triple {4364#false} assume true; {4364#false} is VALID [2018-11-23 11:55:42,037 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {4364#false} {4364#false} #126#return; {4364#false} is VALID [2018-11-23 11:55:42,037 INFO L273 TraceCheckUtils]: 65: Hoare triple {4364#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {4364#false} is VALID [2018-11-23 11:55:42,037 INFO L273 TraceCheckUtils]: 66: Hoare triple {4364#false} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {4364#false} is VALID [2018-11-23 11:55:42,037 INFO L273 TraceCheckUtils]: 67: Hoare triple {4364#false} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {4364#false} is VALID [2018-11-23 11:55:42,037 INFO L273 TraceCheckUtils]: 68: Hoare triple {4364#false} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {4364#false} is VALID [2018-11-23 11:55:42,038 INFO L256 TraceCheckUtils]: 69: Hoare triple {4364#false} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {4364#false} is VALID [2018-11-23 11:55:42,038 INFO L273 TraceCheckUtils]: 70: Hoare triple {4364#false} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {4364#false} is VALID [2018-11-23 11:55:42,038 INFO L273 TraceCheckUtils]: 71: Hoare triple {4364#false} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {4364#false} is VALID [2018-11-23 11:55:42,038 INFO L273 TraceCheckUtils]: 72: Hoare triple {4364#false} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {4364#false} is VALID [2018-11-23 11:55:42,038 INFO L273 TraceCheckUtils]: 73: Hoare triple {4364#false} assume true; {4364#false} is VALID [2018-11-23 11:55:42,038 INFO L268 TraceCheckUtils]: 74: Hoare quadruple {4364#false} {4364#false} #126#return; {4364#false} is VALID [2018-11-23 11:55:42,038 INFO L273 TraceCheckUtils]: 75: Hoare triple {4364#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {4364#false} is VALID [2018-11-23 11:55:42,038 INFO L273 TraceCheckUtils]: 76: Hoare triple {4364#false} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {4364#false} is VALID [2018-11-23 11:55:42,039 INFO L273 TraceCheckUtils]: 77: Hoare triple {4364#false} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {4364#false} is VALID [2018-11-23 11:55:42,039 INFO L273 TraceCheckUtils]: 78: Hoare triple {4364#false} assume !(~v~0 < 100000); {4364#false} is VALID [2018-11-23 11:55:42,039 INFO L273 TraceCheckUtils]: 79: Hoare triple {4364#false} ~x~0 := 0; {4364#false} is VALID [2018-11-23 11:55:42,039 INFO L273 TraceCheckUtils]: 80: Hoare triple {4364#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {4364#false} is VALID [2018-11-23 11:55:42,039 INFO L273 TraceCheckUtils]: 81: Hoare triple {4364#false} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {4364#false} is VALID [2018-11-23 11:55:42,039 INFO L256 TraceCheckUtils]: 82: Hoare triple {4364#false} call __VERIFIER_assert((if #t~mem13 != #t~mem14 then 1 else 0)); {4364#false} is VALID [2018-11-23 11:55:42,039 INFO L273 TraceCheckUtils]: 83: Hoare triple {4364#false} ~cond := #in~cond; {4364#false} is VALID [2018-11-23 11:55:42,039 INFO L273 TraceCheckUtils]: 84: Hoare triple {4364#false} assume 0 == ~cond; {4364#false} is VALID [2018-11-23 11:55:42,040 INFO L273 TraceCheckUtils]: 85: Hoare triple {4364#false} assume !false; {4364#false} is VALID [2018-11-23 11:55:42,043 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-23 11:55:42,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 11:55:42,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2018-11-23 11:55:42,066 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 86 [2018-11-23 11:55:42,066 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:42,067 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 11:55:42,170 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:42,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 11:55:42,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 11:55:42,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:55:42,171 INFO L87 Difference]: Start difference. First operand 144 states and 197 transitions. Second operand 15 states. [2018-11-23 11:55:45,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:45,634 INFO L93 Difference]: Finished difference Result 275 states and 415 transitions. [2018-11-23 11:55:45,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-23 11:55:45,635 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 86 [2018-11-23 11:55:45,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:45,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:55:45,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 258 transitions. [2018-11-23 11:55:45,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:55:45,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 258 transitions. [2018-11-23 11:55:45,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 258 transitions. [2018-11-23 11:55:46,003 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 258 edges. 258 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:46,015 INFO L225 Difference]: With dead ends: 275 [2018-11-23 11:55:46,015 INFO L226 Difference]: Without dead ends: 208 [2018-11-23 11:55:46,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=491, Invalid=1489, Unknown=0, NotChecked=0, Total=1980 [2018-11-23 11:55:46,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-11-23 11:55:46,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 171. [2018-11-23 11:55:46,285 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:46,286 INFO L82 GeneralOperation]: Start isEquivalent. First operand 208 states. Second operand 171 states. [2018-11-23 11:55:46,286 INFO L74 IsIncluded]: Start isIncluded. First operand 208 states. Second operand 171 states. [2018-11-23 11:55:46,286 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 171 states. [2018-11-23 11:55:46,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:46,301 INFO L93 Difference]: Finished difference Result 208 states and 316 transitions. [2018-11-23 11:55:46,301 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 316 transitions. [2018-11-23 11:55:46,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:46,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:46,303 INFO L74 IsIncluded]: Start isIncluded. First operand 171 states. Second operand 208 states. [2018-11-23 11:55:46,303 INFO L87 Difference]: Start difference. First operand 171 states. Second operand 208 states. [2018-11-23 11:55:46,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:46,317 INFO L93 Difference]: Finished difference Result 208 states and 316 transitions. [2018-11-23 11:55:46,317 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 316 transitions. [2018-11-23 11:55:46,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:46,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:46,319 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:46,319 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:46,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-11-23 11:55:46,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 241 transitions. [2018-11-23 11:55:46,327 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 241 transitions. Word has length 86 [2018-11-23 11:55:46,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:46,328 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 241 transitions. [2018-11-23 11:55:46,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 11:55:46,328 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 241 transitions. [2018-11-23 11:55:46,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-23 11:55:46,330 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:46,330 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:46,330 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:46,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:46,331 INFO L82 PathProgramCache]: Analyzing trace with hash 870426741, now seen corresponding path program 6 times [2018-11-23 11:55:46,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:46,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:46,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:46,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:46,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:46,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:46,471 INFO L256 TraceCheckUtils]: 0: Hoare triple {5708#true} call ULTIMATE.init(); {5708#true} is VALID [2018-11-23 11:55:46,471 INFO L273 TraceCheckUtils]: 1: Hoare triple {5708#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5708#true} is VALID [2018-11-23 11:55:46,471 INFO L273 TraceCheckUtils]: 2: Hoare triple {5708#true} assume true; {5708#true} is VALID [2018-11-23 11:55:46,471 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5708#true} {5708#true} #120#return; {5708#true} is VALID [2018-11-23 11:55:46,472 INFO L256 TraceCheckUtils]: 4: Hoare triple {5708#true} call #t~ret15 := main(); {5708#true} is VALID [2018-11-23 11:55:46,472 INFO L273 TraceCheckUtils]: 5: Hoare triple {5708#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {5708#true} is VALID [2018-11-23 11:55:46,472 INFO L273 TraceCheckUtils]: 6: Hoare triple {5708#true} assume !(~x~0 < ~n~0); {5708#true} is VALID [2018-11-23 11:55:46,472 INFO L273 TraceCheckUtils]: 7: Hoare triple {5708#true} call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(400000);havoc ~v~0;~v~0 := 0; {5708#true} is VALID [2018-11-23 11:55:46,472 INFO L273 TraceCheckUtils]: 8: Hoare triple {5708#true} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {5708#true} is VALID [2018-11-23 11:55:46,472 INFO L256 TraceCheckUtils]: 9: Hoare triple {5708#true} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {5708#true} is VALID [2018-11-23 11:55:46,472 INFO L273 TraceCheckUtils]: 10: Hoare triple {5708#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {5708#true} is VALID [2018-11-23 11:55:46,472 INFO L273 TraceCheckUtils]: 11: Hoare triple {5708#true} assume !(~i~0 < ~size); {5708#true} is VALID [2018-11-23 11:55:46,473 INFO L273 TraceCheckUtils]: 12: Hoare triple {5708#true} #res := 0; {5708#true} is VALID [2018-11-23 11:55:46,473 INFO L273 TraceCheckUtils]: 13: Hoare triple {5708#true} assume true; {5708#true} is VALID [2018-11-23 11:55:46,473 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {5708#true} {5708#true} #126#return; {5708#true} is VALID [2018-11-23 11:55:46,473 INFO L273 TraceCheckUtils]: 15: Hoare triple {5708#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {5708#true} is VALID [2018-11-23 11:55:46,473 INFO L273 TraceCheckUtils]: 16: Hoare triple {5708#true} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {5708#true} is VALID [2018-11-23 11:55:46,473 INFO L256 TraceCheckUtils]: 17: Hoare triple {5708#true} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {5708#true} is VALID [2018-11-23 11:55:46,474 INFO L273 TraceCheckUtils]: 18: Hoare triple {5708#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; {5708#true} is VALID [2018-11-23 11:55:46,474 INFO L273 TraceCheckUtils]: 19: Hoare triple {5708#true} assume true; {5708#true} is VALID [2018-11-23 11:55:46,474 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {5708#true} {5708#true} #128#return; {5708#true} is VALID [2018-11-23 11:55:46,474 INFO L273 TraceCheckUtils]: 21: Hoare triple {5708#true} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~mem9;havoc #t~ret10; {5708#true} is VALID [2018-11-23 11:55:46,474 INFO L273 TraceCheckUtils]: 22: Hoare triple {5708#true} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {5708#true} is VALID [2018-11-23 11:55:46,475 INFO L273 TraceCheckUtils]: 23: Hoare triple {5708#true} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {5708#true} is VALID [2018-11-23 11:55:46,475 INFO L256 TraceCheckUtils]: 24: Hoare triple {5708#true} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {5708#true} is VALID [2018-11-23 11:55:46,475 INFO L273 TraceCheckUtils]: 25: Hoare triple {5708#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {5708#true} is VALID [2018-11-23 11:55:46,475 INFO L273 TraceCheckUtils]: 26: Hoare triple {5708#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {5708#true} is VALID [2018-11-23 11:55:46,493 INFO L273 TraceCheckUtils]: 27: Hoare triple {5708#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {5710#(= 1 |elem_exists_#res|)} is VALID [2018-11-23 11:55:46,502 INFO L273 TraceCheckUtils]: 28: Hoare triple {5710#(= 1 |elem_exists_#res|)} assume true; {5710#(= 1 |elem_exists_#res|)} is VALID [2018-11-23 11:55:46,519 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {5710#(= 1 |elem_exists_#res|)} {5708#true} #126#return; {5711#(= |main_#t~ret8| 1)} is VALID [2018-11-23 11:55:46,528 INFO L273 TraceCheckUtils]: 30: Hoare triple {5711#(= |main_#t~ret8| 1)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {5711#(= |main_#t~ret8| 1)} is VALID [2018-11-23 11:55:46,541 INFO L273 TraceCheckUtils]: 31: Hoare triple {5711#(= |main_#t~ret8| 1)} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {5709#false} is VALID [2018-11-23 11:55:46,541 INFO L256 TraceCheckUtils]: 32: Hoare triple {5709#false} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {5708#true} is VALID [2018-11-23 11:55:46,541 INFO L273 TraceCheckUtils]: 33: Hoare triple {5708#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; {5708#true} is VALID [2018-11-23 11:55:46,542 INFO L273 TraceCheckUtils]: 34: Hoare triple {5708#true} assume true; {5708#true} is VALID [2018-11-23 11:55:46,542 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {5708#true} {5709#false} #128#return; {5709#false} is VALID [2018-11-23 11:55:46,542 INFO L273 TraceCheckUtils]: 36: Hoare triple {5709#false} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~mem9;havoc #t~ret10; {5709#false} is VALID [2018-11-23 11:55:46,542 INFO L273 TraceCheckUtils]: 37: Hoare triple {5709#false} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {5709#false} is VALID [2018-11-23 11:55:46,542 INFO L273 TraceCheckUtils]: 38: Hoare triple {5709#false} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {5709#false} is VALID [2018-11-23 11:55:46,542 INFO L256 TraceCheckUtils]: 39: Hoare triple {5709#false} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {5708#true} is VALID [2018-11-23 11:55:46,543 INFO L273 TraceCheckUtils]: 40: Hoare triple {5708#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {5708#true} is VALID [2018-11-23 11:55:46,543 INFO L273 TraceCheckUtils]: 41: Hoare triple {5708#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {5708#true} is VALID [2018-11-23 11:55:46,543 INFO L273 TraceCheckUtils]: 42: Hoare triple {5708#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {5708#true} is VALID [2018-11-23 11:55:46,543 INFO L273 TraceCheckUtils]: 43: Hoare triple {5708#true} assume true; {5708#true} is VALID [2018-11-23 11:55:46,543 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {5708#true} {5709#false} #126#return; {5709#false} is VALID [2018-11-23 11:55:46,543 INFO L273 TraceCheckUtils]: 45: Hoare triple {5709#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {5709#false} is VALID [2018-11-23 11:55:46,544 INFO L273 TraceCheckUtils]: 46: Hoare triple {5709#false} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {5709#false} is VALID [2018-11-23 11:55:46,544 INFO L273 TraceCheckUtils]: 47: Hoare triple {5709#false} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {5709#false} is VALID [2018-11-23 11:55:46,544 INFO L273 TraceCheckUtils]: 48: Hoare triple {5709#false} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {5709#false} is VALID [2018-11-23 11:55:46,544 INFO L256 TraceCheckUtils]: 49: Hoare triple {5709#false} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {5708#true} is VALID [2018-11-23 11:55:46,544 INFO L273 TraceCheckUtils]: 50: Hoare triple {5708#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {5708#true} is VALID [2018-11-23 11:55:46,544 INFO L273 TraceCheckUtils]: 51: Hoare triple {5708#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {5708#true} is VALID [2018-11-23 11:55:46,545 INFO L273 TraceCheckUtils]: 52: Hoare triple {5708#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {5708#true} is VALID [2018-11-23 11:55:46,545 INFO L273 TraceCheckUtils]: 53: Hoare triple {5708#true} assume true; {5708#true} is VALID [2018-11-23 11:55:46,545 INFO L268 TraceCheckUtils]: 54: Hoare quadruple {5708#true} {5709#false} #126#return; {5709#false} is VALID [2018-11-23 11:55:46,545 INFO L273 TraceCheckUtils]: 55: Hoare triple {5709#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {5709#false} is VALID [2018-11-23 11:55:46,545 INFO L273 TraceCheckUtils]: 56: Hoare triple {5709#false} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {5709#false} is VALID [2018-11-23 11:55:46,545 INFO L273 TraceCheckUtils]: 57: Hoare triple {5709#false} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {5709#false} is VALID [2018-11-23 11:55:46,546 INFO L273 TraceCheckUtils]: 58: Hoare triple {5709#false} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {5709#false} is VALID [2018-11-23 11:55:46,546 INFO L256 TraceCheckUtils]: 59: Hoare triple {5709#false} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {5708#true} is VALID [2018-11-23 11:55:46,546 INFO L273 TraceCheckUtils]: 60: Hoare triple {5708#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {5708#true} is VALID [2018-11-23 11:55:46,546 INFO L273 TraceCheckUtils]: 61: Hoare triple {5708#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {5708#true} is VALID [2018-11-23 11:55:46,546 INFO L273 TraceCheckUtils]: 62: Hoare triple {5708#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {5708#true} is VALID [2018-11-23 11:55:46,547 INFO L273 TraceCheckUtils]: 63: Hoare triple {5708#true} assume true; {5708#true} is VALID [2018-11-23 11:55:46,547 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {5708#true} {5709#false} #126#return; {5709#false} is VALID [2018-11-23 11:55:46,547 INFO L273 TraceCheckUtils]: 65: Hoare triple {5709#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {5709#false} is VALID [2018-11-23 11:55:46,547 INFO L273 TraceCheckUtils]: 66: Hoare triple {5709#false} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {5709#false} is VALID [2018-11-23 11:55:46,547 INFO L273 TraceCheckUtils]: 67: Hoare triple {5709#false} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {5709#false} is VALID [2018-11-23 11:55:46,547 INFO L273 TraceCheckUtils]: 68: Hoare triple {5709#false} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {5709#false} is VALID [2018-11-23 11:55:46,548 INFO L256 TraceCheckUtils]: 69: Hoare triple {5709#false} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {5708#true} is VALID [2018-11-23 11:55:46,548 INFO L273 TraceCheckUtils]: 70: Hoare triple {5708#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {5708#true} is VALID [2018-11-23 11:55:46,548 INFO L273 TraceCheckUtils]: 71: Hoare triple {5708#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {5708#true} is VALID [2018-11-23 11:55:46,548 INFO L273 TraceCheckUtils]: 72: Hoare triple {5708#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {5708#true} is VALID [2018-11-23 11:55:46,548 INFO L273 TraceCheckUtils]: 73: Hoare triple {5708#true} assume true; {5708#true} is VALID [2018-11-23 11:55:46,548 INFO L268 TraceCheckUtils]: 74: Hoare quadruple {5708#true} {5709#false} #126#return; {5709#false} is VALID [2018-11-23 11:55:46,549 INFO L273 TraceCheckUtils]: 75: Hoare triple {5709#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {5709#false} is VALID [2018-11-23 11:55:46,549 INFO L273 TraceCheckUtils]: 76: Hoare triple {5709#false} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {5709#false} is VALID [2018-11-23 11:55:46,549 INFO L273 TraceCheckUtils]: 77: Hoare triple {5709#false} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {5709#false} is VALID [2018-11-23 11:55:46,549 INFO L273 TraceCheckUtils]: 78: Hoare triple {5709#false} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {5709#false} is VALID [2018-11-23 11:55:46,549 INFO L256 TraceCheckUtils]: 79: Hoare triple {5709#false} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {5708#true} is VALID [2018-11-23 11:55:46,549 INFO L273 TraceCheckUtils]: 80: Hoare triple {5708#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {5708#true} is VALID [2018-11-23 11:55:46,550 INFO L273 TraceCheckUtils]: 81: Hoare triple {5708#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {5708#true} is VALID [2018-11-23 11:55:46,550 INFO L273 TraceCheckUtils]: 82: Hoare triple {5708#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {5708#true} is VALID [2018-11-23 11:55:46,550 INFO L273 TraceCheckUtils]: 83: Hoare triple {5708#true} assume true; {5708#true} is VALID [2018-11-23 11:55:46,550 INFO L268 TraceCheckUtils]: 84: Hoare quadruple {5708#true} {5709#false} #126#return; {5709#false} is VALID [2018-11-23 11:55:46,550 INFO L273 TraceCheckUtils]: 85: Hoare triple {5709#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {5709#false} is VALID [2018-11-23 11:55:46,550 INFO L273 TraceCheckUtils]: 86: Hoare triple {5709#false} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {5709#false} is VALID [2018-11-23 11:55:46,551 INFO L273 TraceCheckUtils]: 87: Hoare triple {5709#false} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {5709#false} is VALID [2018-11-23 11:55:46,551 INFO L273 TraceCheckUtils]: 88: Hoare triple {5709#false} assume !(~v~0 < 100000); {5709#false} is VALID [2018-11-23 11:55:46,551 INFO L273 TraceCheckUtils]: 89: Hoare triple {5709#false} ~x~0 := 0; {5709#false} is VALID [2018-11-23 11:55:46,551 INFO L273 TraceCheckUtils]: 90: Hoare triple {5709#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {5709#false} is VALID [2018-11-23 11:55:46,551 INFO L273 TraceCheckUtils]: 91: Hoare triple {5709#false} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {5709#false} is VALID [2018-11-23 11:55:46,551 INFO L256 TraceCheckUtils]: 92: Hoare triple {5709#false} call __VERIFIER_assert((if #t~mem13 != #t~mem14 then 1 else 0)); {5709#false} is VALID [2018-11-23 11:55:46,552 INFO L273 TraceCheckUtils]: 93: Hoare triple {5709#false} ~cond := #in~cond; {5709#false} is VALID [2018-11-23 11:55:46,552 INFO L273 TraceCheckUtils]: 94: Hoare triple {5709#false} assume 0 == ~cond; {5709#false} is VALID [2018-11-23 11:55:46,552 INFO L273 TraceCheckUtils]: 95: Hoare triple {5709#false} assume !false; {5709#false} is VALID [2018-11-23 11:55:46,557 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 54 proven. 10 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2018-11-23 11:55:46,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:46,557 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:46,575 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:55:46,619 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-11-23 11:55:46,619 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:46,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:46,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:46,748 INFO L256 TraceCheckUtils]: 0: Hoare triple {5708#true} call ULTIMATE.init(); {5708#true} is VALID [2018-11-23 11:55:46,749 INFO L273 TraceCheckUtils]: 1: Hoare triple {5708#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5708#true} is VALID [2018-11-23 11:55:46,749 INFO L273 TraceCheckUtils]: 2: Hoare triple {5708#true} assume true; {5708#true} is VALID [2018-11-23 11:55:46,749 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5708#true} {5708#true} #120#return; {5708#true} is VALID [2018-11-23 11:55:46,749 INFO L256 TraceCheckUtils]: 4: Hoare triple {5708#true} call #t~ret15 := main(); {5708#true} is VALID [2018-11-23 11:55:46,750 INFO L273 TraceCheckUtils]: 5: Hoare triple {5708#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {5708#true} is VALID [2018-11-23 11:55:46,750 INFO L273 TraceCheckUtils]: 6: Hoare triple {5708#true} assume !(~x~0 < ~n~0); {5708#true} is VALID [2018-11-23 11:55:46,750 INFO L273 TraceCheckUtils]: 7: Hoare triple {5708#true} call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(400000);havoc ~v~0;~v~0 := 0; {5708#true} is VALID [2018-11-23 11:55:46,750 INFO L273 TraceCheckUtils]: 8: Hoare triple {5708#true} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {5708#true} is VALID [2018-11-23 11:55:46,750 INFO L256 TraceCheckUtils]: 9: Hoare triple {5708#true} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {5708#true} is VALID [2018-11-23 11:55:46,751 INFO L273 TraceCheckUtils]: 10: Hoare triple {5708#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {5708#true} is VALID [2018-11-23 11:55:46,751 INFO L273 TraceCheckUtils]: 11: Hoare triple {5708#true} assume !(~i~0 < ~size); {5708#true} is VALID [2018-11-23 11:55:46,751 INFO L273 TraceCheckUtils]: 12: Hoare triple {5708#true} #res := 0; {5708#true} is VALID [2018-11-23 11:55:46,751 INFO L273 TraceCheckUtils]: 13: Hoare triple {5708#true} assume true; {5708#true} is VALID [2018-11-23 11:55:46,751 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {5708#true} {5708#true} #126#return; {5708#true} is VALID [2018-11-23 11:55:46,751 INFO L273 TraceCheckUtils]: 15: Hoare triple {5708#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {5708#true} is VALID [2018-11-23 11:55:46,751 INFO L273 TraceCheckUtils]: 16: Hoare triple {5708#true} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {5708#true} is VALID [2018-11-23 11:55:46,752 INFO L256 TraceCheckUtils]: 17: Hoare triple {5708#true} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {5708#true} is VALID [2018-11-23 11:55:46,752 INFO L273 TraceCheckUtils]: 18: Hoare triple {5708#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; {5708#true} is VALID [2018-11-23 11:55:46,752 INFO L273 TraceCheckUtils]: 19: Hoare triple {5708#true} assume true; {5708#true} is VALID [2018-11-23 11:55:46,752 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {5708#true} {5708#true} #128#return; {5708#true} is VALID [2018-11-23 11:55:46,752 INFO L273 TraceCheckUtils]: 21: Hoare triple {5708#true} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~mem9;havoc #t~ret10; {5708#true} is VALID [2018-11-23 11:55:46,752 INFO L273 TraceCheckUtils]: 22: Hoare triple {5708#true} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {5708#true} is VALID [2018-11-23 11:55:46,752 INFO L273 TraceCheckUtils]: 23: Hoare triple {5708#true} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {5708#true} is VALID [2018-11-23 11:55:46,752 INFO L256 TraceCheckUtils]: 24: Hoare triple {5708#true} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {5708#true} is VALID [2018-11-23 11:55:46,753 INFO L273 TraceCheckUtils]: 25: Hoare triple {5708#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {5708#true} is VALID [2018-11-23 11:55:46,753 INFO L273 TraceCheckUtils]: 26: Hoare triple {5708#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {5708#true} is VALID [2018-11-23 11:55:46,753 INFO L273 TraceCheckUtils]: 27: Hoare triple {5708#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {5796#(<= 1 |elem_exists_#res|)} is VALID [2018-11-23 11:55:46,754 INFO L273 TraceCheckUtils]: 28: Hoare triple {5796#(<= 1 |elem_exists_#res|)} assume true; {5796#(<= 1 |elem_exists_#res|)} is VALID [2018-11-23 11:55:46,755 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {5796#(<= 1 |elem_exists_#res|)} {5708#true} #126#return; {5803#(<= 1 |main_#t~ret8|)} is VALID [2018-11-23 11:55:46,756 INFO L273 TraceCheckUtils]: 30: Hoare triple {5803#(<= 1 |main_#t~ret8|)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {5803#(<= 1 |main_#t~ret8|)} is VALID [2018-11-23 11:55:46,756 INFO L273 TraceCheckUtils]: 31: Hoare triple {5803#(<= 1 |main_#t~ret8|)} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {5709#false} is VALID [2018-11-23 11:55:46,756 INFO L256 TraceCheckUtils]: 32: Hoare triple {5709#false} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {5709#false} is VALID [2018-11-23 11:55:46,757 INFO L273 TraceCheckUtils]: 33: Hoare triple {5709#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; {5709#false} is VALID [2018-11-23 11:55:46,757 INFO L273 TraceCheckUtils]: 34: Hoare triple {5709#false} assume true; {5709#false} is VALID [2018-11-23 11:55:46,757 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {5709#false} {5709#false} #128#return; {5709#false} is VALID [2018-11-23 11:55:46,757 INFO L273 TraceCheckUtils]: 36: Hoare triple {5709#false} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~mem9;havoc #t~ret10; {5709#false} is VALID [2018-11-23 11:55:46,757 INFO L273 TraceCheckUtils]: 37: Hoare triple {5709#false} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {5709#false} is VALID [2018-11-23 11:55:46,758 INFO L273 TraceCheckUtils]: 38: Hoare triple {5709#false} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {5709#false} is VALID [2018-11-23 11:55:46,758 INFO L256 TraceCheckUtils]: 39: Hoare triple {5709#false} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {5709#false} is VALID [2018-11-23 11:55:46,758 INFO L273 TraceCheckUtils]: 40: Hoare triple {5709#false} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {5709#false} is VALID [2018-11-23 11:55:46,758 INFO L273 TraceCheckUtils]: 41: Hoare triple {5709#false} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {5709#false} is VALID [2018-11-23 11:55:46,758 INFO L273 TraceCheckUtils]: 42: Hoare triple {5709#false} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {5709#false} is VALID [2018-11-23 11:55:46,759 INFO L273 TraceCheckUtils]: 43: Hoare triple {5709#false} assume true; {5709#false} is VALID [2018-11-23 11:55:46,759 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {5709#false} {5709#false} #126#return; {5709#false} is VALID [2018-11-23 11:55:46,759 INFO L273 TraceCheckUtils]: 45: Hoare triple {5709#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {5709#false} is VALID [2018-11-23 11:55:46,759 INFO L273 TraceCheckUtils]: 46: Hoare triple {5709#false} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {5709#false} is VALID [2018-11-23 11:55:46,759 INFO L273 TraceCheckUtils]: 47: Hoare triple {5709#false} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {5709#false} is VALID [2018-11-23 11:55:46,759 INFO L273 TraceCheckUtils]: 48: Hoare triple {5709#false} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {5709#false} is VALID [2018-11-23 11:55:46,759 INFO L256 TraceCheckUtils]: 49: Hoare triple {5709#false} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {5709#false} is VALID [2018-11-23 11:55:46,760 INFO L273 TraceCheckUtils]: 50: Hoare triple {5709#false} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {5709#false} is VALID [2018-11-23 11:55:46,760 INFO L273 TraceCheckUtils]: 51: Hoare triple {5709#false} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {5709#false} is VALID [2018-11-23 11:55:46,760 INFO L273 TraceCheckUtils]: 52: Hoare triple {5709#false} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {5709#false} is VALID [2018-11-23 11:55:46,760 INFO L273 TraceCheckUtils]: 53: Hoare triple {5709#false} assume true; {5709#false} is VALID [2018-11-23 11:55:46,760 INFO L268 TraceCheckUtils]: 54: Hoare quadruple {5709#false} {5709#false} #126#return; {5709#false} is VALID [2018-11-23 11:55:46,760 INFO L273 TraceCheckUtils]: 55: Hoare triple {5709#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {5709#false} is VALID [2018-11-23 11:55:46,760 INFO L273 TraceCheckUtils]: 56: Hoare triple {5709#false} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {5709#false} is VALID [2018-11-23 11:55:46,761 INFO L273 TraceCheckUtils]: 57: Hoare triple {5709#false} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {5709#false} is VALID [2018-11-23 11:55:46,761 INFO L273 TraceCheckUtils]: 58: Hoare triple {5709#false} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {5709#false} is VALID [2018-11-23 11:55:46,761 INFO L256 TraceCheckUtils]: 59: Hoare triple {5709#false} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {5709#false} is VALID [2018-11-23 11:55:46,761 INFO L273 TraceCheckUtils]: 60: Hoare triple {5709#false} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {5709#false} is VALID [2018-11-23 11:55:46,761 INFO L273 TraceCheckUtils]: 61: Hoare triple {5709#false} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {5709#false} is VALID [2018-11-23 11:55:46,761 INFO L273 TraceCheckUtils]: 62: Hoare triple {5709#false} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {5709#false} is VALID [2018-11-23 11:55:46,762 INFO L273 TraceCheckUtils]: 63: Hoare triple {5709#false} assume true; {5709#false} is VALID [2018-11-23 11:55:46,762 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {5709#false} {5709#false} #126#return; {5709#false} is VALID [2018-11-23 11:55:46,762 INFO L273 TraceCheckUtils]: 65: Hoare triple {5709#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {5709#false} is VALID [2018-11-23 11:55:46,762 INFO L273 TraceCheckUtils]: 66: Hoare triple {5709#false} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {5709#false} is VALID [2018-11-23 11:55:46,762 INFO L273 TraceCheckUtils]: 67: Hoare triple {5709#false} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {5709#false} is VALID [2018-11-23 11:55:46,762 INFO L273 TraceCheckUtils]: 68: Hoare triple {5709#false} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {5709#false} is VALID [2018-11-23 11:55:46,762 INFO L256 TraceCheckUtils]: 69: Hoare triple {5709#false} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {5709#false} is VALID [2018-11-23 11:55:46,763 INFO L273 TraceCheckUtils]: 70: Hoare triple {5709#false} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {5709#false} is VALID [2018-11-23 11:55:46,763 INFO L273 TraceCheckUtils]: 71: Hoare triple {5709#false} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {5709#false} is VALID [2018-11-23 11:55:46,763 INFO L273 TraceCheckUtils]: 72: Hoare triple {5709#false} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {5709#false} is VALID [2018-11-23 11:55:46,763 INFO L273 TraceCheckUtils]: 73: Hoare triple {5709#false} assume true; {5709#false} is VALID [2018-11-23 11:55:46,763 INFO L268 TraceCheckUtils]: 74: Hoare quadruple {5709#false} {5709#false} #126#return; {5709#false} is VALID [2018-11-23 11:55:46,763 INFO L273 TraceCheckUtils]: 75: Hoare triple {5709#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {5709#false} is VALID [2018-11-23 11:55:46,763 INFO L273 TraceCheckUtils]: 76: Hoare triple {5709#false} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {5709#false} is VALID [2018-11-23 11:55:46,764 INFO L273 TraceCheckUtils]: 77: Hoare triple {5709#false} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {5709#false} is VALID [2018-11-23 11:55:46,764 INFO L273 TraceCheckUtils]: 78: Hoare triple {5709#false} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {5709#false} is VALID [2018-11-23 11:55:46,764 INFO L256 TraceCheckUtils]: 79: Hoare triple {5709#false} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {5709#false} is VALID [2018-11-23 11:55:46,764 INFO L273 TraceCheckUtils]: 80: Hoare triple {5709#false} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {5709#false} is VALID [2018-11-23 11:55:46,764 INFO L273 TraceCheckUtils]: 81: Hoare triple {5709#false} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {5709#false} is VALID [2018-11-23 11:55:46,764 INFO L273 TraceCheckUtils]: 82: Hoare triple {5709#false} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {5709#false} is VALID [2018-11-23 11:55:46,764 INFO L273 TraceCheckUtils]: 83: Hoare triple {5709#false} assume true; {5709#false} is VALID [2018-11-23 11:55:46,764 INFO L268 TraceCheckUtils]: 84: Hoare quadruple {5709#false} {5709#false} #126#return; {5709#false} is VALID [2018-11-23 11:55:46,765 INFO L273 TraceCheckUtils]: 85: Hoare triple {5709#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {5709#false} is VALID [2018-11-23 11:55:46,765 INFO L273 TraceCheckUtils]: 86: Hoare triple {5709#false} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {5709#false} is VALID [2018-11-23 11:55:46,765 INFO L273 TraceCheckUtils]: 87: Hoare triple {5709#false} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {5709#false} is VALID [2018-11-23 11:55:46,765 INFO L273 TraceCheckUtils]: 88: Hoare triple {5709#false} assume !(~v~0 < 100000); {5709#false} is VALID [2018-11-23 11:55:46,765 INFO L273 TraceCheckUtils]: 89: Hoare triple {5709#false} ~x~0 := 0; {5709#false} is VALID [2018-11-23 11:55:46,765 INFO L273 TraceCheckUtils]: 90: Hoare triple {5709#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {5709#false} is VALID [2018-11-23 11:55:46,765 INFO L273 TraceCheckUtils]: 91: Hoare triple {5709#false} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {5709#false} is VALID [2018-11-23 11:55:46,765 INFO L256 TraceCheckUtils]: 92: Hoare triple {5709#false} call __VERIFIER_assert((if #t~mem13 != #t~mem14 then 1 else 0)); {5709#false} is VALID [2018-11-23 11:55:46,765 INFO L273 TraceCheckUtils]: 93: Hoare triple {5709#false} ~cond := #in~cond; {5709#false} is VALID [2018-11-23 11:55:46,766 INFO L273 TraceCheckUtils]: 94: Hoare triple {5709#false} assume 0 == ~cond; {5709#false} is VALID [2018-11-23 11:55:46,766 INFO L273 TraceCheckUtils]: 95: Hoare triple {5709#false} assume !false; {5709#false} is VALID [2018-11-23 11:55:46,769 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-11-23 11:55:46,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 11:55:46,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2018-11-23 11:55:46,790 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-11-23 11:55:46,796 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:46,796 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:55:46,870 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:46,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:55:46,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:55:46,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:55:46,871 INFO L87 Difference]: Start difference. First operand 171 states and 241 transitions. Second operand 6 states. [2018-11-23 11:55:47,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:47,302 INFO L93 Difference]: Finished difference Result 293 states and 409 transitions. [2018-11-23 11:55:47,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:55:47,302 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-11-23 11:55:47,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:47,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:55:47,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2018-11-23 11:55:47,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:55:47,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2018-11-23 11:55:47,308 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 82 transitions. [2018-11-23 11:55:47,456 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:47,461 INFO L225 Difference]: With dead ends: 293 [2018-11-23 11:55:47,461 INFO L226 Difference]: Without dead ends: 171 [2018-11-23 11:55:47,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:55:47,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-11-23 11:55:47,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2018-11-23 11:55:47,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:47,781 INFO L82 GeneralOperation]: Start isEquivalent. First operand 171 states. Second operand 167 states. [2018-11-23 11:55:47,781 INFO L74 IsIncluded]: Start isIncluded. First operand 171 states. Second operand 167 states. [2018-11-23 11:55:47,782 INFO L87 Difference]: Start difference. First operand 171 states. Second operand 167 states. [2018-11-23 11:55:47,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:47,792 INFO L93 Difference]: Finished difference Result 171 states and 224 transitions. [2018-11-23 11:55:47,792 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 224 transitions. [2018-11-23 11:55:47,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:47,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:47,794 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand 171 states. [2018-11-23 11:55:47,794 INFO L87 Difference]: Start difference. First operand 167 states. Second operand 171 states. [2018-11-23 11:55:47,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:47,808 INFO L93 Difference]: Finished difference Result 171 states and 224 transitions. [2018-11-23 11:55:47,809 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 224 transitions. [2018-11-23 11:55:47,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:47,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:47,814 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:47,814 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:47,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-23 11:55:47,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 220 transitions. [2018-11-23 11:55:47,834 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 220 transitions. Word has length 96 [2018-11-23 11:55:47,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:47,834 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 220 transitions. [2018-11-23 11:55:47,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:55:47,835 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 220 transitions. [2018-11-23 11:55:47,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-23 11:55:47,837 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:47,837 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 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] [2018-11-23 11:55:47,837 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:47,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:47,842 INFO L82 PathProgramCache]: Analyzing trace with hash 2023346, now seen corresponding path program 1 times [2018-11-23 11:55:47,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:47,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:47,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:47,843 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:47,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:47,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:48,109 INFO L256 TraceCheckUtils]: 0: Hoare triple {6966#true} call ULTIMATE.init(); {6966#true} is VALID [2018-11-23 11:55:48,110 INFO L273 TraceCheckUtils]: 1: Hoare triple {6966#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6966#true} is VALID [2018-11-23 11:55:48,110 INFO L273 TraceCheckUtils]: 2: Hoare triple {6966#true} assume true; {6966#true} is VALID [2018-11-23 11:55:48,111 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6966#true} {6966#true} #120#return; {6966#true} is VALID [2018-11-23 11:55:48,111 INFO L256 TraceCheckUtils]: 4: Hoare triple {6966#true} call #t~ret15 := main(); {6966#true} is VALID [2018-11-23 11:55:48,111 INFO L273 TraceCheckUtils]: 5: Hoare triple {6966#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {6966#true} is VALID [2018-11-23 11:55:48,111 INFO L273 TraceCheckUtils]: 6: Hoare triple {6966#true} assume !(~x~0 < ~n~0); {6966#true} is VALID [2018-11-23 11:55:48,112 INFO L273 TraceCheckUtils]: 7: Hoare triple {6966#true} call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(400000);havoc ~v~0;~v~0 := 0; {6968#(= main_~v~0 0)} is VALID [2018-11-23 11:55:48,112 INFO L273 TraceCheckUtils]: 8: Hoare triple {6968#(= main_~v~0 0)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {6968#(= main_~v~0 0)} is VALID [2018-11-23 11:55:48,112 INFO L256 TraceCheckUtils]: 9: Hoare triple {6968#(= main_~v~0 0)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {6966#true} is VALID [2018-11-23 11:55:48,113 INFO L273 TraceCheckUtils]: 10: Hoare triple {6966#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {6966#true} is VALID [2018-11-23 11:55:48,113 INFO L273 TraceCheckUtils]: 11: Hoare triple {6966#true} assume !(~i~0 < ~size); {6966#true} is VALID [2018-11-23 11:55:48,113 INFO L273 TraceCheckUtils]: 12: Hoare triple {6966#true} #res := 0; {6966#true} is VALID [2018-11-23 11:55:48,113 INFO L273 TraceCheckUtils]: 13: Hoare triple {6966#true} assume true; {6966#true} is VALID [2018-11-23 11:55:48,115 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {6966#true} {6968#(= main_~v~0 0)} #126#return; {6968#(= main_~v~0 0)} is VALID [2018-11-23 11:55:48,115 INFO L273 TraceCheckUtils]: 15: Hoare triple {6968#(= main_~v~0 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {6968#(= main_~v~0 0)} is VALID [2018-11-23 11:55:48,116 INFO L273 TraceCheckUtils]: 16: Hoare triple {6968#(= main_~v~0 0)} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {6968#(= main_~v~0 0)} is VALID [2018-11-23 11:55:48,116 INFO L256 TraceCheckUtils]: 17: Hoare triple {6968#(= main_~v~0 0)} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {6966#true} is VALID [2018-11-23 11:55:48,116 INFO L273 TraceCheckUtils]: 18: Hoare triple {6966#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; {6966#true} is VALID [2018-11-23 11:55:48,116 INFO L273 TraceCheckUtils]: 19: Hoare triple {6966#true} assume true; {6966#true} is VALID [2018-11-23 11:55:48,118 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {6966#true} {6968#(= main_~v~0 0)} #128#return; {6968#(= main_~v~0 0)} is VALID [2018-11-23 11:55:48,118 INFO L273 TraceCheckUtils]: 21: Hoare triple {6968#(= main_~v~0 0)} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~mem9;havoc #t~ret10; {6968#(= main_~v~0 0)} is VALID [2018-11-23 11:55:48,119 INFO L273 TraceCheckUtils]: 22: Hoare triple {6968#(= main_~v~0 0)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {6969#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:48,120 INFO L273 TraceCheckUtils]: 23: Hoare triple {6969#(<= main_~v~0 1)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {6969#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:48,120 INFO L256 TraceCheckUtils]: 24: Hoare triple {6969#(<= main_~v~0 1)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {6966#true} is VALID [2018-11-23 11:55:48,120 INFO L273 TraceCheckUtils]: 25: Hoare triple {6966#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {6966#true} is VALID [2018-11-23 11:55:48,121 INFO L273 TraceCheckUtils]: 26: Hoare triple {6966#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {6966#true} is VALID [2018-11-23 11:55:48,121 INFO L273 TraceCheckUtils]: 27: Hoare triple {6966#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {6966#true} is VALID [2018-11-23 11:55:48,121 INFO L273 TraceCheckUtils]: 28: Hoare triple {6966#true} assume true; {6966#true} is VALID [2018-11-23 11:55:48,124 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {6966#true} {6969#(<= main_~v~0 1)} #126#return; {6969#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:48,124 INFO L273 TraceCheckUtils]: 30: Hoare triple {6969#(<= main_~v~0 1)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {6969#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:48,125 INFO L273 TraceCheckUtils]: 31: Hoare triple {6969#(<= main_~v~0 1)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {6969#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:48,125 INFO L273 TraceCheckUtils]: 32: Hoare triple {6969#(<= main_~v~0 1)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {6970#(<= main_~v~0 2)} is VALID [2018-11-23 11:55:48,126 INFO L273 TraceCheckUtils]: 33: Hoare triple {6970#(<= main_~v~0 2)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {6970#(<= main_~v~0 2)} is VALID [2018-11-23 11:55:48,126 INFO L256 TraceCheckUtils]: 34: Hoare triple {6970#(<= main_~v~0 2)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {6966#true} is VALID [2018-11-23 11:55:48,126 INFO L273 TraceCheckUtils]: 35: Hoare triple {6966#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {6966#true} is VALID [2018-11-23 11:55:48,126 INFO L273 TraceCheckUtils]: 36: Hoare triple {6966#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {6966#true} is VALID [2018-11-23 11:55:48,127 INFO L273 TraceCheckUtils]: 37: Hoare triple {6966#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {6966#true} is VALID [2018-11-23 11:55:48,127 INFO L273 TraceCheckUtils]: 38: Hoare triple {6966#true} assume true; {6966#true} is VALID [2018-11-23 11:55:48,129 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {6966#true} {6970#(<= main_~v~0 2)} #126#return; {6970#(<= main_~v~0 2)} is VALID [2018-11-23 11:55:48,130 INFO L273 TraceCheckUtils]: 40: Hoare triple {6970#(<= main_~v~0 2)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {6970#(<= main_~v~0 2)} is VALID [2018-11-23 11:55:48,130 INFO L273 TraceCheckUtils]: 41: Hoare triple {6970#(<= main_~v~0 2)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {6970#(<= main_~v~0 2)} is VALID [2018-11-23 11:55:48,131 INFO L273 TraceCheckUtils]: 42: Hoare triple {6970#(<= main_~v~0 2)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {6971#(<= main_~v~0 3)} is VALID [2018-11-23 11:55:48,132 INFO L273 TraceCheckUtils]: 43: Hoare triple {6971#(<= main_~v~0 3)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {6971#(<= main_~v~0 3)} is VALID [2018-11-23 11:55:48,132 INFO L256 TraceCheckUtils]: 44: Hoare triple {6971#(<= main_~v~0 3)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {6966#true} is VALID [2018-11-23 11:55:48,133 INFO L273 TraceCheckUtils]: 45: Hoare triple {6966#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {6966#true} is VALID [2018-11-23 11:55:48,133 INFO L273 TraceCheckUtils]: 46: Hoare triple {6966#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {6966#true} is VALID [2018-11-23 11:55:48,133 INFO L273 TraceCheckUtils]: 47: Hoare triple {6966#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {6966#true} is VALID [2018-11-23 11:55:48,133 INFO L273 TraceCheckUtils]: 48: Hoare triple {6966#true} assume true; {6966#true} is VALID [2018-11-23 11:55:48,135 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {6966#true} {6971#(<= main_~v~0 3)} #126#return; {6971#(<= main_~v~0 3)} is VALID [2018-11-23 11:55:48,136 INFO L273 TraceCheckUtils]: 50: Hoare triple {6971#(<= main_~v~0 3)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {6971#(<= main_~v~0 3)} is VALID [2018-11-23 11:55:48,136 INFO L273 TraceCheckUtils]: 51: Hoare triple {6971#(<= main_~v~0 3)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {6971#(<= main_~v~0 3)} is VALID [2018-11-23 11:55:48,137 INFO L273 TraceCheckUtils]: 52: Hoare triple {6971#(<= main_~v~0 3)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {6972#(<= main_~v~0 4)} is VALID [2018-11-23 11:55:48,137 INFO L273 TraceCheckUtils]: 53: Hoare triple {6972#(<= main_~v~0 4)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {6972#(<= main_~v~0 4)} is VALID [2018-11-23 11:55:48,138 INFO L256 TraceCheckUtils]: 54: Hoare triple {6972#(<= main_~v~0 4)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {6966#true} is VALID [2018-11-23 11:55:48,138 INFO L273 TraceCheckUtils]: 55: Hoare triple {6966#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {6966#true} is VALID [2018-11-23 11:55:48,138 INFO L273 TraceCheckUtils]: 56: Hoare triple {6966#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {6966#true} is VALID [2018-11-23 11:55:48,139 INFO L273 TraceCheckUtils]: 57: Hoare triple {6966#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {6966#true} is VALID [2018-11-23 11:55:48,139 INFO L273 TraceCheckUtils]: 58: Hoare triple {6966#true} assume true; {6966#true} is VALID [2018-11-23 11:55:48,141 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {6966#true} {6972#(<= main_~v~0 4)} #126#return; {6972#(<= main_~v~0 4)} is VALID [2018-11-23 11:55:48,142 INFO L273 TraceCheckUtils]: 60: Hoare triple {6972#(<= main_~v~0 4)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {6972#(<= main_~v~0 4)} is VALID [2018-11-23 11:55:48,142 INFO L273 TraceCheckUtils]: 61: Hoare triple {6972#(<= main_~v~0 4)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {6972#(<= main_~v~0 4)} is VALID [2018-11-23 11:55:48,143 INFO L273 TraceCheckUtils]: 62: Hoare triple {6972#(<= main_~v~0 4)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {6973#(<= main_~v~0 5)} is VALID [2018-11-23 11:55:48,144 INFO L273 TraceCheckUtils]: 63: Hoare triple {6973#(<= main_~v~0 5)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {6973#(<= main_~v~0 5)} is VALID [2018-11-23 11:55:48,144 INFO L256 TraceCheckUtils]: 64: Hoare triple {6973#(<= main_~v~0 5)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {6966#true} is VALID [2018-11-23 11:55:48,145 INFO L273 TraceCheckUtils]: 65: Hoare triple {6966#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {6966#true} is VALID [2018-11-23 11:55:48,145 INFO L273 TraceCheckUtils]: 66: Hoare triple {6966#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {6966#true} is VALID [2018-11-23 11:55:48,145 INFO L273 TraceCheckUtils]: 67: Hoare triple {6966#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {6966#true} is VALID [2018-11-23 11:55:48,145 INFO L273 TraceCheckUtils]: 68: Hoare triple {6966#true} assume true; {6966#true} is VALID [2018-11-23 11:55:48,148 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {6966#true} {6973#(<= main_~v~0 5)} #126#return; {6973#(<= main_~v~0 5)} is VALID [2018-11-23 11:55:48,148 INFO L273 TraceCheckUtils]: 70: Hoare triple {6973#(<= main_~v~0 5)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {6973#(<= main_~v~0 5)} is VALID [2018-11-23 11:55:48,149 INFO L273 TraceCheckUtils]: 71: Hoare triple {6973#(<= main_~v~0 5)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {6973#(<= main_~v~0 5)} is VALID [2018-11-23 11:55:48,150 INFO L273 TraceCheckUtils]: 72: Hoare triple {6973#(<= main_~v~0 5)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {6974#(<= main_~v~0 6)} is VALID [2018-11-23 11:55:48,150 INFO L273 TraceCheckUtils]: 73: Hoare triple {6974#(<= main_~v~0 6)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {6974#(<= main_~v~0 6)} is VALID [2018-11-23 11:55:48,151 INFO L256 TraceCheckUtils]: 74: Hoare triple {6974#(<= main_~v~0 6)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {6966#true} is VALID [2018-11-23 11:55:48,151 INFO L273 TraceCheckUtils]: 75: Hoare triple {6966#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {6966#true} is VALID [2018-11-23 11:55:48,151 INFO L273 TraceCheckUtils]: 76: Hoare triple {6966#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {6966#true} is VALID [2018-11-23 11:55:48,152 INFO L273 TraceCheckUtils]: 77: Hoare triple {6966#true} assume !(#t~mem1 == ~value);havoc #t~mem1; {6966#true} is VALID [2018-11-23 11:55:48,152 INFO L273 TraceCheckUtils]: 78: Hoare triple {6966#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6966#true} is VALID [2018-11-23 11:55:48,152 INFO L273 TraceCheckUtils]: 79: Hoare triple {6966#true} assume !(~i~0 < ~size); {6966#true} is VALID [2018-11-23 11:55:48,153 INFO L273 TraceCheckUtils]: 80: Hoare triple {6966#true} #res := 0; {6966#true} is VALID [2018-11-23 11:55:48,153 INFO L273 TraceCheckUtils]: 81: Hoare triple {6966#true} assume true; {6966#true} is VALID [2018-11-23 11:55:48,155 INFO L268 TraceCheckUtils]: 82: Hoare quadruple {6966#true} {6974#(<= main_~v~0 6)} #126#return; {6974#(<= main_~v~0 6)} is VALID [2018-11-23 11:55:48,156 INFO L273 TraceCheckUtils]: 83: Hoare triple {6974#(<= main_~v~0 6)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {6974#(<= main_~v~0 6)} is VALID [2018-11-23 11:55:48,157 INFO L273 TraceCheckUtils]: 84: Hoare triple {6974#(<= main_~v~0 6)} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {6974#(<= main_~v~0 6)} is VALID [2018-11-23 11:55:48,157 INFO L256 TraceCheckUtils]: 85: Hoare triple {6974#(<= main_~v~0 6)} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {6966#true} is VALID [2018-11-23 11:55:48,157 INFO L273 TraceCheckUtils]: 86: Hoare triple {6966#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; {6966#true} is VALID [2018-11-23 11:55:48,157 INFO L273 TraceCheckUtils]: 87: Hoare triple {6966#true} assume true; {6966#true} is VALID [2018-11-23 11:55:48,159 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {6966#true} {6974#(<= main_~v~0 6)} #128#return; {6974#(<= main_~v~0 6)} is VALID [2018-11-23 11:55:48,160 INFO L273 TraceCheckUtils]: 89: Hoare triple {6974#(<= main_~v~0 6)} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~mem9;havoc #t~ret10; {6974#(<= main_~v~0 6)} is VALID [2018-11-23 11:55:48,160 INFO L273 TraceCheckUtils]: 90: Hoare triple {6974#(<= main_~v~0 6)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {6975#(<= main_~v~0 7)} is VALID [2018-11-23 11:55:48,208 INFO L273 TraceCheckUtils]: 91: Hoare triple {6975#(<= main_~v~0 7)} assume !(~v~0 < 100000); {6967#false} is VALID [2018-11-23 11:55:48,208 INFO L273 TraceCheckUtils]: 92: Hoare triple {6967#false} ~x~0 := 0; {6967#false} is VALID [2018-11-23 11:55:48,208 INFO L273 TraceCheckUtils]: 93: Hoare triple {6967#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {6967#false} is VALID [2018-11-23 11:55:48,208 INFO L273 TraceCheckUtils]: 94: Hoare triple {6967#false} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {6967#false} is VALID [2018-11-23 11:55:48,209 INFO L256 TraceCheckUtils]: 95: Hoare triple {6967#false} call __VERIFIER_assert((if #t~mem13 != #t~mem14 then 1 else 0)); {6967#false} is VALID [2018-11-23 11:55:48,209 INFO L273 TraceCheckUtils]: 96: Hoare triple {6967#false} ~cond := #in~cond; {6967#false} is VALID [2018-11-23 11:55:48,209 INFO L273 TraceCheckUtils]: 97: Hoare triple {6967#false} assume 0 == ~cond; {6967#false} is VALID [2018-11-23 11:55:48,209 INFO L273 TraceCheckUtils]: 98: Hoare triple {6967#false} assume !false; {6967#false} is VALID [2018-11-23 11:55:48,213 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-11-23 11:55:48,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:48,214 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:48,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:48,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:48,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:48,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:48,592 INFO L256 TraceCheckUtils]: 0: Hoare triple {6966#true} call ULTIMATE.init(); {6966#true} is VALID [2018-11-23 11:55:48,592 INFO L273 TraceCheckUtils]: 1: Hoare triple {6966#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6966#true} is VALID [2018-11-23 11:55:48,592 INFO L273 TraceCheckUtils]: 2: Hoare triple {6966#true} assume true; {6966#true} is VALID [2018-11-23 11:55:48,593 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6966#true} {6966#true} #120#return; {6966#true} is VALID [2018-11-23 11:55:48,593 INFO L256 TraceCheckUtils]: 4: Hoare triple {6966#true} call #t~ret15 := main(); {6966#true} is VALID [2018-11-23 11:55:48,593 INFO L273 TraceCheckUtils]: 5: Hoare triple {6966#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {6966#true} is VALID [2018-11-23 11:55:48,593 INFO L273 TraceCheckUtils]: 6: Hoare triple {6966#true} assume !(~x~0 < ~n~0); {6966#true} is VALID [2018-11-23 11:55:48,594 INFO L273 TraceCheckUtils]: 7: Hoare triple {6966#true} call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(400000);havoc ~v~0;~v~0 := 0; {7000#(<= main_~v~0 0)} is VALID [2018-11-23 11:55:48,594 INFO L273 TraceCheckUtils]: 8: Hoare triple {7000#(<= main_~v~0 0)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {7000#(<= main_~v~0 0)} is VALID [2018-11-23 11:55:48,595 INFO L256 TraceCheckUtils]: 9: Hoare triple {7000#(<= main_~v~0 0)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {6966#true} is VALID [2018-11-23 11:55:48,595 INFO L273 TraceCheckUtils]: 10: Hoare triple {6966#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {6966#true} is VALID [2018-11-23 11:55:48,595 INFO L273 TraceCheckUtils]: 11: Hoare triple {6966#true} assume !(~i~0 < ~size); {6966#true} is VALID [2018-11-23 11:55:48,595 INFO L273 TraceCheckUtils]: 12: Hoare triple {6966#true} #res := 0; {6966#true} is VALID [2018-11-23 11:55:48,595 INFO L273 TraceCheckUtils]: 13: Hoare triple {6966#true} assume true; {6966#true} is VALID [2018-11-23 11:55:48,596 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {6966#true} {7000#(<= main_~v~0 0)} #126#return; {7000#(<= main_~v~0 0)} is VALID [2018-11-23 11:55:48,596 INFO L273 TraceCheckUtils]: 15: Hoare triple {7000#(<= main_~v~0 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {7000#(<= main_~v~0 0)} is VALID [2018-11-23 11:55:48,596 INFO L273 TraceCheckUtils]: 16: Hoare triple {7000#(<= main_~v~0 0)} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {7000#(<= main_~v~0 0)} is VALID [2018-11-23 11:55:48,597 INFO L256 TraceCheckUtils]: 17: Hoare triple {7000#(<= main_~v~0 0)} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {6966#true} is VALID [2018-11-23 11:55:48,597 INFO L273 TraceCheckUtils]: 18: Hoare triple {6966#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; {6966#true} is VALID [2018-11-23 11:55:48,597 INFO L273 TraceCheckUtils]: 19: Hoare triple {6966#true} assume true; {6966#true} is VALID [2018-11-23 11:55:48,598 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {6966#true} {7000#(<= main_~v~0 0)} #128#return; {7000#(<= main_~v~0 0)} is VALID [2018-11-23 11:55:48,598 INFO L273 TraceCheckUtils]: 21: Hoare triple {7000#(<= main_~v~0 0)} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~mem9;havoc #t~ret10; {7000#(<= main_~v~0 0)} is VALID [2018-11-23 11:55:48,599 INFO L273 TraceCheckUtils]: 22: Hoare triple {7000#(<= main_~v~0 0)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {6969#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:48,599 INFO L273 TraceCheckUtils]: 23: Hoare triple {6969#(<= main_~v~0 1)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {6969#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:48,600 INFO L256 TraceCheckUtils]: 24: Hoare triple {6969#(<= main_~v~0 1)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {6966#true} is VALID [2018-11-23 11:55:48,600 INFO L273 TraceCheckUtils]: 25: Hoare triple {6966#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {6966#true} is VALID [2018-11-23 11:55:48,600 INFO L273 TraceCheckUtils]: 26: Hoare triple {6966#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {6966#true} is VALID [2018-11-23 11:55:48,600 INFO L273 TraceCheckUtils]: 27: Hoare triple {6966#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {6966#true} is VALID [2018-11-23 11:55:48,601 INFO L273 TraceCheckUtils]: 28: Hoare triple {6966#true} assume true; {6966#true} is VALID [2018-11-23 11:55:48,602 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {6966#true} {6969#(<= main_~v~0 1)} #126#return; {6969#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:48,602 INFO L273 TraceCheckUtils]: 30: Hoare triple {6969#(<= main_~v~0 1)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {6969#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:48,603 INFO L273 TraceCheckUtils]: 31: Hoare triple {6969#(<= main_~v~0 1)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {6969#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:48,603 INFO L273 TraceCheckUtils]: 32: Hoare triple {6969#(<= main_~v~0 1)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {6970#(<= main_~v~0 2)} is VALID [2018-11-23 11:55:48,603 INFO L273 TraceCheckUtils]: 33: Hoare triple {6970#(<= main_~v~0 2)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {6970#(<= main_~v~0 2)} is VALID [2018-11-23 11:55:48,604 INFO L256 TraceCheckUtils]: 34: Hoare triple {6970#(<= main_~v~0 2)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {6966#true} is VALID [2018-11-23 11:55:48,604 INFO L273 TraceCheckUtils]: 35: Hoare triple {6966#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {6966#true} is VALID [2018-11-23 11:55:48,604 INFO L273 TraceCheckUtils]: 36: Hoare triple {6966#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {6966#true} is VALID [2018-11-23 11:55:48,604 INFO L273 TraceCheckUtils]: 37: Hoare triple {6966#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {6966#true} is VALID [2018-11-23 11:55:48,604 INFO L273 TraceCheckUtils]: 38: Hoare triple {6966#true} assume true; {6966#true} is VALID [2018-11-23 11:55:48,605 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {6966#true} {6970#(<= main_~v~0 2)} #126#return; {6970#(<= main_~v~0 2)} is VALID [2018-11-23 11:55:48,605 INFO L273 TraceCheckUtils]: 40: Hoare triple {6970#(<= main_~v~0 2)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {6970#(<= main_~v~0 2)} is VALID [2018-11-23 11:55:48,605 INFO L273 TraceCheckUtils]: 41: Hoare triple {6970#(<= main_~v~0 2)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {6970#(<= main_~v~0 2)} is VALID [2018-11-23 11:55:48,606 INFO L273 TraceCheckUtils]: 42: Hoare triple {6970#(<= main_~v~0 2)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {6971#(<= main_~v~0 3)} is VALID [2018-11-23 11:55:48,607 INFO L273 TraceCheckUtils]: 43: Hoare triple {6971#(<= main_~v~0 3)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {6971#(<= main_~v~0 3)} is VALID [2018-11-23 11:55:48,607 INFO L256 TraceCheckUtils]: 44: Hoare triple {6971#(<= main_~v~0 3)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {6966#true} is VALID [2018-11-23 11:55:48,607 INFO L273 TraceCheckUtils]: 45: Hoare triple {6966#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {6966#true} is VALID [2018-11-23 11:55:48,607 INFO L273 TraceCheckUtils]: 46: Hoare triple {6966#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {6966#true} is VALID [2018-11-23 11:55:48,608 INFO L273 TraceCheckUtils]: 47: Hoare triple {6966#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {6966#true} is VALID [2018-11-23 11:55:48,608 INFO L273 TraceCheckUtils]: 48: Hoare triple {6966#true} assume true; {6966#true} is VALID [2018-11-23 11:55:48,609 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {6966#true} {6971#(<= main_~v~0 3)} #126#return; {6971#(<= main_~v~0 3)} is VALID [2018-11-23 11:55:48,609 INFO L273 TraceCheckUtils]: 50: Hoare triple {6971#(<= main_~v~0 3)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {6971#(<= main_~v~0 3)} is VALID [2018-11-23 11:55:48,610 INFO L273 TraceCheckUtils]: 51: Hoare triple {6971#(<= main_~v~0 3)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {6971#(<= main_~v~0 3)} is VALID [2018-11-23 11:55:48,611 INFO L273 TraceCheckUtils]: 52: Hoare triple {6971#(<= main_~v~0 3)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {6972#(<= main_~v~0 4)} is VALID [2018-11-23 11:55:48,611 INFO L273 TraceCheckUtils]: 53: Hoare triple {6972#(<= main_~v~0 4)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {6972#(<= main_~v~0 4)} is VALID [2018-11-23 11:55:48,612 INFO L256 TraceCheckUtils]: 54: Hoare triple {6972#(<= main_~v~0 4)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {6966#true} is VALID [2018-11-23 11:55:48,612 INFO L273 TraceCheckUtils]: 55: Hoare triple {6966#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {6966#true} is VALID [2018-11-23 11:55:48,612 INFO L273 TraceCheckUtils]: 56: Hoare triple {6966#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {6966#true} is VALID [2018-11-23 11:55:48,612 INFO L273 TraceCheckUtils]: 57: Hoare triple {6966#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {6966#true} is VALID [2018-11-23 11:55:48,612 INFO L273 TraceCheckUtils]: 58: Hoare triple {6966#true} assume true; {6966#true} is VALID [2018-11-23 11:55:48,613 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {6966#true} {6972#(<= main_~v~0 4)} #126#return; {6972#(<= main_~v~0 4)} is VALID [2018-11-23 11:55:48,614 INFO L273 TraceCheckUtils]: 60: Hoare triple {6972#(<= main_~v~0 4)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {6972#(<= main_~v~0 4)} is VALID [2018-11-23 11:55:48,615 INFO L273 TraceCheckUtils]: 61: Hoare triple {6972#(<= main_~v~0 4)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {6972#(<= main_~v~0 4)} is VALID [2018-11-23 11:55:48,615 INFO L273 TraceCheckUtils]: 62: Hoare triple {6972#(<= main_~v~0 4)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {6973#(<= main_~v~0 5)} is VALID [2018-11-23 11:55:48,615 INFO L273 TraceCheckUtils]: 63: Hoare triple {6973#(<= main_~v~0 5)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {6973#(<= main_~v~0 5)} is VALID [2018-11-23 11:55:48,615 INFO L256 TraceCheckUtils]: 64: Hoare triple {6973#(<= main_~v~0 5)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {6966#true} is VALID [2018-11-23 11:55:48,616 INFO L273 TraceCheckUtils]: 65: Hoare triple {6966#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {6966#true} is VALID [2018-11-23 11:55:48,616 INFO L273 TraceCheckUtils]: 66: Hoare triple {6966#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {6966#true} is VALID [2018-11-23 11:55:48,616 INFO L273 TraceCheckUtils]: 67: Hoare triple {6966#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {6966#true} is VALID [2018-11-23 11:55:48,616 INFO L273 TraceCheckUtils]: 68: Hoare triple {6966#true} assume true; {6966#true} is VALID [2018-11-23 11:55:48,617 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {6966#true} {6973#(<= main_~v~0 5)} #126#return; {6973#(<= main_~v~0 5)} is VALID [2018-11-23 11:55:48,617 INFO L273 TraceCheckUtils]: 70: Hoare triple {6973#(<= main_~v~0 5)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {6973#(<= main_~v~0 5)} is VALID [2018-11-23 11:55:48,618 INFO L273 TraceCheckUtils]: 71: Hoare triple {6973#(<= main_~v~0 5)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {6973#(<= main_~v~0 5)} is VALID [2018-11-23 11:55:48,619 INFO L273 TraceCheckUtils]: 72: Hoare triple {6973#(<= main_~v~0 5)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {6974#(<= main_~v~0 6)} is VALID [2018-11-23 11:55:48,619 INFO L273 TraceCheckUtils]: 73: Hoare triple {6974#(<= main_~v~0 6)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {6974#(<= main_~v~0 6)} is VALID [2018-11-23 11:55:48,619 INFO L256 TraceCheckUtils]: 74: Hoare triple {6974#(<= main_~v~0 6)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {6966#true} is VALID [2018-11-23 11:55:48,620 INFO L273 TraceCheckUtils]: 75: Hoare triple {6966#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {6966#true} is VALID [2018-11-23 11:55:48,620 INFO L273 TraceCheckUtils]: 76: Hoare triple {6966#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {6966#true} is VALID [2018-11-23 11:55:48,620 INFO L273 TraceCheckUtils]: 77: Hoare triple {6966#true} assume !(#t~mem1 == ~value);havoc #t~mem1; {6966#true} is VALID [2018-11-23 11:55:48,620 INFO L273 TraceCheckUtils]: 78: Hoare triple {6966#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6966#true} is VALID [2018-11-23 11:55:48,620 INFO L273 TraceCheckUtils]: 79: Hoare triple {6966#true} assume !(~i~0 < ~size); {6966#true} is VALID [2018-11-23 11:55:48,621 INFO L273 TraceCheckUtils]: 80: Hoare triple {6966#true} #res := 0; {6966#true} is VALID [2018-11-23 11:55:48,621 INFO L273 TraceCheckUtils]: 81: Hoare triple {6966#true} assume true; {6966#true} is VALID [2018-11-23 11:55:48,622 INFO L268 TraceCheckUtils]: 82: Hoare quadruple {6966#true} {6974#(<= main_~v~0 6)} #126#return; {6974#(<= main_~v~0 6)} is VALID [2018-11-23 11:55:48,622 INFO L273 TraceCheckUtils]: 83: Hoare triple {6974#(<= main_~v~0 6)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {6974#(<= main_~v~0 6)} is VALID [2018-11-23 11:55:48,622 INFO L273 TraceCheckUtils]: 84: Hoare triple {6974#(<= main_~v~0 6)} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {6974#(<= main_~v~0 6)} is VALID [2018-11-23 11:55:48,623 INFO L256 TraceCheckUtils]: 85: Hoare triple {6974#(<= main_~v~0 6)} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {6966#true} is VALID [2018-11-23 11:55:48,623 INFO L273 TraceCheckUtils]: 86: Hoare triple {6966#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; {6966#true} is VALID [2018-11-23 11:55:48,623 INFO L273 TraceCheckUtils]: 87: Hoare triple {6966#true} assume true; {6966#true} is VALID [2018-11-23 11:55:48,623 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {6966#true} {6974#(<= main_~v~0 6)} #128#return; {6974#(<= main_~v~0 6)} is VALID [2018-11-23 11:55:48,624 INFO L273 TraceCheckUtils]: 89: Hoare triple {6974#(<= main_~v~0 6)} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~mem9;havoc #t~ret10; {6974#(<= main_~v~0 6)} is VALID [2018-11-23 11:55:48,624 INFO L273 TraceCheckUtils]: 90: Hoare triple {6974#(<= main_~v~0 6)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {6975#(<= main_~v~0 7)} is VALID [2018-11-23 11:55:48,625 INFO L273 TraceCheckUtils]: 91: Hoare triple {6975#(<= main_~v~0 7)} assume !(~v~0 < 100000); {6967#false} is VALID [2018-11-23 11:55:48,625 INFO L273 TraceCheckUtils]: 92: Hoare triple {6967#false} ~x~0 := 0; {6967#false} is VALID [2018-11-23 11:55:48,625 INFO L273 TraceCheckUtils]: 93: Hoare triple {6967#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {6967#false} is VALID [2018-11-23 11:55:48,625 INFO L273 TraceCheckUtils]: 94: Hoare triple {6967#false} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {6967#false} is VALID [2018-11-23 11:55:48,625 INFO L256 TraceCheckUtils]: 95: Hoare triple {6967#false} call __VERIFIER_assert((if #t~mem13 != #t~mem14 then 1 else 0)); {6967#false} is VALID [2018-11-23 11:55:48,625 INFO L273 TraceCheckUtils]: 96: Hoare triple {6967#false} ~cond := #in~cond; {6967#false} is VALID [2018-11-23 11:55:48,625 INFO L273 TraceCheckUtils]: 97: Hoare triple {6967#false} assume 0 == ~cond; {6967#false} is VALID [2018-11-23 11:55:48,626 INFO L273 TraceCheckUtils]: 98: Hoare triple {6967#false} assume !false; {6967#false} is VALID [2018-11-23 11:55:48,630 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-11-23 11:55:48,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:48,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 11:55:48,651 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 99 [2018-11-23 11:55:48,651 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:48,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 11:55:48,770 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:48,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:55:48,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:55:48,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:55:48,771 INFO L87 Difference]: Start difference. First operand 167 states and 220 transitions. Second operand 11 states. [2018-11-23 11:55:50,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:50,265 INFO L93 Difference]: Finished difference Result 240 states and 317 transitions. [2018-11-23 11:55:50,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:55:50,265 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 99 [2018-11-23 11:55:50,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:50,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:55:50,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 138 transitions. [2018-11-23 11:55:50,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:55:50,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 138 transitions. [2018-11-23 11:55:50,272 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 138 transitions. [2018-11-23 11:55:50,451 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:50,459 INFO L225 Difference]: With dead ends: 240 [2018-11-23 11:55:50,459 INFO L226 Difference]: Without dead ends: 227 [2018-11-23 11:55:50,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:55:50,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-11-23 11:55:50,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 190. [2018-11-23 11:55:50,723 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:50,723 INFO L82 GeneralOperation]: Start isEquivalent. First operand 227 states. Second operand 190 states. [2018-11-23 11:55:50,723 INFO L74 IsIncluded]: Start isIncluded. First operand 227 states. Second operand 190 states. [2018-11-23 11:55:50,723 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 190 states. [2018-11-23 11:55:50,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:50,733 INFO L93 Difference]: Finished difference Result 227 states and 302 transitions. [2018-11-23 11:55:50,733 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 302 transitions. [2018-11-23 11:55:50,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:50,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:50,735 INFO L74 IsIncluded]: Start isIncluded. First operand 190 states. Second operand 227 states. [2018-11-23 11:55:50,735 INFO L87 Difference]: Start difference. First operand 190 states. Second operand 227 states. [2018-11-23 11:55:50,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:50,745 INFO L93 Difference]: Finished difference Result 227 states and 302 transitions. [2018-11-23 11:55:50,745 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 302 transitions. [2018-11-23 11:55:50,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:50,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:50,747 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:50,747 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:50,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-11-23 11:55:50,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 252 transitions. [2018-11-23 11:55:50,755 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 252 transitions. Word has length 99 [2018-11-23 11:55:50,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:50,755 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 252 transitions. [2018-11-23 11:55:50,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:55:50,755 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 252 transitions. [2018-11-23 11:55:50,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-23 11:55:50,757 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:50,758 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 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] [2018-11-23 11:55:50,758 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:50,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:50,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1261329349, now seen corresponding path program 2 times [2018-11-23 11:55:50,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:50,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:50,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:50,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:50,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:51,784 INFO L256 TraceCheckUtils]: 0: Hoare triple {8307#true} call ULTIMATE.init(); {8307#true} is VALID [2018-11-23 11:55:51,784 INFO L273 TraceCheckUtils]: 1: Hoare triple {8307#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8307#true} is VALID [2018-11-23 11:55:51,785 INFO L273 TraceCheckUtils]: 2: Hoare triple {8307#true} assume true; {8307#true} is VALID [2018-11-23 11:55:51,785 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8307#true} {8307#true} #120#return; {8307#true} is VALID [2018-11-23 11:55:51,785 INFO L256 TraceCheckUtils]: 4: Hoare triple {8307#true} call #t~ret15 := main(); {8307#true} is VALID [2018-11-23 11:55:51,785 INFO L273 TraceCheckUtils]: 5: Hoare triple {8307#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {8307#true} is VALID [2018-11-23 11:55:51,785 INFO L273 TraceCheckUtils]: 6: Hoare triple {8307#true} assume !(~x~0 < ~n~0); {8307#true} is VALID [2018-11-23 11:55:51,786 INFO L273 TraceCheckUtils]: 7: Hoare triple {8307#true} call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(400000);havoc ~v~0;~v~0 := 0; {8309#(= main_~v~0 0)} is VALID [2018-11-23 11:55:51,787 INFO L273 TraceCheckUtils]: 8: Hoare triple {8309#(= main_~v~0 0)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {8309#(= main_~v~0 0)} is VALID [2018-11-23 11:55:51,787 INFO L256 TraceCheckUtils]: 9: Hoare triple {8309#(= main_~v~0 0)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {8307#true} is VALID [2018-11-23 11:55:51,787 INFO L273 TraceCheckUtils]: 10: Hoare triple {8307#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {8307#true} is VALID [2018-11-23 11:55:51,787 INFO L273 TraceCheckUtils]: 11: Hoare triple {8307#true} assume !(~i~0 < ~size); {8307#true} is VALID [2018-11-23 11:55:51,787 INFO L273 TraceCheckUtils]: 12: Hoare triple {8307#true} #res := 0; {8307#true} is VALID [2018-11-23 11:55:51,787 INFO L273 TraceCheckUtils]: 13: Hoare triple {8307#true} assume true; {8307#true} is VALID [2018-11-23 11:55:51,788 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {8307#true} {8309#(= main_~v~0 0)} #126#return; {8309#(= main_~v~0 0)} is VALID [2018-11-23 11:55:51,788 INFO L273 TraceCheckUtils]: 15: Hoare triple {8309#(= main_~v~0 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {8309#(= main_~v~0 0)} is VALID [2018-11-23 11:55:51,789 INFO L273 TraceCheckUtils]: 16: Hoare triple {8309#(= main_~v~0 0)} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {8309#(= main_~v~0 0)} is VALID [2018-11-23 11:55:51,789 INFO L256 TraceCheckUtils]: 17: Hoare triple {8309#(= main_~v~0 0)} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {8307#true} is VALID [2018-11-23 11:55:51,789 INFO L273 TraceCheckUtils]: 18: Hoare triple {8307#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; {8307#true} is VALID [2018-11-23 11:55:51,789 INFO L273 TraceCheckUtils]: 19: Hoare triple {8307#true} assume true; {8307#true} is VALID [2018-11-23 11:55:51,790 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {8307#true} {8309#(= main_~v~0 0)} #128#return; {8309#(= main_~v~0 0)} is VALID [2018-11-23 11:55:51,791 INFO L273 TraceCheckUtils]: 21: Hoare triple {8309#(= main_~v~0 0)} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~mem9;havoc #t~ret10; {8309#(= main_~v~0 0)} is VALID [2018-11-23 11:55:51,791 INFO L273 TraceCheckUtils]: 22: Hoare triple {8309#(= main_~v~0 0)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {8310#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:51,792 INFO L273 TraceCheckUtils]: 23: Hoare triple {8310#(<= main_~v~0 1)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {8310#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:51,792 INFO L256 TraceCheckUtils]: 24: Hoare triple {8310#(<= main_~v~0 1)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {8307#true} is VALID [2018-11-23 11:55:51,792 INFO L273 TraceCheckUtils]: 25: Hoare triple {8307#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {8307#true} is VALID [2018-11-23 11:55:51,792 INFO L273 TraceCheckUtils]: 26: Hoare triple {8307#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {8307#true} is VALID [2018-11-23 11:55:51,793 INFO L273 TraceCheckUtils]: 27: Hoare triple {8307#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {8307#true} is VALID [2018-11-23 11:55:51,793 INFO L273 TraceCheckUtils]: 28: Hoare triple {8307#true} assume true; {8307#true} is VALID [2018-11-23 11:55:51,794 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {8307#true} {8310#(<= main_~v~0 1)} #126#return; {8310#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:51,795 INFO L273 TraceCheckUtils]: 30: Hoare triple {8310#(<= main_~v~0 1)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {8310#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:51,795 INFO L273 TraceCheckUtils]: 31: Hoare triple {8310#(<= main_~v~0 1)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {8310#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:51,796 INFO L273 TraceCheckUtils]: 32: Hoare triple {8310#(<= main_~v~0 1)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {8311#(<= main_~v~0 2)} is VALID [2018-11-23 11:55:51,796 INFO L273 TraceCheckUtils]: 33: Hoare triple {8311#(<= main_~v~0 2)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {8311#(<= main_~v~0 2)} is VALID [2018-11-23 11:55:51,797 INFO L256 TraceCheckUtils]: 34: Hoare triple {8311#(<= main_~v~0 2)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {8307#true} is VALID [2018-11-23 11:55:51,797 INFO L273 TraceCheckUtils]: 35: Hoare triple {8307#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {8307#true} is VALID [2018-11-23 11:55:51,797 INFO L273 TraceCheckUtils]: 36: Hoare triple {8307#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {8307#true} is VALID [2018-11-23 11:55:51,797 INFO L273 TraceCheckUtils]: 37: Hoare triple {8307#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {8307#true} is VALID [2018-11-23 11:55:51,798 INFO L273 TraceCheckUtils]: 38: Hoare triple {8307#true} assume true; {8307#true} is VALID [2018-11-23 11:55:51,799 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {8307#true} {8311#(<= main_~v~0 2)} #126#return; {8311#(<= main_~v~0 2)} is VALID [2018-11-23 11:55:51,799 INFO L273 TraceCheckUtils]: 40: Hoare triple {8311#(<= main_~v~0 2)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {8311#(<= main_~v~0 2)} is VALID [2018-11-23 11:55:51,800 INFO L273 TraceCheckUtils]: 41: Hoare triple {8311#(<= main_~v~0 2)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {8311#(<= main_~v~0 2)} is VALID [2018-11-23 11:55:51,801 INFO L273 TraceCheckUtils]: 42: Hoare triple {8311#(<= main_~v~0 2)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {8312#(<= main_~v~0 3)} is VALID [2018-11-23 11:55:51,801 INFO L273 TraceCheckUtils]: 43: Hoare triple {8312#(<= main_~v~0 3)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {8312#(<= main_~v~0 3)} is VALID [2018-11-23 11:55:51,801 INFO L256 TraceCheckUtils]: 44: Hoare triple {8312#(<= main_~v~0 3)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {8307#true} is VALID [2018-11-23 11:55:51,802 INFO L273 TraceCheckUtils]: 45: Hoare triple {8307#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {8307#true} is VALID [2018-11-23 11:55:51,802 INFO L273 TraceCheckUtils]: 46: Hoare triple {8307#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {8307#true} is VALID [2018-11-23 11:55:51,802 INFO L273 TraceCheckUtils]: 47: Hoare triple {8307#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {8307#true} is VALID [2018-11-23 11:55:51,802 INFO L273 TraceCheckUtils]: 48: Hoare triple {8307#true} assume true; {8307#true} is VALID [2018-11-23 11:55:51,803 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {8307#true} {8312#(<= main_~v~0 3)} #126#return; {8312#(<= main_~v~0 3)} is VALID [2018-11-23 11:55:51,804 INFO L273 TraceCheckUtils]: 50: Hoare triple {8312#(<= main_~v~0 3)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {8312#(<= main_~v~0 3)} is VALID [2018-11-23 11:55:51,804 INFO L273 TraceCheckUtils]: 51: Hoare triple {8312#(<= main_~v~0 3)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {8312#(<= main_~v~0 3)} is VALID [2018-11-23 11:55:51,805 INFO L273 TraceCheckUtils]: 52: Hoare triple {8312#(<= main_~v~0 3)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {8313#(<= main_~v~0 4)} is VALID [2018-11-23 11:55:51,806 INFO L273 TraceCheckUtils]: 53: Hoare triple {8313#(<= main_~v~0 4)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {8313#(<= main_~v~0 4)} is VALID [2018-11-23 11:55:51,806 INFO L256 TraceCheckUtils]: 54: Hoare triple {8313#(<= main_~v~0 4)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {8307#true} is VALID [2018-11-23 11:55:51,806 INFO L273 TraceCheckUtils]: 55: Hoare triple {8307#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {8307#true} is VALID [2018-11-23 11:55:51,806 INFO L273 TraceCheckUtils]: 56: Hoare triple {8307#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {8307#true} is VALID [2018-11-23 11:55:51,807 INFO L273 TraceCheckUtils]: 57: Hoare triple {8307#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {8307#true} is VALID [2018-11-23 11:55:51,807 INFO L273 TraceCheckUtils]: 58: Hoare triple {8307#true} assume true; {8307#true} is VALID [2018-11-23 11:55:51,808 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {8307#true} {8313#(<= main_~v~0 4)} #126#return; {8313#(<= main_~v~0 4)} is VALID [2018-11-23 11:55:51,809 INFO L273 TraceCheckUtils]: 60: Hoare triple {8313#(<= main_~v~0 4)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {8313#(<= main_~v~0 4)} is VALID [2018-11-23 11:55:51,809 INFO L273 TraceCheckUtils]: 61: Hoare triple {8313#(<= main_~v~0 4)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {8313#(<= main_~v~0 4)} is VALID [2018-11-23 11:55:51,809 INFO L273 TraceCheckUtils]: 62: Hoare triple {8313#(<= main_~v~0 4)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {8314#(<= main_~v~0 5)} is VALID [2018-11-23 11:55:51,810 INFO L273 TraceCheckUtils]: 63: Hoare triple {8314#(<= main_~v~0 5)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {8314#(<= main_~v~0 5)} is VALID [2018-11-23 11:55:51,810 INFO L256 TraceCheckUtils]: 64: Hoare triple {8314#(<= main_~v~0 5)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {8307#true} is VALID [2018-11-23 11:55:51,810 INFO L273 TraceCheckUtils]: 65: Hoare triple {8307#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {8307#true} is VALID [2018-11-23 11:55:51,810 INFO L273 TraceCheckUtils]: 66: Hoare triple {8307#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {8307#true} is VALID [2018-11-23 11:55:51,810 INFO L273 TraceCheckUtils]: 67: Hoare triple {8307#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {8307#true} is VALID [2018-11-23 11:55:51,810 INFO L273 TraceCheckUtils]: 68: Hoare triple {8307#true} assume true; {8307#true} is VALID [2018-11-23 11:55:51,811 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {8307#true} {8314#(<= main_~v~0 5)} #126#return; {8314#(<= main_~v~0 5)} is VALID [2018-11-23 11:55:51,812 INFO L273 TraceCheckUtils]: 70: Hoare triple {8314#(<= main_~v~0 5)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {8314#(<= main_~v~0 5)} is VALID [2018-11-23 11:55:51,812 INFO L273 TraceCheckUtils]: 71: Hoare triple {8314#(<= main_~v~0 5)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {8314#(<= main_~v~0 5)} is VALID [2018-11-23 11:55:51,813 INFO L273 TraceCheckUtils]: 72: Hoare triple {8314#(<= main_~v~0 5)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {8315#(<= main_~v~0 6)} is VALID [2018-11-23 11:55:51,814 INFO L273 TraceCheckUtils]: 73: Hoare triple {8315#(<= main_~v~0 6)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {8315#(<= main_~v~0 6)} is VALID [2018-11-23 11:55:51,814 INFO L256 TraceCheckUtils]: 74: Hoare triple {8315#(<= main_~v~0 6)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {8307#true} is VALID [2018-11-23 11:55:51,814 INFO L273 TraceCheckUtils]: 75: Hoare triple {8307#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {8307#true} is VALID [2018-11-23 11:55:51,814 INFO L273 TraceCheckUtils]: 76: Hoare triple {8307#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {8307#true} is VALID [2018-11-23 11:55:51,815 INFO L273 TraceCheckUtils]: 77: Hoare triple {8307#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {8307#true} is VALID [2018-11-23 11:55:51,815 INFO L273 TraceCheckUtils]: 78: Hoare triple {8307#true} assume true; {8307#true} is VALID [2018-11-23 11:55:51,816 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {8307#true} {8315#(<= main_~v~0 6)} #126#return; {8315#(<= main_~v~0 6)} is VALID [2018-11-23 11:55:51,817 INFO L273 TraceCheckUtils]: 80: Hoare triple {8315#(<= main_~v~0 6)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {8315#(<= main_~v~0 6)} is VALID [2018-11-23 11:55:51,817 INFO L273 TraceCheckUtils]: 81: Hoare triple {8315#(<= main_~v~0 6)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {8315#(<= main_~v~0 6)} is VALID [2018-11-23 11:55:51,818 INFO L273 TraceCheckUtils]: 82: Hoare triple {8315#(<= main_~v~0 6)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {8316#(<= main_~v~0 7)} is VALID [2018-11-23 11:55:51,818 INFO L273 TraceCheckUtils]: 83: Hoare triple {8316#(<= main_~v~0 7)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {8316#(<= main_~v~0 7)} is VALID [2018-11-23 11:55:51,819 INFO L256 TraceCheckUtils]: 84: Hoare triple {8316#(<= main_~v~0 7)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {8307#true} is VALID [2018-11-23 11:55:51,819 INFO L273 TraceCheckUtils]: 85: Hoare triple {8307#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {8307#true} is VALID [2018-11-23 11:55:51,819 INFO L273 TraceCheckUtils]: 86: Hoare triple {8307#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {8307#true} is VALID [2018-11-23 11:55:51,819 INFO L273 TraceCheckUtils]: 87: Hoare triple {8307#true} assume !(#t~mem1 == ~value);havoc #t~mem1; {8307#true} is VALID [2018-11-23 11:55:51,819 INFO L273 TraceCheckUtils]: 88: Hoare triple {8307#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8307#true} is VALID [2018-11-23 11:55:51,820 INFO L273 TraceCheckUtils]: 89: Hoare triple {8307#true} assume !(~i~0 < ~size); {8307#true} is VALID [2018-11-23 11:55:51,820 INFO L273 TraceCheckUtils]: 90: Hoare triple {8307#true} #res := 0; {8307#true} is VALID [2018-11-23 11:55:51,820 INFO L273 TraceCheckUtils]: 91: Hoare triple {8307#true} assume true; {8307#true} is VALID [2018-11-23 11:55:51,821 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {8307#true} {8316#(<= main_~v~0 7)} #126#return; {8316#(<= main_~v~0 7)} is VALID [2018-11-23 11:55:51,822 INFO L273 TraceCheckUtils]: 93: Hoare triple {8316#(<= main_~v~0 7)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {8316#(<= main_~v~0 7)} is VALID [2018-11-23 11:55:51,822 INFO L273 TraceCheckUtils]: 94: Hoare triple {8316#(<= main_~v~0 7)} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {8316#(<= main_~v~0 7)} is VALID [2018-11-23 11:55:51,823 INFO L256 TraceCheckUtils]: 95: Hoare triple {8316#(<= main_~v~0 7)} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {8307#true} is VALID [2018-11-23 11:55:51,823 INFO L273 TraceCheckUtils]: 96: Hoare triple {8307#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; {8307#true} is VALID [2018-11-23 11:55:51,823 INFO L273 TraceCheckUtils]: 97: Hoare triple {8307#true} assume true; {8307#true} is VALID [2018-11-23 11:55:51,824 INFO L268 TraceCheckUtils]: 98: Hoare quadruple {8307#true} {8316#(<= main_~v~0 7)} #128#return; {8316#(<= main_~v~0 7)} is VALID [2018-11-23 11:55:51,824 INFO L273 TraceCheckUtils]: 99: Hoare triple {8316#(<= main_~v~0 7)} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~mem9;havoc #t~ret10; {8316#(<= main_~v~0 7)} is VALID [2018-11-23 11:55:51,824 INFO L273 TraceCheckUtils]: 100: Hoare triple {8316#(<= main_~v~0 7)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {8317#(<= main_~v~0 8)} is VALID [2018-11-23 11:55:51,825 INFO L273 TraceCheckUtils]: 101: Hoare triple {8317#(<= main_~v~0 8)} assume !(~v~0 < 100000); {8308#false} is VALID [2018-11-23 11:55:51,825 INFO L273 TraceCheckUtils]: 102: Hoare triple {8308#false} ~x~0 := 0; {8308#false} is VALID [2018-11-23 11:55:51,826 INFO L273 TraceCheckUtils]: 103: Hoare triple {8308#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {8308#false} is VALID [2018-11-23 11:55:51,826 INFO L273 TraceCheckUtils]: 104: Hoare triple {8308#false} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {8308#false} is VALID [2018-11-23 11:55:51,826 INFO L256 TraceCheckUtils]: 105: Hoare triple {8308#false} call __VERIFIER_assert((if #t~mem13 != #t~mem14 then 1 else 0)); {8308#false} is VALID [2018-11-23 11:55:51,826 INFO L273 TraceCheckUtils]: 106: Hoare triple {8308#false} ~cond := #in~cond; {8308#false} is VALID [2018-11-23 11:55:51,826 INFO L273 TraceCheckUtils]: 107: Hoare triple {8308#false} assume 0 == ~cond; {8308#false} is VALID [2018-11-23 11:55:51,827 INFO L273 TraceCheckUtils]: 108: Hoare triple {8308#false} assume !false; {8308#false} is VALID [2018-11-23 11:55:51,833 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-23 11:55:51,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:51,833 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:51,842 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:55:51,902 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:55:51,902 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:51,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:51,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:52,107 INFO L256 TraceCheckUtils]: 0: Hoare triple {8307#true} call ULTIMATE.init(); {8307#true} is VALID [2018-11-23 11:55:52,108 INFO L273 TraceCheckUtils]: 1: Hoare triple {8307#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8307#true} is VALID [2018-11-23 11:55:52,108 INFO L273 TraceCheckUtils]: 2: Hoare triple {8307#true} assume true; {8307#true} is VALID [2018-11-23 11:55:52,108 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8307#true} {8307#true} #120#return; {8307#true} is VALID [2018-11-23 11:55:52,108 INFO L256 TraceCheckUtils]: 4: Hoare triple {8307#true} call #t~ret15 := main(); {8307#true} is VALID [2018-11-23 11:55:52,109 INFO L273 TraceCheckUtils]: 5: Hoare triple {8307#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {8307#true} is VALID [2018-11-23 11:55:52,109 INFO L273 TraceCheckUtils]: 6: Hoare triple {8307#true} assume !(~x~0 < ~n~0); {8307#true} is VALID [2018-11-23 11:55:52,109 INFO L273 TraceCheckUtils]: 7: Hoare triple {8307#true} call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(400000);havoc ~v~0;~v~0 := 0; {8342#(<= main_~v~0 0)} is VALID [2018-11-23 11:55:52,110 INFO L273 TraceCheckUtils]: 8: Hoare triple {8342#(<= main_~v~0 0)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {8342#(<= main_~v~0 0)} is VALID [2018-11-23 11:55:52,110 INFO L256 TraceCheckUtils]: 9: Hoare triple {8342#(<= main_~v~0 0)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {8307#true} is VALID [2018-11-23 11:55:52,110 INFO L273 TraceCheckUtils]: 10: Hoare triple {8307#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {8307#true} is VALID [2018-11-23 11:55:52,110 INFO L273 TraceCheckUtils]: 11: Hoare triple {8307#true} assume !(~i~0 < ~size); {8307#true} is VALID [2018-11-23 11:55:52,110 INFO L273 TraceCheckUtils]: 12: Hoare triple {8307#true} #res := 0; {8307#true} is VALID [2018-11-23 11:55:52,110 INFO L273 TraceCheckUtils]: 13: Hoare triple {8307#true} assume true; {8307#true} is VALID [2018-11-23 11:55:52,111 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {8307#true} {8342#(<= main_~v~0 0)} #126#return; {8342#(<= main_~v~0 0)} is VALID [2018-11-23 11:55:52,112 INFO L273 TraceCheckUtils]: 15: Hoare triple {8342#(<= main_~v~0 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {8342#(<= main_~v~0 0)} is VALID [2018-11-23 11:55:52,112 INFO L273 TraceCheckUtils]: 16: Hoare triple {8342#(<= main_~v~0 0)} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {8342#(<= main_~v~0 0)} is VALID [2018-11-23 11:55:52,112 INFO L256 TraceCheckUtils]: 17: Hoare triple {8342#(<= main_~v~0 0)} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {8307#true} is VALID [2018-11-23 11:55:52,112 INFO L273 TraceCheckUtils]: 18: Hoare triple {8307#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; {8307#true} is VALID [2018-11-23 11:55:52,112 INFO L273 TraceCheckUtils]: 19: Hoare triple {8307#true} assume true; {8307#true} is VALID [2018-11-23 11:55:52,113 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {8307#true} {8342#(<= main_~v~0 0)} #128#return; {8342#(<= main_~v~0 0)} is VALID [2018-11-23 11:55:52,113 INFO L273 TraceCheckUtils]: 21: Hoare triple {8342#(<= main_~v~0 0)} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~mem9;havoc #t~ret10; {8342#(<= main_~v~0 0)} is VALID [2018-11-23 11:55:52,114 INFO L273 TraceCheckUtils]: 22: Hoare triple {8342#(<= main_~v~0 0)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {8310#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:52,114 INFO L273 TraceCheckUtils]: 23: Hoare triple {8310#(<= main_~v~0 1)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {8310#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:52,115 INFO L256 TraceCheckUtils]: 24: Hoare triple {8310#(<= main_~v~0 1)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {8307#true} is VALID [2018-11-23 11:55:52,115 INFO L273 TraceCheckUtils]: 25: Hoare triple {8307#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {8307#true} is VALID [2018-11-23 11:55:52,115 INFO L273 TraceCheckUtils]: 26: Hoare triple {8307#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {8307#true} is VALID [2018-11-23 11:55:52,115 INFO L273 TraceCheckUtils]: 27: Hoare triple {8307#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {8307#true} is VALID [2018-11-23 11:55:52,115 INFO L273 TraceCheckUtils]: 28: Hoare triple {8307#true} assume true; {8307#true} is VALID [2018-11-23 11:55:52,117 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {8307#true} {8310#(<= main_~v~0 1)} #126#return; {8310#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:52,117 INFO L273 TraceCheckUtils]: 30: Hoare triple {8310#(<= main_~v~0 1)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {8310#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:52,117 INFO L273 TraceCheckUtils]: 31: Hoare triple {8310#(<= main_~v~0 1)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {8310#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:52,118 INFO L273 TraceCheckUtils]: 32: Hoare triple {8310#(<= main_~v~0 1)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {8311#(<= main_~v~0 2)} is VALID [2018-11-23 11:55:52,118 INFO L273 TraceCheckUtils]: 33: Hoare triple {8311#(<= main_~v~0 2)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {8311#(<= main_~v~0 2)} is VALID [2018-11-23 11:55:52,118 INFO L256 TraceCheckUtils]: 34: Hoare triple {8311#(<= main_~v~0 2)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {8307#true} is VALID [2018-11-23 11:55:52,119 INFO L273 TraceCheckUtils]: 35: Hoare triple {8307#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {8307#true} is VALID [2018-11-23 11:55:52,119 INFO L273 TraceCheckUtils]: 36: Hoare triple {8307#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {8307#true} is VALID [2018-11-23 11:55:52,119 INFO L273 TraceCheckUtils]: 37: Hoare triple {8307#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {8307#true} is VALID [2018-11-23 11:55:52,119 INFO L273 TraceCheckUtils]: 38: Hoare triple {8307#true} assume true; {8307#true} is VALID [2018-11-23 11:55:52,120 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {8307#true} {8311#(<= main_~v~0 2)} #126#return; {8311#(<= main_~v~0 2)} is VALID [2018-11-23 11:55:52,120 INFO L273 TraceCheckUtils]: 40: Hoare triple {8311#(<= main_~v~0 2)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {8311#(<= main_~v~0 2)} is VALID [2018-11-23 11:55:52,120 INFO L273 TraceCheckUtils]: 41: Hoare triple {8311#(<= main_~v~0 2)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {8311#(<= main_~v~0 2)} is VALID [2018-11-23 11:55:52,121 INFO L273 TraceCheckUtils]: 42: Hoare triple {8311#(<= main_~v~0 2)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {8312#(<= main_~v~0 3)} is VALID [2018-11-23 11:55:52,122 INFO L273 TraceCheckUtils]: 43: Hoare triple {8312#(<= main_~v~0 3)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {8312#(<= main_~v~0 3)} is VALID [2018-11-23 11:55:52,122 INFO L256 TraceCheckUtils]: 44: Hoare triple {8312#(<= main_~v~0 3)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {8307#true} is VALID [2018-11-23 11:55:52,122 INFO L273 TraceCheckUtils]: 45: Hoare triple {8307#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {8307#true} is VALID [2018-11-23 11:55:52,122 INFO L273 TraceCheckUtils]: 46: Hoare triple {8307#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {8307#true} is VALID [2018-11-23 11:55:52,123 INFO L273 TraceCheckUtils]: 47: Hoare triple {8307#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {8307#true} is VALID [2018-11-23 11:55:52,123 INFO L273 TraceCheckUtils]: 48: Hoare triple {8307#true} assume true; {8307#true} is VALID [2018-11-23 11:55:52,124 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {8307#true} {8312#(<= main_~v~0 3)} #126#return; {8312#(<= main_~v~0 3)} is VALID [2018-11-23 11:55:52,125 INFO L273 TraceCheckUtils]: 50: Hoare triple {8312#(<= main_~v~0 3)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {8312#(<= main_~v~0 3)} is VALID [2018-11-23 11:55:52,125 INFO L273 TraceCheckUtils]: 51: Hoare triple {8312#(<= main_~v~0 3)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {8312#(<= main_~v~0 3)} is VALID [2018-11-23 11:55:52,126 INFO L273 TraceCheckUtils]: 52: Hoare triple {8312#(<= main_~v~0 3)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {8313#(<= main_~v~0 4)} is VALID [2018-11-23 11:55:52,126 INFO L273 TraceCheckUtils]: 53: Hoare triple {8313#(<= main_~v~0 4)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {8313#(<= main_~v~0 4)} is VALID [2018-11-23 11:55:52,127 INFO L256 TraceCheckUtils]: 54: Hoare triple {8313#(<= main_~v~0 4)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {8307#true} is VALID [2018-11-23 11:55:52,127 INFO L273 TraceCheckUtils]: 55: Hoare triple {8307#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {8307#true} is VALID [2018-11-23 11:55:52,127 INFO L273 TraceCheckUtils]: 56: Hoare triple {8307#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {8307#true} is VALID [2018-11-23 11:55:52,127 INFO L273 TraceCheckUtils]: 57: Hoare triple {8307#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {8307#true} is VALID [2018-11-23 11:55:52,128 INFO L273 TraceCheckUtils]: 58: Hoare triple {8307#true} assume true; {8307#true} is VALID [2018-11-23 11:55:52,129 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {8307#true} {8313#(<= main_~v~0 4)} #126#return; {8313#(<= main_~v~0 4)} is VALID [2018-11-23 11:55:52,129 INFO L273 TraceCheckUtils]: 60: Hoare triple {8313#(<= main_~v~0 4)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {8313#(<= main_~v~0 4)} is VALID [2018-11-23 11:55:52,130 INFO L273 TraceCheckUtils]: 61: Hoare triple {8313#(<= main_~v~0 4)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {8313#(<= main_~v~0 4)} is VALID [2018-11-23 11:55:52,131 INFO L273 TraceCheckUtils]: 62: Hoare triple {8313#(<= main_~v~0 4)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {8314#(<= main_~v~0 5)} is VALID [2018-11-23 11:55:52,131 INFO L273 TraceCheckUtils]: 63: Hoare triple {8314#(<= main_~v~0 5)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {8314#(<= main_~v~0 5)} is VALID [2018-11-23 11:55:52,131 INFO L256 TraceCheckUtils]: 64: Hoare triple {8314#(<= main_~v~0 5)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {8307#true} is VALID [2018-11-23 11:55:52,132 INFO L273 TraceCheckUtils]: 65: Hoare triple {8307#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {8307#true} is VALID [2018-11-23 11:55:52,132 INFO L273 TraceCheckUtils]: 66: Hoare triple {8307#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {8307#true} is VALID [2018-11-23 11:55:52,132 INFO L273 TraceCheckUtils]: 67: Hoare triple {8307#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {8307#true} is VALID [2018-11-23 11:55:52,132 INFO L273 TraceCheckUtils]: 68: Hoare triple {8307#true} assume true; {8307#true} is VALID [2018-11-23 11:55:52,133 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {8307#true} {8314#(<= main_~v~0 5)} #126#return; {8314#(<= main_~v~0 5)} is VALID [2018-11-23 11:55:52,134 INFO L273 TraceCheckUtils]: 70: Hoare triple {8314#(<= main_~v~0 5)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {8314#(<= main_~v~0 5)} is VALID [2018-11-23 11:55:52,134 INFO L273 TraceCheckUtils]: 71: Hoare triple {8314#(<= main_~v~0 5)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {8314#(<= main_~v~0 5)} is VALID [2018-11-23 11:55:52,135 INFO L273 TraceCheckUtils]: 72: Hoare triple {8314#(<= main_~v~0 5)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {8315#(<= main_~v~0 6)} is VALID [2018-11-23 11:55:52,135 INFO L273 TraceCheckUtils]: 73: Hoare triple {8315#(<= main_~v~0 6)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {8315#(<= main_~v~0 6)} is VALID [2018-11-23 11:55:52,135 INFO L256 TraceCheckUtils]: 74: Hoare triple {8315#(<= main_~v~0 6)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {8307#true} is VALID [2018-11-23 11:55:52,135 INFO L273 TraceCheckUtils]: 75: Hoare triple {8307#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {8307#true} is VALID [2018-11-23 11:55:52,135 INFO L273 TraceCheckUtils]: 76: Hoare triple {8307#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {8307#true} is VALID [2018-11-23 11:55:52,136 INFO L273 TraceCheckUtils]: 77: Hoare triple {8307#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {8307#true} is VALID [2018-11-23 11:55:52,136 INFO L273 TraceCheckUtils]: 78: Hoare triple {8307#true} assume true; {8307#true} is VALID [2018-11-23 11:55:52,137 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {8307#true} {8315#(<= main_~v~0 6)} #126#return; {8315#(<= main_~v~0 6)} is VALID [2018-11-23 11:55:52,137 INFO L273 TraceCheckUtils]: 80: Hoare triple {8315#(<= main_~v~0 6)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {8315#(<= main_~v~0 6)} is VALID [2018-11-23 11:55:52,138 INFO L273 TraceCheckUtils]: 81: Hoare triple {8315#(<= main_~v~0 6)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {8315#(<= main_~v~0 6)} is VALID [2018-11-23 11:55:52,138 INFO L273 TraceCheckUtils]: 82: Hoare triple {8315#(<= main_~v~0 6)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {8316#(<= main_~v~0 7)} is VALID [2018-11-23 11:55:52,139 INFO L273 TraceCheckUtils]: 83: Hoare triple {8316#(<= main_~v~0 7)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {8316#(<= main_~v~0 7)} is VALID [2018-11-23 11:55:52,139 INFO L256 TraceCheckUtils]: 84: Hoare triple {8316#(<= main_~v~0 7)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {8307#true} is VALID [2018-11-23 11:55:52,139 INFO L273 TraceCheckUtils]: 85: Hoare triple {8307#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {8307#true} is VALID [2018-11-23 11:55:52,140 INFO L273 TraceCheckUtils]: 86: Hoare triple {8307#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {8307#true} is VALID [2018-11-23 11:55:52,140 INFO L273 TraceCheckUtils]: 87: Hoare triple {8307#true} assume !(#t~mem1 == ~value);havoc #t~mem1; {8307#true} is VALID [2018-11-23 11:55:52,140 INFO L273 TraceCheckUtils]: 88: Hoare triple {8307#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8307#true} is VALID [2018-11-23 11:55:52,140 INFO L273 TraceCheckUtils]: 89: Hoare triple {8307#true} assume !(~i~0 < ~size); {8307#true} is VALID [2018-11-23 11:55:52,141 INFO L273 TraceCheckUtils]: 90: Hoare triple {8307#true} #res := 0; {8307#true} is VALID [2018-11-23 11:55:52,141 INFO L273 TraceCheckUtils]: 91: Hoare triple {8307#true} assume true; {8307#true} is VALID [2018-11-23 11:55:52,159 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {8307#true} {8316#(<= main_~v~0 7)} #126#return; {8316#(<= main_~v~0 7)} is VALID [2018-11-23 11:55:52,161 INFO L273 TraceCheckUtils]: 93: Hoare triple {8316#(<= main_~v~0 7)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {8316#(<= main_~v~0 7)} is VALID [2018-11-23 11:55:52,161 INFO L273 TraceCheckUtils]: 94: Hoare triple {8316#(<= main_~v~0 7)} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {8316#(<= main_~v~0 7)} is VALID [2018-11-23 11:55:52,161 INFO L256 TraceCheckUtils]: 95: Hoare triple {8316#(<= main_~v~0 7)} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {8307#true} is VALID [2018-11-23 11:55:52,161 INFO L273 TraceCheckUtils]: 96: Hoare triple {8307#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; {8307#true} is VALID [2018-11-23 11:55:52,161 INFO L273 TraceCheckUtils]: 97: Hoare triple {8307#true} assume true; {8307#true} is VALID [2018-11-23 11:55:52,164 INFO L268 TraceCheckUtils]: 98: Hoare quadruple {8307#true} {8316#(<= main_~v~0 7)} #128#return; {8316#(<= main_~v~0 7)} is VALID [2018-11-23 11:55:52,164 INFO L273 TraceCheckUtils]: 99: Hoare triple {8316#(<= main_~v~0 7)} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~mem9;havoc #t~ret10; {8316#(<= main_~v~0 7)} is VALID [2018-11-23 11:55:52,166 INFO L273 TraceCheckUtils]: 100: Hoare triple {8316#(<= main_~v~0 7)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {8317#(<= main_~v~0 8)} is VALID [2018-11-23 11:55:52,166 INFO L273 TraceCheckUtils]: 101: Hoare triple {8317#(<= main_~v~0 8)} assume !(~v~0 < 100000); {8308#false} is VALID [2018-11-23 11:55:52,166 INFO L273 TraceCheckUtils]: 102: Hoare triple {8308#false} ~x~0 := 0; {8308#false} is VALID [2018-11-23 11:55:52,167 INFO L273 TraceCheckUtils]: 103: Hoare triple {8308#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {8308#false} is VALID [2018-11-23 11:55:52,167 INFO L273 TraceCheckUtils]: 104: Hoare triple {8308#false} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {8308#false} is VALID [2018-11-23 11:55:52,167 INFO L256 TraceCheckUtils]: 105: Hoare triple {8308#false} call __VERIFIER_assert((if #t~mem13 != #t~mem14 then 1 else 0)); {8308#false} is VALID [2018-11-23 11:55:52,167 INFO L273 TraceCheckUtils]: 106: Hoare triple {8308#false} ~cond := #in~cond; {8308#false} is VALID [2018-11-23 11:55:52,167 INFO L273 TraceCheckUtils]: 107: Hoare triple {8308#false} assume 0 == ~cond; {8308#false} is VALID [2018-11-23 11:55:52,167 INFO L273 TraceCheckUtils]: 108: Hoare triple {8308#false} assume !false; {8308#false} is VALID [2018-11-23 11:55:52,173 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-23 11:55:52,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:52,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 11:55:52,193 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 109 [2018-11-23 11:55:52,193 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:52,193 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:55:52,274 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:52,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:55:52,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:55:52,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:55:52,276 INFO L87 Difference]: Start difference. First operand 190 states and 252 transitions. Second operand 12 states. [2018-11-23 11:55:53,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:53,564 INFO L93 Difference]: Finished difference Result 263 states and 349 transitions. [2018-11-23 11:55:53,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:55:53,565 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 109 [2018-11-23 11:55:53,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:53,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:55:53,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 148 transitions. [2018-11-23 11:55:53,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:55:53,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 148 transitions. [2018-11-23 11:55:53,570 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 148 transitions. [2018-11-23 11:55:54,128 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:54,136 INFO L225 Difference]: With dead ends: 263 [2018-11-23 11:55:54,136 INFO L226 Difference]: Without dead ends: 250 [2018-11-23 11:55:54,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:55:54,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-11-23 11:55:55,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 213. [2018-11-23 11:55:55,123 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:55,123 INFO L82 GeneralOperation]: Start isEquivalent. First operand 250 states. Second operand 213 states. [2018-11-23 11:55:55,123 INFO L74 IsIncluded]: Start isIncluded. First operand 250 states. Second operand 213 states. [2018-11-23 11:55:55,123 INFO L87 Difference]: Start difference. First operand 250 states. Second operand 213 states. [2018-11-23 11:55:55,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:55,135 INFO L93 Difference]: Finished difference Result 250 states and 334 transitions. [2018-11-23 11:55:55,135 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 334 transitions. [2018-11-23 11:55:55,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:55,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:55,137 INFO L74 IsIncluded]: Start isIncluded. First operand 213 states. Second operand 250 states. [2018-11-23 11:55:55,137 INFO L87 Difference]: Start difference. First operand 213 states. Second operand 250 states. [2018-11-23 11:55:55,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:55,148 INFO L93 Difference]: Finished difference Result 250 states and 334 transitions. [2018-11-23 11:55:55,149 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 334 transitions. [2018-11-23 11:55:55,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:55,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:55,150 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:55,151 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:55,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-11-23 11:55:55,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 284 transitions. [2018-11-23 11:55:55,159 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 284 transitions. Word has length 109 [2018-11-23 11:55:55,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:55,160 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 284 transitions. [2018-11-23 11:55:55,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:55:55,160 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 284 transitions. [2018-11-23 11:55:55,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-23 11:55:55,162 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:55,162 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 7, 7, 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] [2018-11-23 11:55:55,163 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:55,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:55,163 INFO L82 PathProgramCache]: Analyzing trace with hash 587996184, now seen corresponding path program 3 times [2018-11-23 11:55:55,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:55,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:55,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:55,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:55,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:55,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:55,465 INFO L256 TraceCheckUtils]: 0: Hoare triple {9787#true} call ULTIMATE.init(); {9787#true} is VALID [2018-11-23 11:55:55,466 INFO L273 TraceCheckUtils]: 1: Hoare triple {9787#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9787#true} is VALID [2018-11-23 11:55:55,466 INFO L273 TraceCheckUtils]: 2: Hoare triple {9787#true} assume true; {9787#true} is VALID [2018-11-23 11:55:55,466 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9787#true} {9787#true} #120#return; {9787#true} is VALID [2018-11-23 11:55:55,467 INFO L256 TraceCheckUtils]: 4: Hoare triple {9787#true} call #t~ret15 := main(); {9787#true} is VALID [2018-11-23 11:55:55,467 INFO L273 TraceCheckUtils]: 5: Hoare triple {9787#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {9787#true} is VALID [2018-11-23 11:55:55,467 INFO L273 TraceCheckUtils]: 6: Hoare triple {9787#true} assume !(~x~0 < ~n~0); {9787#true} is VALID [2018-11-23 11:55:55,467 INFO L273 TraceCheckUtils]: 7: Hoare triple {9787#true} call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(400000);havoc ~v~0;~v~0 := 0; {9789#(= main_~v~0 0)} is VALID [2018-11-23 11:55:55,468 INFO L273 TraceCheckUtils]: 8: Hoare triple {9789#(= main_~v~0 0)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {9789#(= main_~v~0 0)} is VALID [2018-11-23 11:55:55,468 INFO L256 TraceCheckUtils]: 9: Hoare triple {9789#(= main_~v~0 0)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {9787#true} is VALID [2018-11-23 11:55:55,468 INFO L273 TraceCheckUtils]: 10: Hoare triple {9787#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {9787#true} is VALID [2018-11-23 11:55:55,468 INFO L273 TraceCheckUtils]: 11: Hoare triple {9787#true} assume !(~i~0 < ~size); {9787#true} is VALID [2018-11-23 11:55:55,468 INFO L273 TraceCheckUtils]: 12: Hoare triple {9787#true} #res := 0; {9787#true} is VALID [2018-11-23 11:55:55,468 INFO L273 TraceCheckUtils]: 13: Hoare triple {9787#true} assume true; {9787#true} is VALID [2018-11-23 11:55:55,470 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {9787#true} {9789#(= main_~v~0 0)} #126#return; {9789#(= main_~v~0 0)} is VALID [2018-11-23 11:55:55,470 INFO L273 TraceCheckUtils]: 15: Hoare triple {9789#(= main_~v~0 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {9789#(= main_~v~0 0)} is VALID [2018-11-23 11:55:55,470 INFO L273 TraceCheckUtils]: 16: Hoare triple {9789#(= main_~v~0 0)} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {9789#(= main_~v~0 0)} is VALID [2018-11-23 11:55:55,470 INFO L256 TraceCheckUtils]: 17: Hoare triple {9789#(= main_~v~0 0)} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {9787#true} is VALID [2018-11-23 11:55:55,471 INFO L273 TraceCheckUtils]: 18: Hoare triple {9787#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; {9787#true} is VALID [2018-11-23 11:55:55,471 INFO L273 TraceCheckUtils]: 19: Hoare triple {9787#true} assume true; {9787#true} is VALID [2018-11-23 11:55:55,472 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {9787#true} {9789#(= main_~v~0 0)} #128#return; {9789#(= main_~v~0 0)} is VALID [2018-11-23 11:55:55,472 INFO L273 TraceCheckUtils]: 21: Hoare triple {9789#(= main_~v~0 0)} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~mem9;havoc #t~ret10; {9789#(= main_~v~0 0)} is VALID [2018-11-23 11:55:55,473 INFO L273 TraceCheckUtils]: 22: Hoare triple {9789#(= main_~v~0 0)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {9790#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:55,473 INFO L273 TraceCheckUtils]: 23: Hoare triple {9790#(<= main_~v~0 1)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {9790#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:55,474 INFO L256 TraceCheckUtils]: 24: Hoare triple {9790#(<= main_~v~0 1)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {9787#true} is VALID [2018-11-23 11:55:55,474 INFO L273 TraceCheckUtils]: 25: Hoare triple {9787#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {9787#true} is VALID [2018-11-23 11:55:55,474 INFO L273 TraceCheckUtils]: 26: Hoare triple {9787#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {9787#true} is VALID [2018-11-23 11:55:55,474 INFO L273 TraceCheckUtils]: 27: Hoare triple {9787#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {9787#true} is VALID [2018-11-23 11:55:55,474 INFO L273 TraceCheckUtils]: 28: Hoare triple {9787#true} assume true; {9787#true} is VALID [2018-11-23 11:55:55,476 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {9787#true} {9790#(<= main_~v~0 1)} #126#return; {9790#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:55,477 INFO L273 TraceCheckUtils]: 30: Hoare triple {9790#(<= main_~v~0 1)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {9790#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:55,477 INFO L273 TraceCheckUtils]: 31: Hoare triple {9790#(<= main_~v~0 1)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {9790#(<= main_~v~0 1)} is VALID [2018-11-23 11:55:55,477 INFO L273 TraceCheckUtils]: 32: Hoare triple {9790#(<= main_~v~0 1)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {9791#(<= main_~v~0 2)} is VALID [2018-11-23 11:55:55,478 INFO L273 TraceCheckUtils]: 33: Hoare triple {9791#(<= main_~v~0 2)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {9791#(<= main_~v~0 2)} is VALID [2018-11-23 11:55:55,478 INFO L256 TraceCheckUtils]: 34: Hoare triple {9791#(<= main_~v~0 2)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {9787#true} is VALID [2018-11-23 11:55:55,478 INFO L273 TraceCheckUtils]: 35: Hoare triple {9787#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {9787#true} is VALID [2018-11-23 11:55:55,478 INFO L273 TraceCheckUtils]: 36: Hoare triple {9787#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {9787#true} is VALID [2018-11-23 11:55:55,478 INFO L273 TraceCheckUtils]: 37: Hoare triple {9787#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {9787#true} is VALID [2018-11-23 11:55:55,478 INFO L273 TraceCheckUtils]: 38: Hoare triple {9787#true} assume true; {9787#true} is VALID [2018-11-23 11:55:55,480 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {9787#true} {9791#(<= main_~v~0 2)} #126#return; {9791#(<= main_~v~0 2)} is VALID [2018-11-23 11:55:55,481 INFO L273 TraceCheckUtils]: 40: Hoare triple {9791#(<= main_~v~0 2)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {9791#(<= main_~v~0 2)} is VALID [2018-11-23 11:55:55,481 INFO L273 TraceCheckUtils]: 41: Hoare triple {9791#(<= main_~v~0 2)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {9791#(<= main_~v~0 2)} is VALID [2018-11-23 11:55:55,482 INFO L273 TraceCheckUtils]: 42: Hoare triple {9791#(<= main_~v~0 2)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {9792#(<= main_~v~0 3)} is VALID [2018-11-23 11:55:55,483 INFO L273 TraceCheckUtils]: 43: Hoare triple {9792#(<= main_~v~0 3)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {9792#(<= main_~v~0 3)} is VALID [2018-11-23 11:55:55,483 INFO L256 TraceCheckUtils]: 44: Hoare triple {9792#(<= main_~v~0 3)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {9787#true} is VALID [2018-11-23 11:55:55,483 INFO L273 TraceCheckUtils]: 45: Hoare triple {9787#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {9787#true} is VALID [2018-11-23 11:55:55,483 INFO L273 TraceCheckUtils]: 46: Hoare triple {9787#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {9787#true} is VALID [2018-11-23 11:55:55,484 INFO L273 TraceCheckUtils]: 47: Hoare triple {9787#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {9787#true} is VALID [2018-11-23 11:55:55,484 INFO L273 TraceCheckUtils]: 48: Hoare triple {9787#true} assume true; {9787#true} is VALID [2018-11-23 11:55:55,485 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {9787#true} {9792#(<= main_~v~0 3)} #126#return; {9792#(<= main_~v~0 3)} is VALID [2018-11-23 11:55:55,486 INFO L273 TraceCheckUtils]: 50: Hoare triple {9792#(<= main_~v~0 3)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {9792#(<= main_~v~0 3)} is VALID [2018-11-23 11:55:55,487 INFO L273 TraceCheckUtils]: 51: Hoare triple {9792#(<= main_~v~0 3)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {9792#(<= main_~v~0 3)} is VALID [2018-11-23 11:55:55,487 INFO L273 TraceCheckUtils]: 52: Hoare triple {9792#(<= main_~v~0 3)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {9793#(<= main_~v~0 4)} is VALID [2018-11-23 11:55:55,488 INFO L273 TraceCheckUtils]: 53: Hoare triple {9793#(<= main_~v~0 4)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {9793#(<= main_~v~0 4)} is VALID [2018-11-23 11:55:55,488 INFO L256 TraceCheckUtils]: 54: Hoare triple {9793#(<= main_~v~0 4)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {9787#true} is VALID [2018-11-23 11:55:55,488 INFO L273 TraceCheckUtils]: 55: Hoare triple {9787#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {9787#true} is VALID [2018-11-23 11:55:55,489 INFO L273 TraceCheckUtils]: 56: Hoare triple {9787#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {9787#true} is VALID [2018-11-23 11:55:55,489 INFO L273 TraceCheckUtils]: 57: Hoare triple {9787#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {9787#true} is VALID [2018-11-23 11:55:55,489 INFO L273 TraceCheckUtils]: 58: Hoare triple {9787#true} assume true; {9787#true} is VALID [2018-11-23 11:55:55,491 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {9787#true} {9793#(<= main_~v~0 4)} #126#return; {9793#(<= main_~v~0 4)} is VALID [2018-11-23 11:55:55,491 INFO L273 TraceCheckUtils]: 60: Hoare triple {9793#(<= main_~v~0 4)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {9793#(<= main_~v~0 4)} is VALID [2018-11-23 11:55:55,492 INFO L273 TraceCheckUtils]: 61: Hoare triple {9793#(<= main_~v~0 4)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {9793#(<= main_~v~0 4)} is VALID [2018-11-23 11:55:55,492 INFO L273 TraceCheckUtils]: 62: Hoare triple {9793#(<= main_~v~0 4)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {9794#(<= main_~v~0 5)} is VALID [2018-11-23 11:55:55,493 INFO L273 TraceCheckUtils]: 63: Hoare triple {9794#(<= main_~v~0 5)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {9794#(<= main_~v~0 5)} is VALID [2018-11-23 11:55:55,493 INFO L256 TraceCheckUtils]: 64: Hoare triple {9794#(<= main_~v~0 5)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {9787#true} is VALID [2018-11-23 11:55:55,493 INFO L273 TraceCheckUtils]: 65: Hoare triple {9787#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {9787#true} is VALID [2018-11-23 11:55:55,493 INFO L273 TraceCheckUtils]: 66: Hoare triple {9787#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {9787#true} is VALID [2018-11-23 11:55:55,493 INFO L273 TraceCheckUtils]: 67: Hoare triple {9787#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {9787#true} is VALID [2018-11-23 11:55:55,493 INFO L273 TraceCheckUtils]: 68: Hoare triple {9787#true} assume true; {9787#true} is VALID [2018-11-23 11:55:55,494 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {9787#true} {9794#(<= main_~v~0 5)} #126#return; {9794#(<= main_~v~0 5)} is VALID [2018-11-23 11:55:55,495 INFO L273 TraceCheckUtils]: 70: Hoare triple {9794#(<= main_~v~0 5)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {9794#(<= main_~v~0 5)} is VALID [2018-11-23 11:55:55,495 INFO L273 TraceCheckUtils]: 71: Hoare triple {9794#(<= main_~v~0 5)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {9794#(<= main_~v~0 5)} is VALID [2018-11-23 11:55:55,496 INFO L273 TraceCheckUtils]: 72: Hoare triple {9794#(<= main_~v~0 5)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {9795#(<= main_~v~0 6)} is VALID [2018-11-23 11:55:55,497 INFO L273 TraceCheckUtils]: 73: Hoare triple {9795#(<= main_~v~0 6)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {9795#(<= main_~v~0 6)} is VALID [2018-11-23 11:55:55,497 INFO L256 TraceCheckUtils]: 74: Hoare triple {9795#(<= main_~v~0 6)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {9787#true} is VALID [2018-11-23 11:55:55,497 INFO L273 TraceCheckUtils]: 75: Hoare triple {9787#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {9787#true} is VALID [2018-11-23 11:55:55,497 INFO L273 TraceCheckUtils]: 76: Hoare triple {9787#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {9787#true} is VALID [2018-11-23 11:55:55,498 INFO L273 TraceCheckUtils]: 77: Hoare triple {9787#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {9787#true} is VALID [2018-11-23 11:55:55,498 INFO L273 TraceCheckUtils]: 78: Hoare triple {9787#true} assume true; {9787#true} is VALID [2018-11-23 11:55:55,500 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {9787#true} {9795#(<= main_~v~0 6)} #126#return; {9795#(<= main_~v~0 6)} is VALID [2018-11-23 11:55:55,500 INFO L273 TraceCheckUtils]: 80: Hoare triple {9795#(<= main_~v~0 6)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {9795#(<= main_~v~0 6)} is VALID [2018-11-23 11:55:55,501 INFO L273 TraceCheckUtils]: 81: Hoare triple {9795#(<= main_~v~0 6)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {9795#(<= main_~v~0 6)} is VALID [2018-11-23 11:55:55,502 INFO L273 TraceCheckUtils]: 82: Hoare triple {9795#(<= main_~v~0 6)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {9796#(<= main_~v~0 7)} is VALID [2018-11-23 11:55:55,502 INFO L273 TraceCheckUtils]: 83: Hoare triple {9796#(<= main_~v~0 7)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {9796#(<= main_~v~0 7)} is VALID [2018-11-23 11:55:55,502 INFO L256 TraceCheckUtils]: 84: Hoare triple {9796#(<= main_~v~0 7)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {9787#true} is VALID [2018-11-23 11:55:55,502 INFO L273 TraceCheckUtils]: 85: Hoare triple {9787#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {9787#true} is VALID [2018-11-23 11:55:55,502 INFO L273 TraceCheckUtils]: 86: Hoare triple {9787#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {9787#true} is VALID [2018-11-23 11:55:55,502 INFO L273 TraceCheckUtils]: 87: Hoare triple {9787#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {9787#true} is VALID [2018-11-23 11:55:55,503 INFO L273 TraceCheckUtils]: 88: Hoare triple {9787#true} assume true; {9787#true} is VALID [2018-11-23 11:55:55,504 INFO L268 TraceCheckUtils]: 89: Hoare quadruple {9787#true} {9796#(<= main_~v~0 7)} #126#return; {9796#(<= main_~v~0 7)} is VALID [2018-11-23 11:55:55,504 INFO L273 TraceCheckUtils]: 90: Hoare triple {9796#(<= main_~v~0 7)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {9796#(<= main_~v~0 7)} is VALID [2018-11-23 11:55:55,504 INFO L273 TraceCheckUtils]: 91: Hoare triple {9796#(<= main_~v~0 7)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {9796#(<= main_~v~0 7)} is VALID [2018-11-23 11:55:55,505 INFO L273 TraceCheckUtils]: 92: Hoare triple {9796#(<= main_~v~0 7)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {9797#(<= main_~v~0 8)} is VALID [2018-11-23 11:55:55,505 INFO L273 TraceCheckUtils]: 93: Hoare triple {9797#(<= main_~v~0 8)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {9797#(<= main_~v~0 8)} is VALID [2018-11-23 11:55:55,505 INFO L256 TraceCheckUtils]: 94: Hoare triple {9797#(<= main_~v~0 8)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {9787#true} is VALID [2018-11-23 11:55:55,505 INFO L273 TraceCheckUtils]: 95: Hoare triple {9787#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {9787#true} is VALID [2018-11-23 11:55:55,506 INFO L273 TraceCheckUtils]: 96: Hoare triple {9787#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {9787#true} is VALID [2018-11-23 11:55:55,506 INFO L273 TraceCheckUtils]: 97: Hoare triple {9787#true} assume !(#t~mem1 == ~value);havoc #t~mem1; {9787#true} is VALID [2018-11-23 11:55:55,506 INFO L273 TraceCheckUtils]: 98: Hoare triple {9787#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9787#true} is VALID [2018-11-23 11:55:55,506 INFO L273 TraceCheckUtils]: 99: Hoare triple {9787#true} assume !(~i~0 < ~size); {9787#true} is VALID [2018-11-23 11:55:55,506 INFO L273 TraceCheckUtils]: 100: Hoare triple {9787#true} #res := 0; {9787#true} is VALID [2018-11-23 11:55:55,506 INFO L273 TraceCheckUtils]: 101: Hoare triple {9787#true} assume true; {9787#true} is VALID [2018-11-23 11:55:55,507 INFO L268 TraceCheckUtils]: 102: Hoare quadruple {9787#true} {9797#(<= main_~v~0 8)} #126#return; {9797#(<= main_~v~0 8)} is VALID [2018-11-23 11:55:55,508 INFO L273 TraceCheckUtils]: 103: Hoare triple {9797#(<= main_~v~0 8)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {9797#(<= main_~v~0 8)} is VALID [2018-11-23 11:55:55,508 INFO L273 TraceCheckUtils]: 104: Hoare triple {9797#(<= main_~v~0 8)} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {9797#(<= main_~v~0 8)} is VALID [2018-11-23 11:55:55,508 INFO L256 TraceCheckUtils]: 105: Hoare triple {9797#(<= main_~v~0 8)} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {9787#true} is VALID [2018-11-23 11:55:55,508 INFO L273 TraceCheckUtils]: 106: Hoare triple {9787#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; {9787#true} is VALID [2018-11-23 11:55:55,508 INFO L273 TraceCheckUtils]: 107: Hoare triple {9787#true} assume true; {9787#true} is VALID [2018-11-23 11:55:55,510 INFO L268 TraceCheckUtils]: 108: Hoare quadruple {9787#true} {9797#(<= main_~v~0 8)} #128#return; {9797#(<= main_~v~0 8)} is VALID [2018-11-23 11:55:55,510 INFO L273 TraceCheckUtils]: 109: Hoare triple {9797#(<= main_~v~0 8)} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~mem9;havoc #t~ret10; {9797#(<= main_~v~0 8)} is VALID [2018-11-23 11:55:55,511 INFO L273 TraceCheckUtils]: 110: Hoare triple {9797#(<= main_~v~0 8)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {9798#(<= main_~v~0 9)} is VALID [2018-11-23 11:55:55,512 INFO L273 TraceCheckUtils]: 111: Hoare triple {9798#(<= main_~v~0 9)} assume !(~v~0 < 100000); {9788#false} is VALID [2018-11-23 11:55:55,512 INFO L273 TraceCheckUtils]: 112: Hoare triple {9788#false} ~x~0 := 0; {9788#false} is VALID [2018-11-23 11:55:55,512 INFO L273 TraceCheckUtils]: 113: Hoare triple {9788#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {9788#false} is VALID [2018-11-23 11:55:55,513 INFO L273 TraceCheckUtils]: 114: Hoare triple {9788#false} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {9788#false} is VALID [2018-11-23 11:55:55,513 INFO L256 TraceCheckUtils]: 115: Hoare triple {9788#false} call __VERIFIER_assert((if #t~mem13 != #t~mem14 then 1 else 0)); {9788#false} is VALID [2018-11-23 11:55:55,513 INFO L273 TraceCheckUtils]: 116: Hoare triple {9788#false} ~cond := #in~cond; {9788#false} is VALID [2018-11-23 11:55:55,513 INFO L273 TraceCheckUtils]: 117: Hoare triple {9788#false} assume 0 == ~cond; {9788#false} is VALID [2018-11-23 11:55:55,514 INFO L273 TraceCheckUtils]: 118: Hoare triple {9788#false} assume !false; {9788#false} is VALID [2018-11-23 11:55:55,523 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 191 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2018-11-23 11:55:55,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:55,523 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:55,541 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:55:55,578 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 11:55:55,578 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:55,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:55,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:56,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 48 [2018-11-23 11:55:56,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 51 [2018-11-23 11:55:56,631 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 11:55:56,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 53 [2018-11-23 11:55:56,699 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-23 11:55:56,737 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:55:56,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2018-11-23 11:55:56,785 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:51, output treesize:104 [2018-11-23 11:55:56,793 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:55:56,794 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_BEFORE_CALL_2|, |main_~#values~0.base|, main_~v~0, |main_~#values~0.offset|, insert_~size]. (let ((.cse0 (select |v_#memory_int_BEFORE_CALL_2| |main_~#set~0.base|)) (.cse1 (select (select |v_#memory_int_BEFORE_CALL_2| |main_~#values~0.base|) (+ (* 4 main_~v~0) |main_~#values~0.offset|)))) (and (<= insert_~size 1) (= |main_~#set~0.offset| 0) (not (= (select .cse0 |main_~#set~0.offset|) .cse1)) (= (store |v_#memory_int_BEFORE_CALL_2| |main_~#set~0.base| (store .cse0 (+ |main_~#set~0.offset| (* 4 insert_~size)) .cse1)) |#memory_int|) (<= |main_#t~ret10| (+ insert_~size 1)))) [2018-11-23 11:55:56,794 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [insert_~size, v_prenex_6, v_prenex_4, v_prenex_5, v_prenex_2, v_prenex_3, |main_~#values~0.base|, main_~v~0, |main_~#values~0.offset|]. (let ((.cse2 (select |#memory_int| |main_~#set~0.base|))) (let ((.cse3 (= |main_~#set~0.offset| 0)) (.cse1 (select .cse2 |main_~#set~0.offset|)) (.cse4 (<= |main_#t~ret10| 1))) (or (let ((.cse0 (+ (* 4 v_prenex_2) v_prenex_3))) (and (not (= |main_~#set~0.offset| .cse0)) (= .cse1 (select .cse2 .cse0)) .cse3 .cse4)) (let ((.cse5 (select (select |#memory_int| v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5)))) (and (not (= .cse1 .cse5)) (<= insert_~size 1) (= (select .cse2 (+ |main_~#set~0.offset| (* 4 insert_~size))) .cse5) .cse3 (<= |main_#t~ret10| (+ insert_~size 1)))) (and .cse3 (= .cse1 (select (select |#memory_int| |main_~#values~0.base|) (+ (* 4 main_~v~0) |main_~#values~0.offset|))) (not (= |main_~#set~0.base| |main_~#values~0.base|)) .cse4)))) [2018-11-23 11:56:03,069 WARN L180 SmtUtils]: Spent 6.16 s on a formula simplification. DAG size of input: 56 DAG size of output: 33 [2018-11-23 11:56:03,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 55 [2018-11-23 11:56:03,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 36 [2018-11-23 11:56:03,658 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:56:03,715 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:56:03,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2018-11-23 11:56:03,725 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:56:03,772 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:56:03,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2018-11-23 11:56:03,779 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:56:03,822 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:56:03,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:56:03,894 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:83, output treesize:4 [2018-11-23 11:56:03,898 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:56:03,899 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_prenex_9, v_prenex_6, v_prenex_4, v_prenex_5, v_prenex_8, insert_~size, v_prenex_7, |#memory_int|, |main_~#set~0.base|, main_~y~0]. (or (let ((.cse0 (select |#memory_int| |main_~#set~0.base|))) (and (<= 1 main_~y~0) (= |main_#t~mem13| (select .cse0 0)) (= |main_#t~mem14| (select .cse0 (* 4 main_~y~0))) (<= main_~y~0 0))) (let ((.cse3 (select v_prenex_9 v_prenex_8))) (let ((.cse1 (select .cse3 0)) (.cse2 (select (select v_prenex_9 v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5)))) (and (<= insert_~size 1) (<= 1 v_prenex_7) (= |main_#t~mem13| .cse1) (not (= .cse2 .cse1)) (= |main_#t~mem14| (select .cse3 (* 4 v_prenex_7))) (= .cse2 (select .cse3 (* 4 insert_~size))) (<= v_prenex_7 insert_~size))))) [2018-11-23 11:56:03,899 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (not (= |main_#t~mem14| |main_#t~mem13|)) [2018-11-23 11:56:04,032 INFO L256 TraceCheckUtils]: 0: Hoare triple {9787#true} call ULTIMATE.init(); {9787#true} is VALID [2018-11-23 11:56:04,032 INFO L273 TraceCheckUtils]: 1: Hoare triple {9787#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9787#true} is VALID [2018-11-23 11:56:04,033 INFO L273 TraceCheckUtils]: 2: Hoare triple {9787#true} assume true; {9787#true} is VALID [2018-11-23 11:56:04,033 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9787#true} {9787#true} #120#return; {9787#true} is VALID [2018-11-23 11:56:04,033 INFO L256 TraceCheckUtils]: 4: Hoare triple {9787#true} call #t~ret15 := main(); {9787#true} is VALID [2018-11-23 11:56:04,042 INFO L273 TraceCheckUtils]: 5: Hoare triple {9787#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {9817#(= |main_~#set~0.offset| 0)} is VALID [2018-11-23 11:56:04,054 INFO L273 TraceCheckUtils]: 6: Hoare triple {9817#(= |main_~#set~0.offset| 0)} assume !(~x~0 < ~n~0); {9817#(= |main_~#set~0.offset| 0)} is VALID [2018-11-23 11:56:04,072 INFO L273 TraceCheckUtils]: 7: Hoare triple {9817#(= |main_~#set~0.offset| 0)} call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(400000);havoc ~v~0;~v~0 := 0; {9817#(= |main_~#set~0.offset| 0)} is VALID [2018-11-23 11:56:04,081 INFO L273 TraceCheckUtils]: 8: Hoare triple {9817#(= |main_~#set~0.offset| 0)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {9817#(= |main_~#set~0.offset| 0)} is VALID [2018-11-23 11:56:04,081 INFO L256 TraceCheckUtils]: 9: Hoare triple {9817#(= |main_~#set~0.offset| 0)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {9787#true} is VALID [2018-11-23 11:56:04,081 INFO L273 TraceCheckUtils]: 10: Hoare triple {9787#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {9787#true} is VALID [2018-11-23 11:56:04,082 INFO L273 TraceCheckUtils]: 11: Hoare triple {9787#true} assume !(~i~0 < ~size); {9787#true} is VALID [2018-11-23 11:56:04,082 INFO L273 TraceCheckUtils]: 12: Hoare triple {9787#true} #res := 0; {9787#true} is VALID [2018-11-23 11:56:04,082 INFO L273 TraceCheckUtils]: 13: Hoare triple {9787#true} assume true; {9787#true} is VALID [2018-11-23 11:56:04,095 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {9787#true} {9817#(= |main_~#set~0.offset| 0)} #126#return; {9817#(= |main_~#set~0.offset| 0)} is VALID [2018-11-23 11:56:04,107 INFO L273 TraceCheckUtils]: 15: Hoare triple {9817#(= |main_~#set~0.offset| 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {9817#(= |main_~#set~0.offset| 0)} is VALID [2018-11-23 11:56:04,127 INFO L273 TraceCheckUtils]: 16: Hoare triple {9817#(= |main_~#set~0.offset| 0)} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {9817#(= |main_~#set~0.offset| 0)} is VALID [2018-11-23 11:56:04,127 INFO L256 TraceCheckUtils]: 17: Hoare triple {9817#(= |main_~#set~0.offset| 0)} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {9787#true} is VALID [2018-11-23 11:56:04,127 INFO L273 TraceCheckUtils]: 18: Hoare triple {9787#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; {9787#true} is VALID [2018-11-23 11:56:04,127 INFO L273 TraceCheckUtils]: 19: Hoare triple {9787#true} assume true; {9787#true} is VALID [2018-11-23 11:56:04,137 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {9787#true} {9817#(= |main_~#set~0.offset| 0)} #128#return; {9817#(= |main_~#set~0.offset| 0)} is VALID [2018-11-23 11:56:04,138 INFO L273 TraceCheckUtils]: 21: Hoare triple {9817#(= |main_~#set~0.offset| 0)} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~mem9;havoc #t~ret10; {9817#(= |main_~#set~0.offset| 0)} is VALID [2018-11-23 11:56:04,141 INFO L273 TraceCheckUtils]: 22: Hoare triple {9817#(= |main_~#set~0.offset| 0)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {9817#(= |main_~#set~0.offset| 0)} is VALID [2018-11-23 11:56:04,143 INFO L273 TraceCheckUtils]: 23: Hoare triple {9817#(= |main_~#set~0.offset| 0)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {9817#(= |main_~#set~0.offset| 0)} is VALID [2018-11-23 11:56:04,143 INFO L256 TraceCheckUtils]: 24: Hoare triple {9817#(= |main_~#set~0.offset| 0)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {9787#true} is VALID [2018-11-23 11:56:04,143 INFO L273 TraceCheckUtils]: 25: Hoare triple {9787#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {9787#true} is VALID [2018-11-23 11:56:04,143 INFO L273 TraceCheckUtils]: 26: Hoare triple {9787#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {9787#true} is VALID [2018-11-23 11:56:04,143 INFO L273 TraceCheckUtils]: 27: Hoare triple {9787#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {9787#true} is VALID [2018-11-23 11:56:04,143 INFO L273 TraceCheckUtils]: 28: Hoare triple {9787#true} assume true; {9787#true} is VALID [2018-11-23 11:56:04,144 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {9787#true} {9817#(= |main_~#set~0.offset| 0)} #126#return; {9817#(= |main_~#set~0.offset| 0)} is VALID [2018-11-23 11:56:04,145 INFO L273 TraceCheckUtils]: 30: Hoare triple {9817#(= |main_~#set~0.offset| 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {9817#(= |main_~#set~0.offset| 0)} is VALID [2018-11-23 11:56:04,145 INFO L273 TraceCheckUtils]: 31: Hoare triple {9817#(= |main_~#set~0.offset| 0)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {9817#(= |main_~#set~0.offset| 0)} is VALID [2018-11-23 11:56:04,145 INFO L273 TraceCheckUtils]: 32: Hoare triple {9817#(= |main_~#set~0.offset| 0)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {9817#(= |main_~#set~0.offset| 0)} is VALID [2018-11-23 11:56:04,146 INFO L273 TraceCheckUtils]: 33: Hoare triple {9817#(= |main_~#set~0.offset| 0)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {9817#(= |main_~#set~0.offset| 0)} is VALID [2018-11-23 11:56:04,146 INFO L256 TraceCheckUtils]: 34: Hoare triple {9817#(= |main_~#set~0.offset| 0)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {9787#true} is VALID [2018-11-23 11:56:04,146 INFO L273 TraceCheckUtils]: 35: Hoare triple {9787#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {9787#true} is VALID [2018-11-23 11:56:04,146 INFO L273 TraceCheckUtils]: 36: Hoare triple {9787#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {9787#true} is VALID [2018-11-23 11:56:04,146 INFO L273 TraceCheckUtils]: 37: Hoare triple {9787#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {9787#true} is VALID [2018-11-23 11:56:04,146 INFO L273 TraceCheckUtils]: 38: Hoare triple {9787#true} assume true; {9787#true} is VALID [2018-11-23 11:56:04,147 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {9787#true} {9817#(= |main_~#set~0.offset| 0)} #126#return; {9817#(= |main_~#set~0.offset| 0)} is VALID [2018-11-23 11:56:04,147 INFO L273 TraceCheckUtils]: 40: Hoare triple {9817#(= |main_~#set~0.offset| 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {9817#(= |main_~#set~0.offset| 0)} is VALID [2018-11-23 11:56:04,147 INFO L273 TraceCheckUtils]: 41: Hoare triple {9817#(= |main_~#set~0.offset| 0)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {9817#(= |main_~#set~0.offset| 0)} is VALID [2018-11-23 11:56:04,148 INFO L273 TraceCheckUtils]: 42: Hoare triple {9817#(= |main_~#set~0.offset| 0)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {9817#(= |main_~#set~0.offset| 0)} is VALID [2018-11-23 11:56:04,148 INFO L273 TraceCheckUtils]: 43: Hoare triple {9817#(= |main_~#set~0.offset| 0)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {9817#(= |main_~#set~0.offset| 0)} is VALID [2018-11-23 11:56:04,148 INFO L256 TraceCheckUtils]: 44: Hoare triple {9817#(= |main_~#set~0.offset| 0)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {9787#true} is VALID [2018-11-23 11:56:04,149 INFO L273 TraceCheckUtils]: 45: Hoare triple {9787#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {9787#true} is VALID [2018-11-23 11:56:04,149 INFO L273 TraceCheckUtils]: 46: Hoare triple {9787#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {9787#true} is VALID [2018-11-23 11:56:04,149 INFO L273 TraceCheckUtils]: 47: Hoare triple {9787#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {9787#true} is VALID [2018-11-23 11:56:04,149 INFO L273 TraceCheckUtils]: 48: Hoare triple {9787#true} assume true; {9787#true} is VALID [2018-11-23 11:56:04,150 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {9787#true} {9817#(= |main_~#set~0.offset| 0)} #126#return; {9817#(= |main_~#set~0.offset| 0)} is VALID [2018-11-23 11:56:04,151 INFO L273 TraceCheckUtils]: 50: Hoare triple {9817#(= |main_~#set~0.offset| 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {9817#(= |main_~#set~0.offset| 0)} is VALID [2018-11-23 11:56:04,151 INFO L273 TraceCheckUtils]: 51: Hoare triple {9817#(= |main_~#set~0.offset| 0)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {9817#(= |main_~#set~0.offset| 0)} is VALID [2018-11-23 11:56:04,152 INFO L273 TraceCheckUtils]: 52: Hoare triple {9817#(= |main_~#set~0.offset| 0)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {9817#(= |main_~#set~0.offset| 0)} is VALID [2018-11-23 11:56:04,152 INFO L273 TraceCheckUtils]: 53: Hoare triple {9817#(= |main_~#set~0.offset| 0)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {9817#(= |main_~#set~0.offset| 0)} is VALID [2018-11-23 11:56:04,153 INFO L256 TraceCheckUtils]: 54: Hoare triple {9817#(= |main_~#set~0.offset| 0)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {9787#true} is VALID [2018-11-23 11:56:04,153 INFO L273 TraceCheckUtils]: 55: Hoare triple {9787#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {9787#true} is VALID [2018-11-23 11:56:04,153 INFO L273 TraceCheckUtils]: 56: Hoare triple {9787#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {9787#true} is VALID [2018-11-23 11:56:04,153 INFO L273 TraceCheckUtils]: 57: Hoare triple {9787#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {9787#true} is VALID [2018-11-23 11:56:04,153 INFO L273 TraceCheckUtils]: 58: Hoare triple {9787#true} assume true; {9787#true} is VALID [2018-11-23 11:56:04,154 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {9787#true} {9817#(= |main_~#set~0.offset| 0)} #126#return; {9817#(= |main_~#set~0.offset| 0)} is VALID [2018-11-23 11:56:04,155 INFO L273 TraceCheckUtils]: 60: Hoare triple {9817#(= |main_~#set~0.offset| 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {9817#(= |main_~#set~0.offset| 0)} is VALID [2018-11-23 11:56:04,155 INFO L273 TraceCheckUtils]: 61: Hoare triple {9817#(= |main_~#set~0.offset| 0)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {9817#(= |main_~#set~0.offset| 0)} is VALID [2018-11-23 11:56:04,156 INFO L273 TraceCheckUtils]: 62: Hoare triple {9817#(= |main_~#set~0.offset| 0)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {9817#(= |main_~#set~0.offset| 0)} is VALID [2018-11-23 11:56:04,156 INFO L273 TraceCheckUtils]: 63: Hoare triple {9817#(= |main_~#set~0.offset| 0)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {9817#(= |main_~#set~0.offset| 0)} is VALID [2018-11-23 11:56:04,156 INFO L256 TraceCheckUtils]: 64: Hoare triple {9817#(= |main_~#set~0.offset| 0)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {9787#true} is VALID [2018-11-23 11:56:04,156 INFO L273 TraceCheckUtils]: 65: Hoare triple {9787#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {9787#true} is VALID [2018-11-23 11:56:04,156 INFO L273 TraceCheckUtils]: 66: Hoare triple {9787#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {9787#true} is VALID [2018-11-23 11:56:04,156 INFO L273 TraceCheckUtils]: 67: Hoare triple {9787#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {9787#true} is VALID [2018-11-23 11:56:04,156 INFO L273 TraceCheckUtils]: 68: Hoare triple {9787#true} assume true; {9787#true} is VALID [2018-11-23 11:56:04,157 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {9787#true} {9817#(= |main_~#set~0.offset| 0)} #126#return; {9817#(= |main_~#set~0.offset| 0)} is VALID [2018-11-23 11:56:04,157 INFO L273 TraceCheckUtils]: 70: Hoare triple {9817#(= |main_~#set~0.offset| 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {9817#(= |main_~#set~0.offset| 0)} is VALID [2018-11-23 11:56:04,158 INFO L273 TraceCheckUtils]: 71: Hoare triple {9817#(= |main_~#set~0.offset| 0)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {9817#(= |main_~#set~0.offset| 0)} is VALID [2018-11-23 11:56:04,158 INFO L273 TraceCheckUtils]: 72: Hoare triple {9817#(= |main_~#set~0.offset| 0)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {9817#(= |main_~#set~0.offset| 0)} is VALID [2018-11-23 11:56:04,159 INFO L273 TraceCheckUtils]: 73: Hoare triple {9817#(= |main_~#set~0.offset| 0)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {9817#(= |main_~#set~0.offset| 0)} is VALID [2018-11-23 11:56:04,159 INFO L256 TraceCheckUtils]: 74: Hoare triple {9817#(= |main_~#set~0.offset| 0)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {9787#true} is VALID [2018-11-23 11:56:04,159 INFO L273 TraceCheckUtils]: 75: Hoare triple {9787#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {9787#true} is VALID [2018-11-23 11:56:04,159 INFO L273 TraceCheckUtils]: 76: Hoare triple {9787#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {9787#true} is VALID [2018-11-23 11:56:04,159 INFO L273 TraceCheckUtils]: 77: Hoare triple {9787#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {9787#true} is VALID [2018-11-23 11:56:04,160 INFO L273 TraceCheckUtils]: 78: Hoare triple {9787#true} assume true; {9787#true} is VALID [2018-11-23 11:56:04,161 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {9787#true} {9817#(= |main_~#set~0.offset| 0)} #126#return; {9817#(= |main_~#set~0.offset| 0)} is VALID [2018-11-23 11:56:04,161 INFO L273 TraceCheckUtils]: 80: Hoare triple {9817#(= |main_~#set~0.offset| 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {9817#(= |main_~#set~0.offset| 0)} is VALID [2018-11-23 11:56:04,162 INFO L273 TraceCheckUtils]: 81: Hoare triple {9817#(= |main_~#set~0.offset| 0)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {9817#(= |main_~#set~0.offset| 0)} is VALID [2018-11-23 11:56:04,162 INFO L273 TraceCheckUtils]: 82: Hoare triple {9817#(= |main_~#set~0.offset| 0)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {9817#(= |main_~#set~0.offset| 0)} is VALID [2018-11-23 11:56:04,163 INFO L273 TraceCheckUtils]: 83: Hoare triple {9817#(= |main_~#set~0.offset| 0)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {9817#(= |main_~#set~0.offset| 0)} is VALID [2018-11-23 11:56:04,163 INFO L256 TraceCheckUtils]: 84: Hoare triple {9817#(= |main_~#set~0.offset| 0)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {9787#true} is VALID [2018-11-23 11:56:04,163 INFO L273 TraceCheckUtils]: 85: Hoare triple {9787#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {9787#true} is VALID [2018-11-23 11:56:04,163 INFO L273 TraceCheckUtils]: 86: Hoare triple {9787#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {9787#true} is VALID [2018-11-23 11:56:04,164 INFO L273 TraceCheckUtils]: 87: Hoare triple {9787#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {10064#(= |elem_exists_#res| 1)} is VALID [2018-11-23 11:56:04,164 INFO L273 TraceCheckUtils]: 88: Hoare triple {10064#(= |elem_exists_#res| 1)} assume true; {10064#(= |elem_exists_#res| 1)} is VALID [2018-11-23 11:56:04,165 INFO L268 TraceCheckUtils]: 89: Hoare quadruple {10064#(= |elem_exists_#res| 1)} {9817#(= |main_~#set~0.offset| 0)} #126#return; {10071#(and (= 1 |main_#t~ret8|) (= |main_~#set~0.offset| 0))} is VALID [2018-11-23 11:56:04,166 INFO L273 TraceCheckUtils]: 90: Hoare triple {10071#(and (= 1 |main_#t~ret8|) (= |main_~#set~0.offset| 0))} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {10071#(and (= 1 |main_#t~ret8|) (= |main_~#set~0.offset| 0))} is VALID [2018-11-23 11:56:04,166 INFO L273 TraceCheckUtils]: 91: Hoare triple {10071#(and (= 1 |main_#t~ret8|) (= |main_~#set~0.offset| 0))} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {9817#(= |main_~#set~0.offset| 0)} is VALID [2018-11-23 11:56:04,167 INFO L273 TraceCheckUtils]: 92: Hoare triple {9817#(= |main_~#set~0.offset| 0)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {9817#(= |main_~#set~0.offset| 0)} is VALID [2018-11-23 11:56:04,167 INFO L273 TraceCheckUtils]: 93: Hoare triple {9817#(= |main_~#set~0.offset| 0)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {10084#(and (= (select (select |#memory_int| |main_~#values~0.base|) (+ (* 4 main_~v~0) |main_~#values~0.offset|)) |main_#t~mem7|) (= |main_~#set~0.offset| 0))} is VALID [2018-11-23 11:56:04,167 INFO L256 TraceCheckUtils]: 94: Hoare triple {10084#(and (= (select (select |#memory_int| |main_~#values~0.base|) (+ (* 4 main_~v~0) |main_~#values~0.offset|)) |main_#t~mem7|) (= |main_~#set~0.offset| 0))} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {9787#true} is VALID [2018-11-23 11:56:04,168 INFO L273 TraceCheckUtils]: 95: Hoare triple {9787#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {10091#(and (= |elem_exists_#in~set.offset| elem_exists_~set.offset) (<= |elem_exists_#in~size| elem_exists_~size) (= elem_exists_~i~0 0) (= elem_exists_~set.base |elem_exists_#in~set.base|) (= elem_exists_~value |elem_exists_#in~value|))} is VALID [2018-11-23 11:56:04,169 INFO L273 TraceCheckUtils]: 96: Hoare triple {10091#(and (= |elem_exists_#in~set.offset| elem_exists_~set.offset) (<= |elem_exists_#in~size| elem_exists_~size) (= elem_exists_~i~0 0) (= elem_exists_~set.base |elem_exists_#in~set.base|) (= elem_exists_~value |elem_exists_#in~value|))} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {10095#(and (= |elem_exists_#t~mem1| (select (select |#memory_int| |elem_exists_#in~set.base|) (+ |elem_exists_#in~set.offset| (* 4 elem_exists_~i~0)))) (<= |elem_exists_#in~size| elem_exists_~size) (= elem_exists_~i~0 0) (= elem_exists_~value |elem_exists_#in~value|))} is VALID [2018-11-23 11:56:04,170 INFO L273 TraceCheckUtils]: 97: Hoare triple {10095#(and (= |elem_exists_#t~mem1| (select (select |#memory_int| |elem_exists_#in~set.base|) (+ |elem_exists_#in~set.offset| (* 4 elem_exists_~i~0)))) (<= |elem_exists_#in~size| elem_exists_~size) (= elem_exists_~i~0 0) (= elem_exists_~value |elem_exists_#in~value|))} assume !(#t~mem1 == ~value);havoc #t~mem1; {10099#(and (not (= |elem_exists_#in~value| (select (select |#memory_int| |elem_exists_#in~set.base|) (+ |elem_exists_#in~set.offset| (* 4 elem_exists_~i~0))))) (<= |elem_exists_#in~size| elem_exists_~size) (= elem_exists_~i~0 0))} is VALID [2018-11-23 11:56:04,172 INFO L273 TraceCheckUtils]: 98: Hoare triple {10099#(and (not (= |elem_exists_#in~value| (select (select |#memory_int| |elem_exists_#in~set.base|) (+ |elem_exists_#in~set.offset| (* 4 elem_exists_~i~0))))) (<= |elem_exists_#in~size| elem_exists_~size) (= elem_exists_~i~0 0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10103#(and (not (= (select (select |#memory_int| |elem_exists_#in~set.base|) |elem_exists_#in~set.offset|) |elem_exists_#in~value|)) (<= elem_exists_~i~0 1) (<= |elem_exists_#in~size| elem_exists_~size))} is VALID [2018-11-23 11:56:04,173 INFO L273 TraceCheckUtils]: 99: Hoare triple {10103#(and (not (= (select (select |#memory_int| |elem_exists_#in~set.base|) |elem_exists_#in~set.offset|) |elem_exists_#in~value|)) (<= elem_exists_~i~0 1) (<= |elem_exists_#in~size| elem_exists_~size))} assume !(~i~0 < ~size); {10107#(and (<= |elem_exists_#in~size| 1) (not (= (select (select |#memory_int| |elem_exists_#in~set.base|) |elem_exists_#in~set.offset|) |elem_exists_#in~value|)))} is VALID [2018-11-23 11:56:04,173 INFO L273 TraceCheckUtils]: 100: Hoare triple {10107#(and (<= |elem_exists_#in~size| 1) (not (= (select (select |#memory_int| |elem_exists_#in~set.base|) |elem_exists_#in~set.offset|) |elem_exists_#in~value|)))} #res := 0; {10107#(and (<= |elem_exists_#in~size| 1) (not (= (select (select |#memory_int| |elem_exists_#in~set.base|) |elem_exists_#in~set.offset|) |elem_exists_#in~value|)))} is VALID [2018-11-23 11:56:04,174 INFO L273 TraceCheckUtils]: 101: Hoare triple {10107#(and (<= |elem_exists_#in~size| 1) (not (= (select (select |#memory_int| |elem_exists_#in~set.base|) |elem_exists_#in~set.offset|) |elem_exists_#in~value|)))} assume true; {10107#(and (<= |elem_exists_#in~size| 1) (not (= (select (select |#memory_int| |elem_exists_#in~set.base|) |elem_exists_#in~set.offset|) |elem_exists_#in~value|)))} is VALID [2018-11-23 11:56:04,176 INFO L268 TraceCheckUtils]: 102: Hoare quadruple {10107#(and (<= |elem_exists_#in~size| 1) (not (= (select (select |#memory_int| |elem_exists_#in~set.base|) |elem_exists_#in~set.offset|) |elem_exists_#in~value|)))} {10084#(and (= (select (select |#memory_int| |main_~#values~0.base|) (+ (* 4 main_~v~0) |main_~#values~0.offset|)) |main_#t~mem7|) (= |main_~#set~0.offset| 0))} #126#return; {10117#(and (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) (select (select |#memory_int| |main_~#values~0.base|) (+ (* 4 main_~v~0) |main_~#values~0.offset|)))) (= |main_~#set~0.offset| 0) (<= main_~n~0 1))} is VALID [2018-11-23 11:56:04,177 INFO L273 TraceCheckUtils]: 103: Hoare triple {10117#(and (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) (select (select |#memory_int| |main_~#values~0.base|) (+ (* 4 main_~v~0) |main_~#values~0.offset|)))) (= |main_~#set~0.offset| 0) (<= main_~n~0 1))} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {10117#(and (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) (select (select |#memory_int| |main_~#values~0.base|) (+ (* 4 main_~v~0) |main_~#values~0.offset|)))) (= |main_~#set~0.offset| 0) (<= main_~n~0 1))} is VALID [2018-11-23 11:56:04,179 INFO L273 TraceCheckUtils]: 104: Hoare triple {10117#(and (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) (select (select |#memory_int| |main_~#values~0.base|) (+ (* 4 main_~v~0) |main_~#values~0.offset|)))) (= |main_~#set~0.offset| 0) (<= main_~n~0 1))} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {10124#(and (= |main_~#set~0.offset| 0) (<= main_~n~0 1) (exists ((main_~v~0 Int) (|main_~#values~0.offset| Int) (|main_~#values~0.base| Int)) (and (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) (select (select |#memory_int| |main_~#values~0.base|) (+ (* 4 main_~v~0) |main_~#values~0.offset|)))) (= (select (select |#memory_int| |main_~#values~0.base|) (+ (* 4 main_~v~0) |main_~#values~0.offset|)) |main_#t~mem9|))))} is VALID [2018-11-23 11:56:04,180 INFO L256 TraceCheckUtils]: 105: Hoare triple {10124#(and (= |main_~#set~0.offset| 0) (<= main_~n~0 1) (exists ((main_~v~0 Int) (|main_~#values~0.offset| Int) (|main_~#values~0.base| Int)) (and (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) (select (select |#memory_int| |main_~#values~0.base|) (+ (* 4 main_~v~0) |main_~#values~0.offset|)))) (= (select (select |#memory_int| |main_~#values~0.base|) (+ (* 4 main_~v~0) |main_~#values~0.offset|)) |main_#t~mem9|))))} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {10128#(= |#memory_int| |old(#memory_int)|)} is VALID [2018-11-23 11:56:04,182 INFO L273 TraceCheckUtils]: 106: Hoare triple {10128#(= |#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; {10132#(exists ((insert_~size Int)) (and (= |#memory_int| (store |old(#memory_int)| |insert_#in~set.base| (store (select |old(#memory_int)| |insert_#in~set.base|) (+ (* 4 insert_~size) |insert_#in~set.offset|) |insert_#in~value|))) (<= |insert_#res| (+ insert_~size 1)) (<= insert_~size |insert_#in~size|)))} is VALID [2018-11-23 11:56:04,183 INFO L273 TraceCheckUtils]: 107: Hoare triple {10132#(exists ((insert_~size Int)) (and (= |#memory_int| (store |old(#memory_int)| |insert_#in~set.base| (store (select |old(#memory_int)| |insert_#in~set.base|) (+ (* 4 insert_~size) |insert_#in~set.offset|) |insert_#in~value|))) (<= |insert_#res| (+ insert_~size 1)) (<= insert_~size |insert_#in~size|)))} assume true; {10132#(exists ((insert_~size Int)) (and (= |#memory_int| (store |old(#memory_int)| |insert_#in~set.base| (store (select |old(#memory_int)| |insert_#in~set.base|) (+ (* 4 insert_~size) |insert_#in~set.offset|) |insert_#in~value|))) (<= |insert_#res| (+ insert_~size 1)) (<= insert_~size |insert_#in~size|)))} is VALID [2018-11-23 11:56:04,187 INFO L268 TraceCheckUtils]: 108: Hoare quadruple {10132#(exists ((insert_~size Int)) (and (= |#memory_int| (store |old(#memory_int)| |insert_#in~set.base| (store (select |old(#memory_int)| |insert_#in~set.base|) (+ (* 4 insert_~size) |insert_#in~set.offset|) |insert_#in~value|))) (<= |insert_#res| (+ insert_~size 1)) (<= insert_~size |insert_#in~size|)))} {10124#(and (= |main_~#set~0.offset| 0) (<= main_~n~0 1) (exists ((main_~v~0 Int) (|main_~#values~0.offset| Int) (|main_~#values~0.base| Int)) (and (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) (select (select |#memory_int| |main_~#values~0.base|) (+ (* 4 main_~v~0) |main_~#values~0.offset|)))) (= (select (select |#memory_int| |main_~#values~0.base|) (+ (* 4 main_~v~0) |main_~#values~0.offset|)) |main_#t~mem9|))))} #128#return; {10139#(or (and (exists ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (insert_~size Int)) (and (<= insert_~size 1) (<= |main_#t~ret10| (+ insert_~size 1)) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) (select (select |#memory_int| v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5)))) (= (select (select |#memory_int| |main_~#set~0.base|) (+ |main_~#set~0.offset| (* 4 insert_~size))) (select (select |#memory_int| v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5))))) (= |main_~#set~0.offset| 0)) (and (= |main_~#set~0.offset| 0) (<= |main_#t~ret10| 1)))} is VALID [2018-11-23 11:56:04,399 INFO L273 TraceCheckUtils]: 109: Hoare triple {10139#(or (and (exists ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (insert_~size Int)) (and (<= insert_~size 1) (<= |main_#t~ret10| (+ insert_~size 1)) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) (select (select |#memory_int| v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5)))) (= (select (select |#memory_int| |main_~#set~0.base|) (+ |main_~#set~0.offset| (* 4 insert_~size))) (select (select |#memory_int| v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5))))) (= |main_~#set~0.offset| 0)) (and (= |main_~#set~0.offset| 0) (<= |main_#t~ret10| 1)))} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~mem9;havoc #t~ret10; {10143#(or (and (= |main_~#set~0.offset| 0) (<= main_~n~0 1)) (and (exists ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (insert_~size Int)) (and (<= insert_~size 1) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) (select (select |#memory_int| v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5)))) (<= main_~n~0 (+ insert_~size 1)) (= (select (select |#memory_int| |main_~#set~0.base|) (+ |main_~#set~0.offset| (* 4 insert_~size))) (select (select |#memory_int| v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5))))) (= |main_~#set~0.offset| 0)))} is VALID [2018-11-23 11:56:04,400 INFO L273 TraceCheckUtils]: 110: Hoare triple {10143#(or (and (= |main_~#set~0.offset| 0) (<= main_~n~0 1)) (and (exists ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (insert_~size Int)) (and (<= insert_~size 1) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) (select (select |#memory_int| v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5)))) (<= main_~n~0 (+ insert_~size 1)) (= (select (select |#memory_int| |main_~#set~0.base|) (+ |main_~#set~0.offset| (* 4 insert_~size))) (select (select |#memory_int| v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5))))) (= |main_~#set~0.offset| 0)))} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {10143#(or (and (= |main_~#set~0.offset| 0) (<= main_~n~0 1)) (and (exists ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (insert_~size Int)) (and (<= insert_~size 1) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) (select (select |#memory_int| v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5)))) (<= main_~n~0 (+ insert_~size 1)) (= (select (select |#memory_int| |main_~#set~0.base|) (+ |main_~#set~0.offset| (* 4 insert_~size))) (select (select |#memory_int| v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5))))) (= |main_~#set~0.offset| 0)))} is VALID [2018-11-23 11:56:04,400 INFO L273 TraceCheckUtils]: 111: Hoare triple {10143#(or (and (= |main_~#set~0.offset| 0) (<= main_~n~0 1)) (and (exists ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (insert_~size Int)) (and (<= insert_~size 1) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) (select (select |#memory_int| v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5)))) (<= main_~n~0 (+ insert_~size 1)) (= (select (select |#memory_int| |main_~#set~0.base|) (+ |main_~#set~0.offset| (* 4 insert_~size))) (select (select |#memory_int| v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5))))) (= |main_~#set~0.offset| 0)))} assume !(~v~0 < 100000); {10143#(or (and (= |main_~#set~0.offset| 0) (<= main_~n~0 1)) (and (exists ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (insert_~size Int)) (and (<= insert_~size 1) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) (select (select |#memory_int| v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5)))) (<= main_~n~0 (+ insert_~size 1)) (= (select (select |#memory_int| |main_~#set~0.base|) (+ |main_~#set~0.offset| (* 4 insert_~size))) (select (select |#memory_int| v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5))))) (= |main_~#set~0.offset| 0)))} is VALID [2018-11-23 11:56:04,401 INFO L273 TraceCheckUtils]: 112: Hoare triple {10143#(or (and (= |main_~#set~0.offset| 0) (<= main_~n~0 1)) (and (exists ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (insert_~size Int)) (and (<= insert_~size 1) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) (select (select |#memory_int| v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5)))) (<= main_~n~0 (+ insert_~size 1)) (= (select (select |#memory_int| |main_~#set~0.base|) (+ |main_~#set~0.offset| (* 4 insert_~size))) (select (select |#memory_int| v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5))))) (= |main_~#set~0.offset| 0)))} ~x~0 := 0; {10153#(or (and (= main_~x~0 0) (= |main_~#set~0.offset| 0) (<= main_~n~0 1)) (and (exists ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (insert_~size Int)) (and (<= insert_~size 1) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) (select (select |#memory_int| v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5)))) (<= main_~n~0 (+ insert_~size 1)) (= (select (select |#memory_int| |main_~#set~0.base|) (+ |main_~#set~0.offset| (* 4 insert_~size))) (select (select |#memory_int| v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5))))) (= main_~x~0 0) (= |main_~#set~0.offset| 0)))} is VALID [2018-11-23 11:56:04,402 INFO L273 TraceCheckUtils]: 113: Hoare triple {10153#(or (and (= main_~x~0 0) (= |main_~#set~0.offset| 0) (<= main_~n~0 1)) (and (exists ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (insert_~size Int)) (and (<= insert_~size 1) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) (select (select |#memory_int| v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5)))) (<= main_~n~0 (+ insert_~size 1)) (= (select (select |#memory_int| |main_~#set~0.base|) (+ |main_~#set~0.offset| (* 4 insert_~size))) (select (select |#memory_int| v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5))))) (= main_~x~0 0) (= |main_~#set~0.offset| 0)))} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {10157#(or (and (<= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0) (= |main_~#set~0.offset| 0) (<= main_~n~0 1)) (and (exists ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (insert_~size Int)) (and (<= insert_~size 1) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) (select (select |#memory_int| v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5)))) (<= main_~n~0 (+ insert_~size 1)) (= (select (select |#memory_int| |main_~#set~0.base|) (+ |main_~#set~0.offset| (* 4 insert_~size))) (select (select |#memory_int| v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5))))) (<= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0) (= |main_~#set~0.offset| 0)))} is VALID [2018-11-23 11:56:04,403 INFO L273 TraceCheckUtils]: 114: Hoare triple {10157#(or (and (<= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0) (= |main_~#set~0.offset| 0) (<= main_~n~0 1)) (and (exists ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (insert_~size Int)) (and (<= insert_~size 1) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) (select (select |#memory_int| v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5)))) (<= main_~n~0 (+ insert_~size 1)) (= (select (select |#memory_int| |main_~#set~0.base|) (+ |main_~#set~0.offset| (* 4 insert_~size))) (select (select |#memory_int| v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5))))) (<= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0) (= |main_~#set~0.offset| 0)))} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {10161#(not (= |main_#t~mem14| |main_#t~mem13|))} is VALID [2018-11-23 11:56:04,404 INFO L256 TraceCheckUtils]: 115: Hoare triple {10161#(not (= |main_#t~mem14| |main_#t~mem13|))} call __VERIFIER_assert((if #t~mem13 != #t~mem14 then 1 else 0)); {10165#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 11:56:04,405 INFO L273 TraceCheckUtils]: 116: Hoare triple {10165#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {10169#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 11:56:04,406 INFO L273 TraceCheckUtils]: 117: Hoare triple {10169#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9788#false} is VALID [2018-11-23 11:56:04,406 INFO L273 TraceCheckUtils]: 118: Hoare triple {9788#false} assume !false; {9788#false} is VALID [2018-11-23 11:56:04,439 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 110 proven. 5 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2018-11-23 11:56:04,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:56:04,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 22] total 32 [2018-11-23 11:56:04,469 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 119 [2018-11-23 11:56:04,481 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:56:04,481 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-23 11:56:05,633 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 128 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:05,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-23 11:56:05,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-23 11:56:05,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=872, Unknown=0, NotChecked=0, Total=992 [2018-11-23 11:56:05,635 INFO L87 Difference]: Start difference. First operand 213 states and 284 transitions. Second operand 32 states. [2018-11-23 11:56:13,646 WARN L180 SmtUtils]: Spent 913.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2018-11-23 11:56:22,953 WARN L180 SmtUtils]: Spent 3.63 s on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2018-11-23 11:56:29,286 WARN L180 SmtUtils]: Spent 6.10 s on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2018-11-23 11:56:34,925 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2018-11-23 11:56:38,182 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 32 [2018-11-23 11:56:53,051 WARN L180 SmtUtils]: Spent 9.92 s on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2018-11-23 11:56:55,199 WARN L180 SmtUtils]: Spent 1.71 s on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2018-11-23 11:56:59,816 WARN L180 SmtUtils]: Spent 541.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 28 [2018-11-23 11:57:08,420 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-11-23 11:57:12,271 WARN L180 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-11-23 11:57:22,188 WARN L180 SmtUtils]: Spent 7.73 s on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2018-11-23 11:57:24,874 WARN L180 SmtUtils]: Spent 2.40 s on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2018-11-23 11:57:26,744 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-23 11:57:27,611 WARN L180 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 30 [2018-11-23 11:57:32,235 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-11-23 11:57:40,020 WARN L180 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2018-11-23 11:57:40,633 WARN L180 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2018-11-23 11:57:58,199 WARN L180 SmtUtils]: Spent 9.11 s on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2018-11-23 11:58:13,073 WARN L180 SmtUtils]: Spent 4.62 s on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2018-11-23 11:58:13,957 WARN L180 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2018-11-23 11:58:25,367 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2018-11-23 11:58:36,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:36,377 INFO L93 Difference]: Finished difference Result 640 states and 1023 transitions. [2018-11-23 11:58:36,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 222 states. [2018-11-23 11:58:36,378 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 119 [2018-11-23 11:58:36,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:36,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 11:58:36,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 821 transitions. [2018-11-23 11:58:36,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 11:58:36,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 821 transitions. [2018-11-23 11:58:36,521 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 222 states and 821 transitions. [2018-11-23 11:58:45,325 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 821 edges. 820 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:45,364 INFO L225 Difference]: With dead ends: 640 [2018-11-23 11:58:45,364 INFO L226 Difference]: Without dead ends: 627 [2018-11-23 11:58:45,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25165 ImplicationChecksByTransitivity, 95.7s TimeCoverageRelationStatistics Valid=7857, Invalid=51922, Unknown=1, NotChecked=0, Total=59780 [2018-11-23 11:58:45,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2018-11-23 11:58:46,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 330. [2018-11-23 11:58:46,358 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:46,358 INFO L82 GeneralOperation]: Start isEquivalent. First operand 627 states. Second operand 330 states. [2018-11-23 11:58:46,358 INFO L74 IsIncluded]: Start isIncluded. First operand 627 states. Second operand 330 states. [2018-11-23 11:58:46,358 INFO L87 Difference]: Start difference. First operand 627 states. Second operand 330 states. [2018-11-23 11:58:46,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:46,419 INFO L93 Difference]: Finished difference Result 627 states and 1005 transitions. [2018-11-23 11:58:46,419 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 1005 transitions. [2018-11-23 11:58:46,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:46,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:46,425 INFO L74 IsIncluded]: Start isIncluded. First operand 330 states. Second operand 627 states. [2018-11-23 11:58:46,425 INFO L87 Difference]: Start difference. First operand 330 states. Second operand 627 states. [2018-11-23 11:58:46,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:46,480 INFO L93 Difference]: Finished difference Result 627 states and 1005 transitions. [2018-11-23 11:58:46,480 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 1005 transitions. [2018-11-23 11:58:46,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:46,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:46,485 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:46,485 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:46,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-11-23 11:58:46,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 472 transitions. [2018-11-23 11:58:46,503 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 472 transitions. Word has length 119 [2018-11-23 11:58:46,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:46,504 INFO L480 AbstractCegarLoop]: Abstraction has 330 states and 472 transitions. [2018-11-23 11:58:46,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-23 11:58:46,504 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 472 transitions. [2018-11-23 11:58:46,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-23 11:58:46,507 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:46,507 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 8, 8, 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] [2018-11-23 11:58:46,508 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:46,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:46,508 INFO L82 PathProgramCache]: Analyzing trace with hash 488639967, now seen corresponding path program 1 times [2018-11-23 11:58:46,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:46,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:46,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:46,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:46,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:46,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:47,158 INFO L256 TraceCheckUtils]: 0: Hoare triple {13153#true} call ULTIMATE.init(); {13153#true} is VALID [2018-11-23 11:58:47,158 INFO L273 TraceCheckUtils]: 1: Hoare triple {13153#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13153#true} is VALID [2018-11-23 11:58:47,158 INFO L273 TraceCheckUtils]: 2: Hoare triple {13153#true} assume true; {13153#true} is VALID [2018-11-23 11:58:47,159 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13153#true} {13153#true} #120#return; {13153#true} is VALID [2018-11-23 11:58:47,159 INFO L256 TraceCheckUtils]: 4: Hoare triple {13153#true} call #t~ret15 := main(); {13153#true} is VALID [2018-11-23 11:58:47,159 INFO L273 TraceCheckUtils]: 5: Hoare triple {13153#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {13153#true} is VALID [2018-11-23 11:58:47,159 INFO L273 TraceCheckUtils]: 6: Hoare triple {13153#true} assume !(~x~0 < ~n~0); {13153#true} is VALID [2018-11-23 11:58:47,159 INFO L273 TraceCheckUtils]: 7: Hoare triple {13153#true} call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(400000);havoc ~v~0;~v~0 := 0; {13153#true} is VALID [2018-11-23 11:58:47,159 INFO L273 TraceCheckUtils]: 8: Hoare triple {13153#true} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {13153#true} is VALID [2018-11-23 11:58:47,160 INFO L256 TraceCheckUtils]: 9: Hoare triple {13153#true} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {13153#true} is VALID [2018-11-23 11:58:47,160 INFO L273 TraceCheckUtils]: 10: Hoare triple {13153#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {13153#true} is VALID [2018-11-23 11:58:47,160 INFO L273 TraceCheckUtils]: 11: Hoare triple {13153#true} assume !(~i~0 < ~size); {13153#true} is VALID [2018-11-23 11:58:47,160 INFO L273 TraceCheckUtils]: 12: Hoare triple {13153#true} #res := 0; {13153#true} is VALID [2018-11-23 11:58:47,160 INFO L273 TraceCheckUtils]: 13: Hoare triple {13153#true} assume true; {13153#true} is VALID [2018-11-23 11:58:47,161 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {13153#true} {13153#true} #126#return; {13153#true} is VALID [2018-11-23 11:58:47,161 INFO L273 TraceCheckUtils]: 15: Hoare triple {13153#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {13153#true} is VALID [2018-11-23 11:58:47,161 INFO L273 TraceCheckUtils]: 16: Hoare triple {13153#true} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {13153#true} is VALID [2018-11-23 11:58:47,161 INFO L256 TraceCheckUtils]: 17: Hoare triple {13153#true} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {13153#true} is VALID [2018-11-23 11:58:47,161 INFO L273 TraceCheckUtils]: 18: Hoare triple {13153#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; {13153#true} is VALID [2018-11-23 11:58:47,161 INFO L273 TraceCheckUtils]: 19: Hoare triple {13153#true} assume true; {13153#true} is VALID [2018-11-23 11:58:47,161 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {13153#true} {13153#true} #128#return; {13153#true} is VALID [2018-11-23 11:58:47,162 INFO L273 TraceCheckUtils]: 21: Hoare triple {13153#true} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~mem9;havoc #t~ret10; {13153#true} is VALID [2018-11-23 11:58:47,162 INFO L273 TraceCheckUtils]: 22: Hoare triple {13153#true} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {13153#true} is VALID [2018-11-23 11:58:47,162 INFO L273 TraceCheckUtils]: 23: Hoare triple {13153#true} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {13153#true} is VALID [2018-11-23 11:58:47,162 INFO L256 TraceCheckUtils]: 24: Hoare triple {13153#true} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {13153#true} is VALID [2018-11-23 11:58:47,162 INFO L273 TraceCheckUtils]: 25: Hoare triple {13153#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {13153#true} is VALID [2018-11-23 11:58:47,162 INFO L273 TraceCheckUtils]: 26: Hoare triple {13153#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {13153#true} is VALID [2018-11-23 11:58:47,163 INFO L273 TraceCheckUtils]: 27: Hoare triple {13153#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {13153#true} is VALID [2018-11-23 11:58:47,163 INFO L273 TraceCheckUtils]: 28: Hoare triple {13153#true} assume true; {13153#true} is VALID [2018-11-23 11:58:47,163 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {13153#true} {13153#true} #126#return; {13153#true} is VALID [2018-11-23 11:58:47,163 INFO L273 TraceCheckUtils]: 30: Hoare triple {13153#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {13153#true} is VALID [2018-11-23 11:58:47,163 INFO L273 TraceCheckUtils]: 31: Hoare triple {13153#true} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {13153#true} is VALID [2018-11-23 11:58:47,163 INFO L273 TraceCheckUtils]: 32: Hoare triple {13153#true} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {13153#true} is VALID [2018-11-23 11:58:47,164 INFO L273 TraceCheckUtils]: 33: Hoare triple {13153#true} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {13153#true} is VALID [2018-11-23 11:58:47,164 INFO L256 TraceCheckUtils]: 34: Hoare triple {13153#true} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {13153#true} is VALID [2018-11-23 11:58:47,164 INFO L273 TraceCheckUtils]: 35: Hoare triple {13153#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {13153#true} is VALID [2018-11-23 11:58:47,164 INFO L273 TraceCheckUtils]: 36: Hoare triple {13153#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {13153#true} is VALID [2018-11-23 11:58:47,164 INFO L273 TraceCheckUtils]: 37: Hoare triple {13153#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {13153#true} is VALID [2018-11-23 11:58:47,164 INFO L273 TraceCheckUtils]: 38: Hoare triple {13153#true} assume true; {13153#true} is VALID [2018-11-23 11:58:47,165 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {13153#true} {13153#true} #126#return; {13153#true} is VALID [2018-11-23 11:58:47,165 INFO L273 TraceCheckUtils]: 40: Hoare triple {13153#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {13153#true} is VALID [2018-11-23 11:58:47,165 INFO L273 TraceCheckUtils]: 41: Hoare triple {13153#true} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {13153#true} is VALID [2018-11-23 11:58:47,165 INFO L273 TraceCheckUtils]: 42: Hoare triple {13153#true} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {13153#true} is VALID [2018-11-23 11:58:47,165 INFO L273 TraceCheckUtils]: 43: Hoare triple {13153#true} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {13153#true} is VALID [2018-11-23 11:58:47,166 INFO L256 TraceCheckUtils]: 44: Hoare triple {13153#true} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {13153#true} is VALID [2018-11-23 11:58:47,166 INFO L273 TraceCheckUtils]: 45: Hoare triple {13153#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {13153#true} is VALID [2018-11-23 11:58:47,166 INFO L273 TraceCheckUtils]: 46: Hoare triple {13153#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {13153#true} is VALID [2018-11-23 11:58:47,166 INFO L273 TraceCheckUtils]: 47: Hoare triple {13153#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {13153#true} is VALID [2018-11-23 11:58:47,166 INFO L273 TraceCheckUtils]: 48: Hoare triple {13153#true} assume true; {13153#true} is VALID [2018-11-23 11:58:47,166 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {13153#true} {13153#true} #126#return; {13153#true} is VALID [2018-11-23 11:58:47,167 INFO L273 TraceCheckUtils]: 50: Hoare triple {13153#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {13153#true} is VALID [2018-11-23 11:58:47,167 INFO L273 TraceCheckUtils]: 51: Hoare triple {13153#true} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {13153#true} is VALID [2018-11-23 11:58:47,167 INFO L273 TraceCheckUtils]: 52: Hoare triple {13153#true} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {13153#true} is VALID [2018-11-23 11:58:47,167 INFO L273 TraceCheckUtils]: 53: Hoare triple {13153#true} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {13153#true} is VALID [2018-11-23 11:58:47,167 INFO L256 TraceCheckUtils]: 54: Hoare triple {13153#true} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {13153#true} is VALID [2018-11-23 11:58:47,167 INFO L273 TraceCheckUtils]: 55: Hoare triple {13153#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {13153#true} is VALID [2018-11-23 11:58:47,168 INFO L273 TraceCheckUtils]: 56: Hoare triple {13153#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {13153#true} is VALID [2018-11-23 11:58:47,168 INFO L273 TraceCheckUtils]: 57: Hoare triple {13153#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {13153#true} is VALID [2018-11-23 11:58:47,168 INFO L273 TraceCheckUtils]: 58: Hoare triple {13153#true} assume true; {13153#true} is VALID [2018-11-23 11:58:47,168 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {13153#true} {13153#true} #126#return; {13153#true} is VALID [2018-11-23 11:58:47,168 INFO L273 TraceCheckUtils]: 60: Hoare triple {13153#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {13153#true} is VALID [2018-11-23 11:58:47,168 INFO L273 TraceCheckUtils]: 61: Hoare triple {13153#true} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {13153#true} is VALID [2018-11-23 11:58:47,169 INFO L273 TraceCheckUtils]: 62: Hoare triple {13153#true} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {13153#true} is VALID [2018-11-23 11:58:47,169 INFO L273 TraceCheckUtils]: 63: Hoare triple {13153#true} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {13153#true} is VALID [2018-11-23 11:58:47,169 INFO L256 TraceCheckUtils]: 64: Hoare triple {13153#true} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {13153#true} is VALID [2018-11-23 11:58:47,169 INFO L273 TraceCheckUtils]: 65: Hoare triple {13153#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {13153#true} is VALID [2018-11-23 11:58:47,169 INFO L273 TraceCheckUtils]: 66: Hoare triple {13153#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {13153#true} is VALID [2018-11-23 11:58:47,169 INFO L273 TraceCheckUtils]: 67: Hoare triple {13153#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {13153#true} is VALID [2018-11-23 11:58:47,170 INFO L273 TraceCheckUtils]: 68: Hoare triple {13153#true} assume true; {13153#true} is VALID [2018-11-23 11:58:47,170 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {13153#true} {13153#true} #126#return; {13153#true} is VALID [2018-11-23 11:58:47,170 INFO L273 TraceCheckUtils]: 70: Hoare triple {13153#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {13153#true} is VALID [2018-11-23 11:58:47,170 INFO L273 TraceCheckUtils]: 71: Hoare triple {13153#true} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {13153#true} is VALID [2018-11-23 11:58:47,170 INFO L273 TraceCheckUtils]: 72: Hoare triple {13153#true} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {13153#true} is VALID [2018-11-23 11:58:47,170 INFO L273 TraceCheckUtils]: 73: Hoare triple {13153#true} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {13153#true} is VALID [2018-11-23 11:58:47,171 INFO L256 TraceCheckUtils]: 74: Hoare triple {13153#true} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {13153#true} is VALID [2018-11-23 11:58:47,171 INFO L273 TraceCheckUtils]: 75: Hoare triple {13153#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {13153#true} is VALID [2018-11-23 11:58:47,171 INFO L273 TraceCheckUtils]: 76: Hoare triple {13153#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {13153#true} is VALID [2018-11-23 11:58:47,171 INFO L273 TraceCheckUtils]: 77: Hoare triple {13153#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {13153#true} is VALID [2018-11-23 11:58:47,171 INFO L273 TraceCheckUtils]: 78: Hoare triple {13153#true} assume true; {13153#true} is VALID [2018-11-23 11:58:47,171 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {13153#true} {13153#true} #126#return; {13153#true} is VALID [2018-11-23 11:58:47,172 INFO L273 TraceCheckUtils]: 80: Hoare triple {13153#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {13153#true} is VALID [2018-11-23 11:58:47,172 INFO L273 TraceCheckUtils]: 81: Hoare triple {13153#true} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {13153#true} is VALID [2018-11-23 11:58:47,172 INFO L273 TraceCheckUtils]: 82: Hoare triple {13153#true} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {13153#true} is VALID [2018-11-23 11:58:47,172 INFO L273 TraceCheckUtils]: 83: Hoare triple {13153#true} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {13153#true} is VALID [2018-11-23 11:58:47,172 INFO L256 TraceCheckUtils]: 84: Hoare triple {13153#true} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {13153#true} is VALID [2018-11-23 11:58:47,172 INFO L273 TraceCheckUtils]: 85: Hoare triple {13153#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {13153#true} is VALID [2018-11-23 11:58:47,173 INFO L273 TraceCheckUtils]: 86: Hoare triple {13153#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {13153#true} is VALID [2018-11-23 11:58:47,173 INFO L273 TraceCheckUtils]: 87: Hoare triple {13153#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {13153#true} is VALID [2018-11-23 11:58:47,173 INFO L273 TraceCheckUtils]: 88: Hoare triple {13153#true} assume true; {13153#true} is VALID [2018-11-23 11:58:47,173 INFO L268 TraceCheckUtils]: 89: Hoare quadruple {13153#true} {13153#true} #126#return; {13153#true} is VALID [2018-11-23 11:58:47,173 INFO L273 TraceCheckUtils]: 90: Hoare triple {13153#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {13153#true} is VALID [2018-11-23 11:58:47,173 INFO L273 TraceCheckUtils]: 91: Hoare triple {13153#true} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {13153#true} is VALID [2018-11-23 11:58:47,174 INFO L273 TraceCheckUtils]: 92: Hoare triple {13153#true} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {13153#true} is VALID [2018-11-23 11:58:47,174 INFO L273 TraceCheckUtils]: 93: Hoare triple {13153#true} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {13153#true} is VALID [2018-11-23 11:58:47,174 INFO L256 TraceCheckUtils]: 94: Hoare triple {13153#true} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {13153#true} is VALID [2018-11-23 11:58:47,174 INFO L273 TraceCheckUtils]: 95: Hoare triple {13153#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {13153#true} is VALID [2018-11-23 11:58:47,174 INFO L273 TraceCheckUtils]: 96: Hoare triple {13153#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {13153#true} is VALID [2018-11-23 11:58:47,174 INFO L273 TraceCheckUtils]: 97: Hoare triple {13153#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {13153#true} is VALID [2018-11-23 11:58:47,175 INFO L273 TraceCheckUtils]: 98: Hoare triple {13153#true} assume true; {13153#true} is VALID [2018-11-23 11:58:47,175 INFO L268 TraceCheckUtils]: 99: Hoare quadruple {13153#true} {13153#true} #126#return; {13153#true} is VALID [2018-11-23 11:58:47,175 INFO L273 TraceCheckUtils]: 100: Hoare triple {13153#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {13153#true} is VALID [2018-11-23 11:58:47,175 INFO L273 TraceCheckUtils]: 101: Hoare triple {13153#true} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {13153#true} is VALID [2018-11-23 11:58:47,175 INFO L273 TraceCheckUtils]: 102: Hoare triple {13153#true} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {13153#true} is VALID [2018-11-23 11:58:47,176 INFO L273 TraceCheckUtils]: 103: Hoare triple {13153#true} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {13153#true} is VALID [2018-11-23 11:58:47,176 INFO L256 TraceCheckUtils]: 104: Hoare triple {13153#true} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {13153#true} is VALID [2018-11-23 11:58:47,176 INFO L273 TraceCheckUtils]: 105: Hoare triple {13153#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {13153#true} is VALID [2018-11-23 11:58:47,176 INFO L273 TraceCheckUtils]: 106: Hoare triple {13153#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {13153#true} is VALID [2018-11-23 11:58:47,176 INFO L273 TraceCheckUtils]: 107: Hoare triple {13153#true} assume !(#t~mem1 == ~value);havoc #t~mem1; {13153#true} is VALID [2018-11-23 11:58:47,176 INFO L273 TraceCheckUtils]: 108: Hoare triple {13153#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13153#true} is VALID [2018-11-23 11:58:47,177 INFO L273 TraceCheckUtils]: 109: Hoare triple {13153#true} assume !(~i~0 < ~size); {13153#true} is VALID [2018-11-23 11:58:47,177 INFO L273 TraceCheckUtils]: 110: Hoare triple {13153#true} #res := 0; {13153#true} is VALID [2018-11-23 11:58:47,177 INFO L273 TraceCheckUtils]: 111: Hoare triple {13153#true} assume true; {13153#true} is VALID [2018-11-23 11:58:47,177 INFO L268 TraceCheckUtils]: 112: Hoare quadruple {13153#true} {13153#true} #126#return; {13153#true} is VALID [2018-11-23 11:58:47,177 INFO L273 TraceCheckUtils]: 113: Hoare triple {13153#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {13153#true} is VALID [2018-11-23 11:58:47,177 INFO L273 TraceCheckUtils]: 114: Hoare triple {13153#true} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {13153#true} is VALID [2018-11-23 11:58:47,178 INFO L256 TraceCheckUtils]: 115: Hoare triple {13153#true} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {13153#true} is VALID [2018-11-23 11:58:47,178 INFO L273 TraceCheckUtils]: 116: Hoare triple {13153#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; {13153#true} is VALID [2018-11-23 11:58:47,178 INFO L273 TraceCheckUtils]: 117: Hoare triple {13153#true} assume true; {13153#true} is VALID [2018-11-23 11:58:47,178 INFO L268 TraceCheckUtils]: 118: Hoare quadruple {13153#true} {13153#true} #128#return; {13153#true} is VALID [2018-11-23 11:58:47,178 INFO L273 TraceCheckUtils]: 119: Hoare triple {13153#true} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~mem9;havoc #t~ret10; {13153#true} is VALID [2018-11-23 11:58:47,178 INFO L273 TraceCheckUtils]: 120: Hoare triple {13153#true} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {13153#true} is VALID [2018-11-23 11:58:47,179 INFO L273 TraceCheckUtils]: 121: Hoare triple {13153#true} assume !(~v~0 < 100000); {13153#true} is VALID [2018-11-23 11:58:47,179 INFO L273 TraceCheckUtils]: 122: Hoare triple {13153#true} ~x~0 := 0; {13153#true} is VALID [2018-11-23 11:58:47,198 INFO L273 TraceCheckUtils]: 123: Hoare triple {13153#true} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {13155#(<= main_~y~0 (+ main_~x~0 1))} is VALID [2018-11-23 11:58:47,207 INFO L273 TraceCheckUtils]: 124: Hoare triple {13155#(<= main_~y~0 (+ main_~x~0 1))} assume !(~y~0 < ~n~0); {13156#(<= main_~n~0 (+ main_~x~0 1))} is VALID [2018-11-23 11:58:47,220 INFO L273 TraceCheckUtils]: 125: Hoare triple {13156#(<= main_~n~0 (+ main_~x~0 1))} #t~post11 := ~x~0;~x~0 := 1 + #t~post11;havoc #t~post11; {13157#(<= main_~n~0 main_~x~0)} is VALID [2018-11-23 11:58:47,232 INFO L273 TraceCheckUtils]: 126: Hoare triple {13157#(<= main_~n~0 main_~x~0)} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {13154#false} is VALID [2018-11-23 11:58:47,233 INFO L273 TraceCheckUtils]: 127: Hoare triple {13154#false} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {13154#false} is VALID [2018-11-23 11:58:47,233 INFO L256 TraceCheckUtils]: 128: Hoare triple {13154#false} call __VERIFIER_assert((if #t~mem13 != #t~mem14 then 1 else 0)); {13154#false} is VALID [2018-11-23 11:58:47,233 INFO L273 TraceCheckUtils]: 129: Hoare triple {13154#false} ~cond := #in~cond; {13154#false} is VALID [2018-11-23 11:58:47,233 INFO L273 TraceCheckUtils]: 130: Hoare triple {13154#false} assume 0 == ~cond; {13154#false} is VALID [2018-11-23 11:58:47,234 INFO L273 TraceCheckUtils]: 131: Hoare triple {13154#false} assume !false; {13154#false} is VALID [2018-11-23 11:58:47,241 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 467 trivial. 0 not checked. [2018-11-23 11:58:47,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:58:47,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:58:47,242 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2018-11-23 11:58:47,243 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:47,243 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:58:47,293 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:47,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:58:47,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:58:47,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:58:47,294 INFO L87 Difference]: Start difference. First operand 330 states and 472 transitions. Second operand 5 states.