java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/array-examples/data_structures_set_multi_proc_ground-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:32:25,250 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:32:25,253 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:32:25,265 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:32:25,265 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:32:25,266 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:32:25,268 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:32:25,269 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:32:25,271 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:32:25,272 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:32:25,273 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:32:25,274 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:32:25,275 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:32:25,276 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:32:25,277 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:32:25,278 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:32:25,279 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:32:25,280 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:32:25,281 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:32:25,283 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:32:25,285 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:32:25,286 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:32:25,288 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:32:25,288 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:32:25,291 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:32:25,291 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:32:25,291 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:32:25,292 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:32:25,293 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:32:25,294 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:32:25,294 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:32:25,295 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:32:25,295 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:32:25,296 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:32:25,297 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:32:25,298 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:32:25,298 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:32:25,298 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:32:25,299 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:32:25,300 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:32:25,300 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:32:25,301 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:32:25,315 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:32:25,316 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:32:25,317 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:32:25,317 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:32:25,317 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:32:25,317 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:32:25,318 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:32:25,318 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:32:25,318 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:32:25,318 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:32:25,319 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:32:25,319 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:32:25,319 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:32:25,319 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:32:25,319 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:32:25,319 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:32:25,320 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:32:25,320 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:32:25,320 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:32:25,320 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:32:25,321 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:32:25,321 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:32:25,321 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:32:25,321 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:32:25,321 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:32:25,322 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:32:25,322 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:32:25,322 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:32:25,322 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-13 21:32:25,650 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:32:25,664 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:32:25,667 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:32:25,669 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:32:25,669 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:32:25,670 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/data_structures_set_multi_proc_ground-2.i [2019-10-13 21:32:25,750 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d77e4393/8e15f5c7f1304b6790c6e23f29612d36/FLAGa0affd1f1 [2019-10-13 21:32:26,236 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:32:26,237 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/data_structures_set_multi_proc_ground-2.i [2019-10-13 21:32:26,243 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d77e4393/8e15f5c7f1304b6790c6e23f29612d36/FLAGa0affd1f1 [2019-10-13 21:32:26,578 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d77e4393/8e15f5c7f1304b6790c6e23f29612d36 [2019-10-13 21:32:26,587 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:32:26,588 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:32:26,589 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:32:26,589 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:32:26,593 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:32:26,594 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:32:26" (1/1) ... [2019-10-13 21:32:26,597 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4621a2b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:26, skipping insertion in model container [2019-10-13 21:32:26,597 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:32:26" (1/1) ... [2019-10-13 21:32:26,606 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:32:26,625 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:32:26,837 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:32:26,846 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:32:26,870 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:32:26,886 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:32:26,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:26 WrapperNode [2019-10-13 21:32:26,887 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:32:26,887 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:32:26,888 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:32:26,888 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:32:26,975 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:26" (1/1) ... [2019-10-13 21:32:26,975 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:26" (1/1) ... [2019-10-13 21:32:26,985 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:26" (1/1) ... [2019-10-13 21:32:26,986 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:26" (1/1) ... [2019-10-13 21:32:26,996 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:26" (1/1) ... [2019-10-13 21:32:27,003 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:26" (1/1) ... [2019-10-13 21:32:27,007 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:26" (1/1) ... [2019-10-13 21:32:27,010 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:32:27,011 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:32:27,011 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:32:27,011 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:32:27,015 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32: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 [2019-10-13 21:32:27,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:32:27,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:32:27,072 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 21:32:27,072 INFO L138 BoogieDeclarations]: Found implementation of procedure insert [2019-10-13 21:32:27,072 INFO L138 BoogieDeclarations]: Found implementation of procedure elem_exists [2019-10-13 21:32:27,073 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:32:27,074 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:32:27,074 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:32:27,074 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:32:27,074 INFO L130 BoogieDeclarations]: Found specification of procedure insert [2019-10-13 21:32:27,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:32:27,075 INFO L130 BoogieDeclarations]: Found specification of procedure elem_exists [2019-10-13 21:32:27,075 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:32:27,075 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:32:27,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:32:27,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:32:27,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:32:27,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:32:27,595 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:32:27,595 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-13 21:32:27,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:32:27 BoogieIcfgContainer [2019-10-13 21:32:27,597 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:32:27,598 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:32:27,598 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:32:27,600 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:32:27,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:32:26" (1/3) ... [2019-10-13 21:32:27,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@300bf09f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:32:27, skipping insertion in model container [2019-10-13 21:32:27,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:26" (2/3) ... [2019-10-13 21:32:27,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@300bf09f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:32:27, skipping insertion in model container [2019-10-13 21:32:27,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:32:27" (3/3) ... [2019-10-13 21:32:27,604 INFO L109 eAbstractionObserver]: Analyzing ICFG data_structures_set_multi_proc_ground-2.i [2019-10-13 21:32:27,611 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:32:27,618 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:32:27,630 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:32:27,655 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:32:27,655 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:32:27,655 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:32:27,655 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:32:27,656 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:32:27,656 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:32:27,656 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:32:27,656 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:32:27,671 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2019-10-13 21:32:27,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-13 21:32:27,677 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:27,678 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:27,680 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:27,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:27,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1511676476, now seen corresponding path program 1 times [2019-10-13 21:32:27,694 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:27,694 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442683318] [2019-10-13 21:32:27,695 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:27,695 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:27,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:27,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:27,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:32:27,853 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442683318] [2019-10-13 21:32:27,855 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:32:27,856 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:32:27,857 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849566837] [2019-10-13 21:32:27,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:32:27,863 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:27,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:32:27,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:32:27,876 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 3 states. [2019-10-13 21:32:27,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:27,956 INFO L93 Difference]: Finished difference Result 88 states and 125 transitions. [2019-10-13 21:32:27,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:32:27,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-13 21:32:27,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:27,971 INFO L225 Difference]: With dead ends: 88 [2019-10-13 21:32:27,972 INFO L226 Difference]: Without dead ends: 52 [2019-10-13 21:32:27,976 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:32:27,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-10-13 21:32:28,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 36. [2019-10-13 21:32:28,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-13 21:32:28,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2019-10-13 21:32:28,032 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 12 [2019-10-13 21:32:28,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:28,033 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 46 transitions. [2019-10-13 21:32:28,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:32:28,033 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2019-10-13 21:32:28,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 21:32:28,035 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:28,035 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:28,036 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:28,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:28,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1775930285, now seen corresponding path program 1 times [2019-10-13 21:32:28,037 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:28,037 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722284604] [2019-10-13 21:32:28,037 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:28,038 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:28,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:28,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:28,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:32:28,178 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722284604] [2019-10-13 21:32:28,178 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:32:28,178 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:32:28,178 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051855521] [2019-10-13 21:32:28,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:32:28,180 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:28,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:32:28,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:32:28,181 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. Second operand 5 states. [2019-10-13 21:32:28,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:28,253 INFO L93 Difference]: Finished difference Result 70 states and 91 transitions. [2019-10-13 21:32:28,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:32:28,254 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-10-13 21:32:28,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:28,255 INFO L225 Difference]: With dead ends: 70 [2019-10-13 21:32:28,255 INFO L226 Difference]: Without dead ends: 40 [2019-10-13 21:32:28,257 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:32:28,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-13 21:32:28,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2019-10-13 21:32:28,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-13 21:32:28,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2019-10-13 21:32:28,266 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 13 [2019-10-13 21:32:28,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:28,266 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2019-10-13 21:32:28,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:32:28,267 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2019-10-13 21:32:28,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 21:32:28,268 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:28,268 INFO L380 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] [2019-10-13 21:32:28,268 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:28,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:28,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1000416666, now seen corresponding path program 1 times [2019-10-13 21:32:28,269 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:28,269 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258555928] [2019-10-13 21:32:28,270 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:28,270 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:28,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:28,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:28,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:32:28,331 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258555928] [2019-10-13 21:32:28,332 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:32:28,332 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:32:28,332 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590678697] [2019-10-13 21:32:28,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:32:28,333 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:28,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:32:28,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:32:28,334 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. Second operand 3 states. [2019-10-13 21:32:28,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:28,370 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2019-10-13 21:32:28,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:32:28,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-13 21:32:28,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:28,376 INFO L225 Difference]: With dead ends: 76 [2019-10-13 21:32:28,376 INFO L226 Difference]: Without dead ends: 47 [2019-10-13 21:32:28,377 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:32:28,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-13 21:32:28,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 39. [2019-10-13 21:32:28,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-13 21:32:28,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2019-10-13 21:32:28,386 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 29 [2019-10-13 21:32:28,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:28,386 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2019-10-13 21:32:28,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:32:28,387 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2019-10-13 21:32:28,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-13 21:32:28,388 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:28,388 INFO L380 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] [2019-10-13 21:32:28,389 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:28,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:28,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1697925591, now seen corresponding path program 1 times [2019-10-13 21:32:28,389 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:28,390 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252252422] [2019-10-13 21:32:28,390 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:28,390 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:28,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:28,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:28,510 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:32:28,511 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252252422] [2019-10-13 21:32:28,512 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691498442] [2019-10-13 21:32:28,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:32:28,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:28,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:32:28,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:32:28,635 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:32:28,636 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:32:28,680 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:32:28,680 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [755016358] [2019-10-13 21:32:28,710 INFO L162 IcfgInterpreter]: Started Sifa with 28 locations of interest [2019-10-13 21:32:28,710 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:32:28,717 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:32:28,725 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:32:28,726 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:32:28,922 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:32:33,350 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 1 for LOIs [2019-10-13 21:32:33,355 INFO L199 IcfgInterpreter]: Interpreting procedure insert with input of size 7 for LOIs [2019-10-13 21:32:33,359 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:32:33,362 INFO L199 IcfgInterpreter]: Interpreting procedure elem_exists with input of size 42 for LOIs [2019-10-13 21:32:33,372 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:32:33,372 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:32:33,373 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 1963#false [2019-10-13 21:32:33,373 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 1968#false [2019-10-13 21:32:33,373 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 73#(and (= main_~x~0 0) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:32:33,373 INFO L193 IcfgInterpreter]: Reachable states at location elem_existsFINAL satisfy 2005#(and (<= |elem_exists_#res| 0) (<= elem_exists_~size 0) (= elem_exists_~size |elem_exists_#in~size|) (not (< elem_exists_~i~0 elem_exists_~size)) (= elem_exists_~set.base |elem_exists_#in~set.base|) (= elem_exists_~value |elem_exists_#in~value|) (exists ((v_prenex_27 Int) (v_prenex_29 Int) (v_prenex_28 Int) (|v_main_~#values~0.base_BEFORE_CALL_53| Int) (v_main_~v~0_BEFORE_CALL_73 Int)) (or (and (= |elem_exists_#in~value| (select (select |#memory_int| v_prenex_27) 0)) (<= |elem_exists_#in~size| 0)) (and (<= |elem_exists_#in~size| 1) (<= 1 v_prenex_29) (<= |elem_exists_#in~size| 0) (<= 0 v_prenex_29) (<= |elem_exists_#in~size| 2147483647) (<= v_prenex_29 0) (< v_prenex_29 100000) (= (select (select |#memory_int| v_prenex_28) (* v_prenex_29 4)) |elem_exists_#in~value|) (<= 0 (+ |elem_exists_#in~size| 2147483648))) (and (<= |elem_exists_#in~size| 1) (<= 1 v_main_~v~0_BEFORE_CALL_73) (< v_main_~v~0_BEFORE_CALL_73 100000) (<= |elem_exists_#in~size| 2147483647) (<= v_main_~v~0_BEFORE_CALL_73 100000) (= (select (select |#memory_int| |v_main_~#values~0.base_BEFORE_CALL_53|) (* v_main_~v~0_BEFORE_CALL_73 4)) |elem_exists_#in~value|) (<= 0 (+ |elem_exists_#in~size| 2147483648))))) (= |elem_exists_#in~set.offset| elem_exists_~set.offset) (<= |elem_exists_#in~size| 0) (= |elem_exists_#res| 0) (<= 0 elem_exists_~i~0) (<= elem_exists_~i~0 0) (= elem_exists_~i~0 0) (<= 0 |elem_exists_#res|)) [2019-10-13 21:32:33,374 INFO L193 IcfgInterpreter]: Reachable states at location L47 satisfy 1949#(and (<= main_~n~0 2147483647) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 1 main_~v~0) (<= |main_~#values~0.offset| 0) (<= 0 (+ main_~n~0 2147483648)) (< main_~x~0 main_~n~0) (<= 0 |main_~#values~0.offset|) (<= main_~x~0 0) (<= 0 main_~x~0) (= |main_#t~mem18| (select (select |#memory_int| |main_~#set~0.base|) (+ |main_~#set~0.offset| (* main_~y~0 4)))) (= main_~x~0 0) (not (< main_~v~0 100000)) (<= 1 main_~n~0) (<= main_~n~0 1) (= |main_#t~mem17| (select (select |#memory_int| |main_~#set~0.base|) (+ |main_~#set~0.offset| (* main_~x~0 4)))) (<= 100000 main_~v~0) (< main_~y~0 main_~n~0) (<= main_~y~0 1) (= |main_~#values~0.offset| 0)) [2019-10-13 21:32:33,374 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 1419#(and (or (and (<= main_~n~0 0) (<= main_~v~0 0) (= main_~v~0 0) (= main_~x~0 0) (<= |main_~#values~0.offset| 0) (= |main_~#values~0.offset| 0)) (and (<= main_~n~0 2147483647) (= main_~x~0 0) (<= 1 main_~v~0) (<= |main_~#values~0.offset| 0) (<= 0 (+ main_~n~0 2147483648)) (= |main_~#values~0.offset| 0))) (<= 0 main_~v~0) (<= main_~n~0 1) (<= main_~x~0 0) (<= 0 |main_~#values~0.offset|) (<= 0 main_~x~0)) [2019-10-13 21:32:33,374 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:33,374 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:33,375 INFO L193 IcfgInterpreter]: Reachable states at location L40-2 satisfy 1544#(and (<= main_~n~0 2147483647) (= main_~x~0 0) (<= |main_~#values~0.offset| 0) (<= 0 (+ main_~n~0 2147483648)) (<= main_~n~0 1) (<= 0 main_~v~0) (<= main_~x~0 0) (<= 0 |main_~#values~0.offset|) (= |main_~#values~0.offset| 0) (<= 0 main_~x~0)) [2019-10-13 21:32:33,375 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 68#true [2019-10-13 21:32:33,375 INFO L193 IcfgInterpreter]: Reachable states at location L42-1 satisfy 1766#(and (and (<= main_~n~0 0) (= main_~x~0 0) (= |main_~#values~0.offset| 0)) (<= |main_~#values~0.offset| 0) (<= 0 main_~v~0) (<= main_~x~0 0) (<= 0 |main_~#values~0.offset|) (<= 0 main_~x~0) (<= |main_#t~ret14| 1)) [2019-10-13 21:32:33,375 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 2000#(and (exists ((v_prenex_27 Int) (v_prenex_29 Int) (v_prenex_28 Int) (|v_main_~#values~0.base_BEFORE_CALL_53| Int) (v_main_~v~0_BEFORE_CALL_73 Int)) (or (and (= |elem_exists_#in~value| (select (select |#memory_int| v_prenex_27) 0)) (<= |elem_exists_#in~size| 0)) (and (<= |elem_exists_#in~size| 1) (<= 1 v_prenex_29) (<= |elem_exists_#in~size| 0) (<= 0 v_prenex_29) (<= |elem_exists_#in~size| 2147483647) (<= v_prenex_29 0) (< v_prenex_29 100000) (= (select (select |#memory_int| v_prenex_28) (* v_prenex_29 4)) |elem_exists_#in~value|) (<= 0 (+ |elem_exists_#in~size| 2147483648))) (and (<= |elem_exists_#in~size| 1) (<= 1 v_main_~v~0_BEFORE_CALL_73) (< v_main_~v~0_BEFORE_CALL_73 100000) (<= |elem_exists_#in~size| 2147483647) (<= v_main_~v~0_BEFORE_CALL_73 100000) (= (select (select |#memory_int| |v_main_~#values~0.base_BEFORE_CALL_53|) (* v_main_~v~0_BEFORE_CALL_73 4)) |elem_exists_#in~value|) (<= 0 (+ |elem_exists_#in~size| 2147483648))))) (= |elem_exists_#in~set.offset| elem_exists_~set.offset) (<= 0 elem_exists_~i~0) (= elem_exists_~size |elem_exists_#in~size|) (<= elem_exists_~i~0 0) (= elem_exists_~i~0 0) (= elem_exists_~set.base |elem_exists_#in~set.base|) (= elem_exists_~value |elem_exists_#in~value|)) [2019-10-13 21:32:33,376 INFO L193 IcfgInterpreter]: Reachable states at location L42 satisfy 1867#(and (<= main_~n~0 0) (= main_~x~0 0) (<= |main_~#values~0.offset| 0) (<= 0 main_~v~0) (<= main_~x~0 0) (<= 0 |main_~#values~0.offset|) (= |main_~#values~0.offset| 0) (<= 0 main_~x~0)) [2019-10-13 21:32:33,377 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 111#(and (or (and (<= main_~n~0 0) (not (= 0 |main_~#values~0.base|)) (<= main_~v~0 0) (< |main_~#values~0.base| |#StackHeapBarrier|) (= 0 |main_~#values~0.offset|) (= main_~v~0 0) (= main_~x~0 0) (not (< main_~x~0 main_~n~0)) (= (select |#length| |main_~#values~0.base|) 400000) (= (select |#valid| |main_~#values~0.base|) 1)) (and (<= main_~n~0 0) (= main_~x~0 0) (= |main_~#values~0.offset| 0))) (<= |main_~#values~0.offset| 0) (<= 0 main_~v~0) (<= main_~x~0 0) (<= 0 |main_~#values~0.offset|) (<= 0 main_~x~0)) [2019-10-13 21:32:33,379 INFO L193 IcfgInterpreter]: Reachable states at location L46-3 satisfy 1954#(and (<= 0 main_~n~0) (<= main_~n~0 2147483647) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 1 main_~v~0) (<= |main_~#values~0.offset| 0) (<= 0 (+ main_~n~0 2147483648)) (< main_~x~0 main_~n~0) (<= 0 |main_~#values~0.offset|) (<= main_~x~0 0) (<= 0 main_~x~0) (= main_~x~0 0) (not (< main_~v~0 100000)) (<= main_~n~0 1) (<= 100000 main_~v~0) (<= main_~y~0 1) (= |main_~#values~0.offset| 0)) [2019-10-13 21:32:33,379 INFO L193 IcfgInterpreter]: Reachable states at location insertEXIT satisfy 1982#(and (= insert_~set.base |insert_#in~set.base|) (<= insert_~size 0) (<= |insert_#in~size| 0) (= |insert_#in~value| insert_~value) (= |insert_#in~set.offset| insert_~set.offset) (= |#memory_int| (store |old(#memory_int)| insert_~set.base (store (select |old(#memory_int)| insert_~set.base) (+ insert_~set.offset (* insert_~size 4)) insert_~value))) (<= |insert_#res| 1) (= |insert_#res| (+ insert_~size 1)) (= |insert_#in~size| insert_~size)) [2019-10-13 21:32:33,379 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 1986#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:32:33,379 INFO L193 IcfgInterpreter]: Reachable states at location elem_existsENTRY satisfy 1995#(exists ((v_prenex_27 Int) (v_prenex_29 Int) (v_prenex_28 Int) (|v_main_~#values~0.base_BEFORE_CALL_53| Int) (v_main_~v~0_BEFORE_CALL_73 Int)) (or (and (= |elem_exists_#in~value| (select (select |#memory_int| v_prenex_27) 0)) (<= |elem_exists_#in~size| 0)) (and (<= |elem_exists_#in~size| 1) (<= 1 v_prenex_29) (<= |elem_exists_#in~size| 0) (<= 0 v_prenex_29) (<= |elem_exists_#in~size| 2147483647) (<= v_prenex_29 0) (< v_prenex_29 100000) (= (select (select |#memory_int| v_prenex_28) (* v_prenex_29 4)) |elem_exists_#in~value|) (<= 0 (+ |elem_exists_#in~size| 2147483648))) (and (<= |elem_exists_#in~size| 1) (<= 1 v_main_~v~0_BEFORE_CALL_73) (< v_main_~v~0_BEFORE_CALL_73 100000) (<= |elem_exists_#in~size| 2147483647) (<= v_main_~v~0_BEFORE_CALL_73 100000) (= (select (select |#memory_int| |v_main_~#values~0.base_BEFORE_CALL_53|) (* v_main_~v~0_BEFORE_CALL_73 4)) |elem_exists_#in~value|) (<= 0 (+ |elem_exists_#in~size| 2147483648))))) [2019-10-13 21:32:33,380 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 1991#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:33,380 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:32:33,380 INFO L193 IcfgInterpreter]: Reachable states at location L41-2 satisfy 1923#(or (and (<= main_~n~0 0) (<= |main_#t~ret12| 0) (<= |main_~#values~0.offset| 0) (<= main_~v~0 100000) (<= 0 main_~v~0) (<= main_~x~0 0) (<= 0 |main_~#values~0.offset|) (<= 0 |main_#t~ret12|) (<= 0 main_~x~0) (= main_~x~0 0) (<= 0 (+ |main_#t~ret12| 2147483648)) (<= |main_#t~ret12| 2147483647) (= |main_~#values~0.offset| 0) (= |main_#t~ret12| 0)) (and (<= main_~n~0 0) (<= main_~v~0 0) (<= |main_#t~ret12| 0) (<= |main_~#values~0.offset| 0) (<= 0 main_~v~0) (<= main_~x~0 0) (<= 0 |main_~#values~0.offset|) (<= 0 |main_#t~ret12|) (<= 0 main_~x~0) (= main_~v~0 0) (= main_~x~0 0) (<= 0 (+ |main_#t~ret12| 2147483648)) (< main_~v~0 100000) (<= |main_#t~ret12| 2147483647) (= |main_#t~mem11| (select (select |#memory_int| |main_~#values~0.base|) (+ (* main_~v~0 4) |main_~#values~0.offset|))) (= |main_#t~ret12| 0) (= |main_~#values~0.offset| 0))) [2019-10-13 21:32:33,381 INFO L193 IcfgInterpreter]: Reachable states at location insertENTRY satisfy 1977#(and (<= |insert_#in~size| 0) (= |#memory_int| |old(#memory_int)|)) [2019-10-13 21:32:33,382 INFO L193 IcfgInterpreter]: Reachable states at location elem_existsEXIT satisfy 2010#(and (<= |elem_exists_#res| 0) (<= elem_exists_~size 0) (= elem_exists_~size |elem_exists_#in~size|) (not (< elem_exists_~i~0 elem_exists_~size)) (= elem_exists_~set.base |elem_exists_#in~set.base|) (= elem_exists_~value |elem_exists_#in~value|) (exists ((v_prenex_27 Int) (v_prenex_29 Int) (v_prenex_28 Int) (|v_main_~#values~0.base_BEFORE_CALL_53| Int) (v_main_~v~0_BEFORE_CALL_73 Int)) (or (and (= |elem_exists_#in~value| (select (select |#memory_int| v_prenex_27) 0)) (<= |elem_exists_#in~size| 0)) (and (<= |elem_exists_#in~size| 1) (<= 1 v_prenex_29) (<= |elem_exists_#in~size| 0) (<= 0 v_prenex_29) (<= |elem_exists_#in~size| 2147483647) (<= v_prenex_29 0) (< v_prenex_29 100000) (= (select (select |#memory_int| v_prenex_28) (* v_prenex_29 4)) |elem_exists_#in~value|) (<= 0 (+ |elem_exists_#in~size| 2147483648))) (and (<= |elem_exists_#in~size| 1) (<= 1 v_main_~v~0_BEFORE_CALL_73) (< v_main_~v~0_BEFORE_CALL_73 100000) (<= |elem_exists_#in~size| 2147483647) (<= v_main_~v~0_BEFORE_CALL_73 100000) (= (select (select |#memory_int| |v_main_~#values~0.base_BEFORE_CALL_53|) (* v_main_~v~0_BEFORE_CALL_73 4)) |elem_exists_#in~value|) (<= 0 (+ |elem_exists_#in~size| 2147483648))))) (= |elem_exists_#in~set.offset| elem_exists_~set.offset) (<= |elem_exists_#in~size| 0) (= |elem_exists_#res| 0) (<= 0 elem_exists_~i~0) (<= elem_exists_~i~0 0) (= elem_exists_~i~0 0) (<= 0 |elem_exists_#res|)) [2019-10-13 21:32:33,382 INFO L193 IcfgInterpreter]: Reachable states at location L41-1 satisfy 1910#(and (<= main_~n~0 0) (= main_~x~0 0) (<= |main_#t~ret12| 0) (<= |main_~#values~0.offset| 0) (<= main_~v~0 100000) (<= 0 main_~v~0) (<= main_~x~0 0) (<= 0 |main_~#values~0.offset|) (<= 0 |main_#t~ret12|) (= |main_~#values~0.offset| 0) (= |main_#t~ret12| 0) (<= 0 main_~x~0)) [2019-10-13 21:32:33,382 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 1958#false [2019-10-13 21:32:33,382 INFO L193 IcfgInterpreter]: Reachable states at location L41 satisfy 1289#(and (and (= main_~x~0 0) (= |main_~#values~0.offset| 0)) (<= |main_~#values~0.offset| 0) (<= main_~v~0 100000) (<= 0 main_~v~0) (<= main_~n~0 1) (<= main_~x~0 0) (<= 0 |main_~#values~0.offset|) (<= 0 main_~x~0)) [2019-10-13 21:32:33,383 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 1973#false [2019-10-13 21:32:33,384 INFO L193 IcfgInterpreter]: Reachable states at location L45-3 satisfy 1928#(and (<= 0 (+ main_~n~0 2147483648)) (<= main_~n~0 1) (<= 100000 main_~v~0) (<= main_~x~0 0) (or (and (<= main_~n~0 2147483647) (= main_~x~0 0) (<= 1 main_~v~0) (not (< main_~v~0 100000)) (<= |main_~#values~0.offset| 0) (<= 0 |main_~#values~0.offset|) (= |main_~#values~0.offset| 0)) (and (<= main_~n~0 0) (= main_~v~0 0) (= main_~x~0 0) (not (< main_~v~0 100000)) (<= |main_~#values~0.offset| 0) (<= 0 |main_~#values~0.offset|) (= |main_~#values~0.offset| 0))) (<= 0 main_~x~0)) [2019-10-13 21:32:34,382 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-13 21:32:34,383 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [4, 4, 4] total 24 [2019-10-13 21:32:34,383 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054416435] [2019-10-13 21:32:34,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-13 21:32:34,387 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:34,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-13 21:32:34,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2019-10-13 21:32:34,388 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand 20 states. [2019-10-13 21:32:36,312 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2019-10-13 21:32:36,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:36,954 INFO L93 Difference]: Finished difference Result 112 states and 149 transitions. [2019-10-13 21:32:36,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-13 21:32:36,955 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2019-10-13 21:32:36,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:36,958 INFO L225 Difference]: With dead ends: 112 [2019-10-13 21:32:36,959 INFO L226 Difference]: Without dead ends: 83 [2019-10-13 21:32:36,961 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 68 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 590 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=405, Invalid=1757, Unknown=0, NotChecked=0, Total=2162 [2019-10-13 21:32:36,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-10-13 21:32:36,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 60. [2019-10-13 21:32:36,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-13 21:32:36,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 75 transitions. [2019-10-13 21:32:36,983 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 75 transitions. Word has length 30 [2019-10-13 21:32:36,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:36,984 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 75 transitions. [2019-10-13 21:32:36,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-13 21:32:36,984 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2019-10-13 21:32:36,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-13 21:32:36,986 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:36,986 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:37,189 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:32:37,190 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:37,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:37,190 INFO L82 PathProgramCache]: Analyzing trace with hash 545937229, now seen corresponding path program 1 times [2019-10-13 21:32:37,191 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:37,191 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086199050] [2019-10-13 21:32:37,192 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:37,192 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:37,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:37,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:37,345 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:32:37,345 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086199050] [2019-10-13 21:32:37,346 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628797965] [2019-10-13 21:32:37,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:32:37,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:37,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:32:37,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:32:37,595 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:32:37,595 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:32:37,645 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:32:37,645 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [780989706] [2019-10-13 21:32:37,649 INFO L162 IcfgInterpreter]: Started Sifa with 28 locations of interest [2019-10-13 21:32:37,651 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:32:37,652 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:32:37,652 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:32:37,653 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:32:37,694 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:32:42,041 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 1 for LOIs [2019-10-13 21:32:42,045 INFO L199 IcfgInterpreter]: Interpreting procedure insert with input of size 7 for LOIs [2019-10-13 21:32:42,049 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:32:42,052 INFO L199 IcfgInterpreter]: Interpreting procedure elem_exists with input of size 34 for LOIs [2019-10-13 21:32:42,063 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:32:42,063 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:32:42,063 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 2062#false [2019-10-13 21:32:42,064 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 2067#false [2019-10-13 21:32:42,064 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 73#(and (= main_~x~0 0) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:32:42,064 INFO L193 IcfgInterpreter]: Reachable states at location elem_existsFINAL satisfy 2104#(and (<= |elem_exists_#res| 0) (<= elem_exists_~size 0) (= elem_exists_~size |elem_exists_#in~size|) (not (< elem_exists_~i~0 elem_exists_~size)) (= elem_exists_~set.base |elem_exists_#in~set.base|) (= elem_exists_~value |elem_exists_#in~value|) (= |elem_exists_#in~set.offset| elem_exists_~set.offset) (<= |elem_exists_#in~size| 0) (exists ((v_prenex_110 Int) (|v_main_~#values~0.base_BEFORE_CALL_200| Int) (v_main_~v~0_BEFORE_CALL_274 Int)) (or (and (<= |elem_exists_#in~size| 1) (<= 0 v_main_~v~0_BEFORE_CALL_274) (<= |elem_exists_#in~size| 0) (< v_main_~v~0_BEFORE_CALL_274 100000) (<= v_main_~v~0_BEFORE_CALL_274 0) (<= |elem_exists_#in~size| 2147483647) (<= 1 v_main_~v~0_BEFORE_CALL_274) (= |elem_exists_#in~value| (select (select |#memory_int| v_prenex_110) (* v_main_~v~0_BEFORE_CALL_274 4))) (<= 0 (+ |elem_exists_#in~size| 2147483648))) (and (<= |elem_exists_#in~size| 1) (<= v_main_~v~0_BEFORE_CALL_274 100000) (< v_main_~v~0_BEFORE_CALL_274 100000) (<= |elem_exists_#in~size| 2147483647) (<= 1 v_main_~v~0_BEFORE_CALL_274) (= |elem_exists_#in~value| (select (select |#memory_int| v_prenex_110) (* v_main_~v~0_BEFORE_CALL_274 4))) (<= 0 (+ |elem_exists_#in~size| 2147483648))) (and (<= |elem_exists_#in~size| 0) (= |elem_exists_#in~value| (select (select |#memory_int| |v_main_~#values~0.base_BEFORE_CALL_200|) 0))))) (= |elem_exists_#res| 0) (<= 0 elem_exists_~i~0) (<= elem_exists_~i~0 0) (= elem_exists_~i~0 0) (<= 0 |elem_exists_#res|)) [2019-10-13 21:32:42,064 INFO L193 IcfgInterpreter]: Reachable states at location L47 satisfy 2005#(and (<= 1 main_~y~0) (<= |main_~#values~0.offset| 0) (<= 1 main_~n~0) (<= main_~n~0 1) (<= 100000 main_~v~0) (<= main_~x~0 0) (<= main_~y~0 1) (<= 0 |main_~#values~0.offset|) (= |main_~#values~0.offset| 0) (<= 0 main_~x~0)) [2019-10-13 21:32:42,064 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 1426#(and (or (and (<= main_~n~0 2147483647) (<= 1 main_~v~0) (= main_~x~0 0) (<= 0 (+ main_~n~0 2147483648)) (= |main_~#values~0.offset| 0)) (and (<= main_~n~0 0) (<= main_~v~0 0) (= main_~v~0 0) (= main_~x~0 0) (= |main_~#values~0.offset| 0))) (<= |main_~#values~0.offset| 0) (<= 0 main_~v~0) (<= main_~n~0 1) (<= main_~x~0 0) (<= 0 |main_~#values~0.offset|) (<= 0 main_~x~0)) [2019-10-13 21:32:42,065 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:42,065 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:42,066 INFO L193 IcfgInterpreter]: Reachable states at location L40-2 satisfy 1551#(and (<= main_~n~0 2147483647) (= main_~x~0 0) (<= |main_~#values~0.offset| 0) (<= 0 (+ main_~n~0 2147483648)) (<= main_~n~0 1) (<= 0 main_~v~0) (<= main_~x~0 0) (<= 0 |main_~#values~0.offset|) (= |main_~#values~0.offset| 0) (<= 0 main_~x~0)) [2019-10-13 21:32:42,066 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 68#true [2019-10-13 21:32:42,066 INFO L193 IcfgInterpreter]: Reachable states at location L42-1 satisfy 1769#(and (and (<= main_~n~0 0) (= main_~x~0 0) (= |main_~#values~0.offset| 0)) (<= |main_~#values~0.offset| 0) (<= 0 main_~v~0) (<= main_~x~0 0) (<= 0 |main_~#values~0.offset|) (<= 0 main_~x~0) (<= |main_#t~ret14| 1)) [2019-10-13 21:32:42,066 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 2099#(and (= |elem_exists_#in~set.offset| elem_exists_~set.offset) (exists ((v_prenex_110 Int) (|v_main_~#values~0.base_BEFORE_CALL_200| Int) (v_main_~v~0_BEFORE_CALL_274 Int)) (or (and (<= |elem_exists_#in~size| 1) (<= 0 v_main_~v~0_BEFORE_CALL_274) (<= |elem_exists_#in~size| 0) (< v_main_~v~0_BEFORE_CALL_274 100000) (<= v_main_~v~0_BEFORE_CALL_274 0) (<= |elem_exists_#in~size| 2147483647) (<= 1 v_main_~v~0_BEFORE_CALL_274) (= |elem_exists_#in~value| (select (select |#memory_int| v_prenex_110) (* v_main_~v~0_BEFORE_CALL_274 4))) (<= 0 (+ |elem_exists_#in~size| 2147483648))) (and (<= |elem_exists_#in~size| 1) (<= v_main_~v~0_BEFORE_CALL_274 100000) (< v_main_~v~0_BEFORE_CALL_274 100000) (<= |elem_exists_#in~size| 2147483647) (<= 1 v_main_~v~0_BEFORE_CALL_274) (= |elem_exists_#in~value| (select (select |#memory_int| v_prenex_110) (* v_main_~v~0_BEFORE_CALL_274 4))) (<= 0 (+ |elem_exists_#in~size| 2147483648))) (and (<= |elem_exists_#in~size| 0) (= |elem_exists_#in~value| (select (select |#memory_int| |v_main_~#values~0.base_BEFORE_CALL_200|) 0))))) (<= 0 elem_exists_~i~0) (= elem_exists_~size |elem_exists_#in~size|) (<= elem_exists_~i~0 0) (= elem_exists_~i~0 0) (= elem_exists_~set.base |elem_exists_#in~set.base|) (= elem_exists_~value |elem_exists_#in~value|)) [2019-10-13 21:32:42,066 INFO L193 IcfgInterpreter]: Reachable states at location L42 satisfy 1873#(and (<= main_~n~0 0) (= main_~x~0 0) (<= |main_~#values~0.offset| 0) (<= 0 main_~v~0) (<= main_~x~0 0) (<= 0 |main_~#values~0.offset|) (= |main_~#values~0.offset| 0) (<= 0 main_~x~0)) [2019-10-13 21:32:42,067 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 111#(and (or (and (<= main_~n~0 0) (not (= 0 |main_~#values~0.base|)) (<= main_~v~0 0) (< |main_~#values~0.base| |#StackHeapBarrier|) (= 0 |main_~#values~0.offset|) (= main_~v~0 0) (= main_~x~0 0) (not (< main_~x~0 main_~n~0)) (= (select |#length| |main_~#values~0.base|) 400000) (= (select |#valid| |main_~#values~0.base|) 1)) (and (<= main_~n~0 0) (= main_~x~0 0) (= |main_~#values~0.offset| 0))) (<= |main_~#values~0.offset| 0) (<= 0 main_~v~0) (<= main_~x~0 0) (<= 0 |main_~#values~0.offset|) (<= 0 main_~x~0)) [2019-10-13 21:32:42,067 INFO L193 IcfgInterpreter]: Reachable states at location L46-3 satisfy 2033#(and (<= 0 main_~n~0) (<= 1 main_~y~0) (<= main_~x~0 1) (<= |main_~#values~0.offset| 0) (<= main_~y~0 2) (<= main_~n~0 1) (<= 100000 main_~v~0) (<= 0 |main_~#values~0.offset|) (= |main_~#values~0.offset| 0) (<= 0 main_~x~0)) [2019-10-13 21:32:42,067 INFO L193 IcfgInterpreter]: Reachable states at location insertEXIT satisfy 2081#(and (= insert_~set.base |insert_#in~set.base|) (<= insert_~size 0) (<= |insert_#in~size| 0) (= |insert_#in~value| insert_~value) (= |insert_#in~set.offset| insert_~set.offset) (= |#memory_int| (store |old(#memory_int)| insert_~set.base (store (select |old(#memory_int)| insert_~set.base) (+ insert_~set.offset (* insert_~size 4)) insert_~value))) (<= |insert_#res| 1) (= |insert_#res| (+ insert_~size 1)) (= |insert_#in~size| insert_~size)) [2019-10-13 21:32:42,067 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 2085#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:32:42,067 INFO L193 IcfgInterpreter]: Reachable states at location elem_existsENTRY satisfy 2094#(exists ((v_prenex_110 Int) (|v_main_~#values~0.base_BEFORE_CALL_200| Int) (v_main_~v~0_BEFORE_CALL_274 Int)) (or (and (<= |elem_exists_#in~size| 1) (<= 0 v_main_~v~0_BEFORE_CALL_274) (<= |elem_exists_#in~size| 0) (< v_main_~v~0_BEFORE_CALL_274 100000) (<= v_main_~v~0_BEFORE_CALL_274 0) (<= |elem_exists_#in~size| 2147483647) (<= 1 v_main_~v~0_BEFORE_CALL_274) (= |elem_exists_#in~value| (select (select |#memory_int| v_prenex_110) (* v_main_~v~0_BEFORE_CALL_274 4))) (<= 0 (+ |elem_exists_#in~size| 2147483648))) (and (<= |elem_exists_#in~size| 1) (<= v_main_~v~0_BEFORE_CALL_274 100000) (< v_main_~v~0_BEFORE_CALL_274 100000) (<= |elem_exists_#in~size| 2147483647) (<= 1 v_main_~v~0_BEFORE_CALL_274) (= |elem_exists_#in~value| (select (select |#memory_int| v_prenex_110) (* v_main_~v~0_BEFORE_CALL_274 4))) (<= 0 (+ |elem_exists_#in~size| 2147483648))) (and (<= |elem_exists_#in~size| 0) (= |elem_exists_#in~value| (select (select |#memory_int| |v_main_~#values~0.base_BEFORE_CALL_200|) 0))))) [2019-10-13 21:32:42,068 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 2090#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:42,068 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:32:42,068 INFO L193 IcfgInterpreter]: Reachable states at location L41-2 satisfy 1929#(or (and (<= main_~n~0 0) (<= |main_#t~ret12| 0) (<= |main_~#values~0.offset| 0) (<= main_~v~0 100000) (<= 0 main_~v~0) (<= main_~x~0 0) (<= 0 |main_~#values~0.offset|) (<= 0 |main_#t~ret12|) (<= 0 main_~x~0) (= main_~x~0 0) (<= 0 (+ |main_#t~ret12| 2147483648)) (<= |main_#t~ret12| 2147483647) (= |main_~#values~0.offset| 0) (= |main_#t~ret12| 0)) (and (<= main_~n~0 0) (<= main_~v~0 0) (<= |main_#t~ret12| 0) (<= |main_~#values~0.offset| 0) (<= 0 main_~v~0) (<= main_~x~0 0) (<= 0 |main_~#values~0.offset|) (<= 0 |main_#t~ret12|) (<= 0 main_~x~0) (= main_~v~0 0) (= main_~x~0 0) (<= 0 (+ |main_#t~ret12| 2147483648)) (< main_~v~0 100000) (<= |main_#t~ret12| 2147483647) (= |main_#t~mem11| (select (select |#memory_int| |main_~#values~0.base|) (+ (* main_~v~0 4) |main_~#values~0.offset|))) (= |main_#t~ret12| 0) (= |main_~#values~0.offset| 0))) [2019-10-13 21:32:42,068 INFO L193 IcfgInterpreter]: Reachable states at location insertENTRY satisfy 2076#(and (<= |insert_#in~size| 0) (= |#memory_int| |old(#memory_int)|)) [2019-10-13 21:32:42,069 INFO L193 IcfgInterpreter]: Reachable states at location elem_existsEXIT satisfy 2109#(and (<= |elem_exists_#res| 0) (<= elem_exists_~size 0) (= elem_exists_~size |elem_exists_#in~size|) (not (< elem_exists_~i~0 elem_exists_~size)) (= elem_exists_~set.base |elem_exists_#in~set.base|) (= elem_exists_~value |elem_exists_#in~value|) (= |elem_exists_#in~set.offset| elem_exists_~set.offset) (<= |elem_exists_#in~size| 0) (exists ((v_prenex_110 Int) (|v_main_~#values~0.base_BEFORE_CALL_200| Int) (v_main_~v~0_BEFORE_CALL_274 Int)) (or (and (<= |elem_exists_#in~size| 1) (<= 0 v_main_~v~0_BEFORE_CALL_274) (<= |elem_exists_#in~size| 0) (< v_main_~v~0_BEFORE_CALL_274 100000) (<= v_main_~v~0_BEFORE_CALL_274 0) (<= |elem_exists_#in~size| 2147483647) (<= 1 v_main_~v~0_BEFORE_CALL_274) (= |elem_exists_#in~value| (select (select |#memory_int| v_prenex_110) (* v_main_~v~0_BEFORE_CALL_274 4))) (<= 0 (+ |elem_exists_#in~size| 2147483648))) (and (<= |elem_exists_#in~size| 1) (<= v_main_~v~0_BEFORE_CALL_274 100000) (< v_main_~v~0_BEFORE_CALL_274 100000) (<= |elem_exists_#in~size| 2147483647) (<= 1 v_main_~v~0_BEFORE_CALL_274) (= |elem_exists_#in~value| (select (select |#memory_int| v_prenex_110) (* v_main_~v~0_BEFORE_CALL_274 4))) (<= 0 (+ |elem_exists_#in~size| 2147483648))) (and (<= |elem_exists_#in~size| 0) (= |elem_exists_#in~value| (select (select |#memory_int| |v_main_~#values~0.base_BEFORE_CALL_200|) 0))))) (= |elem_exists_#res| 0) (<= 0 elem_exists_~i~0) (<= elem_exists_~i~0 0) (= elem_exists_~i~0 0) (<= 0 |elem_exists_#res|)) [2019-10-13 21:32:42,069 INFO L193 IcfgInterpreter]: Reachable states at location L41-1 satisfy 1916#(and (<= main_~n~0 0) (= main_~x~0 0) (<= |main_#t~ret12| 0) (<= |main_~#values~0.offset| 0) (<= main_~v~0 100000) (<= 0 main_~v~0) (<= main_~x~0 0) (<= 0 |main_~#values~0.offset|) (<= 0 |main_#t~ret12|) (= |main_~#values~0.offset| 0) (= |main_#t~ret12| 0) (<= 0 main_~x~0)) [2019-10-13 21:32:42,069 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 2057#false [2019-10-13 21:32:42,069 INFO L193 IcfgInterpreter]: Reachable states at location L41 satisfy 1296#(and (and (= main_~x~0 0) (= |main_~#values~0.offset| 0)) (<= |main_~#values~0.offset| 0) (<= main_~v~0 100000) (<= 0 main_~v~0) (<= main_~n~0 1) (<= main_~x~0 0) (<= 0 |main_~#values~0.offset|) (<= 0 main_~x~0)) [2019-10-13 21:32:42,069 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 2072#false [2019-10-13 21:32:42,070 INFO L193 IcfgInterpreter]: Reachable states at location L45-3 satisfy 2053#(and (<= main_~x~0 1) (and (<= |main_~#values~0.offset| 0) (<= 0 (+ main_~n~0 2147483648)) (<= main_~n~0 1) (<= 100000 main_~v~0) (<= 0 |main_~#values~0.offset|) (= |main_~#values~0.offset| 0) (<= 0 main_~x~0))) [2019-10-13 21:32:43,018 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-13 21:32:43,018 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [5, 4, 4] total 28 [2019-10-13 21:32:43,018 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322344306] [2019-10-13 21:32:43,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-13 21:32:43,019 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:43,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-13 21:32:43,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=634, Unknown=0, NotChecked=0, Total=756 [2019-10-13 21:32:43,020 INFO L87 Difference]: Start difference. First operand 60 states and 75 transitions. Second operand 21 states. [2019-10-13 21:32:45,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:45,318 INFO L93 Difference]: Finished difference Result 95 states and 123 transitions. [2019-10-13 21:32:45,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-13 21:32:45,319 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 32 [2019-10-13 21:32:45,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:45,321 INFO L225 Difference]: With dead ends: 95 [2019-10-13 21:32:45,322 INFO L226 Difference]: Without dead ends: 81 [2019-10-13 21:32:45,323 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 636 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=439, Invalid=2213, Unknown=0, NotChecked=0, Total=2652 [2019-10-13 21:32:45,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-10-13 21:32:45,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 58. [2019-10-13 21:32:45,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-13 21:32:45,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2019-10-13 21:32:45,335 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 32 [2019-10-13 21:32:45,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:45,335 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2019-10-13 21:32:45,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-13 21:32:45,335 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2019-10-13 21:32:45,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-13 21:32:45,337 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:45,337 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:45,543 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:32:45,544 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:45,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:45,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1911824755, now seen corresponding path program 1 times [2019-10-13 21:32:45,544 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:45,545 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107047320] [2019-10-13 21:32:45,545 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:45,545 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:45,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:45,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:45,640 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 21:32:45,641 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107047320] [2019-10-13 21:32:45,641 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:32:45,641 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:32:45,641 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469073294] [2019-10-13 21:32:45,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:32:45,642 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:45,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:32:45,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:32:45,643 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand 4 states. [2019-10-13 21:32:45,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:45,661 INFO L93 Difference]: Finished difference Result 111 states and 138 transitions. [2019-10-13 21:32:45,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:32:45,662 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-10-13 21:32:45,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:45,663 INFO L225 Difference]: With dead ends: 111 [2019-10-13 21:32:45,663 INFO L226 Difference]: Without dead ends: 68 [2019-10-13 21:32:45,664 INFO L600 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 [2019-10-13 21:32:45,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-13 21:32:45,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-10-13 21:32:45,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-13 21:32:45,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 83 transitions. [2019-10-13 21:32:45,679 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 83 transitions. Word has length 44 [2019-10-13 21:32:45,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:45,680 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 83 transitions. [2019-10-13 21:32:45,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:32:45,682 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 83 transitions. [2019-10-13 21:32:45,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-13 21:32:45,684 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:45,687 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:45,687 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:45,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:45,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1980989535, now seen corresponding path program 1 times [2019-10-13 21:32:45,688 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:45,688 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108957257] [2019-10-13 21:32:45,688 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:45,688 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:45,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:45,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:45,771 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 21:32:45,771 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108957257] [2019-10-13 21:32:45,771 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459039398] [2019-10-13 21:32:45,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:32:45,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:45,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:32:45,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:32:45,967 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 21:32:45,968 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:32:45,993 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 21:32:45,994 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [725326199] [2019-10-13 21:32:45,996 INFO L162 IcfgInterpreter]: Started Sifa with 29 locations of interest [2019-10-13 21:32:45,996 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:32:45,997 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:32:45,997 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:32:45,997 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:32:46,012 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:32:48,807 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-13 21:32:48,812 INFO L199 IcfgInterpreter]: Interpreting procedure insert with input of size 3 for LOIs [2019-10-13 21:32:48,814 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:32:48,817 INFO L199 IcfgInterpreter]: Interpreting procedure elem_exists with input of size 33 for LOIs [2019-10-13 21:32:48,844 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:32:48,844 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:32:48,845 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 2010#(and (exists ((v_prenex_231 Int) (|v_main_~#set~0.offset_BEFORE_CALL_561| Int) (|v_main_~#set~0.base_BEFORE_CALL_561| Int) (v_prenex_230 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_231) v_prenex_230) (select (select |#memory_int| v_prenex_231) (+ v_prenex_230 4)))) (and (= |__VERIFIER_assert_#in~cond| 1) (not (= (select (select |#memory_int| |v_main_~#set~0.base_BEFORE_CALL_561|) |v_main_~#set~0.offset_BEFORE_CALL_561|) (select (select |#memory_int| |v_main_~#set~0.base_BEFORE_CALL_561|) (+ |v_main_~#set~0.offset_BEFORE_CALL_561| 4))))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:32:48,845 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 2015#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_231 Int) (|v_main_~#set~0.offset_BEFORE_CALL_561| Int) (|v_main_~#set~0.base_BEFORE_CALL_561| Int) (v_prenex_230 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_231) v_prenex_230) (select (select |#memory_int| v_prenex_231) (+ v_prenex_230 4)))) (and (= |__VERIFIER_assert_#in~cond| 1) (not (= (select (select |#memory_int| |v_main_~#set~0.base_BEFORE_CALL_561|) |v_main_~#set~0.offset_BEFORE_CALL_561|) (select (select |#memory_int| |v_main_~#set~0.base_BEFORE_CALL_561|) (+ |v_main_~#set~0.offset_BEFORE_CALL_561| 4))))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:32:48,845 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 73#(and (= main_~x~0 0) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:32:48,845 INFO L193 IcfgInterpreter]: Reachable states at location L12 satisfy 2095#(and (< elem_exists_~i~0 elem_exists_~size) (= |elem_exists_#t~mem1| (select (select |#memory_int| elem_exists_~set.base) (+ (* elem_exists_~i~0 4) elem_exists_~set.offset)))) [2019-10-13 21:32:48,845 INFO L193 IcfgInterpreter]: Reachable states at location elem_existsFINAL satisfy 2085#(and (<= |elem_exists_#res| 0) (= |elem_exists_#res| 0) (<= 0 |elem_exists_#res|) (not (< elem_exists_~i~0 elem_exists_~size))) [2019-10-13 21:32:48,846 INFO L193 IcfgInterpreter]: Reachable states at location L47 satisfy 1996#(and (<= main_~n~0 2147483647) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 1 main_~v~0) (<= |main_~#values~0.offset| 0) (<= 0 (+ main_~n~0 2147483648)) (< main_~x~0 main_~n~0) (<= 0 |main_~#values~0.offset|) (<= main_~x~0 0) (<= 0 main_~x~0) (= |main_#t~mem18| (select (select |#memory_int| |main_~#set~0.base|) (+ |main_~#set~0.offset| (* main_~y~0 4)))) (= main_~x~0 0) (not (< main_~v~0 100000)) (<= 1 main_~n~0) (= |main_#t~mem17| (select (select |#memory_int| |main_~#set~0.base|) (+ |main_~#set~0.offset| (* main_~x~0 4)))) (<= 100000 main_~v~0) (< main_~y~0 main_~n~0) (<= main_~y~0 1) (= |main_~#values~0.offset| 0)) [2019-10-13 21:32:48,846 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 1456#(and (and (= main_~x~0 0) (= |main_~#values~0.offset| 0)) (or (and (<= main_~n~0 2147483647) (<= 1 main_~v~0) (<= |main_~#values~0.offset| 0) (<= 0 (+ main_~n~0 2147483648)) (<= main_~x~0 0) (<= 0 |main_~#values~0.offset|) (<= 0 main_~x~0)) (and (<= main_~n~0 2147483647) (<= |main_~#values~0.offset| 0) (<= 0 main_~v~0) (<= main_~x~0 0) (<= 0 |main_~#values~0.offset|) (<= 0 main_~x~0)))) [2019-10-13 21:32:48,846 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:48,846 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:48,847 INFO L193 IcfgInterpreter]: Reachable states at location L40-2 satisfy 1585#(and (<= main_~n~0 2147483647) (= main_~x~0 0) (<= |main_~#values~0.offset| 0) (<= 0 (+ main_~n~0 2147483648)) (<= 0 main_~v~0) (<= main_~x~0 0) (<= 0 |main_~#values~0.offset|) (= |main_~#values~0.offset| 0) (<= 0 main_~x~0)) [2019-10-13 21:32:48,847 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 68#true [2019-10-13 21:32:48,847 INFO L193 IcfgInterpreter]: Reachable states at location L42-1 satisfy 1806#(and (= main_~x~0 0) (<= |main_~#values~0.offset| 0) (<= 0 main_~v~0) (<= main_~x~0 0) (<= 0 |main_~#values~0.offset|) (= |main_~#values~0.offset| 0) (<= 0 main_~x~0)) [2019-10-13 21:32:48,847 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 2080#true [2019-10-13 21:32:48,847 INFO L193 IcfgInterpreter]: Reachable states at location L42 satisfy 1910#(and (= main_~x~0 0) (<= |main_~#values~0.offset| 0) (<= 0 main_~v~0) (<= main_~x~0 0) (<= 0 |main_~#values~0.offset|) (= |main_~#values~0.offset| 0) (<= 0 main_~x~0)) [2019-10-13 21:32:48,847 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 111#(and (or (and (<= main_~n~0 0) (not (= 0 |main_~#values~0.base|)) (<= main_~v~0 0) (< |main_~#values~0.base| |#StackHeapBarrier|) (= 0 |main_~#values~0.offset|) (= main_~v~0 0) (= main_~x~0 0) (not (< main_~x~0 main_~n~0)) (= (select |#length| |main_~#values~0.base|) 400000) (= (select |#valid| |main_~#values~0.base|) 1)) (and (<= main_~n~0 0) (= main_~x~0 0) (= |main_~#values~0.offset| 0))) (<= |main_~#values~0.offset| 0) (<= 0 main_~v~0) (<= main_~x~0 0) (<= 0 |main_~#values~0.offset|) (<= 0 main_~x~0)) [2019-10-13 21:32:48,848 INFO L193 IcfgInterpreter]: Reachable states at location L46-3 satisfy 2001#(and (<= 0 main_~n~0) (<= main_~n~0 2147483647) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 1 main_~v~0) (<= |main_~#values~0.offset| 0) (<= 0 (+ main_~n~0 2147483648)) (< main_~x~0 main_~n~0) (<= 0 |main_~#values~0.offset|) (<= main_~x~0 0) (<= 0 main_~x~0) (= main_~x~0 0) (not (< main_~v~0 100000)) (<= 100000 main_~v~0) (<= main_~y~0 1) (= |main_~#values~0.offset| 0)) [2019-10-13 21:32:48,848 INFO L193 IcfgInterpreter]: Reachable states at location insertEXIT satisfy 2029#(and (= insert_~set.base |insert_#in~set.base|) (= |insert_#in~value| insert_~value) (= |insert_#in~set.offset| insert_~set.offset) (= |#memory_int| (store |old(#memory_int)| insert_~set.base (store (select |old(#memory_int)| insert_~set.base) (+ insert_~set.offset (* insert_~size 4)) insert_~value))) (= |insert_#res| (+ insert_~size 1)) (= |insert_#in~size| insert_~size)) [2019-10-13 21:32:48,848 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 2033#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:32:48,848 INFO L193 IcfgInterpreter]: Reachable states at location elem_existsENTRY satisfy 2042#(exists ((|v_main_~#values~0.base_BEFORE_CALL_327| Int) (v_main_~v~0_BEFORE_CALL_447 Int) (v_prenex_177 Int)) (or (and (<= 1 v_main_~v~0_BEFORE_CALL_447) (< v_main_~v~0_BEFORE_CALL_447 100000) (<= |elem_exists_#in~size| 0) (<= v_main_~v~0_BEFORE_CALL_447 0) (<= 0 v_main_~v~0_BEFORE_CALL_447) (= |elem_exists_#in~value| (select (select |#memory_int| v_prenex_177) (* v_main_~v~0_BEFORE_CALL_447 4))) (<= |elem_exists_#in~size| 2147483647) (<= 0 (+ |elem_exists_#in~size| 2147483648))) (and (<= 1 v_main_~v~0_BEFORE_CALL_447) (< v_main_~v~0_BEFORE_CALL_447 100000) (<= v_main_~v~0_BEFORE_CALL_447 100000) (= |elem_exists_#in~value| (select (select |#memory_int| v_prenex_177) (* v_main_~v~0_BEFORE_CALL_447 4))) (<= |elem_exists_#in~size| 2147483647) (<= 0 (+ |elem_exists_#in~size| 2147483648))) (and (<= |elem_exists_#in~size| 0) (= (select (select |#memory_int| |v_main_~#values~0.base_BEFORE_CALL_327|) 0) |elem_exists_#in~value|)))) [2019-10-13 21:32:48,848 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 2038#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:48,849 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:32:48,849 INFO L193 IcfgInterpreter]: Reachable states at location L41-2 satisfy 1970#(and (or (and (= main_~v~0 0) (= main_~x~0 0) (<= 0 (+ |main_#t~ret12| 2147483648)) (< main_~v~0 100000) (<= |main_#t~ret12| 2147483647) (= |main_#t~mem11| (select (select |#memory_int| |main_~#values~0.base|) (+ (* main_~v~0 4) |main_~#values~0.offset|))) (= |main_#t~ret12| 0) (= |main_~#values~0.offset| 0)) (and (<= main_~n~0 2147483647) (<= main_~v~0 100000) (= main_~x~0 0) (<= 0 (+ |main_#t~ret12| 2147483648)) (<= |main_#t~ret12| 2147483647) (= |main_~#values~0.offset| 0) (= |main_#t~ret12| 0))) (or (and (<= main_~n~0 0) (<= main_~v~0 0) (<= |main_#t~ret12| 0) (<= |main_~#values~0.offset| 0) (<= 0 main_~v~0) (<= main_~x~0 0) (<= 0 |main_~#values~0.offset|) (<= 0 |main_#t~ret12|) (<= 0 main_~x~0)) (and (<= main_~n~0 2147483647) (<= |main_#t~ret12| 0) (<= |main_~#values~0.offset| 0) (<= main_~v~0 100000) (<= 0 main_~v~0) (<= main_~x~0 0) (<= 0 |main_~#values~0.offset|) (<= 0 |main_#t~ret12|) (<= 0 main_~x~0)))) [2019-10-13 21:32:48,849 INFO L193 IcfgInterpreter]: Reachable states at location insertENTRY satisfy 2024#(= |#memory_int| |old(#memory_int)|) [2019-10-13 21:32:48,849 INFO L193 IcfgInterpreter]: Reachable states at location elem_existsEXIT satisfy 2090#(and (<= |elem_exists_#res| 0) (= |elem_exists_#res| 0) (<= 0 |elem_exists_#res|) (not (< elem_exists_~i~0 elem_exists_~size))) [2019-10-13 21:32:48,849 INFO L193 IcfgInterpreter]: Reachable states at location L41-1 satisfy 1953#(and (<= main_~n~0 2147483647) (= main_~x~0 0) (<= |main_#t~ret12| 0) (<= |main_~#values~0.offset| 0) (<= main_~v~0 100000) (<= 0 main_~v~0) (<= main_~x~0 0) (<= 0 |main_~#values~0.offset|) (<= 0 |main_#t~ret12|) (= |main_~#values~0.offset| 0) (= |main_#t~ret12| 0) (<= 0 main_~x~0)) [2019-10-13 21:32:48,850 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 2005#(exists ((v_prenex_231 Int) (|v_main_~#set~0.offset_BEFORE_CALL_561| Int) (|v_main_~#set~0.base_BEFORE_CALL_561| Int) (v_prenex_230 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_231) v_prenex_230) (select (select |#memory_int| v_prenex_231) (+ v_prenex_230 4)))) (and (= |__VERIFIER_assert_#in~cond| 1) (not (= (select (select |#memory_int| |v_main_~#set~0.base_BEFORE_CALL_561|) |v_main_~#set~0.offset_BEFORE_CALL_561|) (select (select |#memory_int| |v_main_~#set~0.base_BEFORE_CALL_561|) (+ |v_main_~#set~0.offset_BEFORE_CALL_561| 4))))))) [2019-10-13 21:32:48,850 INFO L193 IcfgInterpreter]: Reachable states at location L41 satisfy 1323#(and (<= main_~v~0 100000) (<= 0 main_~v~0) (or (and (<= main_~n~0 2147483647) (<= 1 main_~v~0) (= main_~x~0 0) (< main_~v~0 100000) (<= |main_~#values~0.offset| 0) (<= 0 (+ main_~n~0 2147483648)) (= |main_#t~mem11| (select (select |#memory_int| |main_~#values~0.base|) (+ (* main_~v~0 4) |main_~#values~0.offset|))) (= |main_~#values~0.offset| 0)) (and (<= main_~n~0 0) (<= main_~n~0 2147483647) (<= main_~v~0 0) (<= |main_~#values~0.offset| 0) (= main_~v~0 0) (= main_~x~0 0) (< main_~v~0 100000) (= |main_#t~mem11| (select (select |#memory_int| |main_~#values~0.base|) (+ (* main_~v~0 4) |main_~#values~0.offset|))) (= |main_~#values~0.offset| 0))) (<= main_~x~0 0) (<= 0 |main_~#values~0.offset|) (<= 0 main_~x~0)) [2019-10-13 21:32:48,850 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 2020#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_231 Int) (|v_main_~#set~0.offset_BEFORE_CALL_561| Int) (|v_main_~#set~0.base_BEFORE_CALL_561| Int) (v_prenex_230 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_231) v_prenex_230) (select (select |#memory_int| v_prenex_231) (+ v_prenex_230 4)))) (and (= |__VERIFIER_assert_#in~cond| 1) (not (= (select (select |#memory_int| |v_main_~#set~0.base_BEFORE_CALL_561|) |v_main_~#set~0.offset_BEFORE_CALL_561|) (select (select |#memory_int| |v_main_~#set~0.base_BEFORE_CALL_561|) (+ |v_main_~#set~0.offset_BEFORE_CALL_561| 4))))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:32:48,850 INFO L193 IcfgInterpreter]: Reachable states at location L45-3 satisfy 1975#(and (<= main_~n~0 2147483647) (<= 0 (+ main_~n~0 2147483648)) (<= 100000 main_~v~0) (or (and (= main_~x~0 0) (<= 1 main_~v~0) (not (< main_~v~0 100000)) (<= |main_~#values~0.offset| 0) (= |main_~#values~0.offset| 0)) (and (<= main_~n~0 0) (= main_~v~0 0) (= main_~x~0 0) (not (< main_~v~0 100000)) (<= |main_~#values~0.offset| 0) (= |main_~#values~0.offset| 0))) (<= main_~x~0 0) (<= 0 |main_~#values~0.offset|) (<= 0 main_~x~0)) [2019-10-13 21:32:52,888 WARN L191 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2019-10-13 21:32:53,841 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:32:53,841 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4, 23] total 31 [2019-10-13 21:32:53,841 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112879414] [2019-10-13 21:32:53,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-13 21:32:53,843 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:53,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-13 21:32:53,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=785, Unknown=0, NotChecked=0, Total=930 [2019-10-13 21:32:53,844 INFO L87 Difference]: Start difference. First operand 68 states and 83 transitions. Second operand 31 states. [2019-10-13 21:32:58,689 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 50 [2019-10-13 21:32:59,559 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-10-13 21:32:59,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:59,617 INFO L93 Difference]: Finished difference Result 231 states and 306 transitions. [2019-10-13 21:32:59,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-13 21:32:59,617 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 45 [2019-10-13 21:32:59,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:59,620 INFO L225 Difference]: With dead ends: 231 [2019-10-13 21:32:59,620 INFO L226 Difference]: Without dead ends: 170 [2019-10-13 21:32:59,623 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 117 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=804, Invalid=4166, Unknown=0, NotChecked=0, Total=4970 [2019-10-13 21:32:59,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-10-13 21:32:59,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 84. [2019-10-13 21:32:59,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-10-13 21:32:59,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 104 transitions. [2019-10-13 21:32:59,642 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 104 transitions. Word has length 45 [2019-10-13 21:32:59,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:59,642 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 104 transitions. [2019-10-13 21:32:59,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-13 21:32:59,643 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 104 transitions. [2019-10-13 21:32:59,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-13 21:32:59,644 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:59,644 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-13 21:32:59,852 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:32:59,853 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:59,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:59,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1595088869, now seen corresponding path program 1 times [2019-10-13 21:32:59,854 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:59,854 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828761313] [2019-10-13 21:32:59,854 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:59,855 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:59,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:59,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:59,920 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-13 21:32:59,920 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828761313] [2019-10-13 21:32:59,920 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587452151] [2019-10-13 21:32:59,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:00,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:00,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-13 21:33:00,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:00,215 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-13 21:33:00,216 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:00,288 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-13 21:33:00,288 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [769802442] [2019-10-13 21:33:00,290 INFO L162 IcfgInterpreter]: Started Sifa with 29 locations of interest [2019-10-13 21:33:00,290 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:00,291 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:00,291 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:00,291 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:00,308 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs