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/loop-acceleration/array_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 13:28:53,486 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 13:28:53,489 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 13:28:53,508 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 13:28:53,508 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 13:28:53,510 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 13:28:53,512 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 13:28:53,522 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 13:28:53,527 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 13:28:53,530 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 13:28:53,532 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 13:28:53,533 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 13:28:53,533 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 13:28:53,535 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 13:28:53,538 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 13:28:53,539 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 13:28:53,541 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 13:28:53,542 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 13:28:53,544 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 13:28:53,549 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 13:28:53,553 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 13:28:53,556 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 13:28:53,558 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 13:28:53,559 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 13:28:53,561 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 13:28:53,562 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 13:28:53,562 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 13:28:53,564 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 13:28:53,565 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 13:28:53,566 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 13:28:53,566 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 13:28:53,567 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 13:28:53,568 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 13:28:53,569 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 13:28:53,570 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 13:28:53,570 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 13:28:53,571 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 13:28:53,571 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 13:28:53,571 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 13:28:53,572 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 13:28:53,574 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 13:28:53,575 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-07 13:28:53,601 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 13:28:53,601 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 13:28:53,602 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 13:28:53,603 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 13:28:53,603 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 13:28:53,603 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 13:28:53,603 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 13:28:53,603 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 13:28:53,604 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 13:28:53,604 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 13:28:53,604 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 13:28:53,604 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 13:28:53,604 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 13:28:53,605 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 13:28:53,605 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 13:28:53,605 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 13:28:53,605 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 13:28:53,605 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 13:28:53,606 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 13:28:53,606 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 13:28:53,606 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 13:28:53,606 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 13:28:53,606 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 13:28:53,607 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 13:28:53,607 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 13:28:53,607 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 13:28:53,607 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 13:28:53,608 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 13:28:53,608 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-07 13:28:53,907 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 13:28:53,931 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 13:28:53,937 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 13:28:53,938 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 13:28:53,938 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 13:28:53,939 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array_1-1.c [2019-10-07 13:28:54,015 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76a4f6348/4847b39e7a464217b7e0abc5b169ad8d/FLAG04d511059 [2019-10-07 13:28:54,516 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 13:28:54,517 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_1-1.c [2019-10-07 13:28:54,523 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76a4f6348/4847b39e7a464217b7e0abc5b169ad8d/FLAG04d511059 [2019-10-07 13:28:54,868 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76a4f6348/4847b39e7a464217b7e0abc5b169ad8d [2019-10-07 13:28:54,879 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 13:28:54,881 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 13:28:54,883 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 13:28:54,883 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 13:28:54,886 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 13:28:54,887 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:28:54" (1/1) ... [2019-10-07 13:28:54,890 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@799252b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:54, skipping insertion in model container [2019-10-07 13:28:54,891 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:28:54" (1/1) ... [2019-10-07 13:28:54,898 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 13:28:54,917 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 13:28:55,115 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:28:55,119 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 13:28:55,137 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:28:55,154 INFO L192 MainTranslator]: Completed translation [2019-10-07 13:28:55,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:55 WrapperNode [2019-10-07 13:28:55,155 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 13:28:55,156 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 13:28:55,156 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 13:28:55,156 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 13:28:55,246 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:55" (1/1) ... [2019-10-07 13:28:55,247 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:55" (1/1) ... [2019-10-07 13:28:55,253 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:55" (1/1) ... [2019-10-07 13:28:55,254 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:55" (1/1) ... [2019-10-07 13:28:55,263 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:55" (1/1) ... [2019-10-07 13:28:55,268 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:55" (1/1) ... [2019-10-07 13:28:55,269 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:55" (1/1) ... [2019-10-07 13:28:55,277 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 13:28:55,278 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 13:28:55,278 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 13:28:55,278 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 13:28:55,279 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:55" (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-07 13:28:55,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 13:28:55,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 13:28:55,328 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-07 13:28:55,328 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 13:28:55,328 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 13:28:55,329 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-07 13:28:55,329 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 13:28:55,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 13:28:55,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 13:28:55,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 13:28:55,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 13:28:55,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 13:28:55,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 13:28:55,586 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 13:28:55,587 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-07 13:28:55,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:28:55 BoogieIcfgContainer [2019-10-07 13:28:55,589 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 13:28:55,591 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 13:28:55,591 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 13:28:55,595 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 13:28:55,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 01:28:54" (1/3) ... [2019-10-07 13:28:55,596 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2727ba88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:28:55, skipping insertion in model container [2019-10-07 13:28:55,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:55" (2/3) ... [2019-10-07 13:28:55,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2727ba88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:28:55, skipping insertion in model container [2019-10-07 13:28:55,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:28:55" (3/3) ... [2019-10-07 13:28:55,599 INFO L109 eAbstractionObserver]: Analyzing ICFG array_1-1.c [2019-10-07 13:28:55,611 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 13:28:55,619 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 13:28:55,653 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 13:28:55,678 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 13:28:55,678 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 13:28:55,678 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 13:28:55,678 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 13:28:55,678 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 13:28:55,679 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 13:28:55,679 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 13:28:55,679 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 13:28:55,695 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-10-07 13:28:55,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-07 13:28:55,700 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:55,701 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:55,703 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:55,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:55,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1959451811, now seen corresponding path program 1 times [2019-10-07 13:28:55,715 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:55,715 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:55,716 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:55,716 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:55,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:55,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:55,866 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-07 13:28:55,866 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:55,867 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:55,867 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:28:55,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:28:55,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:28:55,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:28:55,887 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2019-10-07 13:28:55,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:55,922 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2019-10-07 13:28:55,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:28:55,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-10-07 13:28:55,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:55,936 INFO L225 Difference]: With dead ends: 29 [2019-10-07 13:28:55,936 INFO L226 Difference]: Without dead ends: 12 [2019-10-07 13:28:55,939 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-07 13:28:55,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-10-07 13:28:55,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-10-07 13:28:55,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-10-07 13:28:55,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-10-07 13:28:55,973 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-10-07 13:28:55,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:55,973 INFO L462 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-10-07 13:28:55,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:28:55,974 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-10-07 13:28:55,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-07 13:28:55,975 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:55,975 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:55,975 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:55,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:55,976 INFO L82 PathProgramCache]: Analyzing trace with hash 504932467, now seen corresponding path program 1 times [2019-10-07 13:28:55,976 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:55,977 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:55,977 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:55,977 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:55,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:56,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:56,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:28:56,051 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:56,052 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:28:56,052 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-07 13:28:56,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:56,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 13:28:56,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:28:56,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:28:56,155 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:28:56,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:28:56,206 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:28:56,232 INFO L162 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-10-07 13:28:56,233 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:28:56,240 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:28:56,249 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:28:56,250 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:28:56,479 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:28:56,795 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-07 13:28:56,823 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:28:56,835 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:28:56,836 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:28:56,837 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 71#(and (or (and (= |#NULL.base| 0) (<= 0 |main_~#A~0.offset|) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= |main_~#A~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#A~0.offset| 0)) (and (= (select |old(#valid)| |main_~#A~0.base|) 0) (<= 0 |main_~#A~0.offset|) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= |main_~#A~0.offset| 0) (= 0 |main_~#A~0.offset|) (<= main_~i~0 0) (not (= 0 |main_~#A~0.base|)) (= 0 (select |old(#valid)| 0)) (= |#valid| (store |old(#valid)| |main_~#A~0.base| 1)) (< |main_~#A~0.base| |#StackHeapBarrier|) (= |#memory_int| |old(#memory_int)|) (= |#length| (store |old(#length)| |main_~#A~0.base| 8192)) (= |#NULL.offset| 0) (= main_~i~0 0))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:28:56,837 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-07 13:28:56,837 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-07 13:28:56,837 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 105#(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-07 13:28:56,838 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:28:56,838 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 100#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:28:56,839 INFO L193 IcfgInterpreter]: Reachable states at location L18 satisfy 76#(and (= |#NULL.base| 0) (<= 0 |main_~#A~0.offset|) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= |main_~#A~0.offset| 0) (= |main_~#A~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1024 main_~i~0) (= (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4092)) |main_#t~mem1|) (not (< main_~i~0 1024)) (= |#NULL.offset| 0)) [2019-10-07 13:28:56,839 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 91#(and (exists ((|v_main_~#A~0.base_BEFORE_CALL_1| Int) (v_prenex_1 Int)) (or (and (= |#NULL.base| 0) (= 1023 (select (select |#memory_int| v_prenex_1) 4092)) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (not (= 1023 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_1|) 4092))) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= __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-07 13:28:56,840 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 81#(exists ((|v_main_~#A~0.base_BEFORE_CALL_1| Int) (v_prenex_1 Int)) (or (and (= |#NULL.base| 0) (= 1023 (select (select |#memory_int| v_prenex_1) 4092)) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (not (= 1023 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_1|) 4092))) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 13:28:56,841 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 86#(and (exists ((|v_main_~#A~0.base_BEFORE_CALL_1| Int) (v_prenex_1 Int)) (or (and (= |#NULL.base| 0) (= 1023 (select (select |#memory_int| v_prenex_1) 4092)) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (not (= 1023 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_1|) 4092))) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:28:56,843 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 96#(and (exists ((|v_main_~#A~0.base_BEFORE_CALL_1| Int) (v_prenex_1 Int)) (or (and (= |#NULL.base| 0) (= 1023 (select (select |#memory_int| v_prenex_1) 4092)) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (not (= 1023 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_1|) 4092))) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= __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-07 13:28:57,283 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:28:57,283 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 9] total 16 [2019-10-07 13:28:57,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-07 13:28:57,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-07 13:28:57,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-10-07 13:28:57,290 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 16 states. [2019-10-07 13:28:57,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:57,859 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2019-10-07 13:28:57,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-07 13:28:57,860 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 11 [2019-10-07 13:28:57,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:57,861 INFO L225 Difference]: With dead ends: 20 [2019-10-07 13:28:57,861 INFO L226 Difference]: Without dead ends: 15 [2019-10-07 13:28:57,862 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=129, Invalid=521, Unknown=0, NotChecked=0, Total=650 [2019-10-07 13:28:57,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-10-07 13:28:57,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-10-07 13:28:57,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-10-07 13:28:57,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-10-07 13:28:57,868 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2019-10-07 13:28:57,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:57,869 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-10-07 13:28:57,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-07 13:28:57,869 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-10-07 13:28:57,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-07 13:28:57,870 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:57,871 INFO L385 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:58,084 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:28:58,084 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:58,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:58,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1070026915, now seen corresponding path program 2 times [2019-10-07 13:28:58,086 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:58,086 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:58,087 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:58,087 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:58,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:58,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:58,171 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:28:58,172 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:58,172 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:28:58,172 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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-07 13:28:58,226 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-07 13:28:58,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 13:28:58,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-07 13:28:58,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:28:58,245 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:28:58,246 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:28:58,319 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:28:58,320 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:28:58,322 INFO L162 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-10-07 13:28:58,323 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:28:58,324 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:28:58,324 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:28:58,324 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:28:58,397 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:28:58,691 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-07 13:28:58,706 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:28:58,713 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:28:58,714 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:28:58,714 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 71#(and (or (and (= |#NULL.base| 0) (<= 0 |main_~#A~0.offset|) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= |main_~#A~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#A~0.offset| 0)) (and (= (select |old(#valid)| |main_~#A~0.base|) 0) (<= 0 |main_~#A~0.offset|) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= |main_~#A~0.offset| 0) (= 0 |main_~#A~0.offset|) (<= main_~i~0 0) (not (= 0 |main_~#A~0.base|)) (= 0 (select |old(#valid)| 0)) (= |#valid| (store |old(#valid)| |main_~#A~0.base| 1)) (< |main_~#A~0.base| |#StackHeapBarrier|) (= |#memory_int| |old(#memory_int)|) (= |#length| (store |old(#length)| |main_~#A~0.base| 8192)) (= |#NULL.offset| 0) (= main_~i~0 0))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:28:58,714 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-07 13:28:58,714 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-07 13:28:58,715 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 105#(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-07 13:28:58,716 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:28:58,716 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 100#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:28:58,716 INFO L193 IcfgInterpreter]: Reachable states at location L18 satisfy 76#(and (= |#NULL.base| 0) (<= 0 |main_~#A~0.offset|) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= |main_~#A~0.offset| 0) (= |main_~#A~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1024 main_~i~0) (= (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4092)) |main_#t~mem1|) (not (< main_~i~0 1024)) (= |#NULL.offset| 0)) [2019-10-07 13:28:58,717 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 91#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_2 Int) (|v_main_~#A~0.base_BEFORE_CALL_2| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (not (= 1023 (select (select |#memory_int| v_prenex_2) 4092))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (= 1023 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_2|) 4092)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:28:58,717 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 81#(exists ((v_prenex_2 Int) (|v_main_~#A~0.base_BEFORE_CALL_2| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (not (= 1023 (select (select |#memory_int| v_prenex_2) 4092))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (= 1023 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_2|) 4092)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 13:28:58,717 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 86#(and (exists ((v_prenex_2 Int) (|v_main_~#A~0.base_BEFORE_CALL_2| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (not (= 1023 (select (select |#memory_int| v_prenex_2) 4092))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (= 1023 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_2|) 4092)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:28:58,719 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 96#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_2 Int) (|v_main_~#A~0.base_BEFORE_CALL_2| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (not (= 1023 (select (select |#memory_int| v_prenex_2) 4092))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (= 1023 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_2|) 4092)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:28:59,078 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:28:59,078 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 9] total 22 [2019-10-07 13:28:59,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-07 13:28:59,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-07 13:28:59,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2019-10-07 13:28:59,080 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 22 states. [2019-10-07 13:28:59,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:59,786 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2019-10-07 13:28:59,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-07 13:28:59,786 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 14 [2019-10-07 13:28:59,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:59,787 INFO L225 Difference]: With dead ends: 26 [2019-10-07 13:28:59,788 INFO L226 Difference]: Without dead ends: 21 [2019-10-07 13:28:59,789 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=300, Invalid=1106, Unknown=0, NotChecked=0, Total=1406 [2019-10-07 13:28:59,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-07 13:28:59,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-07 13:28:59,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-07 13:28:59,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-10-07 13:28:59,795 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 14 [2019-10-07 13:28:59,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:59,796 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-10-07 13:28:59,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-07 13:28:59,796 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-10-07 13:28:59,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-07 13:28:59,797 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:59,797 INFO L385 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:29:00,000 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:29:00,001 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:29:00,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:29:00,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1928773981, now seen corresponding path program 3 times [2019-10-07 13:29:00,002 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:29:00,002 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:29:00,003 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:29:00,003 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:29:00,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:29:00,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:29:00,142 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:29:00,142 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:29:00,144 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:29:00,144 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST 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-07 13:29:00,191 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 13:29:00,191 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 13:29:00,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-07 13:29:00,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:29:00,214 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:29:00,215 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:29:00,428 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:29:00,428 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:29:00,430 INFO L162 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-10-07 13:29:00,431 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:29:00,431 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:29:00,431 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:29:00,431 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:29:00,469 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:29:00,630 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-07 13:29:00,654 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:29:00,667 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:29:00,668 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:29:00,668 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 71#(and (or (and (= |#NULL.base| 0) (<= 0 |main_~#A~0.offset|) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= |main_~#A~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#A~0.offset| 0)) (and (= (select |old(#valid)| |main_~#A~0.base|) 0) (<= 0 |main_~#A~0.offset|) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= |main_~#A~0.offset| 0) (= 0 |main_~#A~0.offset|) (<= main_~i~0 0) (not (= 0 |main_~#A~0.base|)) (= 0 (select |old(#valid)| 0)) (= |#valid| (store |old(#valid)| |main_~#A~0.base| 1)) (< |main_~#A~0.base| |#StackHeapBarrier|) (= |#memory_int| |old(#memory_int)|) (= |#length| (store |old(#length)| |main_~#A~0.base| 8192)) (= |#NULL.offset| 0) (= main_~i~0 0))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:29:00,668 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-07 13:29:00,668 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-07 13:29:00,669 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 105#(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-07 13:29:00,669 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:29:00,669 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 100#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:29:00,670 INFO L193 IcfgInterpreter]: Reachable states at location L18 satisfy 76#(and (= |#NULL.base| 0) (<= 0 |main_~#A~0.offset|) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= |main_~#A~0.offset| 0) (= |main_~#A~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1024 main_~i~0) (= (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4092)) |main_#t~mem1|) (not (< main_~i~0 1024)) (= |#NULL.offset| 0)) [2019-10-07 13:29:00,672 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 91#(and (exists ((v_prenex_3 Int) (|v_main_~#A~0.base_BEFORE_CALL_3| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (= 1023 (select (select |#memory_int| v_prenex_3) 4092)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (not (= 1023 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_3|) 4092))) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= __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-07 13:29:00,672 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 81#(exists ((v_prenex_3 Int) (|v_main_~#A~0.base_BEFORE_CALL_3| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (= 1023 (select (select |#memory_int| v_prenex_3) 4092)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (not (= 1023 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_3|) 4092))) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 13:29:00,673 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 86#(and (exists ((v_prenex_3 Int) (|v_main_~#A~0.base_BEFORE_CALL_3| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (= 1023 (select (select |#memory_int| v_prenex_3) 4092)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (not (= 1023 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_3|) 4092))) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:29:00,673 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 96#(and (exists ((v_prenex_3 Int) (|v_main_~#A~0.base_BEFORE_CALL_3| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (= 1023 (select (select |#memory_int| v_prenex_3) 4092)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (not (= 1023 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_3|) 4092))) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= __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-07 13:29:01,087 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:29:01,087 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 9] total 34 [2019-10-07 13:29:01,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-07 13:29:01,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-07 13:29:01,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=797, Unknown=0, NotChecked=0, Total=1122 [2019-10-07 13:29:01,090 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 34 states. [2019-10-07 13:29:02,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:29:02,368 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2019-10-07 13:29:02,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-07 13:29:02,369 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 20 [2019-10-07 13:29:02,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:29:02,371 INFO L225 Difference]: With dead ends: 38 [2019-10-07 13:29:02,371 INFO L226 Difference]: Without dead ends: 33 [2019-10-07 13:29:02,374 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 904 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=966, Invalid=2816, Unknown=0, NotChecked=0, Total=3782 [2019-10-07 13:29:02,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-07 13:29:02,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-10-07 13:29:02,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-07 13:29:02,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-10-07 13:29:02,382 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 20 [2019-10-07 13:29:02,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:29:02,382 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-10-07 13:29:02,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-07 13:29:02,382 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-10-07 13:29:02,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-07 13:29:02,383 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:29:02,384 INFO L385 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:29:02,597 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:29:02,597 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:29:02,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:29:02,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1953340067, now seen corresponding path program 4 times [2019-10-07 13:29:02,598 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:29:02,598 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:29:02,598 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:29:02,599 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:29:02,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:29:02,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:29:02,973 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:29:02,974 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:29:02,974 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:29:02,974 INFO L93 rtionOrderModulation]: Changing assertion order to 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-07 13:29:03,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:29:03,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-07 13:29:03,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:29:03,068 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:29:03,068 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:29:03,802 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:29:03,802 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:29:03,804 INFO L162 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-10-07 13:29:03,804 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:29:03,805 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:29:03,805 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:29:03,805 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:29:03,845 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:29:03,981 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-07 13:29:03,990 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:29:03,998 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:29:03,998 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:29:03,999 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 71#(and (or (and (= |#NULL.base| 0) (<= 0 |main_~#A~0.offset|) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= |main_~#A~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#A~0.offset| 0)) (and (= (select |old(#valid)| |main_~#A~0.base|) 0) (<= 0 |main_~#A~0.offset|) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= |main_~#A~0.offset| 0) (= 0 |main_~#A~0.offset|) (<= main_~i~0 0) (not (= 0 |main_~#A~0.base|)) (= 0 (select |old(#valid)| 0)) (= |#valid| (store |old(#valid)| |main_~#A~0.base| 1)) (< |main_~#A~0.base| |#StackHeapBarrier|) (= |#memory_int| |old(#memory_int)|) (= |#length| (store |old(#length)| |main_~#A~0.base| 8192)) (= |#NULL.offset| 0) (= main_~i~0 0))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:29:03,999 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-07 13:29:03,999 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-07 13:29:03,999 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 105#(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-07 13:29:04,000 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:29:04,000 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 100#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:29:04,000 INFO L193 IcfgInterpreter]: Reachable states at location L18 satisfy 76#(and (= |#NULL.base| 0) (<= 0 |main_~#A~0.offset|) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= |main_~#A~0.offset| 0) (= |main_~#A~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1024 main_~i~0) (= (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4092)) |main_#t~mem1|) (not (< main_~i~0 1024)) (= |#NULL.offset| 0)) [2019-10-07 13:29:04,000 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 91#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_4 Int) (|v_main_~#A~0.base_BEFORE_CALL_4| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 1023 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_4|) 4092)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (not (= 1023 (select (select |#memory_int| v_prenex_4) 4092)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:29:04,000 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 81#(exists ((v_prenex_4 Int) (|v_main_~#A~0.base_BEFORE_CALL_4| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 1023 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_4|) 4092)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (not (= 1023 (select (select |#memory_int| v_prenex_4) 4092)))))) [2019-10-07 13:29:04,001 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 86#(and (exists ((v_prenex_4 Int) (|v_main_~#A~0.base_BEFORE_CALL_4| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 1023 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_4|) 4092)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (not (= 1023 (select (select |#memory_int| v_prenex_4) 4092)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:29:04,001 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 96#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_4 Int) (|v_main_~#A~0.base_BEFORE_CALL_4| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 1023 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_4|) 4092)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (not (= 1023 (select (select |#memory_int| v_prenex_4) 4092)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:29:04,398 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:29:04,398 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25, 9] total 58 [2019-10-07 13:29:04,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-10-07 13:29:04,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-10-07 13:29:04,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1201, Invalid=2105, Unknown=0, NotChecked=0, Total=3306 [2019-10-07 13:29:04,403 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 58 states. [2019-10-07 13:29:07,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:29:07,569 INFO L93 Difference]: Finished difference Result 62 states and 85 transitions. [2019-10-07 13:29:07,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-10-07 13:29:07,571 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 32 [2019-10-07 13:29:07,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:29:07,572 INFO L225 Difference]: With dead ends: 62 [2019-10-07 13:29:07,572 INFO L226 Difference]: Without dead ends: 57 [2019-10-07 13:29:07,576 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2554 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=3594, Invalid=8396, Unknown=0, NotChecked=0, Total=11990 [2019-10-07 13:29:07,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-07 13:29:07,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-10-07 13:29:07,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-07 13:29:07,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-10-07 13:29:07,588 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 32 [2019-10-07 13:29:07,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:29:07,589 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-10-07 13:29:07,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-10-07 13:29:07,589 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-10-07 13:29:07,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-07 13:29:07,591 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:29:07,591 INFO L385 BasicCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:29:07,794 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:29:07,795 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:29:07,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:29:07,795 INFO L82 PathProgramCache]: Analyzing trace with hash -751283549, now seen corresponding path program 5 times [2019-10-07 13:29:07,796 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:29:07,796 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:29:07,796 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:29:07,797 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:29:07,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:29:07,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:29:08,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:29:08,894 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:29:08,894 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:29:08,894 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:29:25,163 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-10-07 13:29:25,164 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 13:29:25,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 48 conjunts are in the unsatisfiable core [2019-10-07 13:29:25,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:29:25,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:29:25,197 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:29:27,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:29:27,616 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:29:27,617 INFO L162 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-10-07 13:29:27,617 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:29:27,618 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:29:27,618 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:29:27,618 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:29:27,656 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:29:27,782 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-07 13:29:27,790 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:29:27,793 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:29:27,793 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:29:27,794 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 71#(or (and (= (select |old(#valid)| |main_~#A~0.base|) 0) (<= 0 |main_~#A~0.offset|) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= |main_~#A~0.offset| 0) (= 0 |main_~#A~0.offset|) (<= main_~i~0 0) (not (= 0 |main_~#A~0.base|)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (= |#valid| (store |old(#valid)| |main_~#A~0.base| 1)) (< |main_~#A~0.base| |#StackHeapBarrier|) (= |#memory_int| |old(#memory_int)|) (= |#length| (store |old(#length)| |main_~#A~0.base| 8192)) (= |#NULL.offset| 0) (= main_~i~0 0)) (and (= |#NULL.base| 0) (<= 0 |main_~#A~0.offset|) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= |main_~#A~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#A~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0))) [2019-10-07 13:29:27,794 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-07 13:29:27,794 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 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0))) [2019-10-07 13:29:27,794 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 105#(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-07 13:29:27,794 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:29:27,795 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 100#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:29:27,799 INFO L193 IcfgInterpreter]: Reachable states at location L18 satisfy 76#(and (= |#NULL.base| 0) (<= 0 |main_~#A~0.offset|) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= |main_~#A~0.offset| 0) (= |main_~#A~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1024 main_~i~0) (= (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4092)) |main_#t~mem1|) (not (< main_~i~0 1024)) (= |#NULL.offset| 0)) [2019-10-07 13:29:27,800 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 91#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_5 Int) (|v_main_~#A~0.base_BEFORE_CALL_5| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_5|) 4092) 1023) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= (select (select |#memory_int| v_prenex_5) 4092) 1023)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:29:27,800 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 81#(exists ((v_prenex_5 Int) (|v_main_~#A~0.base_BEFORE_CALL_5| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_5|) 4092) 1023) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= (select (select |#memory_int| v_prenex_5) 4092) 1023)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 13:29:27,800 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 96#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_5 Int) (|v_main_~#A~0.base_BEFORE_CALL_5| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_5|) 4092) 1023) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= (select (select |#memory_int| v_prenex_5) 4092) 1023)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:29:27,801 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 86#(and (exists ((v_prenex_5 Int) (|v_main_~#A~0.base_BEFORE_CALL_5| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_5|) 4092) 1023) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= (select (select |#memory_int| v_prenex_5) 4092) 1023)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:29:28,354 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:29:28,355 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49, 9] total 106 [2019-10-07 13:29:28,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-10-07 13:29:28,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-10-07 13:29:28,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4681, Invalid=6449, Unknown=0, NotChecked=0, Total=11130 [2019-10-07 13:29:28,360 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 106 states. [2019-10-07 13:29:36,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:29:36,329 INFO L93 Difference]: Finished difference Result 110 states and 157 transitions. [2019-10-07 13:29:36,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-10-07 13:29:36,331 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 56 [2019-10-07 13:29:36,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:29:36,332 INFO L225 Difference]: With dead ends: 110 [2019-10-07 13:29:36,332 INFO L226 Difference]: Without dead ends: 105 [2019-10-07 13:29:36,340 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8014 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=14034, Invalid=28196, Unknown=0, NotChecked=0, Total=42230 [2019-10-07 13:29:36,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-10-07 13:29:36,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-10-07 13:29:36,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-10-07 13:29:36,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-10-07 13:29:36,357 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 56 [2019-10-07 13:29:36,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:29:36,357 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-10-07 13:29:36,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-10-07 13:29:36,358 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-10-07 13:29:36,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-07 13:29:36,359 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:29:36,360 INFO L385 BasicCegarLoop]: trace histogram [94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:29:36,560 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:29:36,561 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:29:36,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:29:36,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1960166051, now seen corresponding path program 6 times [2019-10-07 13:29:36,562 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:29:36,562 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:29:36,562 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:29:36,563 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:29:36,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:29:36,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:29:40,006 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:29:40,006 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:29:40,006 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:29:40,006 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:29:40,139 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 13:29:40,140 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 13:29:40,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 96 conjunts are in the unsatisfiable core [2019-10-07 13:29:40,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:29:40,190 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:29:40,190 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:29:49,641 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:29:49,642 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:29:49,643 INFO L162 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-10-07 13:29:49,643 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:29:49,643 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:29:49,644 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:29:49,644 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:29:49,666 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:29:49,763 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-07 13:29:49,770 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:29:49,773 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:29:49,774 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:29:49,774 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 71#(and (or (and (= |#NULL.base| 0) (<= 0 |main_~#A~0.offset|) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= |main_~#A~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#A~0.offset| 0)) (and (= (select |old(#valid)| |main_~#A~0.base|) 0) (<= 0 |main_~#A~0.offset|) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= |main_~#A~0.offset| 0) (= 0 |main_~#A~0.offset|) (<= main_~i~0 0) (not (= 0 |main_~#A~0.base|)) (= 0 (select |old(#valid)| 0)) (= |#valid| (store |old(#valid)| |main_~#A~0.base| 1)) (< |main_~#A~0.base| |#StackHeapBarrier|) (= |#memory_int| |old(#memory_int)|) (= |#length| (store |old(#length)| |main_~#A~0.base| 8192)) (= |#NULL.offset| 0) (= main_~i~0 0))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:29:49,774 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-07 13:29:49,775 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-07 13:29:49,775 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 105#(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-07 13:29:49,775 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:29:49,775 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 100#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:29:49,775 INFO L193 IcfgInterpreter]: Reachable states at location L18 satisfy 76#(and (= |#NULL.base| 0) (<= 0 |main_~#A~0.offset|) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= |main_~#A~0.offset| 0) (= |main_~#A~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1024 main_~i~0) (= (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4092)) |main_#t~mem1|) (not (< main_~i~0 1024)) (= |#NULL.offset| 0)) [2019-10-07 13:29:49,776 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 91#(and (exists ((v_prenex_6 Int) (|v_main_~#A~0.base_BEFORE_CALL_6| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (= (select (select |#memory_int| v_prenex_6) 4092) 1023) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_6|) 4092) 1023)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= __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-07 13:29:49,776 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 81#(exists ((v_prenex_6 Int) (|v_main_~#A~0.base_BEFORE_CALL_6| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (= (select (select |#memory_int| v_prenex_6) 4092) 1023) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_6|) 4092) 1023)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 13:29:49,776 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 96#(and (exists ((v_prenex_6 Int) (|v_main_~#A~0.base_BEFORE_CALL_6| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (= (select (select |#memory_int| v_prenex_6) 4092) 1023) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_6|) 4092) 1023)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= __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-07 13:29:49,778 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 86#(and (exists ((v_prenex_6 Int) (|v_main_~#A~0.base_BEFORE_CALL_6| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (= (select (select |#memory_int| v_prenex_6) 4092) 1023) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_6|) 4092) 1023)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:29:50,552 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:29:50,553 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97, 9] total 202 [2019-10-07 13:29:50,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 202 states [2019-10-07 13:29:50,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 202 interpolants. [2019-10-07 13:29:50,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18553, Invalid=22049, Unknown=0, NotChecked=0, Total=40602 [2019-10-07 13:29:50,560 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 202 states. [2019-10-07 13:30:16,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:30:16,477 INFO L93 Difference]: Finished difference Result 206 states and 301 transitions. [2019-10-07 13:30:16,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2019-10-07 13:30:16,477 INFO L78 Accepts]: Start accepts. Automaton has 202 states. Word has length 104 [2019-10-07 13:30:16,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:30:16,480 INFO L225 Difference]: With dead ends: 206 [2019-10-07 13:30:16,480 INFO L226 Difference]: Without dead ends: 201 [2019-10-07 13:30:16,485 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 604 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 396 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27574 ImplicationChecksByTransitivity, 38.0s TimeCoverageRelationStatistics Valid=55650, Invalid=102356, Unknown=0, NotChecked=0, Total=158006 [2019-10-07 13:30:16,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-10-07 13:30:16,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2019-10-07 13:30:16,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-10-07 13:30:16,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2019-10-07 13:30:16,510 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 104 [2019-10-07 13:30:16,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:30:16,511 INFO L462 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2019-10-07 13:30:16,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 202 states. [2019-10-07 13:30:16,511 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2019-10-07 13:30:16,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-10-07 13:30:16,515 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:30:16,515 INFO L385 BasicCegarLoop]: trace histogram [190, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:30:16,727 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:30:16,728 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:30:16,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:30:16,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1748017827, now seen corresponding path program 7 times [2019-10-07 13:30:16,729 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:30:16,729 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:30:16,729 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:30:16,729 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:30:16,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:30:17,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:30:29,579 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:30:29,580 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:30:29,580 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:30:29,580 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:30:29,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:30:29,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 808 conjuncts, 192 conjunts are in the unsatisfiable core [2019-10-07 13:30:29,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:30:29,921 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:30:29,922 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:31:07,971 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:31:07,971 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:31:07,973 INFO L162 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-10-07 13:31:07,973 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:31:07,974 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:31:07,974 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:31:07,974 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:31:07,994 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:31:08,077 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-07 13:31:08,083 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:31:08,086 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:31:08,086 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:31:08,086 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 71#(and (or (and (= |#NULL.base| 0) (<= 0 |main_~#A~0.offset|) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= |main_~#A~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#A~0.offset| 0)) (and (= (select |old(#valid)| |main_~#A~0.base|) 0) (<= 0 |main_~#A~0.offset|) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= |main_~#A~0.offset| 0) (= 0 |main_~#A~0.offset|) (<= main_~i~0 0) (not (= 0 |main_~#A~0.base|)) (= 0 (select |old(#valid)| 0)) (= |#valid| (store |old(#valid)| |main_~#A~0.base| 1)) (< |main_~#A~0.base| |#StackHeapBarrier|) (= |#memory_int| |old(#memory_int)|) (= |#length| (store |old(#length)| |main_~#A~0.base| 8192)) (= |#NULL.offset| 0) (= main_~i~0 0))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:31:08,086 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-07 13:31:08,087 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-07 13:31:08,087 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 105#(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-07 13:31:08,087 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:31:08,087 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 100#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:31:08,087 INFO L193 IcfgInterpreter]: Reachable states at location L18 satisfy 76#(and (= |#NULL.base| 0) (<= 0 |main_~#A~0.offset|) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= |main_~#A~0.offset| 0) (= |main_~#A~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1024 main_~i~0) (= (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4092)) |main_#t~mem1|) (not (< main_~i~0 1024)) (= |#NULL.offset| 0)) [2019-10-07 13:31:08,088 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 91#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_7 Int) (|v_main_~#A~0.base_BEFORE_CALL_7| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= 1023 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_7|) 4092))) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= 1023 (select (select |#memory_int| v_prenex_7) 4092)) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:31:08,088 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 81#(exists ((v_prenex_7 Int) (|v_main_~#A~0.base_BEFORE_CALL_7| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= 1023 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_7|) 4092))) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= 1023 (select (select |#memory_int| v_prenex_7) 4092)) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 13:31:08,088 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 86#(and (exists ((v_prenex_7 Int) (|v_main_~#A~0.base_BEFORE_CALL_7| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= 1023 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_7|) 4092))) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= 1023 (select (select |#memory_int| v_prenex_7) 4092)) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:31:08,088 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 96#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_7 Int) (|v_main_~#A~0.base_BEFORE_CALL_7| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= 1023 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_7|) 4092))) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= 1023 (select (select |#memory_int| v_prenex_7) 4092)) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:31:09,418 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:31:09,419 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [193, 193, 193, 9] total 394 [2019-10-07 13:31:09,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 394 states [2019-10-07 13:31:09,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 394 interpolants. [2019-10-07 13:31:09,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73945, Invalid=80897, Unknown=0, NotChecked=0, Total=154842 [2019-10-07 13:31:09,435 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 394 states. [2019-10-07 13:32:43,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:32:43,181 INFO L93 Difference]: Finished difference Result 398 states and 589 transitions. [2019-10-07 13:32:43,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 393 states. [2019-10-07 13:32:43,181 INFO L78 Accepts]: Start accepts. Automaton has 394 states. Word has length 200 [2019-10-07 13:32:43,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:32:43,186 INFO L225 Difference]: With dead ends: 398 [2019-10-07 13:32:43,186 INFO L226 Difference]: Without dead ends: 393 [2019-10-07 13:32:43,197 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 1180 GetRequests, 400 SyntacticMatches, 0 SemanticMatches, 780 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101254 ImplicationChecksByTransitivity, 140.3s TimeCoverageRelationStatistics Valid=221826, Invalid=388916, Unknown=0, NotChecked=0, Total=610742 [2019-10-07 13:32:43,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-10-07 13:32:43,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2019-10-07 13:32:43,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2019-10-07 13:32:43,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 393 transitions. [2019-10-07 13:32:43,239 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 393 transitions. Word has length 200 [2019-10-07 13:32:43,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:32:43,240 INFO L462 AbstractCegarLoop]: Abstraction has 393 states and 393 transitions. [2019-10-07 13:32:43,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 394 states. [2019-10-07 13:32:43,240 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 393 transitions. [2019-10-07 13:32:43,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-10-07 13:32:43,247 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:32:43,248 INFO L385 BasicCegarLoop]: trace histogram [382, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:32:43,452 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:32:43,458 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:32:43,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:32:43,458 INFO L82 PathProgramCache]: Analyzing trace with hash 258368163, now seen corresponding path program 8 times [2019-10-07 13:32:43,458 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:32:43,459 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:32:43,459 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:32:43,459 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:32:43,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:32:44,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:33:35,265 INFO L134 CoverageAnalysis]: Checked inductivity of 73153 backedges. 0 proven. 73153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:33:35,266 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:33:35,266 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:33:35,266 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true