java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/array-examples/standard_maxInArray_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 00:11:16,546 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 00:11:16,549 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 00:11:16,570 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 00:11:16,571 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 00:11:16,573 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 00:11:16,575 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 00:11:16,590 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 00:11:16,591 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 00:11:16,592 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 00:11:16,594 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 00:11:16,595 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 00:11:16,596 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 00:11:16,599 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 00:11:16,602 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 00:11:16,604 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 00:11:16,605 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 00:11:16,607 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 00:11:16,608 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 00:11:16,611 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 00:11:16,613 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 00:11:16,616 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 00:11:16,617 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 00:11:16,621 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 00:11:16,624 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 00:11:16,624 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 00:11:16,624 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 00:11:16,627 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 00:11:16,629 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 00:11:16,631 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 00:11:16,631 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 00:11:16,632 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 00:11:16,633 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 00:11:16,633 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 00:11:16,637 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 00:11:16,638 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 00:11:16,638 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 00:11:16,639 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 00:11:16,639 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 00:11:16,640 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 00:11:16,641 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 00:11:16,642 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 00:11:16,656 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 00:11:16,656 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 00:11:16,658 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 00:11:16,658 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 00:11:16,658 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 00:11:16,658 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 00:11:16,659 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 00:11:16,659 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 00:11:16,659 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 00:11:16,659 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 00:11:16,659 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 00:11:16,660 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 00:11:16,660 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 00:11:16,660 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 00:11:16,660 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 00:11:16,661 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 00:11:16,661 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 00:11:16,661 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 00:11:16,661 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 00:11:16,661 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 00:11:16,662 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 00:11:16,662 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:11:16,662 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 00:11:16,662 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 00:11:16,662 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 00:11:16,663 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 00:11:16,663 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 00:11:16,663 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 00:11:16,663 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 00:11:16,988 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 00:11:17,005 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 00:11:17,010 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 00:11:17,012 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 00:11:17,012 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 00:11:17,013 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_maxInArray_ground.i [2019-10-07 00:11:17,092 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcfff2ecd/ef4ff1d692cf4b8fac7ecbe8ed066cec/FLAGe58855bac [2019-10-07 00:11:17,563 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 00:11:17,564 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_maxInArray_ground.i [2019-10-07 00:11:17,570 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcfff2ecd/ef4ff1d692cf4b8fac7ecbe8ed066cec/FLAGe58855bac [2019-10-07 00:11:17,928 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcfff2ecd/ef4ff1d692cf4b8fac7ecbe8ed066cec [2019-10-07 00:11:17,938 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 00:11:17,940 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 00:11:17,941 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 00:11:17,941 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 00:11:17,945 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 00:11:17,946 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:11:17" (1/1) ... [2019-10-07 00:11:17,949 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@207a2cf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:11:17, skipping insertion in model container [2019-10-07 00:11:17,950 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:11:17" (1/1) ... [2019-10-07 00:11:17,958 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 00:11:17,980 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 00:11:18,169 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:11:18,174 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 00:11:18,198 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:11:18,221 INFO L192 MainTranslator]: Completed translation [2019-10-07 00:11:18,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:11:18 WrapperNode [2019-10-07 00:11:18,222 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 00:11:18,223 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 00:11:18,223 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 00:11:18,223 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 00:11:18,339 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:11:18" (1/1) ... [2019-10-07 00:11:18,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:11:18" (1/1) ... [2019-10-07 00:11:18,346 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:11:18" (1/1) ... [2019-10-07 00:11:18,347 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:11:18" (1/1) ... [2019-10-07 00:11:18,354 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:11:18" (1/1) ... [2019-10-07 00:11:18,361 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:11:18" (1/1) ... [2019-10-07 00:11:18,364 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:11:18" (1/1) ... [2019-10-07 00:11:18,370 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 00:11:18,370 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 00:11:18,370 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 00:11:18,371 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 00:11:18,372 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:11:18" (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 00:11:18,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 00:11:18,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 00:11:18,426 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-07 00:11:18,426 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 00:11:18,426 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 00:11:18,426 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-07 00:11:18,427 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 00:11:18,427 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 00:11:18,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 00:11:18,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 00:11:18,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 00:11:18,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 00:11:18,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 00:11:18,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 00:11:18,839 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 00:11:18,839 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-07 00:11:18,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:11:18 BoogieIcfgContainer [2019-10-07 00:11:18,841 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 00:11:18,842 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 00:11:18,842 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 00:11:18,844 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 00:11:18,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 12:11:17" (1/3) ... [2019-10-07 00:11:18,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27d26027 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:11:18, skipping insertion in model container [2019-10-07 00:11:18,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:11:18" (2/3) ... [2019-10-07 00:11:18,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27d26027 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:11:18, skipping insertion in model container [2019-10-07 00:11:18,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:11:18" (3/3) ... [2019-10-07 00:11:18,848 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_maxInArray_ground.i [2019-10-07 00:11:18,859 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 00:11:18,867 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 00:11:18,879 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 00:11:18,903 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 00:11:18,904 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 00:11:18,904 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 00:11:18,904 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 00:11:18,904 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 00:11:18,904 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 00:11:18,904 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 00:11:18,904 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 00:11:18,921 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-10-07 00:11:18,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-07 00:11:18,927 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:11:18,928 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:11:18,930 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:11:18,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:11:18,935 INFO L82 PathProgramCache]: Analyzing trace with hash -493369724, now seen corresponding path program 1 times [2019-10-07 00:11:18,943 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:11:18,943 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:11:18,943 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:11:18,943 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:11:18,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:11:19,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:11:19,105 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 00:11:19,106 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:11:19,106 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:11:19,107 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:11:19,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:11:19,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:11:19,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:11:19,123 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2019-10-07 00:11:19,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:11:19,158 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2019-10-07 00:11:19,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:11:19,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-07 00:11:19,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:11:19,168 INFO L225 Difference]: With dead ends: 33 [2019-10-07 00:11:19,168 INFO L226 Difference]: Without dead ends: 17 [2019-10-07 00:11:19,172 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 00:11:19,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-10-07 00:11:19,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-10-07 00:11:19,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-07 00:11:19,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-10-07 00:11:19,211 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2019-10-07 00:11:19,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:11:19,212 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-10-07 00:11:19,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:11:19,212 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-10-07 00:11:19,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-07 00:11:19,213 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:11:19,213 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:11:19,214 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:11:19,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:11:19,214 INFO L82 PathProgramCache]: Analyzing trace with hash 937030386, now seen corresponding path program 1 times [2019-10-07 00:11:19,215 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:11:19,215 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:11:19,215 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:11:19,215 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:11:19,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:11:19,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:11:19,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 00:11:19,256 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:11:19,256 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:11:19,257 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:11:19,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:11:19,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:11:19,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:11:19,260 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 3 states. [2019-10-07 00:11:19,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:11:19,275 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2019-10-07 00:11:19,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:11:19,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-07 00:11:19,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:11:19,277 INFO L225 Difference]: With dead ends: 27 [2019-10-07 00:11:19,278 INFO L226 Difference]: Without dead ends: 18 [2019-10-07 00:11:19,279 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 00:11:19,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-10-07 00:11:19,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-07 00:11:19,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-07 00:11:19,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-10-07 00:11:19,285 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 13 [2019-10-07 00:11:19,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:11:19,286 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-10-07 00:11:19,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:11:19,286 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-10-07 00:11:19,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-07 00:11:19,287 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:11:19,287 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:11:19,288 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:11:19,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:11:19,288 INFO L82 PathProgramCache]: Analyzing trace with hash 76469094, now seen corresponding path program 1 times [2019-10-07 00:11:19,289 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:11:19,289 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:11:19,289 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:11:19,289 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:11:19,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:11:19,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:11:19,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 00:11:19,357 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:11:19,357 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:11:19,357 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 00:11:19,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:11:19,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 00:11:19,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:11:19,506 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 00:11:19,506 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:11:19,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 00:11:19,551 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:11:19,580 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:11:19,581 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:11:19,588 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:11:19,598 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:11:19,599 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:11:19,824 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:11:20,166 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 00:11:20,193 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:11:20,201 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:11:20,202 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:11:20,202 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 114#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-07 00:11:20,203 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 104#(and (< main_~x~0 100000) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem5|) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:11:20,203 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 94#(and (<= 0 main_~i~0) (<= 100000 main_~j~0)) [2019-10-07 00:11:20,203 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 119#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 00:11:20,203 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 128#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:11:20,204 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 00:11:20,204 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 00:11:20,204 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 133#(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 00:11:20,205 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-07 00:11:20,205 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:11:20,205 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 124#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 00:11:20,206 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 99#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:11:20,206 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 109#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-07 00:11:20,665 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:11:20,665 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 18 [2019-10-07 00:11:20,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-07 00:11:20,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-07 00:11:20,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-10-07 00:11:20,671 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 18 states. [2019-10-07 00:11:21,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:11:21,374 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2019-10-07 00:11:21,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-07 00:11:21,375 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 14 [2019-10-07 00:11:21,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:11:21,378 INFO L225 Difference]: With dead ends: 36 [2019-10-07 00:11:21,378 INFO L226 Difference]: Without dead ends: 25 [2019-10-07 00:11:21,379 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=145, Invalid=785, Unknown=0, NotChecked=0, Total=930 [2019-10-07 00:11:21,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-07 00:11:21,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2019-10-07 00:11:21,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-07 00:11:21,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-10-07 00:11:21,394 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 14 [2019-10-07 00:11:21,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:11:21,394 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-10-07 00:11:21,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-07 00:11:21,394 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-10-07 00:11:21,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-07 00:11:21,395 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:11:21,395 INFO L385 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:11:21,609 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:11:21,609 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:11:21,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:11:21,610 INFO L82 PathProgramCache]: Analyzing trace with hash 963576836, now seen corresponding path program 2 times [2019-10-07 00:11:21,610 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:11:21,610 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:11:21,610 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:11:21,610 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:11:21,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:11:21,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:11:21,727 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-07 00:11:21,727 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:11:21,727 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:11:21,728 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 00:11:21,793 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-07 00:11:21,794 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:11:21,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-07 00:11:21,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:11:21,839 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-07 00:11:21,840 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:11:21,889 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-07 00:11:21,889 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:11:21,891 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:11:21,891 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:11:21,892 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:11:21,892 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:11:21,893 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:11:21,938 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:11:22,053 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 00:11:22,076 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:11:22,082 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:11:22,083 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:11:22,083 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 114#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-07 00:11:22,083 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 104#(and (< main_~x~0 100000) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem5|) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:11:22,084 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 94#(and (<= 0 main_~i~0) (<= 100000 main_~j~0)) [2019-10-07 00:11:22,084 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 119#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 00:11:22,084 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 128#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:11:22,084 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 00:11:22,085 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 00:11:22,085 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 133#(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 00:11:22,085 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-07 00:11:22,086 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:11:22,086 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 124#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 00:11:22,086 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 99#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:11:22,086 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 109#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-07 00:11:22,436 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:11:22,437 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5, 11] total 23 [2019-10-07 00:11:22,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-07 00:11:22,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-07 00:11:22,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2019-10-07 00:11:22,439 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 23 states. [2019-10-07 00:11:23,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:11:23,227 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2019-10-07 00:11:23,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-07 00:11:23,228 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 18 [2019-10-07 00:11:23,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:11:23,229 INFO L225 Difference]: With dead ends: 42 [2019-10-07 00:11:23,229 INFO L226 Difference]: Without dead ends: 30 [2019-10-07 00:11:23,233 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=237, Invalid=1403, Unknown=0, NotChecked=0, Total=1640 [2019-10-07 00:11:23,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-07 00:11:23,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2019-10-07 00:11:23,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-07 00:11:23,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-10-07 00:11:23,247 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 18 [2019-10-07 00:11:23,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:11:23,248 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-10-07 00:11:23,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-07 00:11:23,249 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-10-07 00:11:23,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-07 00:11:23,251 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:11:23,251 INFO L385 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:11:23,451 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:11:23,452 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:11:23,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:11:23,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1045781774, now seen corresponding path program 3 times [2019-10-07 00:11:23,454 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:11:23,454 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:11:23,454 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:11:23,454 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:11:23,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:11:23,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:11:23,579 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-07 00:11:23,579 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:11:23,579 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:11:23,580 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 00:11:23,650 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 00:11:23,650 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:11:23,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-07 00:11:23,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:11:23,673 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-07 00:11:23,674 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:11:23,762 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-07 00:11:23,763 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:11:23,765 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:11:23,765 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:11:23,766 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:11:23,766 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:11:23,766 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:11:23,803 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:11:23,915 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 00:11:23,933 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:11:23,938 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:11:23,939 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:11:23,939 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 114#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-07 00:11:23,939 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 104#(and (< main_~x~0 100000) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem5|) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:11:23,940 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 94#(and (<= 0 main_~i~0) (<= 100000 main_~j~0)) [2019-10-07 00:11:23,940 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 119#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 00:11:23,940 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 128#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:11:23,940 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 00:11:23,941 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 00:11:23,941 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-07 00:11:23,941 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 133#(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 00:11:23,941 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:11:23,942 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 124#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 00:11:23,942 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 99#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:11:23,942 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 109#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1))) [2019-10-07 00:11:24,271 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:11:24,271 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 11] total 25 [2019-10-07 00:11:24,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-07 00:11:24,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-07 00:11:24,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=466, Unknown=0, NotChecked=0, Total=600 [2019-10-07 00:11:24,273 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 25 states. [2019-10-07 00:11:24,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:11:24,998 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2019-10-07 00:11:24,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-07 00:11:24,998 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 23 [2019-10-07 00:11:24,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:11:25,000 INFO L225 Difference]: With dead ends: 53 [2019-10-07 00:11:25,000 INFO L226 Difference]: Without dead ends: 37 [2019-10-07 00:11:25,001 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=369, Invalid=1523, Unknown=0, NotChecked=0, Total=1892 [2019-10-07 00:11:25,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-07 00:11:25,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2019-10-07 00:11:25,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-07 00:11:25,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2019-10-07 00:11:25,010 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 23 [2019-10-07 00:11:25,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:11:25,010 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2019-10-07 00:11:25,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-07 00:11:25,010 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2019-10-07 00:11:25,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-07 00:11:25,011 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:11:25,011 INFO L385 BasicCegarLoop]: trace histogram [12, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:11:25,216 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:11:25,216 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:11:25,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:11:25,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1377140484, now seen corresponding path program 4 times [2019-10-07 00:11:25,217 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:11:25,217 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:11:25,217 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:11:25,218 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:11:25,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:11:25,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:11:25,373 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-07 00:11:25,373 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:11:25,373 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:11:25,374 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 00:11:25,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:11:25,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-07 00:11:25,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:11:25,475 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-07 00:11:25,475 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:11:25,734 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-07 00:11:25,734 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:11:25,736 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:11:25,736 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:11:25,737 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:11:25,737 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:11:25,737 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:11:25,793 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:11:25,915 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 00:11:25,934 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:11:25,941 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:11:25,941 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:11:25,941 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 114#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-07 00:11:25,944 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 104#(and (< main_~x~0 100000) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem5|) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:11:25,944 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 94#(and (<= 0 main_~i~0) (<= 100000 main_~j~0)) [2019-10-07 00:11:25,945 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 119#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 00:11:25,945 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 128#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:11:25,945 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 00:11:25,945 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 00:11:25,945 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-07 00:11:25,946 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 133#(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 00:11:25,946 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:11:25,946 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 124#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 00:11:25,947 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 99#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:11:25,947 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 109#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-07 00:11:26,355 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:11:26,355 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15, 11] total 39 [2019-10-07 00:11:26,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-07 00:11:26,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-07 00:11:26,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2019-10-07 00:11:26,361 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 39 states. [2019-10-07 00:11:27,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:11:27,845 INFO L93 Difference]: Finished difference Result 67 states and 85 transitions. [2019-10-07 00:11:27,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-07 00:11:27,846 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 30 [2019-10-07 00:11:27,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:11:27,848 INFO L225 Difference]: With dead ends: 67 [2019-10-07 00:11:27,848 INFO L226 Difference]: Without dead ends: 51 [2019-10-07 00:11:27,852 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1274 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1244, Invalid=3868, Unknown=0, NotChecked=0, Total=5112 [2019-10-07 00:11:27,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-10-07 00:11:27,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2019-10-07 00:11:27,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-07 00:11:27,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2019-10-07 00:11:27,861 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 30 [2019-10-07 00:11:27,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:11:27,861 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2019-10-07 00:11:27,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-07 00:11:27,862 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2019-10-07 00:11:27,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-07 00:11:27,863 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:11:27,863 INFO L385 BasicCegarLoop]: trace histogram [26, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:11:28,068 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:11:28,069 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:11:28,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:11:28,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1770545340, now seen corresponding path program 5 times [2019-10-07 00:11:28,070 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:11:28,070 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:11:28,071 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:11:28,071 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:11:28,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:11:28,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:11:28,503 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-07 00:11:28,504 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:11:28,504 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:11:28,504 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 00:11:28,607 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-07 00:11:28,607 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:11:28,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-07 00:11:28,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:11:28,745 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-10-07 00:11:28,745 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:11:28,915 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-10-07 00:11:28,915 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:11:28,917 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:11:28,917 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:11:28,917 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:11:28,917 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:11:28,918 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:11:28,944 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:11:29,025 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 00:11:29,046 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:11:29,049 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:11:29,050 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:11:29,050 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 114#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-07 00:11:29,050 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 104#(and (< main_~x~0 100000) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem5|) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:11:29,050 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 94#(and (<= 0 main_~i~0) (<= 100000 main_~j~0)) [2019-10-07 00:11:29,051 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 119#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 00:11:29,051 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 128#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:11:29,051 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 00:11:29,051 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 00:11:29,052 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-07 00:11:29,052 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 133#(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 00:11:29,052 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:11:29,053 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 124#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 00:11:29,053 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 99#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:11:29,053 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 109#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-07 00:11:29,726 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:11:29,726 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 9, 9, 11] total 53 [2019-10-07 00:11:29,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-10-07 00:11:29,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-10-07 00:11:29,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=554, Invalid=2202, Unknown=0, NotChecked=0, Total=2756 [2019-10-07 00:11:29,730 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 53 states. [2019-10-07 00:11:32,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:11:32,181 INFO L93 Difference]: Finished difference Result 76 states and 89 transitions. [2019-10-07 00:11:32,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-07 00:11:32,182 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 44 [2019-10-07 00:11:32,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:11:32,184 INFO L225 Difference]: With dead ends: 76 [2019-10-07 00:11:32,184 INFO L226 Difference]: Without dead ends: 60 [2019-10-07 00:11:32,187 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2334 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1684, Invalid=8416, Unknown=0, NotChecked=0, Total=10100 [2019-10-07 00:11:32,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-07 00:11:32,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2019-10-07 00:11:32,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-07 00:11:32,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2019-10-07 00:11:32,199 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 44 [2019-10-07 00:11:32,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:11:32,199 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2019-10-07 00:11:32,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-10-07 00:11:32,199 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2019-10-07 00:11:32,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-07 00:11:32,201 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:11:32,201 INFO L385 BasicCegarLoop]: trace histogram [27, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:11:32,404 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:11:32,405 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:11:32,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:11:32,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1757826482, now seen corresponding path program 6 times [2019-10-07 00:11:32,406 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:11:32,407 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:11:32,407 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:11:32,407 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:11:32,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:11:32,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:11:32,905 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-07 00:11:32,905 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:11:32,905 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:11:32,905 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 00:11:33,014 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 00:11:33,015 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:11:33,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-07 00:11:33,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:11:33,060 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-07 00:11:33,060 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:11:33,953 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-07 00:11:33,953 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:11:33,954 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:11:33,955 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:11:33,955 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:11:33,955 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:11:33,956 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:11:33,987 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:11:34,082 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 00:11:34,095 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:11:34,103 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:11:34,103 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:11:34,103 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 114#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-07 00:11:34,104 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 104#(and (< main_~x~0 100000) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem5|) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:11:34,105 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 94#(and (<= 0 main_~i~0) (<= 100000 main_~j~0)) [2019-10-07 00:11:34,105 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 119#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 00:11:34,105 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 128#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:11:34,105 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 00:11:34,105 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 00:11:34,106 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 133#(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 00:11:34,106 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-07 00:11:34,107 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:11:34,107 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 124#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 00:11:34,107 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 99#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:11:34,108 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 109#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-07 00:11:34,502 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:11:34,503 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30, 11] total 69 [2019-10-07 00:11:34,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-10-07 00:11:34,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-10-07 00:11:34,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1740, Invalid=2952, Unknown=0, NotChecked=0, Total=4692 [2019-10-07 00:11:34,507 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 69 states. [2019-10-07 00:11:37,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:11:37,697 INFO L93 Difference]: Finished difference Result 113 states and 146 transitions. [2019-10-07 00:11:37,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-10-07 00:11:37,698 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 53 [2019-10-07 00:11:37,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:11:37,700 INFO L225 Difference]: With dead ends: 113 [2019-10-07 00:11:37,700 INFO L226 Difference]: Without dead ends: 89 [2019-10-07 00:11:37,705 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3749 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5099, Invalid=12193, Unknown=0, NotChecked=0, Total=17292 [2019-10-07 00:11:37,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-10-07 00:11:37,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2019-10-07 00:11:37,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-10-07 00:11:37,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 88 transitions. [2019-10-07 00:11:37,717 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 88 transitions. Word has length 53 [2019-10-07 00:11:37,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:11:37,718 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 88 transitions. [2019-10-07 00:11:37,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-10-07 00:11:37,718 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2019-10-07 00:11:37,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-07 00:11:37,720 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:11:37,720 INFO L385 BasicCegarLoop]: trace histogram [56, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:11:37,924 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:11:37,924 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:11:37,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:11:37,925 INFO L82 PathProgramCache]: Analyzing trace with hash 377472388, now seen corresponding path program 7 times [2019-10-07 00:11:37,925 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:11:37,926 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:11:37,926 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:11:37,926 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:11:37,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:11:38,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:11:39,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1701 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-07 00:11:39,318 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:11:39,318 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:11:39,318 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 00:11:39,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:11:39,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-07 00:11:39,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:11:39,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1701 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-07 00:11:39,519 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:11:43,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1701 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-07 00:11:43,190 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:11:43,192 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:11:43,192 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:11:43,192 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:11:43,193 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:11:43,193 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:11:43,217 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:11:43,286 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 00:11:43,295 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:11:43,298 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:11:43,298 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:11:43,299 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 114#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-07 00:11:43,299 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 104#(and (< main_~x~0 100000) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem5|) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:11:43,299 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 94#(and (<= 0 main_~i~0) (<= 100000 main_~j~0)) [2019-10-07 00:11:43,299 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 119#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 00:11:43,300 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 128#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:11:43,300 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 00:11:43,300 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 00:11:43,300 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 133#(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 00:11:43,300 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-07 00:11:43,300 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:11:43,301 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 124#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 00:11:43,301 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 99#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:11:43,301 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 109#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-07 00:11:43,850 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:11:43,850 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59, 11] total 127 [2019-10-07 00:11:43,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 127 states [2019-10-07 00:11:43,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2019-10-07 00:11:43,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6815, Invalid=9187, Unknown=0, NotChecked=0, Total=16002 [2019-10-07 00:11:43,863 INFO L87 Difference]: Start difference. First operand 86 states and 88 transitions. Second operand 127 states. [2019-10-07 00:11:53,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:11:53,439 INFO L93 Difference]: Finished difference Result 171 states and 233 transitions. [2019-10-07 00:11:53,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2019-10-07 00:11:53,440 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 82 [2019-10-07 00:11:53,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:11:53,441 INFO L225 Difference]: With dead ends: 171 [2019-10-07 00:11:53,441 INFO L226 Difference]: Without dead ends: 147 [2019-10-07 00:11:53,446 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11724 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=20208, Invalid=41048, Unknown=0, NotChecked=0, Total=61256 [2019-10-07 00:11:53,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-10-07 00:11:53,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 144. [2019-10-07 00:11:53,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-10-07 00:11:53,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 146 transitions. [2019-10-07 00:11:53,464 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 146 transitions. Word has length 82 [2019-10-07 00:11:53,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:11:53,464 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 146 transitions. [2019-10-07 00:11:53,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 127 states. [2019-10-07 00:11:53,465 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 146 transitions. [2019-10-07 00:11:53,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-07 00:11:53,470 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:11:53,470 INFO L385 BasicCegarLoop]: trace histogram [114, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:11:53,674 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:11:53,674 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:11:53,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:11:53,675 INFO L82 PathProgramCache]: Analyzing trace with hash -56941500, now seen corresponding path program 8 times [2019-10-07 00:11:53,675 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:11:53,676 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:11:53,676 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:11:53,676 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:11:53,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:11:53,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:11:58,518 INFO L134 CoverageAnalysis]: Checked inductivity of 6660 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-07 00:11:58,518 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:11:58,518 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:11:58,518 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 [2019-10-07 00:11:58,728 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-10-07 00:11:58,728 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:11:58,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-07 00:11:58,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:11:59,473 INFO L134 CoverageAnalysis]: Checked inductivity of 6660 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 6555 trivial. 0 not checked. [2019-10-07 00:11:59,473 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:12:00,421 INFO L134 CoverageAnalysis]: Checked inductivity of 6660 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 6555 trivial. 0 not checked. [2019-10-07 00:12:00,422 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:12:00,423 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:12:00,423 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:12:00,424 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:12:00,424 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:12:00,424 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:12:00,448 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:12:00,534 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 00:12:00,543 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:12:00,545 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:12:00,546 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:12:00,546 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 114#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-07 00:12:00,546 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 104#(and (< main_~x~0 100000) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem5|) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:12:00,546 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 94#(and (<= 0 main_~i~0) (<= 100000 main_~j~0)) [2019-10-07 00:12:00,547 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 119#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 00:12:00,547 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 128#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:12:00,547 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 00:12:00,547 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 00:12:00,547 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 133#(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 00:12:00,548 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-07 00:12:00,548 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:12:00,548 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 124#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 00:12:00,548 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 99#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:12:00,549 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 109#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-07 00:12:01,445 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:12:01,445 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [117, 17, 17, 11] total 157 [2019-10-07 00:12:01,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 157 states [2019-10-07 00:12:01,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 157 interpolants. [2019-10-07 00:12:01,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7310, Invalid=17182, Unknown=0, NotChecked=0, Total=24492 [2019-10-07 00:12:01,450 INFO L87 Difference]: Start difference. First operand 144 states and 146 transitions. Second operand 157 states. [2019-10-07 00:12:16,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:12:16,255 INFO L93 Difference]: Finished difference Result 188 states and 209 transitions. [2019-10-07 00:12:16,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2019-10-07 00:12:16,256 INFO L78 Accepts]: Start accepts. Automaton has 157 states. Word has length 140 [2019-10-07 00:12:16,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:12:16,259 INFO L225 Difference]: With dead ends: 188 [2019-10-07 00:12:16,259 INFO L226 Difference]: Without dead ends: 164 [2019-10-07 00:12:16,263 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 688 GetRequests, 381 SyntacticMatches, 0 SemanticMatches, 307 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18838 ImplicationChecksByTransitivity, 20.8s TimeCoverageRelationStatistics Valid=21984, Invalid=73188, Unknown=0, NotChecked=0, Total=95172 [2019-10-07 00:12:16,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-10-07 00:12:16,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 161. [2019-10-07 00:12:16,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-10-07 00:12:16,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 163 transitions. [2019-10-07 00:12:16,283 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 163 transitions. Word has length 140 [2019-10-07 00:12:16,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:12:16,284 INFO L462 AbstractCegarLoop]: Abstraction has 161 states and 163 transitions. [2019-10-07 00:12:16,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 157 states. [2019-10-07 00:12:16,284 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 163 transitions. [2019-10-07 00:12:16,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-07 00:12:16,287 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:12:16,287 INFO L385 BasicCegarLoop]: trace histogram [115, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:12:16,489 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:12:16,490 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:12:16,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:12:16,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1450711886, now seen corresponding path program 9 times [2019-10-07 00:12:16,491 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:12:16,491 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:12:16,492 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:12:16,492 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:12:16,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:12:16,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:12:21,486 INFO L134 CoverageAnalysis]: Checked inductivity of 7135 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-10-07 00:12:21,486 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:12:21,486 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:12:21,487 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:12:21,738 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 00:12:21,738 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:12:21,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 866 conjuncts, 117 conjunts are in the unsatisfiable core [2019-10-07 00:12:21,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:12:21,804 INFO L134 CoverageAnalysis]: Checked inductivity of 7135 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-10-07 00:12:21,804 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:12:36,193 INFO L134 CoverageAnalysis]: Checked inductivity of 7135 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-10-07 00:12:36,193 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:12:36,195 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:12:36,195 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:12:36,195 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:12:36,195 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:12:36,196 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:12:36,211 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:12:36,278 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 00:12:36,287 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:12:36,290 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:12:36,290 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:12:36,290 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 114#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-07 00:12:36,290 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 104#(and (< main_~x~0 100000) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem5|) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:12:36,291 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 94#(and (<= 0 main_~i~0) (<= 100000 main_~j~0)) [2019-10-07 00:12:36,291 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 119#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 00:12:36,291 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 128#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:12:36,291 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 00:12:36,292 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 00:12:36,292 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 133#(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 00:12:36,292 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-07 00:12:36,292 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:12:36,292 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 124#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 00:12:36,293 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 99#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:12:36,295 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 109#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1))) [2019-10-07 00:12:37,153 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:12:37,153 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [118, 118, 118, 11] total 245 [2019-10-07 00:12:37,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 245 states [2019-10-07 00:12:37,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 245 interpolants. [2019-10-07 00:12:37,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27524, Invalid=32256, Unknown=0, NotChecked=0, Total=59780 [2019-10-07 00:12:37,160 INFO L87 Difference]: Start difference. First operand 161 states and 163 transitions. Second operand 245 states. [2019-10-07 00:13:11,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:13:11,048 INFO L93 Difference]: Finished difference Result 321 states and 442 transitions. [2019-10-07 00:13:11,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 244 states. [2019-10-07 00:13:11,049 INFO L78 Accepts]: Start accepts. Automaton has 245 states. Word has length 157 [2019-10-07 00:13:11,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:13:11,051 INFO L225 Difference]: With dead ends: 321 [2019-10-07 00:13:11,052 INFO L226 Difference]: Without dead ends: 281 [2019-10-07 00:13:11,060 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 827 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 482 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40929 ImplicationChecksByTransitivity, 51.7s TimeCoverageRelationStatistics Valid=82099, Invalid=151673, Unknown=0, NotChecked=0, Total=233772 [2019-10-07 00:13:11,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-10-07 00:13:11,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 278. [2019-10-07 00:13:11,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-10-07 00:13:11,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 280 transitions. [2019-10-07 00:13:11,084 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 280 transitions. Word has length 157 [2019-10-07 00:13:11,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:13:11,085 INFO L462 AbstractCegarLoop]: Abstraction has 278 states and 280 transitions. [2019-10-07 00:13:11,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 245 states. [2019-10-07 00:13:11,085 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 280 transitions. [2019-10-07 00:13:11,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-10-07 00:13:11,091 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:13:11,091 INFO L385 BasicCegarLoop]: trace histogram [232, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:13:11,298 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:13:11,298 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:13:11,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:13:11,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1274400644, now seen corresponding path program 10 times [2019-10-07 00:13:11,299 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:13:11,300 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:13:11,300 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:13:11,300 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:13:11,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:13:11,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:13:30,451 INFO L134 CoverageAnalysis]: Checked inductivity of 27493 backedges. 0 proven. 27028 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-10-07 00:13:30,451 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:13:30,452 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:13:30,452 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:13:30,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:13:30,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 1568 conjuncts, 234 conjunts are in the unsatisfiable core [2019-10-07 00:13:30,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:13:30,932 INFO L134 CoverageAnalysis]: Checked inductivity of 27493 backedges. 0 proven. 27028 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-10-07 00:13:30,933 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:14:27,473 INFO L134 CoverageAnalysis]: Checked inductivity of 27493 backedges. 0 proven. 27028 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-10-07 00:14:27,473 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:14:27,480 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:14:27,481 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:14:27,481 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:14:27,481 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:14:27,481 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:14:27,514 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:14:27,573 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 00:14:27,580 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:14:27,582 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:14:27,582 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:14:27,582 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 114#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-07 00:14:27,582 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 104#(and (< main_~x~0 100000) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem5|) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:14:27,582 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 94#(and (<= 0 main_~i~0) (<= 100000 main_~j~0)) [2019-10-07 00:14:27,583 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 119#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 00:14:27,583 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 128#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:14:27,583 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 00:14:27,583 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 00:14:27,583 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 133#(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 00:14:27,583 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-07 00:14:27,583 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:14:27,584 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 124#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 00:14:27,584 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 99#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:14:27,584 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 109#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-07 00:14:28,982 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:14:28,983 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [235, 235, 235, 11] total 479 [2019-10-07 00:14:28,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 479 states [2019-10-07 00:14:28,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 479 interpolants. [2019-10-07 00:14:29,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109775, Invalid=119187, Unknown=0, NotChecked=0, Total=228962 [2019-10-07 00:14:29,000 INFO L87 Difference]: Start difference. First operand 278 states and 280 transitions. Second operand 479 states. [2019-10-07 00:16:35,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:16:35,662 INFO L93 Difference]: Finished difference Result 555 states and 793 transitions. [2019-10-07 00:16:35,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 478 states. [2019-10-07 00:16:35,663 INFO L78 Accepts]: Start accepts. Automaton has 479 states. Word has length 274 [2019-10-07 00:16:35,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:16:35,667 INFO L225 Difference]: With dead ends: 555 [2019-10-07 00:16:35,667 INFO L226 Difference]: Without dead ends: 515 [2019-10-07 00:16:35,693 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 1529 GetRequests, 579 SyntacticMatches, 0 SemanticMatches, 950 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150324 ImplicationChecksByTransitivity, 191.6s TimeCoverageRelationStatistics Valid=328384, Invalid=576968, Unknown=0, NotChecked=0, Total=905352 [2019-10-07 00:16:35,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2019-10-07 00:16:35,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 512. [2019-10-07 00:16:35,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-10-07 00:16:35,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 514 transitions. [2019-10-07 00:16:35,726 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 514 transitions. Word has length 274 [2019-10-07 00:16:35,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:16:35,726 INFO L462 AbstractCegarLoop]: Abstraction has 512 states and 514 transitions. [2019-10-07 00:16:35,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 479 states. [2019-10-07 00:16:35,727 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 514 transitions. [2019-10-07 00:16:35,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2019-10-07 00:16:35,737 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:16:35,737 INFO L385 BasicCegarLoop]: trace histogram [466, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:16:35,942 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:16:35,942 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:16:35,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:16:35,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1932711868, now seen corresponding path program 11 times [2019-10-07 00:16:35,943 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:16:35,943 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:16:35,943 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:16:35,943 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:16:35,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:16:37,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:17:54,428 INFO L134 CoverageAnalysis]: Checked inductivity of 109276 backedges. 0 proven. 108811 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-10-07 00:17:54,428 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:17:54,429 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:17:54,429 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:17:57,252 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-10-07 00:17:57,252 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:17:57,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-07 00:17:57,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:18:03,273 INFO L134 CoverageAnalysis]: Checked inductivity of 109276 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 108811 trivial. 0 not checked. [2019-10-07 00:18:03,273 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:18:10,075 INFO L134 CoverageAnalysis]: Checked inductivity of 109276 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 108811 trivial. 0 not checked. [2019-10-07 00:18:10,076 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:18:10,077 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:18:10,077 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:18:10,078 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:18:10,078 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:18:10,078 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:18:10,092 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:18:10,169 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 00:18:10,178 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:18:10,181 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:18:10,181 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:18:10,181 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 114#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-07 00:18:10,181 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 104#(and (< main_~x~0 100000) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem5|) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:18:10,181 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 94#(and (<= 0 main_~i~0) (<= 100000 main_~j~0)) [2019-10-07 00:18:10,181 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 119#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 00:18:10,182 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 128#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:18:10,182 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 00:18:10,182 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 00:18:10,182 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 133#(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 00:18:10,182 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-07 00:18:10,182 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:18:10,183 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 124#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 00:18:10,183 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 99#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:18:10,183 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 109#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-07 00:18:12,942 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:18:12,943 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [469, 33, 33, 11] total 541 [2019-10-07 00:18:12,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 541 states [2019-10-07 00:18:12,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 541 interpolants. [2019-10-07 00:18:12,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111790, Invalid=180350, Unknown=0, NotChecked=0, Total=292140 [2019-10-07 00:18:12,965 INFO L87 Difference]: Start difference. First operand 512 states and 514 transitions. Second operand 541 states. [2019-10-07 00:18:33,219 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-10-07 00:21:02,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:21:02,040 INFO L93 Difference]: Finished difference Result 588 states and 625 transitions. [2019-10-07 00:21:02,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 541 states. [2019-10-07 00:21:02,040 INFO L78 Accepts]: Start accepts. Automaton has 541 states. Word has length 508 [2019-10-07 00:21:02,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:21:02,044 INFO L225 Difference]: With dead ends: 588 [2019-10-07 00:21:02,044 INFO L226 Difference]: Without dead ends: 548 [2019-10-07 00:21:02,090 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 2528 GetRequests, 1453 SyntacticMatches, 0 SemanticMatches, 1075 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194574 ImplicationChecksByTransitivity, 247.0s TimeCoverageRelationStatistics Valid=335488, Invalid=823364, Unknown=0, NotChecked=0, Total=1158852 [2019-10-07 00:21:02,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2019-10-07 00:21:02,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 545. [2019-10-07 00:21:02,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2019-10-07 00:21:02,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 547 transitions. [2019-10-07 00:21:02,122 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 547 transitions. Word has length 508 [2019-10-07 00:21:02,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:21:02,122 INFO L462 AbstractCegarLoop]: Abstraction has 545 states and 547 transitions. [2019-10-07 00:21:02,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 541 states. [2019-10-07 00:21:02,122 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 547 transitions. [2019-10-07 00:21:02,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2019-10-07 00:21:02,125 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:21:02,126 INFO L385 BasicCegarLoop]: trace histogram [467, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:21:02,327 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:21:02,328 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:21:02,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:21:02,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1255843662, now seen corresponding path program 12 times [2019-10-07 00:21:02,329 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:21:02,329 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:21:02,330 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:21:02,330 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:21:02,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:21:03,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:21:05,059 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2019-10-07 00:22:21,974 INFO L134 CoverageAnalysis]: Checked inductivity of 111231 backedges. 0 proven. 109278 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-10-07 00:22:21,974 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:22:21,974 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:22:21,975 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:22:22,774 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 00:22:22,774 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:22:22,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 3106 conjuncts, 469 conjunts are in the unsatisfiable core [2019-10-07 00:22:22,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:22:23,369 INFO L134 CoverageAnalysis]: Checked inductivity of 111231 backedges. 0 proven. 109278 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-10-07 00:22:23,370 INFO L322 TraceCheckSpWp]: Computing backward predicates...