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-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:32:11,302 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:32:11,306 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:32:11,320 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:32:11,321 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:32:11,322 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:32:11,323 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:32:11,325 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:32:11,326 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:32:11,327 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:32:11,328 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:32:11,329 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:32:11,330 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:32:11,331 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:32:11,331 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:32:11,333 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:32:11,333 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:32:11,334 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:32:11,336 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:32:11,338 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:32:11,340 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:32:11,341 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:32:11,342 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:32:11,343 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:32:11,345 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:32:11,345 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:32:11,346 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:32:11,347 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:32:11,347 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:32:11,348 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:32:11,348 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:32:11,349 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:32:11,350 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:32:11,351 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:32:11,352 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:32:11,352 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:32:11,353 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:32:11,353 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:32:11,353 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:32:11,354 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:32:11,355 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:32:11,355 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:32:11,372 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:32:11,373 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:32:11,375 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:32:11,376 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:32:11,376 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:32:11,376 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:32:11,376 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:32:11,377 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:32:11,377 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:32:11,377 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:32:11,378 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:32:11,378 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:32:11,379 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:32:11,379 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:32:11,379 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:32:11,380 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:32:11,380 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:32:11,380 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:32:11,380 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:32:11,380 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:32:11,381 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:32:11,381 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:32:11,381 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:32:11,381 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:32:11,382 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:32:11,382 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:32:11,382 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:32:11,382 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:32:11,382 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-13 21:32:11,670 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:32:11,686 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:32:11,690 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:32:11,692 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:32:11,692 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:32:11,693 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-1.i [2019-10-13 21:32:11,768 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/712fa7915/65e9cf1a761d4eda890d88f30d70644b/FLAGdffc4b809 [2019-10-13 21:32:12,261 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:32:12,262 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/data_structures_set_multi_proc_ground-1.i [2019-10-13 21:32:12,274 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/712fa7915/65e9cf1a761d4eda890d88f30d70644b/FLAGdffc4b809 [2019-10-13 21:32:12,637 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/712fa7915/65e9cf1a761d4eda890d88f30d70644b [2019-10-13 21:32:12,645 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:32:12,646 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:32:12,647 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:32:12,648 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:32:12,651 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:32:12,652 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:32:12" (1/1) ... [2019-10-13 21:32:12,656 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70dea371 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:12, skipping insertion in model container [2019-10-13 21:32:12,656 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:32:12" (1/1) ... [2019-10-13 21:32:12,664 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:32:12,687 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:32:12,886 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:32:12,897 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:32:12,924 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:32:13,036 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:32:13,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:13 WrapperNode [2019-10-13 21:32:13,037 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:32:13,038 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:32:13,038 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:32:13,038 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:32:13,049 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:13" (1/1) ... [2019-10-13 21:32:13,049 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:13" (1/1) ... [2019-10-13 21:32:13,057 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:13" (1/1) ... [2019-10-13 21:32:13,058 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:13" (1/1) ... [2019-10-13 21:32:13,068 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:13" (1/1) ... [2019-10-13 21:32:13,076 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:13" (1/1) ... [2019-10-13 21:32:13,078 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:13" (1/1) ... [2019-10-13 21:32:13,081 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:32:13,082 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:32:13,082 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:32:13,082 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:32:13,083 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:32:13,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:32:13,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:32:13,141 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 21:32:13,142 INFO L138 BoogieDeclarations]: Found implementation of procedure insert [2019-10-13 21:32:13,142 INFO L138 BoogieDeclarations]: Found implementation of procedure elem_exists [2019-10-13 21:32:13,142 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:32:13,142 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:32:13,142 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:32:13,142 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:32:13,143 INFO L130 BoogieDeclarations]: Found specification of procedure insert [2019-10-13 21:32:13,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:32:13,143 INFO L130 BoogieDeclarations]: Found specification of procedure elem_exists [2019-10-13 21:32:13,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:32:13,143 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:32:13,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:32:13,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:32:13,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:32:13,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:32:13,661 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:32:13,662 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-13 21:32:13,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:32:13 BoogieIcfgContainer [2019-10-13 21:32:13,663 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:32:13,665 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:32:13,665 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:32:13,668 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:32:13,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:32:12" (1/3) ... [2019-10-13 21:32:13,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2933ca79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:32:13, skipping insertion in model container [2019-10-13 21:32:13,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:13" (2/3) ... [2019-10-13 21:32:13,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2933ca79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:32:13, skipping insertion in model container [2019-10-13 21:32:13,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:32:13" (3/3) ... [2019-10-13 21:32:13,675 INFO L109 eAbstractionObserver]: Analyzing ICFG data_structures_set_multi_proc_ground-1.i [2019-10-13 21:32:13,686 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:32:13,695 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:32:13,707 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:32:13,744 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:32:13,744 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:32:13,744 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:32:13,744 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:32:13,745 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:32:13,745 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:32:13,745 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:32:13,745 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:32:13,760 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2019-10-13 21:32:13,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-13 21:32:13,766 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:13,767 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:13,769 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:13,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:13,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1511676476, now seen corresponding path program 1 times [2019-10-13 21:32:13,781 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:13,782 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944107446] [2019-10-13 21:32:13,782 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:13,782 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:13,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:13,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:13,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:32:13,961 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944107446] [2019-10-13 21:32:13,962 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:32:13,963 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:32:13,963 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095242238] [2019-10-13 21:32:13,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:32:13,968 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:13,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:32:13,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:32:13,981 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 3 states. [2019-10-13 21:32:14,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:14,065 INFO L93 Difference]: Finished difference Result 88 states and 125 transitions. [2019-10-13 21:32:14,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:32:14,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-13 21:32:14,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:14,077 INFO L225 Difference]: With dead ends: 88 [2019-10-13 21:32:14,077 INFO L226 Difference]: Without dead ends: 52 [2019-10-13 21:32:14,081 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:32:14,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-10-13 21:32:14,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 36. [2019-10-13 21:32:14,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-13 21:32:14,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2019-10-13 21:32:14,144 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 12 [2019-10-13 21:32:14,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:14,145 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 46 transitions. [2019-10-13 21:32:14,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:32:14,145 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2019-10-13 21:32:14,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 21:32:14,147 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:14,147 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:14,147 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:14,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:14,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1775930285, now seen corresponding path program 1 times [2019-10-13 21:32:14,148 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:14,148 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529349354] [2019-10-13 21:32:14,148 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:14,149 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:14,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:14,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:14,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:32:14,247 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529349354] [2019-10-13 21:32:14,248 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:32:14,248 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:32:14,248 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150570305] [2019-10-13 21:32:14,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:32:14,250 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:14,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:32:14,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:32:14,252 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. Second operand 5 states. [2019-10-13 21:32:14,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:14,318 INFO L93 Difference]: Finished difference Result 70 states and 91 transitions. [2019-10-13 21:32:14,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:32:14,319 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-10-13 21:32:14,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:14,320 INFO L225 Difference]: With dead ends: 70 [2019-10-13 21:32:14,321 INFO L226 Difference]: Without dead ends: 40 [2019-10-13 21:32:14,322 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:32:14,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-13 21:32:14,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2019-10-13 21:32:14,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-13 21:32:14,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2019-10-13 21:32:14,331 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 13 [2019-10-13 21:32:14,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:14,331 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2019-10-13 21:32:14,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:32:14,332 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2019-10-13 21:32:14,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 21:32:14,333 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:14,333 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:14,333 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:14,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:14,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1000416666, now seen corresponding path program 1 times [2019-10-13 21:32:14,334 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:14,334 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362493044] [2019-10-13 21:32:14,335 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:14,335 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:14,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:14,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:14,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:32:14,420 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362493044] [2019-10-13 21:32:14,420 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:32:14,421 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:32:14,421 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887601704] [2019-10-13 21:32:14,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:32:14,422 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:14,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:32:14,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:32:14,424 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. Second operand 3 states. [2019-10-13 21:32:14,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:14,450 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2019-10-13 21:32:14,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:32:14,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-13 21:32:14,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:14,452 INFO L225 Difference]: With dead ends: 76 [2019-10-13 21:32:14,452 INFO L226 Difference]: Without dead ends: 47 [2019-10-13 21:32:14,453 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:32:14,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-13 21:32:14,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 39. [2019-10-13 21:32:14,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-13 21:32:14,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2019-10-13 21:32:14,462 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 29 [2019-10-13 21:32:14,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:14,463 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2019-10-13 21:32:14,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:32:14,463 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2019-10-13 21:32:14,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-13 21:32:14,464 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:14,464 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:14,465 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:14,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:14,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1697925591, now seen corresponding path program 1 times [2019-10-13 21:32:14,465 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:14,466 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742105813] [2019-10-13 21:32:14,466 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:14,466 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:14,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:14,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:14,541 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:32:14,542 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742105813] [2019-10-13 21:32:14,542 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046853683] [2019-10-13 21:32:14,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:32:14,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:14,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:32:14,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:32:14,666 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:32:14,667 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:32:14,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:32:14,706 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [488500769] [2019-10-13 21:32:14,735 INFO L162 IcfgInterpreter]: Started Sifa with 28 locations of interest [2019-10-13 21:32:14,735 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:32:14,741 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:32:14,747 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:32:14,748 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:32:14,975 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:32:19,267 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 1 for LOIs [2019-10-13 21:32:19,271 INFO L199 IcfgInterpreter]: Interpreting procedure insert with input of size 7 for LOIs [2019-10-13 21:32:19,276 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:32:19,278 INFO L199 IcfgInterpreter]: Interpreting procedure elem_exists with input of size 42 for LOIs [2019-10-13 21:32:19,286 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:32:19,286 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:32:19,287 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 1963#false [2019-10-13 21:32:19,287 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 1968#false [2019-10-13 21:32:19,287 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 73#(and (= main_~x~0 0) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:32:19,287 INFO L193 IcfgInterpreter]: Reachable states at location elem_existsFINAL satisfy 2005#(and (<= |elem_exists_#res| 0) (<= elem_exists_~size 0) (= elem_exists_~size |elem_exists_#in~size|) (not (< elem_exists_~i~0 elem_exists_~size)) (= elem_exists_~set.base |elem_exists_#in~set.base|) (= elem_exists_~value |elem_exists_#in~value|) (exists ((v_prenex_27 Int) (v_prenex_29 Int) (v_prenex_28 Int) (|v_main_~#values~0.base_BEFORE_CALL_53| Int) (v_main_~v~0_BEFORE_CALL_73 Int)) (or (and (= |elem_exists_#in~value| (select (select |#memory_int| v_prenex_27) 0)) (<= |elem_exists_#in~size| 0)) (and (<= |elem_exists_#in~size| 1) (<= 1 v_prenex_29) (<= |elem_exists_#in~size| 0) (<= 0 v_prenex_29) (<= |elem_exists_#in~size| 2147483647) (<= v_prenex_29 0) (< v_prenex_29 100000) (= (select (select |#memory_int| v_prenex_28) (* v_prenex_29 4)) |elem_exists_#in~value|) (<= 0 (+ |elem_exists_#in~size| 2147483648))) (and (<= |elem_exists_#in~size| 1) (<= 1 v_main_~v~0_BEFORE_CALL_73) (< v_main_~v~0_BEFORE_CALL_73 100000) (<= |elem_exists_#in~size| 2147483647) (<= v_main_~v~0_BEFORE_CALL_73 100000) (= (select (select |#memory_int| |v_main_~#values~0.base_BEFORE_CALL_53|) (* v_main_~v~0_BEFORE_CALL_73 4)) |elem_exists_#in~value|) (<= 0 (+ |elem_exists_#in~size| 2147483648))))) (= |elem_exists_#in~set.offset| elem_exists_~set.offset) (<= |elem_exists_#in~size| 0) (= |elem_exists_#res| 0) (<= 0 elem_exists_~i~0) (<= elem_exists_~i~0 0) (= elem_exists_~i~0 0) (<= 0 |elem_exists_#res|)) [2019-10-13 21:32:19,288 INFO L193 IcfgInterpreter]: Reachable states at location L47 satisfy 1949#(and (<= main_~n~0 2147483647) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 1 main_~v~0) (<= |main_~#values~0.offset| 0) (<= 0 (+ main_~n~0 2147483648)) (< main_~x~0 main_~n~0) (<= 0 |main_~#values~0.offset|) (<= main_~x~0 0) (<= 0 main_~x~0) (= |main_#t~mem18| (select (select |#memory_int| |main_~#set~0.base|) (+ |main_~#set~0.offset| (* main_~y~0 4)))) (= main_~x~0 0) (not (< main_~v~0 100000)) (<= 1 main_~n~0) (<= main_~n~0 1) (= |main_#t~mem17| (select (select |#memory_int| |main_~#set~0.base|) (+ |main_~#set~0.offset| (* main_~x~0 4)))) (<= 100000 main_~v~0) (< main_~y~0 main_~n~0) (<= main_~y~0 1) (= |main_~#values~0.offset| 0)) [2019-10-13 21:32:19,289 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 1419#(and (or (and (<= main_~n~0 0) (<= main_~v~0 0) (= main_~v~0 0) (= main_~x~0 0) (<= |main_~#values~0.offset| 0) (= |main_~#values~0.offset| 0)) (and (<= main_~n~0 2147483647) (= main_~x~0 0) (<= 1 main_~v~0) (<= |main_~#values~0.offset| 0) (<= 0 (+ main_~n~0 2147483648)) (= |main_~#values~0.offset| 0))) (<= 0 main_~v~0) (<= main_~n~0 1) (<= main_~x~0 0) (<= 0 |main_~#values~0.offset|) (<= 0 main_~x~0)) [2019-10-13 21:32:19,289 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:19,289 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:19,289 INFO L193 IcfgInterpreter]: Reachable states at location L40-2 satisfy 1544#(and (<= main_~n~0 2147483647) (= main_~x~0 0) (<= |main_~#values~0.offset| 0) (<= 0 (+ main_~n~0 2147483648)) (<= main_~n~0 1) (<= 0 main_~v~0) (<= main_~x~0 0) (<= 0 |main_~#values~0.offset|) (= |main_~#values~0.offset| 0) (<= 0 main_~x~0)) [2019-10-13 21:32:19,289 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 68#true [2019-10-13 21:32:19,290 INFO L193 IcfgInterpreter]: Reachable states at location L42-1 satisfy 1766#(and (and (<= main_~n~0 0) (= main_~x~0 0) (= |main_~#values~0.offset| 0)) (<= |main_~#values~0.offset| 0) (<= 0 main_~v~0) (<= main_~x~0 0) (<= 0 |main_~#values~0.offset|) (<= 0 main_~x~0) (<= |main_#t~ret14| 1)) [2019-10-13 21:32:19,290 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 2000#(and (exists ((v_prenex_27 Int) (v_prenex_29 Int) (v_prenex_28 Int) (|v_main_~#values~0.base_BEFORE_CALL_53| Int) (v_main_~v~0_BEFORE_CALL_73 Int)) (or (and (= |elem_exists_#in~value| (select (select |#memory_int| v_prenex_27) 0)) (<= |elem_exists_#in~size| 0)) (and (<= |elem_exists_#in~size| 1) (<= 1 v_prenex_29) (<= |elem_exists_#in~size| 0) (<= 0 v_prenex_29) (<= |elem_exists_#in~size| 2147483647) (<= v_prenex_29 0) (< v_prenex_29 100000) (= (select (select |#memory_int| v_prenex_28) (* v_prenex_29 4)) |elem_exists_#in~value|) (<= 0 (+ |elem_exists_#in~size| 2147483648))) (and (<= |elem_exists_#in~size| 1) (<= 1 v_main_~v~0_BEFORE_CALL_73) (< v_main_~v~0_BEFORE_CALL_73 100000) (<= |elem_exists_#in~size| 2147483647) (<= v_main_~v~0_BEFORE_CALL_73 100000) (= (select (select |#memory_int| |v_main_~#values~0.base_BEFORE_CALL_53|) (* v_main_~v~0_BEFORE_CALL_73 4)) |elem_exists_#in~value|) (<= 0 (+ |elem_exists_#in~size| 2147483648))))) (= |elem_exists_#in~set.offset| elem_exists_~set.offset) (<= 0 elem_exists_~i~0) (= elem_exists_~size |elem_exists_#in~size|) (<= elem_exists_~i~0 0) (= elem_exists_~i~0 0) (= elem_exists_~set.base |elem_exists_#in~set.base|) (= elem_exists_~value |elem_exists_#in~value|)) [2019-10-13 21:32:19,290 INFO L193 IcfgInterpreter]: Reachable states at location L42 satisfy 1867#(and (<= main_~n~0 0) (= main_~x~0 0) (<= |main_~#values~0.offset| 0) (<= 0 main_~v~0) (<= main_~x~0 0) (<= 0 |main_~#values~0.offset|) (= |main_~#values~0.offset| 0) (<= 0 main_~x~0)) [2019-10-13 21:32:19,290 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 111#(and (or (and (<= main_~n~0 0) (not (= 0 |main_~#values~0.base|)) (<= main_~v~0 0) (< |main_~#values~0.base| |#StackHeapBarrier|) (= 0 |main_~#values~0.offset|) (= main_~v~0 0) (= main_~x~0 0) (not (< main_~x~0 main_~n~0)) (= (select |#length| |main_~#values~0.base|) 400000) (= (select |#valid| |main_~#values~0.base|) 1)) (and (<= main_~n~0 0) (= main_~x~0 0) (= |main_~#values~0.offset| 0))) (<= |main_~#values~0.offset| 0) (<= 0 main_~v~0) (<= main_~x~0 0) (<= 0 |main_~#values~0.offset|) (<= 0 main_~x~0)) [2019-10-13 21:32:19,292 INFO L193 IcfgInterpreter]: Reachable states at location L46-3 satisfy 1954#(and (<= 0 main_~n~0) (<= main_~n~0 2147483647) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 1 main_~v~0) (<= |main_~#values~0.offset| 0) (<= 0 (+ main_~n~0 2147483648)) (< main_~x~0 main_~n~0) (<= 0 |main_~#values~0.offset|) (<= main_~x~0 0) (<= 0 main_~x~0) (= main_~x~0 0) (not (< main_~v~0 100000)) (<= main_~n~0 1) (<= 100000 main_~v~0) (<= main_~y~0 1) (= |main_~#values~0.offset| 0)) [2019-10-13 21:32:19,292 INFO L193 IcfgInterpreter]: Reachable states at location insertEXIT satisfy 1982#(and (= insert_~set.base |insert_#in~set.base|) (<= insert_~size 0) (<= |insert_#in~size| 0) (= |insert_#in~value| insert_~value) (= |insert_#in~set.offset| insert_~set.offset) (= |#memory_int| (store |old(#memory_int)| insert_~set.base (store (select |old(#memory_int)| insert_~set.base) (+ insert_~set.offset (* insert_~size 4)) insert_~value))) (<= |insert_#res| 1) (= |insert_#res| (+ insert_~size 1)) (= |insert_#in~size| insert_~size)) [2019-10-13 21:32:19,292 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 1986#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:32:19,293 INFO L193 IcfgInterpreter]: Reachable states at location elem_existsENTRY satisfy 1995#(exists ((v_prenex_27 Int) (v_prenex_29 Int) (v_prenex_28 Int) (|v_main_~#values~0.base_BEFORE_CALL_53| Int) (v_main_~v~0_BEFORE_CALL_73 Int)) (or (and (= |elem_exists_#in~value| (select (select |#memory_int| v_prenex_27) 0)) (<= |elem_exists_#in~size| 0)) (and (<= |elem_exists_#in~size| 1) (<= 1 v_prenex_29) (<= |elem_exists_#in~size| 0) (<= 0 v_prenex_29) (<= |elem_exists_#in~size| 2147483647) (<= v_prenex_29 0) (< v_prenex_29 100000) (= (select (select |#memory_int| v_prenex_28) (* v_prenex_29 4)) |elem_exists_#in~value|) (<= 0 (+ |elem_exists_#in~size| 2147483648))) (and (<= |elem_exists_#in~size| 1) (<= 1 v_main_~v~0_BEFORE_CALL_73) (< v_main_~v~0_BEFORE_CALL_73 100000) (<= |elem_exists_#in~size| 2147483647) (<= v_main_~v~0_BEFORE_CALL_73 100000) (= (select (select |#memory_int| |v_main_~#values~0.base_BEFORE_CALL_53|) (* v_main_~v~0_BEFORE_CALL_73 4)) |elem_exists_#in~value|) (<= 0 (+ |elem_exists_#in~size| 2147483648))))) [2019-10-13 21:32:19,293 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 1973#false [2019-10-13 21:32:19,293 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 1991#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:19,293 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:32:19,294 INFO L193 IcfgInterpreter]: Reachable states at location L41-2 satisfy 1923#(or (and (<= main_~n~0 0) (<= |main_#t~ret12| 0) (<= |main_~#values~0.offset| 0) (<= main_~v~0 100000) (<= 0 main_~v~0) (<= main_~x~0 0) (<= 0 |main_~#values~0.offset|) (<= 0 |main_#t~ret12|) (<= 0 main_~x~0) (= main_~x~0 0) (<= 0 (+ |main_#t~ret12| 2147483648)) (<= |main_#t~ret12| 2147483647) (= |main_~#values~0.offset| 0) (= |main_#t~ret12| 0)) (and (<= main_~n~0 0) (<= main_~v~0 0) (<= |main_#t~ret12| 0) (<= |main_~#values~0.offset| 0) (<= 0 main_~v~0) (<= main_~x~0 0) (<= 0 |main_~#values~0.offset|) (<= 0 |main_#t~ret12|) (<= 0 main_~x~0) (= main_~v~0 0) (= main_~x~0 0) (<= 0 (+ |main_#t~ret12| 2147483648)) (< main_~v~0 100000) (<= |main_#t~ret12| 2147483647) (= |main_#t~mem11| (select (select |#memory_int| |main_~#values~0.base|) (+ (* main_~v~0 4) |main_~#values~0.offset|))) (= |main_#t~ret12| 0) (= |main_~#values~0.offset| 0))) [2019-10-13 21:32:19,294 INFO L193 IcfgInterpreter]: Reachable states at location insertENTRY satisfy 1977#(and (<= |insert_#in~size| 0) (= |#memory_int| |old(#memory_int)|)) [2019-10-13 21:32:19,294 INFO L193 IcfgInterpreter]: Reachable states at location elem_existsEXIT satisfy 2010#(and (<= |elem_exists_#res| 0) (<= elem_exists_~size 0) (= elem_exists_~size |elem_exists_#in~size|) (not (< elem_exists_~i~0 elem_exists_~size)) (= elem_exists_~set.base |elem_exists_#in~set.base|) (= elem_exists_~value |elem_exists_#in~value|) (exists ((v_prenex_27 Int) (v_prenex_29 Int) (v_prenex_28 Int) (|v_main_~#values~0.base_BEFORE_CALL_53| Int) (v_main_~v~0_BEFORE_CALL_73 Int)) (or (and (= |elem_exists_#in~value| (select (select |#memory_int| v_prenex_27) 0)) (<= |elem_exists_#in~size| 0)) (and (<= |elem_exists_#in~size| 1) (<= 1 v_prenex_29) (<= |elem_exists_#in~size| 0) (<= 0 v_prenex_29) (<= |elem_exists_#in~size| 2147483647) (<= v_prenex_29 0) (< v_prenex_29 100000) (= (select (select |#memory_int| v_prenex_28) (* v_prenex_29 4)) |elem_exists_#in~value|) (<= 0 (+ |elem_exists_#in~size| 2147483648))) (and (<= |elem_exists_#in~size| 1) (<= 1 v_main_~v~0_BEFORE_CALL_73) (< v_main_~v~0_BEFORE_CALL_73 100000) (<= |elem_exists_#in~size| 2147483647) (<= v_main_~v~0_BEFORE_CALL_73 100000) (= (select (select |#memory_int| |v_main_~#values~0.base_BEFORE_CALL_53|) (* v_main_~v~0_BEFORE_CALL_73 4)) |elem_exists_#in~value|) (<= 0 (+ |elem_exists_#in~size| 2147483648))))) (= |elem_exists_#in~set.offset| elem_exists_~set.offset) (<= |elem_exists_#in~size| 0) (= |elem_exists_#res| 0) (<= 0 elem_exists_~i~0) (<= elem_exists_~i~0 0) (= elem_exists_~i~0 0) (<= 0 |elem_exists_#res|)) [2019-10-13 21:32:19,294 INFO L193 IcfgInterpreter]: Reachable states at location L41-1 satisfy 1910#(and (<= main_~n~0 0) (= main_~x~0 0) (<= |main_#t~ret12| 0) (<= |main_~#values~0.offset| 0) (<= main_~v~0 100000) (<= 0 main_~v~0) (<= main_~x~0 0) (<= 0 |main_~#values~0.offset|) (<= 0 |main_#t~ret12|) (= |main_~#values~0.offset| 0) (= |main_#t~ret12| 0) (<= 0 main_~x~0)) [2019-10-13 21:32:19,295 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 1958#false [2019-10-13 21:32:19,295 INFO L193 IcfgInterpreter]: Reachable states at location L41 satisfy 1289#(and (and (= main_~x~0 0) (= |main_~#values~0.offset| 0)) (<= |main_~#values~0.offset| 0) (<= main_~v~0 100000) (<= 0 main_~v~0) (<= main_~n~0 1) (<= main_~x~0 0) (<= 0 |main_~#values~0.offset|) (<= 0 main_~x~0)) [2019-10-13 21:32:19,295 INFO L193 IcfgInterpreter]: Reachable states at location L45-3 satisfy 1928#(and (<= 0 (+ main_~n~0 2147483648)) (<= main_~n~0 1) (<= 100000 main_~v~0) (<= main_~x~0 0) (or (and (<= main_~n~0 2147483647) (= main_~x~0 0) (<= 1 main_~v~0) (not (< main_~v~0 100000)) (<= |main_~#values~0.offset| 0) (<= 0 |main_~#values~0.offset|) (= |main_~#values~0.offset| 0)) (and (<= main_~n~0 0) (= main_~v~0 0) (= main_~x~0 0) (not (< main_~v~0 100000)) (<= |main_~#values~0.offset| 0) (<= 0 |main_~#values~0.offset|) (= |main_~#values~0.offset| 0))) (<= 0 main_~x~0)) [2019-10-13 21:32:20,140 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-13 21:32:20,140 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [4, 4, 4] total 24 [2019-10-13 21:32:20,141 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042139876] [2019-10-13 21:32:20,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-13 21:32:20,142 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:20,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-13 21:32:20,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2019-10-13 21:32:20,146 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand 20 states. [2019-10-13 21:32:22,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:22,263 INFO L93 Difference]: Finished difference Result 112 states and 149 transitions. [2019-10-13 21:32:22,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-13 21:32:22,264 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2019-10-13 21:32:22,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:22,267 INFO L225 Difference]: With dead ends: 112 [2019-10-13 21:32:22,268 INFO L226 Difference]: Without dead ends: 83 [2019-10-13 21:32:22,269 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 68 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 590 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=405, Invalid=1757, Unknown=0, NotChecked=0, Total=2162 [2019-10-13 21:32:22,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-10-13 21:32:22,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 60. [2019-10-13 21:32:22,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-13 21:32:22,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 75 transitions. [2019-10-13 21:32:22,284 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 75 transitions. Word has length 30 [2019-10-13 21:32:22,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:22,284 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 75 transitions. [2019-10-13 21:32:22,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-13 21:32:22,285 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2019-10-13 21:32:22,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-13 21:32:22,286 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:22,286 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:22,489 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:32:22,490 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:22,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:22,491 INFO L82 PathProgramCache]: Analyzing trace with hash 545937229, now seen corresponding path program 1 times [2019-10-13 21:32:22,491 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:22,491 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919393936] [2019-10-13 21:32:22,492 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:22,492 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:22,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:22,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:22,575 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:32:22,576 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919393936] [2019-10-13 21:32:22,576 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138448648] [2019-10-13 21:32:22,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:32:22,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:22,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:32:22,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:32:22,708 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:32:22,708 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:32:22,733 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:32:22,734 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1488815557] [2019-10-13 21:32:22,736 INFO L162 IcfgInterpreter]: Started Sifa with 28 locations of interest [2019-10-13 21:32:22,736 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:32:22,736 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:32:22,737 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:32:22,737 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:32:22,758 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:32:26,101 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 1 for LOIs [2019-10-13 21:32:26,104 INFO L199 IcfgInterpreter]: Interpreting procedure insert with input of size 7 for LOIs [2019-10-13 21:32:26,108 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:32:26,110 INFO L199 IcfgInterpreter]: Interpreting procedure elem_exists with input of size 34 for LOIs [2019-10-13 21:32:26,120 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:32:26,120 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:32:26,120 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 2062#false [2019-10-13 21:32:26,120 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 2067#false [2019-10-13 21:32:26,121 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 73#(and (= main_~x~0 0) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:32:26,121 INFO L193 IcfgInterpreter]: Reachable states at location elem_existsFINAL satisfy 2104#(and (<= |elem_exists_#res| 0) (<= elem_exists_~size 0) (= elem_exists_~size |elem_exists_#in~size|) (not (< elem_exists_~i~0 elem_exists_~size)) (= elem_exists_~set.base |elem_exists_#in~set.base|) (= elem_exists_~value |elem_exists_#in~value|) (= |elem_exists_#in~set.offset| elem_exists_~set.offset) (<= |elem_exists_#in~size| 0) (exists ((v_prenex_110 Int) (|v_main_~#values~0.base_BEFORE_CALL_200| Int) (v_main_~v~0_BEFORE_CALL_274 Int)) (or (and (<= |elem_exists_#in~size| 1) (<= 0 v_main_~v~0_BEFORE_CALL_274) (<= |elem_exists_#in~size| 0) (< v_main_~v~0_BEFORE_CALL_274 100000) (<= v_main_~v~0_BEFORE_CALL_274 0) (<= |elem_exists_#in~size| 2147483647) (<= 1 v_main_~v~0_BEFORE_CALL_274) (= |elem_exists_#in~value| (select (select |#memory_int| v_prenex_110) (* v_main_~v~0_BEFORE_CALL_274 4))) (<= 0 (+ |elem_exists_#in~size| 2147483648))) (and (<= |elem_exists_#in~size| 1) (<= v_main_~v~0_BEFORE_CALL_274 100000) (< v_main_~v~0_BEFORE_CALL_274 100000) (<= |elem_exists_#in~size| 2147483647) (<= 1 v_main_~v~0_BEFORE_CALL_274) (= |elem_exists_#in~value| (select (select |#memory_int| v_prenex_110) (* v_main_~v~0_BEFORE_CALL_274 4))) (<= 0 (+ |elem_exists_#in~size| 2147483648))) (and (<= |elem_exists_#in~size| 0) (= |elem_exists_#in~value| (select (select |#memory_int| |v_main_~#values~0.base_BEFORE_CALL_200|) 0))))) (= |elem_exists_#res| 0) (<= 0 elem_exists_~i~0) (<= elem_exists_~i~0 0) (= elem_exists_~i~0 0) (<= 0 |elem_exists_#res|)) [2019-10-13 21:32:26,121 INFO L193 IcfgInterpreter]: Reachable states at location L47 satisfy 2005#(and (<= 1 main_~y~0) (<= |main_~#values~0.offset| 0) (<= 1 main_~n~0) (<= main_~n~0 1) (<= 100000 main_~v~0) (<= main_~x~0 0) (<= main_~y~0 1) (<= 0 |main_~#values~0.offset|) (= |main_~#values~0.offset| 0) (<= 0 main_~x~0)) [2019-10-13 21:32:26,121 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 1426#(and (or (and (<= main_~n~0 2147483647) (<= 1 main_~v~0) (= main_~x~0 0) (<= 0 (+ main_~n~0 2147483648)) (= |main_~#values~0.offset| 0)) (and (<= main_~n~0 0) (<= main_~v~0 0) (= main_~v~0 0) (= main_~x~0 0) (= |main_~#values~0.offset| 0))) (<= |main_~#values~0.offset| 0) (<= 0 main_~v~0) (<= main_~n~0 1) (<= main_~x~0 0) (<= 0 |main_~#values~0.offset|) (<= 0 main_~x~0)) [2019-10-13 21:32:26,121 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:26,122 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:26,122 INFO L193 IcfgInterpreter]: Reachable states at location L40-2 satisfy 1551#(and (<= main_~n~0 2147483647) (= main_~x~0 0) (<= |main_~#values~0.offset| 0) (<= 0 (+ main_~n~0 2147483648)) (<= main_~n~0 1) (<= 0 main_~v~0) (<= main_~x~0 0) (<= 0 |main_~#values~0.offset|) (= |main_~#values~0.offset| 0) (<= 0 main_~x~0)) [2019-10-13 21:32:26,122 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 68#true [2019-10-13 21:32:26,122 INFO L193 IcfgInterpreter]: Reachable states at location L42-1 satisfy 1769#(and (and (<= main_~n~0 0) (= main_~x~0 0) (= |main_~#values~0.offset| 0)) (<= |main_~#values~0.offset| 0) (<= 0 main_~v~0) (<= main_~x~0 0) (<= 0 |main_~#values~0.offset|) (<= 0 main_~x~0) (<= |main_#t~ret14| 1)) [2019-10-13 21:32:26,122 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 2099#(and (= |elem_exists_#in~set.offset| elem_exists_~set.offset) (exists ((v_prenex_110 Int) (|v_main_~#values~0.base_BEFORE_CALL_200| Int) (v_main_~v~0_BEFORE_CALL_274 Int)) (or (and (<= |elem_exists_#in~size| 1) (<= 0 v_main_~v~0_BEFORE_CALL_274) (<= |elem_exists_#in~size| 0) (< v_main_~v~0_BEFORE_CALL_274 100000) (<= v_main_~v~0_BEFORE_CALL_274 0) (<= |elem_exists_#in~size| 2147483647) (<= 1 v_main_~v~0_BEFORE_CALL_274) (= |elem_exists_#in~value| (select (select |#memory_int| v_prenex_110) (* v_main_~v~0_BEFORE_CALL_274 4))) (<= 0 (+ |elem_exists_#in~size| 2147483648))) (and (<= |elem_exists_#in~size| 1) (<= v_main_~v~0_BEFORE_CALL_274 100000) (< v_main_~v~0_BEFORE_CALL_274 100000) (<= |elem_exists_#in~size| 2147483647) (<= 1 v_main_~v~0_BEFORE_CALL_274) (= |elem_exists_#in~value| (select (select |#memory_int| v_prenex_110) (* v_main_~v~0_BEFORE_CALL_274 4))) (<= 0 (+ |elem_exists_#in~size| 2147483648))) (and (<= |elem_exists_#in~size| 0) (= |elem_exists_#in~value| (select (select |#memory_int| |v_main_~#values~0.base_BEFORE_CALL_200|) 0))))) (<= 0 elem_exists_~i~0) (= elem_exists_~size |elem_exists_#in~size|) (<= elem_exists_~i~0 0) (= elem_exists_~i~0 0) (= elem_exists_~set.base |elem_exists_#in~set.base|) (= elem_exists_~value |elem_exists_#in~value|)) [2019-10-13 21:32:26,123 INFO L193 IcfgInterpreter]: Reachable states at location L42 satisfy 1873#(and (<= main_~n~0 0) (= main_~x~0 0) (<= |main_~#values~0.offset| 0) (<= 0 main_~v~0) (<= main_~x~0 0) (<= 0 |main_~#values~0.offset|) (= |main_~#values~0.offset| 0) (<= 0 main_~x~0)) [2019-10-13 21:32:26,123 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 111#(and (or (and (<= main_~n~0 0) (not (= 0 |main_~#values~0.base|)) (<= main_~v~0 0) (< |main_~#values~0.base| |#StackHeapBarrier|) (= 0 |main_~#values~0.offset|) (= main_~v~0 0) (= main_~x~0 0) (not (< main_~x~0 main_~n~0)) (= (select |#length| |main_~#values~0.base|) 400000) (= (select |#valid| |main_~#values~0.base|) 1)) (and (<= main_~n~0 0) (= main_~x~0 0) (= |main_~#values~0.offset| 0))) (<= |main_~#values~0.offset| 0) (<= 0 main_~v~0) (<= main_~x~0 0) (<= 0 |main_~#values~0.offset|) (<= 0 main_~x~0)) [2019-10-13 21:32:26,123 INFO L193 IcfgInterpreter]: Reachable states at location L46-3 satisfy 2033#(and (<= 0 main_~n~0) (<= 1 main_~y~0) (<= main_~x~0 1) (<= |main_~#values~0.offset| 0) (<= main_~y~0 2) (<= main_~n~0 1) (<= 100000 main_~v~0) (<= 0 |main_~#values~0.offset|) (= |main_~#values~0.offset| 0) (<= 0 main_~x~0)) [2019-10-13 21:32:26,123 INFO L193 IcfgInterpreter]: Reachable states at location insertEXIT satisfy 2081#(and (= insert_~set.base |insert_#in~set.base|) (<= insert_~size 0) (<= |insert_#in~size| 0) (= |insert_#in~value| insert_~value) (= |insert_#in~set.offset| insert_~set.offset) (= |#memory_int| (store |old(#memory_int)| insert_~set.base (store (select |old(#memory_int)| insert_~set.base) (+ insert_~set.offset (* insert_~size 4)) insert_~value))) (<= |insert_#res| 1) (= |insert_#res| (+ insert_~size 1)) (= |insert_#in~size| insert_~size)) [2019-10-13 21:32:26,124 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 2085#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:32:26,124 INFO L193 IcfgInterpreter]: Reachable states at location elem_existsENTRY satisfy 2094#(exists ((v_prenex_110 Int) (|v_main_~#values~0.base_BEFORE_CALL_200| Int) (v_main_~v~0_BEFORE_CALL_274 Int)) (or (and (<= |elem_exists_#in~size| 1) (<= 0 v_main_~v~0_BEFORE_CALL_274) (<= |elem_exists_#in~size| 0) (< v_main_~v~0_BEFORE_CALL_274 100000) (<= v_main_~v~0_BEFORE_CALL_274 0) (<= |elem_exists_#in~size| 2147483647) (<= 1 v_main_~v~0_BEFORE_CALL_274) (= |elem_exists_#in~value| (select (select |#memory_int| v_prenex_110) (* v_main_~v~0_BEFORE_CALL_274 4))) (<= 0 (+ |elem_exists_#in~size| 2147483648))) (and (<= |elem_exists_#in~size| 1) (<= v_main_~v~0_BEFORE_CALL_274 100000) (< v_main_~v~0_BEFORE_CALL_274 100000) (<= |elem_exists_#in~size| 2147483647) (<= 1 v_main_~v~0_BEFORE_CALL_274) (= |elem_exists_#in~value| (select (select |#memory_int| v_prenex_110) (* v_main_~v~0_BEFORE_CALL_274 4))) (<= 0 (+ |elem_exists_#in~size| 2147483648))) (and (<= |elem_exists_#in~size| 0) (= |elem_exists_#in~value| (select (select |#memory_int| |v_main_~#values~0.base_BEFORE_CALL_200|) 0))))) [2019-10-13 21:32:26,124 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 2072#false [2019-10-13 21:32:26,124 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 2090#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:26,124 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:32:26,125 INFO L193 IcfgInterpreter]: Reachable states at location L41-2 satisfy 1929#(or (and (<= main_~n~0 0) (<= |main_#t~ret12| 0) (<= |main_~#values~0.offset| 0) (<= main_~v~0 100000) (<= 0 main_~v~0) (<= main_~x~0 0) (<= 0 |main_~#values~0.offset|) (<= 0 |main_#t~ret12|) (<= 0 main_~x~0) (= main_~x~0 0) (<= 0 (+ |main_#t~ret12| 2147483648)) (<= |main_#t~ret12| 2147483647) (= |main_~#values~0.offset| 0) (= |main_#t~ret12| 0)) (and (<= main_~n~0 0) (<= main_~v~0 0) (<= |main_#t~ret12| 0) (<= |main_~#values~0.offset| 0) (<= 0 main_~v~0) (<= main_~x~0 0) (<= 0 |main_~#values~0.offset|) (<= 0 |main_#t~ret12|) (<= 0 main_~x~0) (= main_~v~0 0) (= main_~x~0 0) (<= 0 (+ |main_#t~ret12| 2147483648)) (< main_~v~0 100000) (<= |main_#t~ret12| 2147483647) (= |main_#t~mem11| (select (select |#memory_int| |main_~#values~0.base|) (+ (* main_~v~0 4) |main_~#values~0.offset|))) (= |main_#t~ret12| 0) (= |main_~#values~0.offset| 0))) [2019-10-13 21:32:26,125 INFO L193 IcfgInterpreter]: Reachable states at location insertENTRY satisfy 2076#(and (<= |insert_#in~size| 0) (= |#memory_int| |old(#memory_int)|)) [2019-10-13 21:32:26,125 INFO L193 IcfgInterpreter]: Reachable states at location elem_existsEXIT satisfy 2109#(and (<= |elem_exists_#res| 0) (<= elem_exists_~size 0) (= elem_exists_~size |elem_exists_#in~size|) (not (< elem_exists_~i~0 elem_exists_~size)) (= elem_exists_~set.base |elem_exists_#in~set.base|) (= elem_exists_~value |elem_exists_#in~value|) (= |elem_exists_#in~set.offset| elem_exists_~set.offset) (<= |elem_exists_#in~size| 0) (exists ((v_prenex_110 Int) (|v_main_~#values~0.base_BEFORE_CALL_200| Int) (v_main_~v~0_BEFORE_CALL_274 Int)) (or (and (<= |elem_exists_#in~size| 1) (<= 0 v_main_~v~0_BEFORE_CALL_274) (<= |elem_exists_#in~size| 0) (< v_main_~v~0_BEFORE_CALL_274 100000) (<= v_main_~v~0_BEFORE_CALL_274 0) (<= |elem_exists_#in~size| 2147483647) (<= 1 v_main_~v~0_BEFORE_CALL_274) (= |elem_exists_#in~value| (select (select |#memory_int| v_prenex_110) (* v_main_~v~0_BEFORE_CALL_274 4))) (<= 0 (+ |elem_exists_#in~size| 2147483648))) (and (<= |elem_exists_#in~size| 1) (<= v_main_~v~0_BEFORE_CALL_274 100000) (< v_main_~v~0_BEFORE_CALL_274 100000) (<= |elem_exists_#in~size| 2147483647) (<= 1 v_main_~v~0_BEFORE_CALL_274) (= |elem_exists_#in~value| (select (select |#memory_int| v_prenex_110) (* v_main_~v~0_BEFORE_CALL_274 4))) (<= 0 (+ |elem_exists_#in~size| 2147483648))) (and (<= |elem_exists_#in~size| 0) (= |elem_exists_#in~value| (select (select |#memory_int| |v_main_~#values~0.base_BEFORE_CALL_200|) 0))))) (= |elem_exists_#res| 0) (<= 0 elem_exists_~i~0) (<= elem_exists_~i~0 0) (= elem_exists_~i~0 0) (<= 0 |elem_exists_#res|)) [2019-10-13 21:32:26,125 INFO L193 IcfgInterpreter]: Reachable states at location L41-1 satisfy 1916#(and (<= main_~n~0 0) (= main_~x~0 0) (<= |main_#t~ret12| 0) (<= |main_~#values~0.offset| 0) (<= main_~v~0 100000) (<= 0 main_~v~0) (<= main_~x~0 0) (<= 0 |main_~#values~0.offset|) (<= 0 |main_#t~ret12|) (= |main_~#values~0.offset| 0) (= |main_#t~ret12| 0) (<= 0 main_~x~0)) [2019-10-13 21:32:26,125 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 2057#false [2019-10-13 21:32:26,126 INFO L193 IcfgInterpreter]: Reachable states at location L41 satisfy 1296#(and (and (= main_~x~0 0) (= |main_~#values~0.offset| 0)) (<= |main_~#values~0.offset| 0) (<= main_~v~0 100000) (<= 0 main_~v~0) (<= main_~n~0 1) (<= main_~x~0 0) (<= 0 |main_~#values~0.offset|) (<= 0 main_~x~0)) [2019-10-13 21:32:26,126 INFO L193 IcfgInterpreter]: Reachable states at location L45-3 satisfy 2053#(and (<= main_~x~0 1) (and (<= |main_~#values~0.offset| 0) (<= 0 (+ main_~n~0 2147483648)) (<= main_~n~0 1) (<= 100000 main_~v~0) (<= 0 |main_~#values~0.offset|) (= |main_~#values~0.offset| 0) (<= 0 main_~x~0))) [2019-10-13 21:32:27,307 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-13 21:32:27,307 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [5, 4, 4] total 28 [2019-10-13 21:32:27,307 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102173157] [2019-10-13 21:32:27,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-13 21:32:27,309 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:27,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-13 21:32:27,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=634, Unknown=0, NotChecked=0, Total=756 [2019-10-13 21:32:27,310 INFO L87 Difference]: Start difference. First operand 60 states and 75 transitions. Second operand 21 states. [2019-10-13 21:32:29,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:29,633 INFO L93 Difference]: Finished difference Result 95 states and 123 transitions. [2019-10-13 21:32:29,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-13 21:32:29,634 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 32 [2019-10-13 21:32:29,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:29,636 INFO L225 Difference]: With dead ends: 95 [2019-10-13 21:32:29,636 INFO L226 Difference]: Without dead ends: 81 [2019-10-13 21:32:29,638 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 636 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=439, Invalid=2213, Unknown=0, NotChecked=0, Total=2652 [2019-10-13 21:32:29,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-10-13 21:32:29,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 58. [2019-10-13 21:32:29,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-13 21:32:29,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2019-10-13 21:32:29,650 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 32 [2019-10-13 21:32:29,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:29,651 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2019-10-13 21:32:29,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-13 21:32:29,651 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2019-10-13 21:32:29,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-13 21:32:29,652 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:29,652 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:29,857 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:32:29,857 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:29,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:29,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1911824755, now seen corresponding path program 1 times [2019-10-13 21:32:29,858 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:29,858 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331789487] [2019-10-13 21:32:29,858 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:29,858 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:29,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:29,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:29,973 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 21:32:29,974 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331789487] [2019-10-13 21:32:29,974 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859073953] [2019-10-13 21:32:29,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:32:30,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:30,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:32:30,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:32:30,192 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-13 21:32:30,193 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:32:30,225 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-13 21:32:30,226 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [632969975] [2019-10-13 21:32:30,229 INFO L162 IcfgInterpreter]: Started Sifa with 29 locations of interest [2019-10-13 21:32:30,229 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:32:30,229 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:32:30,230 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:32:30,230 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:32:30,246 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:32:30,605 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:32:30,606 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:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) 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.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:102) 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:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) ... 21 more [2019-10-13 21:32:30,612 INFO L168 Benchmark]: Toolchain (without parser) took 17966.33 ms. Allocated memory was 138.9 MB in the beginning and 489.7 MB in the end (delta: 350.7 MB). Free memory was 103.9 MB in the beginning and 407.4 MB in the end (delta: -303.5 MB). Peak memory consumption was 47.2 MB. Max. memory is 7.1 GB. [2019-10-13 21:32:30,613 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 138.9 MB. Free memory was 122.2 MB in the beginning and 122.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-13 21:32:30,613 INFO L168 Benchmark]: CACSL2BoogieTranslator took 390.20 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 103.7 MB in the beginning and 182.7 MB in the end (delta: -78.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 7.1 GB. [2019-10-13 21:32:30,613 INFO L168 Benchmark]: Boogie Preprocessor took 43.56 ms. Allocated memory is still 203.4 MB. Free memory was 182.7 MB in the beginning and 180.3 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-10-13 21:32:30,614 INFO L168 Benchmark]: RCFGBuilder took 581.75 ms. Allocated memory is still 203.4 MB. Free memory was 180.3 MB in the beginning and 149.3 MB in the end (delta: 31.0 MB). Peak memory consumption was 31.0 MB. Max. memory is 7.1 GB. [2019-10-13 21:32:30,614 INFO L168 Benchmark]: TraceAbstraction took 16945.97 ms. Allocated memory was 203.4 MB in the beginning and 489.7 MB in the end (delta: 286.3 MB). Free memory was 149.3 MB in the beginning and 407.4 MB in the end (delta: -258.2 MB). Peak memory consumption was 28.1 MB. Max. memory is 7.1 GB. [2019-10-13 21:32:30,616 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.23 ms. Allocated memory is still 138.9 MB. Free memory was 122.2 MB in the beginning and 122.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 390.20 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 103.7 MB in the beginning and 182.7 MB in the end (delta: -78.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.56 ms. Allocated memory is still 203.4 MB. Free memory was 182.7 MB in the beginning and 180.3 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 581.75 ms. Allocated memory is still 203.4 MB. Free memory was 180.3 MB in the beginning and 149.3 MB in the end (delta: 31.0 MB). Peak memory consumption was 31.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16945.97 ms. Allocated memory was 203.4 MB in the beginning and 489.7 MB in the end (delta: 286.3 MB). Free memory was 149.3 MB in the beginning and 407.4 MB in the end (delta: -258.2 MB). Peak memory consumption was 28.1 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:307) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...