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-36ac518-m [2019-10-06 23:16:40,011 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-06 23:16:40,013 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-06 23:16:40,026 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-06 23:16:40,026 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-06 23:16:40,027 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-06 23:16:40,029 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-06 23:16:40,031 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-06 23:16:40,032 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-06 23:16:40,033 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-06 23:16:40,034 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-06 23:16:40,035 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-06 23:16:40,035 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-06 23:16:40,036 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-06 23:16:40,038 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-06 23:16:40,039 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-06 23:16:40,040 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-06 23:16:40,043 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-06 23:16:40,045 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-06 23:16:40,051 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-06 23:16:40,053 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-06 23:16:40,057 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-06 23:16:40,058 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-06 23:16:40,059 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-06 23:16:40,063 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-06 23:16:40,063 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-06 23:16:40,063 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-06 23:16:40,064 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-06 23:16:40,065 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-06 23:16:40,065 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-06 23:16:40,066 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-06 23:16:40,068 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-06 23:16:40,069 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-06 23:16:40,070 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-06 23:16:40,071 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-06 23:16:40,071 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-06 23:16:40,072 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-06 23:16:40,072 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-06 23:16:40,075 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-06 23:16:40,077 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-06 23:16:40,079 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-06 23:16:40,080 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-06 23:16:40,101 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-06 23:16:40,102 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-06 23:16:40,104 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-06 23:16:40,104 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-06 23:16:40,104 INFO L138 SettingsManager]: * Use SBE=true [2019-10-06 23:16:40,104 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-06 23:16:40,104 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-06 23:16:40,105 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-06 23:16:40,105 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-06 23:16:40,105 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-06 23:16:40,106 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-06 23:16:40,106 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-06 23:16:40,106 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-06 23:16:40,107 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-06 23:16:40,107 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-06 23:16:40,107 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-06 23:16:40,107 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-06 23:16:40,107 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-06 23:16:40,108 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-06 23:16:40,108 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-06 23:16:40,108 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-06 23:16:40,108 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-06 23:16:40,109 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-06 23:16:40,109 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-06 23:16:40,109 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-06 23:16:40,109 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-06 23:16:40,109 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-06 23:16:40,110 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-06 23:16:40,110 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-06 23:16:40,421 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-06 23:16:40,441 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-06 23:16:40,445 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-06 23:16:40,446 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-06 23:16:40,446 INFO L275 PluginConnector]: CDTParser initialized [2019-10-06 23:16:40,447 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-06 23:16:40,516 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11188b250/9a02df17deaa4d9e93e78134eea5149a/FLAGe20d1d1ed [2019-10-06 23:16:40,934 INFO L306 CDTParser]: Found 1 translation units. [2019-10-06 23:16:40,936 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/data_structures_set_multi_proc_ground-2.i [2019-10-06 23:16:40,947 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11188b250/9a02df17deaa4d9e93e78134eea5149a/FLAGe20d1d1ed [2019-10-06 23:16:41,296 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11188b250/9a02df17deaa4d9e93e78134eea5149a [2019-10-06 23:16:41,306 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-06 23:16:41,307 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-06 23:16:41,310 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-06 23:16:41,311 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-06 23:16:41,314 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-06 23:16:41,315 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:16:41" (1/1) ... [2019-10-06 23:16:41,318 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e9b8ec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:16:41, skipping insertion in model container [2019-10-06 23:16:41,318 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:16:41" (1/1) ... [2019-10-06 23:16:41,327 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-06 23:16:41,348 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-06 23:16:41,604 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:16:41,613 INFO L188 MainTranslator]: Completed pre-run [2019-10-06 23:16:41,648 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:16:41,750 INFO L192 MainTranslator]: Completed translation [2019-10-06 23:16:41,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:16:41 WrapperNode [2019-10-06 23:16:41,751 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-06 23:16:41,752 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-06 23:16:41,752 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-06 23:16:41,752 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-06 23:16:41,762 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:16:41" (1/1) ... [2019-10-06 23:16:41,762 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:16:41" (1/1) ... [2019-10-06 23:16:41,770 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:16:41" (1/1) ... [2019-10-06 23:16:41,771 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:16:41" (1/1) ... [2019-10-06 23:16:41,780 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:16:41" (1/1) ... [2019-10-06 23:16:41,788 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:16:41" (1/1) ... [2019-10-06 23:16:41,790 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:16:41" (1/1) ... [2019-10-06 23:16:41,792 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-06 23:16:41,793 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-06 23:16:41,793 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-06 23:16:41,793 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-06 23:16:41,794 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:16:41" (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-06 23:16:41,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-06 23:16:41,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-06 23:16:41,857 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-06 23:16:41,857 INFO L138 BoogieDeclarations]: Found implementation of procedure insert [2019-10-06 23:16:41,857 INFO L138 BoogieDeclarations]: Found implementation of procedure elem_exists [2019-10-06 23:16:41,858 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-06 23:16:41,858 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-06 23:16:41,858 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-06 23:16:41,858 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-06 23:16:41,858 INFO L130 BoogieDeclarations]: Found specification of procedure insert [2019-10-06 23:16:41,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-06 23:16:41,859 INFO L130 BoogieDeclarations]: Found specification of procedure elem_exists [2019-10-06 23:16:41,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-06 23:16:41,859 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-06 23:16:41,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-06 23:16:41,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-06 23:16:41,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-06 23:16:41,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-06 23:16:42,371 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-06 23:16:42,372 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-06 23:16:42,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:16:42 BoogieIcfgContainer [2019-10-06 23:16:42,373 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-06 23:16:42,374 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-06 23:16:42,374 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-06 23:16:42,376 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-06 23:16:42,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 11:16:41" (1/3) ... [2019-10-06 23:16:42,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@349f63e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:16:42, skipping insertion in model container [2019-10-06 23:16:42,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:16:41" (2/3) ... [2019-10-06 23:16:42,378 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@349f63e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:16:42, skipping insertion in model container [2019-10-06 23:16:42,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:16:42" (3/3) ... [2019-10-06 23:16:42,380 INFO L109 eAbstractionObserver]: Analyzing ICFG data_structures_set_multi_proc_ground-2.i [2019-10-06 23:16:42,388 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-06 23:16:42,396 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-06 23:16:42,408 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-06 23:16:42,434 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-06 23:16:42,434 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-06 23:16:42,434 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-06 23:16:42,434 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-06 23:16:42,435 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-06 23:16:42,435 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-06 23:16:42,435 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-06 23:16:42,435 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-06 23:16:42,454 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2019-10-06 23:16:42,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-06 23:16:42,459 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:16:42,459 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:16:42,461 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:16:42,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:16:42,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1511676476, now seen corresponding path program 1 times [2019-10-06 23:16:42,473 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:16:42,473 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:42,473 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:42,473 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:42,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:16:42,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:16:42,634 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-06 23:16:42,634 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:42,635 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:16:42,635 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:16:42,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:16:42,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:16:42,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:16:42,651 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 3 states. [2019-10-06 23:16:42,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:16:42,759 INFO L93 Difference]: Finished difference Result 88 states and 125 transitions. [2019-10-06 23:16:42,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:16:42,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-06 23:16:42,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:16:42,774 INFO L225 Difference]: With dead ends: 88 [2019-10-06 23:16:42,774 INFO L226 Difference]: Without dead ends: 52 [2019-10-06 23:16:42,781 INFO L606 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-06 23:16:42,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-10-06 23:16:42,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 36. [2019-10-06 23:16:42,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-06 23:16:42,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2019-10-06 23:16:42,851 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 12 [2019-10-06 23:16:42,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:16:42,852 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 46 transitions. [2019-10-06 23:16:42,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:16:42,852 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2019-10-06 23:16:42,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-06 23:16:42,857 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:16:42,857 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:16:42,857 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:16:42,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:16:42,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1775930285, now seen corresponding path program 1 times [2019-10-06 23:16:42,859 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:16:42,859 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:42,860 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:42,860 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:42,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:16:42,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:16:42,979 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-06 23:16:42,979 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:42,980 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:16:42,980 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-06 23:16:42,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-06 23:16:42,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-06 23:16:42,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-06 23:16:42,983 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. Second operand 5 states. [2019-10-06 23:16:43,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:16:43,043 INFO L93 Difference]: Finished difference Result 70 states and 91 transitions. [2019-10-06 23:16:43,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-06 23:16:43,044 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-10-06 23:16:43,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:16:43,045 INFO L225 Difference]: With dead ends: 70 [2019-10-06 23:16:43,045 INFO L226 Difference]: Without dead ends: 40 [2019-10-06 23:16:43,047 INFO L606 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-06 23:16:43,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-06 23:16:43,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2019-10-06 23:16:43,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-06 23:16:43,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2019-10-06 23:16:43,055 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 13 [2019-10-06 23:16:43,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:16:43,056 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2019-10-06 23:16:43,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-06 23:16:43,056 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2019-10-06 23:16:43,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-06 23:16:43,057 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:16:43,057 INFO L385 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-06 23:16:43,058 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:16:43,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:16:43,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1000416666, now seen corresponding path program 1 times [2019-10-06 23:16:43,058 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:16:43,059 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:43,059 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:43,059 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:43,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:16:43,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:16:43,109 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-06 23:16:43,110 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:43,110 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:16:43,110 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:16:43,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:16:43,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:16:43,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:16:43,112 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. Second operand 3 states. [2019-10-06 23:16:43,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:16:43,166 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2019-10-06 23:16:43,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:16:43,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-06 23:16:43,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:16:43,168 INFO L225 Difference]: With dead ends: 76 [2019-10-06 23:16:43,169 INFO L226 Difference]: Without dead ends: 47 [2019-10-06 23:16:43,170 INFO L606 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-06 23:16:43,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-06 23:16:43,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 39. [2019-10-06 23:16:43,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-06 23:16:43,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2019-10-06 23:16:43,178 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 29 [2019-10-06 23:16:43,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:16:43,178 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2019-10-06 23:16:43,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:16:43,179 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2019-10-06 23:16:43,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-06 23:16:43,180 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:16:43,180 INFO L385 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-06 23:16:43,181 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:16:43,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:16:43,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1697925591, now seen corresponding path program 1 times [2019-10-06 23:16:43,181 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:16:43,182 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:43,182 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:43,182 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:43,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:16:43,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:16:43,290 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-06 23:16:43,291 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:43,291 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:16:43,291 INFO L95 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-06 23:16:43,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:16:43,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-06 23:16:43,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:16:43,453 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-06 23:16:43,453 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:16:43,492 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-06 23:16:43,492 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:16:43,520 INFO L162 IcfgInterpreter]: Started Sifa with 28 locations of interest [2019-10-06 23:16:43,521 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:16:43,531 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:16:43,545 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:16:43,545 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:16:43,692 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:16:48,212 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 1 for LOIs [2019-10-06 23:16:48,219 INFO L199 IcfgInterpreter]: Interpreting procedure insert with input of size 7 for LOIs [2019-10-06 23:16:48,222 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:16:48,226 INFO L199 IcfgInterpreter]: Interpreting procedure elem_exists with input of size 42 for LOIs [2019-10-06 23:16:48,234 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:16:48,234 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:16:48,234 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 1954#false [2019-10-06 23:16:48,234 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 1959#false [2019-10-06 23:16:48,235 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-06 23:16:48,235 INFO L193 IcfgInterpreter]: Reachable states at location elem_existsFINAL satisfy 1996#(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) (= |elem_exists_#res| 0) (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~size| 1) (<= 1 v_prenex_29) (<= |elem_exists_#in~size| 0) (<= 0 v_prenex_29) (<= |elem_exists_#in~size| 2147483647) (= |elem_exists_#in~value| (select (select |#memory_int| v_prenex_27) (* 4 v_prenex_29))) (<= v_prenex_29 0) (< v_prenex_29 100000) (<= 0 (+ |elem_exists_#in~size| 2147483648))) (and (<= |elem_exists_#in~size| 1) (< v_main_~v~0_BEFORE_CALL_73 100000) (<= 1 v_main_~v~0_BEFORE_CALL_73) (<= |elem_exists_#in~size| 2147483647) (<= v_main_~v~0_BEFORE_CALL_73 100000) (= |elem_exists_#in~value| (select (select |#memory_int| |v_main_~#values~0.base_BEFORE_CALL_53|) (* 4 v_main_~v~0_BEFORE_CALL_73))) (<= 0 (+ |elem_exists_#in~size| 2147483648))) (and (<= |elem_exists_#in~size| 0) (= |elem_exists_#in~value| (select (select |#memory_int| v_prenex_28) 0))))) (<= 0 elem_exists_~i~0) (<= elem_exists_~i~0 0) (= elem_exists_~i~0 0) (<= 0 |elem_exists_#res|)) [2019-10-06 23:16:48,235 INFO L193 IcfgInterpreter]: Reachable states at location L47 satisfy 1940#(and (<= main_~n~0 2147483647) (<= 1 main_~y~0) (= |main_#t~mem17| (select (select |#memory_int| |main_~#set~0.base|) (+ |main_~#set~0.offset| (* 4 main_~x~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) (= (select (select |#memory_int| |main_~#set~0.base|) (+ |main_~#set~0.offset| (* 4 main_~y~0))) |main_#t~mem18|) (= main_~x~0 0) (not (< main_~v~0 100000)) (<= 1 main_~n~0) (<= main_~n~0 1) (<= 100000 main_~v~0) (< main_~y~0 main_~n~0) (<= main_~y~0 1) (= |main_~#values~0.offset| 0)) [2019-10-06 23:16:48,235 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 1414#(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-06 23:16:48,236 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-06 23:16:48,236 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-06 23:16:48,236 INFO L193 IcfgInterpreter]: Reachable states at location L40-2 satisfy 1539#(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-06 23:16:48,236 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 68#true [2019-10-06 23:16:48,237 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 1964#false [2019-10-06 23:16:48,237 INFO L193 IcfgInterpreter]: Reachable states at location L42-1 satisfy 1757#(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-06 23:16:48,238 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 1991#(and (= |elem_exists_#in~set.offset| elem_exists_~set.offset) (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~size| 1) (<= 1 v_prenex_29) (<= |elem_exists_#in~size| 0) (<= 0 v_prenex_29) (<= |elem_exists_#in~size| 2147483647) (= |elem_exists_#in~value| (select (select |#memory_int| v_prenex_27) (* 4 v_prenex_29))) (<= v_prenex_29 0) (< v_prenex_29 100000) (<= 0 (+ |elem_exists_#in~size| 2147483648))) (and (<= |elem_exists_#in~size| 1) (< v_main_~v~0_BEFORE_CALL_73 100000) (<= 1 v_main_~v~0_BEFORE_CALL_73) (<= |elem_exists_#in~size| 2147483647) (<= v_main_~v~0_BEFORE_CALL_73 100000) (= |elem_exists_#in~value| (select (select |#memory_int| |v_main_~#values~0.base_BEFORE_CALL_53|) (* 4 v_main_~v~0_BEFORE_CALL_73))) (<= 0 (+ |elem_exists_#in~size| 2147483648))) (and (<= |elem_exists_#in~size| 0) (= |elem_exists_#in~value| (select (select |#memory_int| v_prenex_28) 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-06 23:16:48,238 INFO L193 IcfgInterpreter]: Reachable states at location L42 satisfy 1858#(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-06 23:16:48,238 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-06 23:16:48,238 INFO L193 IcfgInterpreter]: Reachable states at location L46-3 satisfy 1945#(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-06 23:16:48,239 INFO L193 IcfgInterpreter]: Reachable states at location insertEXIT satisfy 1973#(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) (<= |insert_#res| 1) (= |#memory_int| (store |old(#memory_int)| insert_~set.base (store (select |old(#memory_int)| insert_~set.base) (+ insert_~set.offset (* 4 insert_~size)) insert_~value))) (= |insert_#res| (+ insert_~size 1)) (= |insert_#in~size| insert_~size)) [2019-10-06 23:16:48,239 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 1977#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:16:48,239 INFO L193 IcfgInterpreter]: Reachable states at location elem_existsENTRY satisfy 1986#(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~size| 1) (<= 1 v_prenex_29) (<= |elem_exists_#in~size| 0) (<= 0 v_prenex_29) (<= |elem_exists_#in~size| 2147483647) (= |elem_exists_#in~value| (select (select |#memory_int| v_prenex_27) (* 4 v_prenex_29))) (<= v_prenex_29 0) (< v_prenex_29 100000) (<= 0 (+ |elem_exists_#in~size| 2147483648))) (and (<= |elem_exists_#in~size| 1) (< v_main_~v~0_BEFORE_CALL_73 100000) (<= 1 v_main_~v~0_BEFORE_CALL_73) (<= |elem_exists_#in~size| 2147483647) (<= v_main_~v~0_BEFORE_CALL_73 100000) (= |elem_exists_#in~value| (select (select |#memory_int| |v_main_~#values~0.base_BEFORE_CALL_53|) (* 4 v_main_~v~0_BEFORE_CALL_73))) (<= 0 (+ |elem_exists_#in~size| 2147483648))) (and (<= |elem_exists_#in~size| 0) (= |elem_exists_#in~value| (select (select |#memory_int| v_prenex_28) 0))))) [2019-10-06 23:16:48,240 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 1982#(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-06 23:16:48,241 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:16:48,241 INFO L193 IcfgInterpreter]: Reachable states at location L41-2 satisfy 1914#(and (or (and (<= 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)) (and (= |main_#t~mem11| (select (select |#memory_int| |main_~#values~0.base|) (+ (* 4 main_~v~0) |main_~#values~0.offset|))) (= main_~v~0 0) (= main_~x~0 0) (<= 0 (+ |main_#t~ret12| 2147483648)) (< main_~v~0 100000) (<= |main_#t~ret12| 2147483647) (= |main_#t~ret12| 0) (= |main_~#values~0.offset| 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 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)))) [2019-10-06 23:16:48,241 INFO L193 IcfgInterpreter]: Reachable states at location insertENTRY satisfy 1968#(and (<= |insert_#in~size| 0) (= |#memory_int| |old(#memory_int)|)) [2019-10-06 23:16:48,241 INFO L193 IcfgInterpreter]: Reachable states at location elem_existsEXIT satisfy 2001#(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) (= |elem_exists_#res| 0) (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~size| 1) (<= 1 v_prenex_29) (<= |elem_exists_#in~size| 0) (<= 0 v_prenex_29) (<= |elem_exists_#in~size| 2147483647) (= |elem_exists_#in~value| (select (select |#memory_int| v_prenex_27) (* 4 v_prenex_29))) (<= v_prenex_29 0) (< v_prenex_29 100000) (<= 0 (+ |elem_exists_#in~size| 2147483648))) (and (<= |elem_exists_#in~size| 1) (< v_main_~v~0_BEFORE_CALL_73 100000) (<= 1 v_main_~v~0_BEFORE_CALL_73) (<= |elem_exists_#in~size| 2147483647) (<= v_main_~v~0_BEFORE_CALL_73 100000) (= |elem_exists_#in~value| (select (select |#memory_int| |v_main_~#values~0.base_BEFORE_CALL_53|) (* 4 v_main_~v~0_BEFORE_CALL_73))) (<= 0 (+ |elem_exists_#in~size| 2147483648))) (and (<= |elem_exists_#in~size| 0) (= |elem_exists_#in~value| (select (select |#memory_int| v_prenex_28) 0))))) (<= 0 elem_exists_~i~0) (<= elem_exists_~i~0 0) (= elem_exists_~i~0 0) (<= 0 |elem_exists_#res|)) [2019-10-06 23:16:48,242 INFO L193 IcfgInterpreter]: Reachable states at location L41-1 satisfy 1901#(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-06 23:16:48,242 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 1949#false [2019-10-06 23:16:48,242 INFO L193 IcfgInterpreter]: Reachable states at location L41 satisfy 1284#(and (<= main_~v~0 100000) (<= 0 main_~v~0) (or (and (<= main_~n~0 0) (<= main_~v~0 0) (<= |main_~#values~0.offset| 0) (<= main_~x~0 0) (<= 0 |main_~#values~0.offset|) (= |main_#t~mem11| (select (select |#memory_int| |main_~#values~0.base|) (+ (* 4 main_~v~0) |main_~#values~0.offset|))) (= main_~v~0 0) (= main_~x~0 0) (< main_~v~0 100000) (<= main_~n~0 1) (= |main_~#values~0.offset| 0)) (and (<= main_~n~0 2147483647) (= |main_#t~mem11| (select (select |#memory_int| |main_~#values~0.base|) (+ (* 4 main_~v~0) |main_~#values~0.offset|))) (= main_~x~0 0) (<= 1 main_~v~0) (< main_~v~0 100000) (<= |main_~#values~0.offset| 0) (<= 0 (+ main_~n~0 2147483648)) (<= main_~n~0 1) (<= main_~x~0 0) (<= 0 |main_~#values~0.offset|) (= |main_~#values~0.offset| 0))) (<= 0 main_~x~0)) [2019-10-06 23:16:48,242 INFO L193 IcfgInterpreter]: Reachable states at location L45-3 satisfy 1919#(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-06 23:16:49,208 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-06 23:16:49,208 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [4, 4, 4] total 24 [2019-10-06 23:16:49,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-06 23:16:49,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-06 23:16:49,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2019-10-06 23:16:49,211 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand 20 states. [2019-10-06 23:16:50,544 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2019-10-06 23:16:51,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:16:51,321 INFO L93 Difference]: Finished difference Result 110 states and 144 transitions. [2019-10-06 23:16:51,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-06 23:16:51,322 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2019-10-06 23:16:51,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:16:51,326 INFO L225 Difference]: With dead ends: 110 [2019-10-06 23:16:51,326 INFO L226 Difference]: Without dead ends: 81 [2019-10-06 23:16:51,327 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 68 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 566 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=381, Invalid=1689, Unknown=0, NotChecked=0, Total=2070 [2019-10-06 23:16:51,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-10-06 23:16:51,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 62. [2019-10-06 23:16:51,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-10-06 23:16:51,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 78 transitions. [2019-10-06 23:16:51,341 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 78 transitions. Word has length 30 [2019-10-06 23:16:51,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:16:51,342 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 78 transitions. [2019-10-06 23:16:51,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-06 23:16:51,342 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2019-10-06 23:16:51,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-06 23:16:51,343 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:16:51,343 INFO L385 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-06 23:16:51,547 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:16:51,548 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:16:51,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:16:51,548 INFO L82 PathProgramCache]: Analyzing trace with hash 545937229, now seen corresponding path program 1 times [2019-10-06 23:16:51,548 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:16:51,548 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:51,548 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:51,549 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:51,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:16:51,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:16:51,628 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-06 23:16:51,629 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:51,629 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:16:51,629 INFO L95 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-06 23:16:51,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:16:51,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-06 23:16:51,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:16:51,769 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-06 23:16:51,770 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:16:51,797 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-06 23:16:51,797 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:16:51,799 INFO L162 IcfgInterpreter]: Started Sifa with 28 locations of interest [2019-10-06 23:16:51,800 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:16:51,800 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:16:51,800 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:16:51,801 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:16:51,824 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:16:55,173 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 1 for LOIs [2019-10-06 23:16:55,183 INFO L199 IcfgInterpreter]: Interpreting procedure insert with input of size 7 for LOIs [2019-10-06 23:16:55,185 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:16:55,188 INFO L199 IcfgInterpreter]: Interpreting procedure elem_exists with input of size 42 for LOIs [2019-10-06 23:16:55,196 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:16:55,196 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:16:55,196 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 2053#false [2019-10-06 23:16:55,197 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 2058#false [2019-10-06 23:16:55,197 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-06 23:16:55,197 INFO L193 IcfgInterpreter]: Reachable states at location elem_existsFINAL satisfy 2095#(and (<= |elem_exists_#res| 0) (<= elem_exists_~size 0) (= elem_exists_~size |elem_exists_#in~size|) (not (< elem_exists_~i~0 elem_exists_~size)) (exists ((v_prenex_106 Int) (|v_main_~#values~0.base_BEFORE_CALL_200| Int) (v_main_~v~0_BEFORE_CALL_274 Int) (v_prenex_107 Int) (v_prenex_108 Int)) (or (and (<= v_prenex_108 100000) (<= |elem_exists_#in~size| 1) (= |elem_exists_#in~value| (select (select |#memory_int| v_prenex_107) (* 4 v_prenex_108))) (<= 1 v_prenex_108) (<= |elem_exists_#in~size| 2147483647) (< v_prenex_108 100000) (<= 0 (+ |elem_exists_#in~size| 2147483648))) (and (<= 0 v_main_~v~0_BEFORE_CALL_274) (<= |elem_exists_#in~size| 1) (<= |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_106) (* 4 v_main_~v~0_BEFORE_CALL_274))) (<= 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_~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) (= |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-06 23:16:55,197 INFO L193 IcfgInterpreter]: Reachable states at location L47 satisfy 1996#(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-06 23:16:55,197 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 1417#(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-06 23:16:55,197 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-06 23:16:55,198 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-06 23:16:55,198 INFO L193 IcfgInterpreter]: Reachable states at location L40-2 satisfy 1542#(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-06 23:16:55,198 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 68#true [2019-10-06 23:16:55,199 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 2063#false [2019-10-06 23:16:55,199 INFO L193 IcfgInterpreter]: Reachable states at location L42-1 satisfy 1760#(and (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)) (<= |main_#t~ret14| 1)) [2019-10-06 23:16:55,199 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 2090#(and (= |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) (exists ((v_prenex_106 Int) (|v_main_~#values~0.base_BEFORE_CALL_200| Int) (v_main_~v~0_BEFORE_CALL_274 Int) (v_prenex_107 Int) (v_prenex_108 Int)) (or (and (<= v_prenex_108 100000) (<= |elem_exists_#in~size| 1) (= |elem_exists_#in~value| (select (select |#memory_int| v_prenex_107) (* 4 v_prenex_108))) (<= 1 v_prenex_108) (<= |elem_exists_#in~size| 2147483647) (< v_prenex_108 100000) (<= 0 (+ |elem_exists_#in~size| 2147483648))) (and (<= 0 v_main_~v~0_BEFORE_CALL_274) (<= |elem_exists_#in~size| 1) (<= |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_106) (* 4 v_main_~v~0_BEFORE_CALL_274))) (<= 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_~set.base |elem_exists_#in~set.base|) (= elem_exists_~value |elem_exists_#in~value|)) [2019-10-06 23:16:55,199 INFO L193 IcfgInterpreter]: Reachable states at location L42 satisfy 1864#(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-06 23:16:55,200 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-06 23:16:55,200 INFO L193 IcfgInterpreter]: Reachable states at location L46-3 satisfy 2024#(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-06 23:16:55,200 INFO L193 IcfgInterpreter]: Reachable states at location insertEXIT satisfy 2072#(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) (<= |insert_#res| 1) (= |#memory_int| (store |old(#memory_int)| insert_~set.base (store (select |old(#memory_int)| insert_~set.base) (+ insert_~set.offset (* 4 insert_~size)) insert_~value))) (= |insert_#res| (+ insert_~size 1)) (= |insert_#in~size| insert_~size)) [2019-10-06 23:16:55,200 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 2076#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:16:55,201 INFO L193 IcfgInterpreter]: Reachable states at location elem_existsENTRY satisfy 2085#(exists ((v_prenex_106 Int) (|v_main_~#values~0.base_BEFORE_CALL_200| Int) (v_main_~v~0_BEFORE_CALL_274 Int) (v_prenex_107 Int) (v_prenex_108 Int)) (or (and (<= v_prenex_108 100000) (<= |elem_exists_#in~size| 1) (= |elem_exists_#in~value| (select (select |#memory_int| v_prenex_107) (* 4 v_prenex_108))) (<= 1 v_prenex_108) (<= |elem_exists_#in~size| 2147483647) (< v_prenex_108 100000) (<= 0 (+ |elem_exists_#in~size| 2147483648))) (and (<= 0 v_main_~v~0_BEFORE_CALL_274) (<= |elem_exists_#in~size| 1) (<= |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_106) (* 4 v_main_~v~0_BEFORE_CALL_274))) (<= 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-06 23:16:55,201 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 2081#(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-06 23:16:55,201 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:16:55,201 INFO L193 IcfgInterpreter]: Reachable states at location L41-2 satisfy 1920#(and (or (and (<= 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)) (and (= |main_#t~mem11| (select (select |#memory_int| |main_~#values~0.base|) (+ (* 4 main_~v~0) |main_~#values~0.offset|))) (= main_~v~0 0) (= main_~x~0 0) (<= 0 (+ |main_#t~ret12| 2147483648)) (< main_~v~0 100000) (<= |main_#t~ret12| 2147483647) (= |main_#t~ret12| 0) (= |main_~#values~0.offset| 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 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)))) [2019-10-06 23:16:55,201 INFO L193 IcfgInterpreter]: Reachable states at location insertENTRY satisfy 2067#(and (<= |insert_#in~size| 0) (= |#memory_int| |old(#memory_int)|)) [2019-10-06 23:16:55,202 INFO L193 IcfgInterpreter]: Reachable states at location elem_existsEXIT satisfy 2100#(and (<= |elem_exists_#res| 0) (<= elem_exists_~size 0) (= elem_exists_~size |elem_exists_#in~size|) (not (< elem_exists_~i~0 elem_exists_~size)) (exists ((v_prenex_106 Int) (|v_main_~#values~0.base_BEFORE_CALL_200| Int) (v_main_~v~0_BEFORE_CALL_274 Int) (v_prenex_107 Int) (v_prenex_108 Int)) (or (and (<= v_prenex_108 100000) (<= |elem_exists_#in~size| 1) (= |elem_exists_#in~value| (select (select |#memory_int| v_prenex_107) (* 4 v_prenex_108))) (<= 1 v_prenex_108) (<= |elem_exists_#in~size| 2147483647) (< v_prenex_108 100000) (<= 0 (+ |elem_exists_#in~size| 2147483648))) (and (<= 0 v_main_~v~0_BEFORE_CALL_274) (<= |elem_exists_#in~size| 1) (<= |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_106) (* 4 v_main_~v~0_BEFORE_CALL_274))) (<= 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_~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) (= |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-06 23:16:55,202 INFO L193 IcfgInterpreter]: Reachable states at location L41-1 satisfy 1907#(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-06 23:16:55,202 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 2048#false [2019-10-06 23:16:55,202 INFO L193 IcfgInterpreter]: Reachable states at location L41 satisfy 1287#(and (<= main_~v~0 100000) (or (and (<= main_~n~0 0) (<= main_~v~0 0) (<= |main_~#values~0.offset| 0) (= |main_#t~mem11| (select (select |#memory_int| |main_~#values~0.base|) (+ (* 4 main_~v~0) |main_~#values~0.offset|))) (= main_~v~0 0) (= main_~x~0 0) (< main_~v~0 100000) (= |main_~#values~0.offset| 0)) (and (<= main_~n~0 2147483647) (= |main_#t~mem11| (select (select |#memory_int| |main_~#values~0.base|) (+ (* 4 main_~v~0) |main_~#values~0.offset|))) (= main_~x~0 0) (<= 1 main_~v~0) (< main_~v~0 100000) (<= |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-06 23:16:55,202 INFO L193 IcfgInterpreter]: Reachable states at location L45-3 satisfy 2044#(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-06 23:16:56,141 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-06 23:16:56,142 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [5, 4, 4] total 28 [2019-10-06 23:16:56,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-06 23:16:56,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-06 23:16:56,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=634, Unknown=0, NotChecked=0, Total=756 [2019-10-06 23:16:56,145 INFO L87 Difference]: Start difference. First operand 62 states and 78 transitions. Second operand 21 states. [2019-10-06 23:16:58,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:16:58,277 INFO L93 Difference]: Finished difference Result 93 states and 119 transitions. [2019-10-06 23:16:58,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-06 23:16:58,283 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 32 [2019-10-06 23:16:58,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:16:58,285 INFO L225 Difference]: With dead ends: 93 [2019-10-06 23:16:58,285 INFO L226 Difference]: Without dead ends: 79 [2019-10-06 23:16:58,289 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=414, Invalid=2136, Unknown=0, NotChecked=0, Total=2550 [2019-10-06 23:16:58,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-10-06 23:16:58,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 60. [2019-10-06 23:16:58,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-06 23:16:58,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 75 transitions. [2019-10-06 23:16:58,303 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 75 transitions. Word has length 32 [2019-10-06 23:16:58,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:16:58,303 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 75 transitions. [2019-10-06 23:16:58,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-06 23:16:58,304 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2019-10-06 23:16:58,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-06 23:16:58,305 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:16:58,305 INFO L385 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-06 23:16:58,508 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:16:58,513 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:16:58,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:16:58,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1911824755, now seen corresponding path program 1 times [2019-10-06 23:16:58,514 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:16:58,514 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:58,514 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:58,514 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:58,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:16:58,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:16:58,591 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-06 23:16:58,592 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:58,592 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:16:58,592 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-06 23:16:58,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-06 23:16:58,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-06 23:16:58,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-06 23:16:58,593 INFO L87 Difference]: Start difference. First operand 60 states and 75 transitions. Second operand 4 states. [2019-10-06 23:16:58,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:16:58,610 INFO L93 Difference]: Finished difference Result 113 states and 142 transitions. [2019-10-06 23:16:58,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-06 23:16:58,610 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-10-06 23:16:58,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:16:58,612 INFO L225 Difference]: With dead ends: 113 [2019-10-06 23:16:58,612 INFO L226 Difference]: Without dead ends: 70 [2019-10-06 23:16:58,612 INFO L606 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-06 23:16:58,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-06 23:16:58,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-10-06 23:16:58,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-06 23:16:58,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 87 transitions. [2019-10-06 23:16:58,624 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 87 transitions. Word has length 44 [2019-10-06 23:16:58,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:16:58,624 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 87 transitions. [2019-10-06 23:16:58,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-06 23:16:58,625 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2019-10-06 23:16:58,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-06 23:16:58,626 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:16:58,626 INFO L385 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-06 23:16:58,627 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:16:58,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:16:58,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1980989535, now seen corresponding path program 1 times [2019-10-06 23:16:58,627 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:16:58,627 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:58,627 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:58,628 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:58,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:16:58,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:16:58,694 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-06 23:16:58,695 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:58,695 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:16:58,695 INFO L95 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-06 23:16:58,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:16:58,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-06 23:16:58,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:16:58,895 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-06 23:16:58,895 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:16:58,933 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-06 23:16:58,933 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:16:58,935 INFO L162 IcfgInterpreter]: Started Sifa with 29 locations of interest [2019-10-06 23:16:58,935 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:16:58,936 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:16:58,936 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:16:58,936 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:16:58,959 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:17:01,591 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-06 23:17:01,596 INFO L199 IcfgInterpreter]: Interpreting procedure insert with input of size 3 for LOIs [2019-10-06 23:17:01,598 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:17:01,600 INFO L199 IcfgInterpreter]: Interpreting procedure elem_exists with input of size 33 for LOIs [2019-10-06 23:17:01,623 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:17:01,624 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:17:01,624 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 2008#(and (exists ((v_prenex_226 Int) (v_prenex_227 Int) (|v_main_~#set~0.offset_BEFORE_CALL_561| Int) (|v_main_~#set~0.base_BEFORE_CALL_561| Int)) (or (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))))) (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_227) v_prenex_226) (select (select |#memory_int| v_prenex_227) (+ v_prenex_226 4)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:17:01,624 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 2013#(and (exists ((v_prenex_226 Int) (v_prenex_227 Int) (|v_main_~#set~0.offset_BEFORE_CALL_561| Int) (|v_main_~#set~0.base_BEFORE_CALL_561| Int)) (or (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))))) (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_227) v_prenex_226) (select (select |#memory_int| v_prenex_227) (+ v_prenex_226 4)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:17:01,624 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-06 23:17:01,624 INFO L193 IcfgInterpreter]: Reachable states at location L12 satisfy 2093#(and (< elem_exists_~i~0 elem_exists_~size) (= (select (select |#memory_int| elem_exists_~set.base) (+ (* 4 elem_exists_~i~0) elem_exists_~set.offset)) |elem_exists_#t~mem1|)) [2019-10-06 23:17:01,624 INFO L193 IcfgInterpreter]: Reachable states at location elem_existsFINAL satisfy 2083#(and (<= |elem_exists_#res| 0) (= |elem_exists_#res| 0) (<= 0 |elem_exists_#res|) (not (< elem_exists_~i~0 elem_exists_~size))) [2019-10-06 23:17:01,625 INFO L193 IcfgInterpreter]: Reachable states at location L47 satisfy 1994#(and (<= main_~n~0 2147483647) (<= 1 main_~y~0) (= |main_#t~mem17| (select (select |#memory_int| |main_~#set~0.base|) (+ |main_~#set~0.offset| (* 4 main_~x~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) (= (select (select |#memory_int| |main_~#set~0.base|) (+ |main_~#set~0.offset| (* 4 main_~y~0))) |main_#t~mem18|) (= main_~x~0 0) (not (< main_~v~0 100000)) (<= 1 main_~n~0) (<= 100000 main_~v~0) (< main_~y~0 main_~n~0) (<= main_~y~0 1) (= |main_~#values~0.offset| 0)) [2019-10-06 23:17:01,625 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 1458#(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-06 23:17:01,625 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-06 23:17:01,625 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-06 23:17:01,626 INFO L193 IcfgInterpreter]: Reachable states at location L40-2 satisfy 1583#(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-06 23:17:01,626 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 68#true [2019-10-06 23:17:01,626 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 2018#(and (exists ((v_prenex_226 Int) (v_prenex_227 Int) (|v_main_~#set~0.offset_BEFORE_CALL_561| Int) (|v_main_~#set~0.base_BEFORE_CALL_561| Int)) (or (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))))) (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_227) v_prenex_226) (select (select |#memory_int| v_prenex_227) (+ v_prenex_226 4)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:17:01,626 INFO L193 IcfgInterpreter]: Reachable states at location L42-1 satisfy 1804#(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-06 23:17:01,627 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 2078#true [2019-10-06 23:17:01,627 INFO L193 IcfgInterpreter]: Reachable states at location L42 satisfy 1908#(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-06 23:17:01,627 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-06 23:17:01,627 INFO L193 IcfgInterpreter]: Reachable states at location L46-3 satisfy 1999#(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-06 23:17:01,627 INFO L193 IcfgInterpreter]: Reachable states at location insertEXIT satisfy 2027#(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 (* 4 insert_~size)) insert_~value))) (= |insert_#res| (+ insert_~size 1)) (= |insert_#in~size| insert_~size)) [2019-10-06 23:17:01,627 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 2031#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:17:01,627 INFO L193 IcfgInterpreter]: Reachable states at location elem_existsENTRY satisfy 2040#(exists ((|v_main_~#values~0.base_BEFORE_CALL_327| Int) (v_main_~v~0_BEFORE_CALL_447 Int) (v_prenex_175 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~size| 2147483647) (= |elem_exists_#in~value| (select (select |#memory_int| v_prenex_175) (* 4 v_main_~v~0_BEFORE_CALL_447))) (<= 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~size| 2147483647) (= |elem_exists_#in~value| (select (select |#memory_int| v_prenex_175) (* 4 v_main_~v~0_BEFORE_CALL_447))) (<= 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-06 23:17:01,628 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 2036#(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-06 23:17:01,628 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:17:01,628 INFO L193 IcfgInterpreter]: Reachable states at location L41-2 satisfy 1968#(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) (= |main_#t~mem11| (select (select |#memory_int| |main_~#values~0.base|) (+ (* 4 main_~v~0) |main_~#values~0.offset|))) (= main_~v~0 0) (= main_~x~0 0) (<= 0 (+ |main_#t~ret12| 2147483648)) (< main_~v~0 100000) (<= |main_#t~ret12| 2147483647) (= |main_#t~ret12| 0) (= |main_~#values~0.offset| 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) (= main_~x~0 0) (<= 0 (+ |main_#t~ret12| 2147483648)) (<= |main_#t~ret12| 2147483647) (= |main_~#values~0.offset| 0) (= |main_#t~ret12| 0))) [2019-10-06 23:17:01,628 INFO L193 IcfgInterpreter]: Reachable states at location insertENTRY satisfy 2022#(= |#memory_int| |old(#memory_int)|) [2019-10-06 23:17:01,628 INFO L193 IcfgInterpreter]: Reachable states at location elem_existsEXIT satisfy 2088#(and (<= |elem_exists_#res| 0) (= |elem_exists_#res| 0) (<= 0 |elem_exists_#res|) (not (< elem_exists_~i~0 elem_exists_~size))) [2019-10-06 23:17:01,628 INFO L193 IcfgInterpreter]: Reachable states at location L41-1 satisfy 1951#(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-06 23:17:01,628 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 2003#(exists ((v_prenex_226 Int) (v_prenex_227 Int) (|v_main_~#set~0.offset_BEFORE_CALL_561| Int) (|v_main_~#set~0.base_BEFORE_CALL_561| Int)) (or (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))))) (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_227) v_prenex_226) (select (select |#memory_int| v_prenex_227) (+ v_prenex_226 4)))))) [2019-10-06 23:17:01,628 INFO L193 IcfgInterpreter]: Reachable states at location L41 satisfy 1328#(and (and (<= main_~n~0 2147483647) (= main_~x~0 0) (= |main_~#values~0.offset| 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_~x~0)) [2019-10-06 23:17:01,629 INFO L193 IcfgInterpreter]: Reachable states at location L45-3 satisfy 1973#(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-06 23:17:05,657 WARN L191 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2019-10-06 23:17:06,522 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:17:06,522 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4, 23] total 31 [2019-10-06 23:17:06,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-06 23:17:06,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-06 23:17:06,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=784, Unknown=0, NotChecked=0, Total=930 [2019-10-06 23:17:06,525 INFO L87 Difference]: Start difference. First operand 70 states and 87 transitions. Second operand 31 states. [2019-10-06 23:17:10,538 WARN L191 SmtUtils]: Spent 1.56 s on a formula simplification that was a NOOP. DAG size: 50 [2019-10-06 23:17:11,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:17:11,061 INFO L93 Difference]: Finished difference Result 237 states and 316 transitions. [2019-10-06 23:17:11,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-06 23:17:11,065 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 45 [2019-10-06 23:17:11,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:17:11,067 INFO L225 Difference]: With dead ends: 237 [2019-10-06 23:17:11,068 INFO L226 Difference]: Without dead ends: 174 [2019-10-06 23:17:11,070 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 117 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1202 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=765, Invalid=3927, Unknown=0, NotChecked=0, Total=4692 [2019-10-06 23:17:11,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-10-06 23:17:11,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 84. [2019-10-06 23:17:11,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-10-06 23:17:11,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 103 transitions. [2019-10-06 23:17:11,089 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 103 transitions. Word has length 45 [2019-10-06 23:17:11,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:17:11,090 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 103 transitions. [2019-10-06 23:17:11,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-06 23:17:11,090 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 103 transitions. [2019-10-06 23:17:11,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-06 23:17:11,091 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:17:11,092 INFO L385 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-06 23:17:11,295 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:17:11,296 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:17:11,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:17:11,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1595088869, now seen corresponding path program 1 times [2019-10-06 23:17:11,297 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:17:11,297 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:17:11,297 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:17:11,298 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:17:11,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:17:11,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:17:11,408 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-06 23:17:11,409 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:17:11,409 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:17:11,409 INFO L95 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-06 23:17:11,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:17:11,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-06 23:17:11,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:17:11,688 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-06 23:17:11,688 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:17:11,751 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-06 23:17:11,751 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:17:11,752 INFO L162 IcfgInterpreter]: Started Sifa with 29 locations of interest [2019-10-06 23:17:11,752 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:17:11,753 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:17:11,753 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:17:11,753 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:17:11,766 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:17:12,118 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:17:12,119 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: ε at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:133) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: ε at de.uni_freiburg.informatik.ultimate.lib.sifa.PriorityWorklist.add(PriorityWorklist.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.lambda$2(DagInterpreter.java:135) at java.lang.Iterable.forEach(Iterable.java:75) at java.util.Collections$UnmodifiableCollection.forEach(Collections.java:1080) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:135) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:104) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.computeTopSummary(TopInputCallSummarizer.java:78) at java.util.HashMap.computeIfAbsent(HashMap.java:1127) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.summarize(TopInputCallSummarizer.java:67) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretCallReturnSummary(DagInterpreter.java:230) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:214) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:197) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:166) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:130) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:104) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarizeInternal(FixpointLoopSummarizer.java:118) at java.util.HashMap.computeIfAbsent(HashMap.java:1127) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:178) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:169) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:130) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:287) ... 21 more [2019-10-06 23:17:12,125 INFO L168 Benchmark]: Toolchain (without parser) took 30818.22 ms. Allocated memory was 136.8 MB in the beginning and 600.8 MB in the end (delta: 464.0 MB). Free memory was 101.8 MB in the beginning and 133.3 MB in the end (delta: -31.5 MB). Peak memory consumption was 432.5 MB. Max. memory is 7.1 GB. [2019-10-06 23:17:12,126 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-06 23:17:12,126 INFO L168 Benchmark]: CACSL2BoogieTranslator took 441.01 ms. Allocated memory was 136.8 MB in the beginning and 201.3 MB in the end (delta: 64.5 MB). Free memory was 101.6 MB in the beginning and 178.8 MB in the end (delta: -77.2 MB). Peak memory consumption was 23.8 MB. Max. memory is 7.1 GB. [2019-10-06 23:17:12,126 INFO L168 Benchmark]: Boogie Preprocessor took 40.87 ms. Allocated memory is still 201.3 MB. Free memory was 178.8 MB in the beginning and 176.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-10-06 23:17:12,127 INFO L168 Benchmark]: RCFGBuilder took 580.17 ms. Allocated memory is still 201.3 MB. Free memory was 176.7 MB in the beginning and 147.3 MB in the end (delta: 29.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 7.1 GB. [2019-10-06 23:17:12,128 INFO L168 Benchmark]: TraceAbstraction took 29749.50 ms. Allocated memory was 201.3 MB in the beginning and 600.8 MB in the end (delta: 399.5 MB). Free memory was 146.6 MB in the beginning and 133.3 MB in the end (delta: 13.3 MB). Peak memory consumption was 412.8 MB. Max. memory is 7.1 GB. [2019-10-06 23:17:12,129 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 441.01 ms. Allocated memory was 136.8 MB in the beginning and 201.3 MB in the end (delta: 64.5 MB). Free memory was 101.6 MB in the beginning and 178.8 MB in the end (delta: -77.2 MB). Peak memory consumption was 23.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.87 ms. Allocated memory is still 201.3 MB. Free memory was 178.8 MB in the beginning and 176.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 580.17 ms. Allocated memory is still 201.3 MB. Free memory was 176.7 MB in the beginning and 147.3 MB in the end (delta: 29.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 29749.50 ms. Allocated memory was 201.3 MB in the beginning and 600.8 MB in the end (delta: 399.5 MB). Free memory was 146.6 MB in the beginning and 133.3 MB in the end (delta: 13.3 MB). Peak memory consumption was 412.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: ε de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: ε: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:295) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...