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_sentinel-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 00:21:43,576 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 00:21:43,579 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 00:21:43,594 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 00:21:43,595 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 00:21:43,596 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 00:21:43,597 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 00:21:43,599 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 00:21:43,601 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 00:21:43,602 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 00:21:43,603 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 00:21:43,604 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 00:21:43,604 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 00:21:43,605 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 00:21:43,606 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 00:21:43,607 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 00:21:43,608 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 00:21:43,609 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 00:21:43,611 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 00:21:43,613 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 00:21:43,614 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 00:21:43,616 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 00:21:43,617 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 00:21:43,618 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 00:21:43,620 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 00:21:43,620 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 00:21:43,620 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 00:21:43,621 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 00:21:43,621 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 00:21:43,622 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 00:21:43,622 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 00:21:43,623 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 00:21:43,624 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 00:21:43,625 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 00:21:43,626 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 00:21:43,626 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 00:21:43,627 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 00:21:43,627 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 00:21:43,627 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 00:21:43,628 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 00:21:43,629 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 00:21:43,629 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:21:43,651 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 00:21:43,651 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 00:21:43,653 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 00:21:43,653 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 00:21:43,654 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 00:21:43,654 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 00:21:43,654 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 00:21:43,654 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 00:21:43,655 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 00:21:43,655 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 00:21:43,655 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 00:21:43,656 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 00:21:43,656 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 00:21:43,656 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 00:21:43,657 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 00:21:43,657 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 00:21:43,657 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 00:21:43,657 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 00:21:43,657 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 00:21:43,658 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 00:21:43,658 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 00:21:43,658 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:21:43,659 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 00:21:43,659 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 00:21:43,659 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 00:21:43,659 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 00:21:43,660 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 00:21:43,660 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 00:21:43,660 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:21:43,994 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 00:21:44,009 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 00:21:44,014 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 00:21:44,017 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 00:21:44,018 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 00:21:44,019 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_sentinel-2.i [2019-10-07 00:21:44,089 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1f68d374/6ea599344080450e92e4d22baa440af2/FLAG883f53f82 [2019-10-07 00:21:44,532 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 00:21:44,533 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_sentinel-2.i [2019-10-07 00:21:44,540 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1f68d374/6ea599344080450e92e4d22baa440af2/FLAG883f53f82 [2019-10-07 00:21:44,933 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1f68d374/6ea599344080450e92e4d22baa440af2 [2019-10-07 00:21:44,944 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 00:21:44,946 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 00:21:44,947 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 00:21:44,947 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 00:21:44,952 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 00:21:44,953 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:21:44" (1/1) ... [2019-10-07 00:21:44,956 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f255249 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:21:44, skipping insertion in model container [2019-10-07 00:21:44,957 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:21:44" (1/1) ... [2019-10-07 00:21:44,965 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 00:21:44,985 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 00:21:45,179 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:21:45,196 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 00:21:45,223 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:21:45,249 INFO L192 MainTranslator]: Completed translation [2019-10-07 00:21:45,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:21:45 WrapperNode [2019-10-07 00:21:45,251 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 00:21:45,252 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 00:21:45,252 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 00:21:45,252 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 00:21:45,398 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:21:45" (1/1) ... [2019-10-07 00:21:45,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:21:45" (1/1) ... [2019-10-07 00:21:45,405 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:21:45" (1/1) ... [2019-10-07 00:21:45,406 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:21:45" (1/1) ... [2019-10-07 00:21:45,413 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:21:45" (1/1) ... [2019-10-07 00:21:45,418 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:21:45" (1/1) ... [2019-10-07 00:21:45,419 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:21:45" (1/1) ... [2019-10-07 00:21:45,422 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 00:21:45,422 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 00:21:45,422 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 00:21:45,422 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 00:21:45,423 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:21:45" (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:21:45,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 00:21:45,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 00:21:45,489 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-07 00:21:45,489 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 00:21:45,489 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 00:21:45,489 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 00:21:45,490 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-07 00:21:45,490 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 00:21:45,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 00:21:45,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 00:21:45,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 00:21:45,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 00:21:45,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 00:21:45,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 00:21:45,792 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 00:21:45,793 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-07 00:21:45,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:21:45 BoogieIcfgContainer [2019-10-07 00:21:45,794 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 00:21:45,799 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 00:21:45,799 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 00:21:45,802 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 00:21:45,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 12:21:44" (1/3) ... [2019-10-07 00:21:45,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68fc5514 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:21:45, skipping insertion in model container [2019-10-07 00:21:45,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:21:45" (2/3) ... [2019-10-07 00:21:45,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68fc5514 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:21:45, skipping insertion in model container [2019-10-07 00:21:45,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:21:45" (3/3) ... [2019-10-07 00:21:45,807 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_sentinel-2.i [2019-10-07 00:21:45,817 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 00:21:45,827 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 00:21:45,842 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 00:21:45,865 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 00:21:45,865 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 00:21:45,865 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 00:21:45,866 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 00:21:45,866 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 00:21:45,866 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 00:21:45,866 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 00:21:45,866 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 00:21:45,881 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-10-07 00:21:45,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-07 00:21:45,887 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:21:45,888 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:21:45,890 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:21:45,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:21:45,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1895073184, now seen corresponding path program 1 times [2019-10-07 00:21:45,903 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:21:45,904 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:21:45,904 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:21:45,904 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:21:45,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:21:45,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:21:46,036 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:21:46,037 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:21:46,037 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:21:46,038 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-07 00:21:46,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-07 00:21:46,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-07 00:21:46,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-07 00:21:46,057 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2019-10-07 00:21:46,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:21:46,079 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2019-10-07 00:21:46,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-07 00:21:46,081 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-10-07 00:21:46,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:21:46,087 INFO L225 Difference]: With dead ends: 31 [2019-10-07 00:21:46,087 INFO L226 Difference]: Without dead ends: 14 [2019-10-07 00:21:46,092 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-07 00:21:46,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-10-07 00:21:46,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-10-07 00:21:46,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-10-07 00:21:46,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-10-07 00:21:46,127 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 12 [2019-10-07 00:21:46,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:21:46,127 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-10-07 00:21:46,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-07 00:21:46,128 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-10-07 00:21:46,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-07 00:21:46,129 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:21:46,129 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:21:46,129 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:21:46,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:21:46,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1607168598, now seen corresponding path program 1 times [2019-10-07 00:21:46,130 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:21:46,130 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:21:46,130 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:21:46,131 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:21:46,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:21:46,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:21:46,200 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:21:46,201 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:21:46,201 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:21:46,201 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:21:46,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:21:46,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:21:46,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:21:46,204 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 3 states. [2019-10-07 00:21:46,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:21:46,225 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2019-10-07 00:21:46,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:21:46,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-07 00:21:46,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:21:46,226 INFO L225 Difference]: With dead ends: 23 [2019-10-07 00:21:46,227 INFO L226 Difference]: Without dead ends: 15 [2019-10-07 00:21:46,228 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:21:46,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-10-07 00:21:46,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-10-07 00:21:46,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-10-07 00:21:46,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-10-07 00:21:46,233 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 13 [2019-10-07 00:21:46,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:21:46,234 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-10-07 00:21:46,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:21:46,234 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-10-07 00:21:46,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-07 00:21:46,235 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:21:46,235 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:21:46,235 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:21:46,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:21:46,236 INFO L82 PathProgramCache]: Analyzing trace with hash -710183188, now seen corresponding path program 1 times [2019-10-07 00:21:46,236 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:21:46,236 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:21:46,237 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:21:46,237 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:21:46,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:21:46,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:21:46,384 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:21:46,385 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:21:46,385 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:21:46,385 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 00:21:46,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 00:21:46,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 00:21:46,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 00:21:46,387 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 5 states. [2019-10-07 00:21:46,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:21:46,440 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2019-10-07 00:21:46,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 00:21:46,442 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-10-07 00:21:46,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:21:46,443 INFO L225 Difference]: With dead ends: 22 [2019-10-07 00:21:46,444 INFO L226 Difference]: Without dead ends: 17 [2019-10-07 00:21:46,445 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-07 00:21:46,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-10-07 00:21:46,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-10-07 00:21:46,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-07 00:21:46,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-10-07 00:21:46,454 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2019-10-07 00:21:46,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:21:46,455 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-10-07 00:21:46,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 00:21:46,455 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-10-07 00:21:46,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-07 00:21:46,456 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:21:46,456 INFO L385 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:21:46,456 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:21:46,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:21:46,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1319161073, now seen corresponding path program 1 times [2019-10-07 00:21:46,457 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:21:46,457 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:21:46,458 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:21:46,458 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:21:46,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:21:46,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:21:46,520 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 00:21:46,520 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:21:46,521 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:21:46,521 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:21:46,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:21:46,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 00:21:46,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:21:46,612 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 00:21:46,613 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:21:46,651 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 00:21:46,651 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:21:46,675 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-07 00:21:46,676 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:21:46,683 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:21:46,691 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:21:46,692 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:21:46,853 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:21:47,254 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 00:21:47,291 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:21:47,302 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:21:47,302 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:21:47,303 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 144#(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:21:47,304 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 153#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:21:47,304 INFO L193 IcfgInterpreter]: Reachable states at location L17-4 satisfy 124#(and (<= 0 main_~pos~0) (<= 100000 main_~i~0) (<= 0 main_~i~1) (<= main_~pos~0 100000)) [2019-10-07 00:21:47,304 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 149#(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:21:47,305 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 130#(or (and (<= 0 main_~pos~0) (<= 100000 main_~i~0) (<= 1 main_~i~1) (<= main_~pos~0 100000)) (and (<= main_~i~1 0) (<= 0 main_~pos~0) (< main_~pos~0 100000) (<= 100000 main_~i~0) (<= 0 main_~i~1) (not (< main_~i~0 100000)) (= main_~i~1 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~pos~0) |main_~#a~0.offset|)) main_~marker~0) (<= main_~pos~0 100000))) [2019-10-07 00:21:47,306 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 139#(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:21:47,306 INFO L193 IcfgInterpreter]: Reachable states at location L9-4 satisfy 73#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-07 00:21:47,306 INFO L193 IcfgInterpreter]: Reachable states at location L17-1 satisfy 119#(and (<= 0 main_~pos~0) (<= 100000 main_~i~0) (<= 0 main_~i~1) (<= main_~pos~0 100000)) [2019-10-07 00:21:47,307 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:21:47,307 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:21:47,307 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 158#(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:21:47,308 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-07 00:21:47,308 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:21:47,309 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 134#(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:21:47,690 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:21:47,690 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 17 [2019-10-07 00:21:47,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-07 00:21:47,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-07 00:21:47,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2019-10-07 00:21:47,693 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 17 states. [2019-10-07 00:21:48,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:21:48,140 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2019-10-07 00:21:48,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-07 00:21:48,141 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2019-10-07 00:21:48,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:21:48,142 INFO L225 Difference]: With dead ends: 30 [2019-10-07 00:21:48,142 INFO L226 Difference]: Without dead ends: 20 [2019-10-07 00:21:48,144 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=126, Invalid=576, Unknown=0, NotChecked=0, Total=702 [2019-10-07 00:21:48,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-07 00:21:48,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-07 00:21:48,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-07 00:21:48,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-10-07 00:21:48,150 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 16 [2019-10-07 00:21:48,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:21:48,150 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-10-07 00:21:48,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-07 00:21:48,151 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-10-07 00:21:48,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-07 00:21:48,151 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:21:48,152 INFO L385 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:21:48,356 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:21:48,356 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:21:48,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:21:48,357 INFO L82 PathProgramCache]: Analyzing trace with hash 922897583, now seen corresponding path program 2 times [2019-10-07 00:21:48,357 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:21:48,357 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:21:48,357 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:21:48,358 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:21:48,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:21:48,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:21:48,451 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 00:21:48,451 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:21:48,452 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:21:48,452 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:21:48,515 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-07 00:21:48,515 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:21:48,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-07 00:21:48,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:21:48,688 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-07 00:21:48,688 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:21:48,838 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-07 00:21:48,838 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:21:48,840 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-07 00:21:48,840 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:21:48,841 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:21:48,841 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:21:48,841 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:21:48,871 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:21:49,037 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 00:21:49,055 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:21:49,061 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:21:49,061 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:21:49,061 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 144#(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:21:49,062 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 153#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:21:49,062 INFO L193 IcfgInterpreter]: Reachable states at location L17-4 satisfy 124#(and (<= 0 main_~pos~0) (<= 100000 main_~i~0) (<= 0 main_~i~1) (<= main_~pos~0 100000)) [2019-10-07 00:21:49,062 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 149#(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:21:49,063 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 130#(or (and (<= 0 main_~pos~0) (<= 100000 main_~i~0) (<= 1 main_~i~1) (<= main_~pos~0 100000)) (and (<= main_~i~1 0) (<= 0 main_~pos~0) (< main_~pos~0 100000) (<= 100000 main_~i~0) (<= 0 main_~i~1) (not (< main_~i~0 100000)) (= main_~i~1 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~pos~0) |main_~#a~0.offset|)) main_~marker~0) (<= main_~pos~0 100000))) [2019-10-07 00:21:49,063 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 139#(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:21:49,063 INFO L193 IcfgInterpreter]: Reachable states at location L9-4 satisfy 73#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-07 00:21:49,063 INFO L193 IcfgInterpreter]: Reachable states at location L17-1 satisfy 119#(and (<= 0 main_~pos~0) (<= 100000 main_~i~0) (<= 0 main_~i~1) (<= main_~pos~0 100000)) [2019-10-07 00:21:49,063 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:21:49,064 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:21:49,064 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 158#(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:21:49,064 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-07 00:21:49,064 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:21:49,065 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 134#(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:21:49,500 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:21:49,502 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7, 11] total 28 [2019-10-07 00:21:49,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-07 00:21:49,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-07 00:21:49,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=673, Unknown=0, NotChecked=0, Total=756 [2019-10-07 00:21:49,504 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 28 states. [2019-10-07 00:21:50,101 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2019-10-07 00:21:50,395 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-10-07 00:21:50,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:21:50,943 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2019-10-07 00:21:50,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-07 00:21:50,944 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 19 [2019-10-07 00:21:50,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:21:50,946 INFO L225 Difference]: With dead ends: 39 [2019-10-07 00:21:50,946 INFO L226 Difference]: Without dead ends: 25 [2019-10-07 00:21:50,948 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=292, Invalid=1870, Unknown=0, NotChecked=0, Total=2162 [2019-10-07 00:21:50,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-07 00:21:50,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-10-07 00:21:50,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-07 00:21:50,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-10-07 00:21:50,954 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 19 [2019-10-07 00:21:50,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:21:50,955 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-10-07 00:21:50,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-07 00:21:50,955 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-10-07 00:21:50,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-07 00:21:50,956 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:21:50,956 INFO L385 BasicCegarLoop]: trace histogram [5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:21:51,167 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:21:51,168 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:21:51,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:21:51,169 INFO L82 PathProgramCache]: Analyzing trace with hash -841568069, now seen corresponding path program 3 times [2019-10-07 00:21:51,169 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:21:51,169 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:21:51,170 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:21:51,170 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:21:51,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:21:51,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:21:51,259 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-07 00:21:51,260 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:21:51,260 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:21:51,260 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:21:51,339 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 00:21:51,339 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:21:51,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-07 00:21:51,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:21:51,367 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-07 00:21:51,367 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:21:51,444 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-07 00:21:51,445 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:21:51,446 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-07 00:21:51,446 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:21:51,447 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:21:51,447 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:21:51,447 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:21:51,485 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:21:51,648 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 00:21:51,664 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:21:51,674 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:21:51,675 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:21:51,675 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 144#(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:21:51,675 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 153#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:21:51,676 INFO L193 IcfgInterpreter]: Reachable states at location L17-4 satisfy 124#(and (<= 0 main_~pos~0) (<= 100000 main_~i~0) (<= 0 main_~i~1) (<= main_~pos~0 100000)) [2019-10-07 00:21:51,676 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 149#(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:21:51,676 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 130#(or (and (<= 0 main_~pos~0) (<= 100000 main_~i~0) (<= 1 main_~i~1) (<= main_~pos~0 100000)) (and (<= main_~i~1 0) (<= 0 main_~pos~0) (< main_~pos~0 100000) (<= 100000 main_~i~0) (<= 0 main_~i~1) (not (< main_~i~0 100000)) (= main_~i~1 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~pos~0) |main_~#a~0.offset|)) main_~marker~0) (<= main_~pos~0 100000))) [2019-10-07 00:21:51,676 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 139#(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:21:51,677 INFO L193 IcfgInterpreter]: Reachable states at location L9-4 satisfy 73#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-07 00:21:51,677 INFO L193 IcfgInterpreter]: Reachable states at location L17-1 satisfy 119#(and (<= 0 main_~pos~0) (<= 100000 main_~i~0) (<= 0 main_~i~1) (<= main_~pos~0 100000)) [2019-10-07 00:21:51,677 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:21:51,677 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:21:51,679 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-07 00:21:51,680 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 158#(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:21:51,680 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:21:51,680 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 134#(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:21:52,042 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:21:52,043 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 11] total 25 [2019-10-07 00:21:52,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-07 00:21:52,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-07 00:21:52,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=466, Unknown=0, NotChecked=0, Total=600 [2019-10-07 00:21:52,045 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 25 states. [2019-10-07 00:21:52,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:21:52,733 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2019-10-07 00:21:52,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-07 00:21:52,734 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2019-10-07 00:21:52,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:21:52,735 INFO L225 Difference]: With dead ends: 46 [2019-10-07 00:21:52,735 INFO L226 Difference]: Without dead ends: 32 [2019-10-07 00:21:52,737 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=362, Invalid=1444, Unknown=0, NotChecked=0, Total=1806 [2019-10-07 00:21:52,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-07 00:21:52,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-10-07 00:21:52,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-07 00:21:52,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-10-07 00:21:52,744 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 24 [2019-10-07 00:21:52,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:21:52,744 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-10-07 00:21:52,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-07 00:21:52,745 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-10-07 00:21:52,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-07 00:21:52,746 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:21:52,746 INFO L385 BasicCegarLoop]: trace histogram [12, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:21:52,950 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:21:52,951 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:21:52,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:21:52,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1957294841, now seen corresponding path program 4 times [2019-10-07 00:21:52,951 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:21:52,951 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:21:52,952 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:21:52,952 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:21:52,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:21:52,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:21:53,130 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-07 00:21:53,130 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:21:53,130 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:21:53,130 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:21:53,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:21:53,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-07 00:21:53,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:21:53,257 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-07 00:21:53,258 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:21:53,626 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-07 00:21:53,627 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:21:53,631 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-07 00:21:53,632 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:21:53,632 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:21:53,633 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:21:53,633 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:21:53,682 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:21:53,843 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 00:21:53,864 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:21:53,868 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:21:53,869 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:21:53,872 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 144#(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:21:53,872 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 153#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:21:53,872 INFO L193 IcfgInterpreter]: Reachable states at location L17-4 satisfy 124#(and (<= 0 main_~pos~0) (<= 100000 main_~i~0) (<= 0 main_~i~1) (<= main_~pos~0 100000)) [2019-10-07 00:21:53,872 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 149#(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:21:53,873 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 130#(or (and (<= 0 main_~pos~0) (<= 100000 main_~i~0) (<= 1 main_~i~1) (<= main_~pos~0 100000)) (and (<= main_~i~1 0) (<= 0 main_~pos~0) (< main_~pos~0 100000) (<= 100000 main_~i~0) (<= 0 main_~i~1) (not (< main_~i~0 100000)) (= main_~i~1 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~pos~0) |main_~#a~0.offset|)) main_~marker~0) (<= main_~pos~0 100000))) [2019-10-07 00:21:53,873 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 139#(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:21:53,873 INFO L193 IcfgInterpreter]: Reachable states at location L9-4 satisfy 73#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-07 00:21:53,873 INFO L193 IcfgInterpreter]: Reachable states at location L17-1 satisfy 119#(and (<= 0 main_~pos~0) (<= 100000 main_~i~0) (<= 0 main_~i~1) (<= main_~pos~0 100000)) [2019-10-07 00:21:53,874 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:21:53,874 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:21:53,874 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-07 00:21:53,874 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 158#(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:21:53,874 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:21:53,875 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 134#(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:21:54,205 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:21:54,205 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15, 11] total 39 [2019-10-07 00:21:54,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-07 00:21:54,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-07 00:21:54,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2019-10-07 00:21:54,208 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 39 states. [2019-10-07 00:21:55,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:21:55,515 INFO L93 Difference]: Finished difference Result 60 states and 75 transitions. [2019-10-07 00:21:55,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-10-07 00:21:55,515 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 31 [2019-10-07 00:21:55,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:21:55,516 INFO L225 Difference]: With dead ends: 60 [2019-10-07 00:21:55,517 INFO L226 Difference]: Without dead ends: 46 [2019-10-07 00:21:55,519 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1230 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1237, Invalid=3733, Unknown=0, NotChecked=0, Total=4970 [2019-10-07 00:21:55,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-07 00:21:55,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-10-07 00:21:55,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-07 00:21:55,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2019-10-07 00:21:55,528 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 31 [2019-10-07 00:21:55,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:21:55,529 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2019-10-07 00:21:55,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-07 00:21:55,529 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2019-10-07 00:21:55,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-07 00:21:55,530 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:21:55,530 INFO L385 BasicCegarLoop]: trace histogram [26, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:21:55,741 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:21:55,742 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:21:55,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:21:55,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1319947449, now seen corresponding path program 5 times [2019-10-07 00:21:55,743 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:21:55,743 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:21:55,743 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:21:55,743 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:21:55,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:21:55,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:21:56,169 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-07 00:21:56,169 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:21:56,169 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:21:56,170 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:21:56,260 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-07 00:21:56,260 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:21:56,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-07 00:21:56,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:21:56,831 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-10-07 00:21:56,831 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:21:57,242 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-10-07 00:21:57,242 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:21:57,244 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-07 00:21:57,244 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:21:57,244 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:21:57,245 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:21:57,245 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:21:57,273 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:21:57,402 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 00:21:57,411 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:21:57,415 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:21:57,416 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:21:57,417 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 144#(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:21:57,417 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 153#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:21:57,418 INFO L193 IcfgInterpreter]: Reachable states at location L17-4 satisfy 124#(and (<= 0 main_~pos~0) (<= 100000 main_~i~0) (<= 0 main_~i~1) (<= main_~pos~0 100000)) [2019-10-07 00:21:57,418 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 149#(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:21:57,418 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 130#(or (and (<= 0 main_~pos~0) (<= 100000 main_~i~0) (<= 1 main_~i~1) (<= main_~pos~0 100000)) (and (<= main_~i~1 0) (<= 0 main_~pos~0) (< main_~pos~0 100000) (<= 100000 main_~i~0) (<= 0 main_~i~1) (not (< main_~i~0 100000)) (= main_~i~1 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~pos~0) |main_~#a~0.offset|)) main_~marker~0) (<= main_~pos~0 100000))) [2019-10-07 00:21:57,418 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 139#(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:21:57,418 INFO L193 IcfgInterpreter]: Reachable states at location L9-4 satisfy 73#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-07 00:21:57,419 INFO L193 IcfgInterpreter]: Reachable states at location L17-1 satisfy 119#(and (<= 0 main_~pos~0) (<= 100000 main_~i~0) (<= 0 main_~i~1) (<= main_~pos~0 100000)) [2019-10-07 00:21:57,420 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:21:57,420 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:21:57,420 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-07 00:21:57,420 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 158#(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:21:57,420 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:21:57,421 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 134#(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:21:58,043 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:21:58,044 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 12, 11, 11] total 58 [2019-10-07 00:21:58,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-10-07 00:21:58,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-10-07 00:21:58,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=515, Invalid=2791, Unknown=0, NotChecked=0, Total=3306 [2019-10-07 00:21:58,047 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 58 states. [2019-10-07 00:22:00,782 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 69 [2019-10-07 00:22:01,044 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2019-10-07 00:22:01,401 WARN L191 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2019-10-07 00:22:01,895 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-10-07 00:22:02,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:22:02,805 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2019-10-07 00:22:02,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-10-07 00:22:02,806 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 45 [2019-10-07 00:22:02,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:22:02,808 INFO L225 Difference]: With dead ends: 75 [2019-10-07 00:22:02,809 INFO L226 Difference]: Without dead ends: 55 [2019-10-07 00:22:02,812 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2509 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=1710, Invalid=9632, Unknown=0, NotChecked=0, Total=11342 [2019-10-07 00:22:02,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-07 00:22:02,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-10-07 00:22:02,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-07 00:22:02,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-10-07 00:22:02,821 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 45 [2019-10-07 00:22:02,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:22:02,822 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-10-07 00:22:02,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-10-07 00:22:02,822 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-10-07 00:22:02,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-07 00:22:02,823 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:22:02,823 INFO L385 BasicCegarLoop]: trace histogram [27, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:22:03,027 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:22:03,028 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:22:03,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:22:03,029 INFO L82 PathProgramCache]: Analyzing trace with hash 191084431, now seen corresponding path program 6 times [2019-10-07 00:22:03,029 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:22:03,029 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:22:03,030 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:22:03,030 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:22:03,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:22:03,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:22:03,486 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-07 00:22:03,486 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:22:03,486 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:22:03,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 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:22:03,609 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 00:22:03,610 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:22:03,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-07 00:22:03,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:22:03,648 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-07 00:22:03,648 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:22:04,603 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-07 00:22:04,603 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:22:04,604 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-07 00:22:04,605 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:22:04,605 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:22:04,605 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:22:04,605 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:22:04,631 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:22:04,759 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 00:22:04,770 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:22:04,774 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:22:04,774 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:22:04,774 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 144#(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:22:04,774 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 153#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:22:04,774 INFO L193 IcfgInterpreter]: Reachable states at location L17-4 satisfy 124#(and (<= 0 main_~pos~0) (<= 100000 main_~i~0) (<= 0 main_~i~1) (<= main_~pos~0 100000)) [2019-10-07 00:22:04,775 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 149#(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:22:04,775 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 130#(or (and (<= 0 main_~pos~0) (<= 100000 main_~i~0) (<= 1 main_~i~1) (<= main_~pos~0 100000)) (and (<= main_~i~1 0) (<= 0 main_~pos~0) (< main_~pos~0 100000) (<= 100000 main_~i~0) (<= 0 main_~i~1) (not (< main_~i~0 100000)) (= main_~i~1 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~pos~0) |main_~#a~0.offset|)) main_~marker~0) (<= main_~pos~0 100000))) [2019-10-07 00:22:04,775 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 139#(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:22:04,775 INFO L193 IcfgInterpreter]: Reachable states at location L9-4 satisfy 73#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-07 00:22:04,776 INFO L193 IcfgInterpreter]: Reachable states at location L17-1 satisfy 119#(and (<= 0 main_~pos~0) (<= 100000 main_~i~0) (<= 0 main_~i~1) (<= main_~pos~0 100000)) [2019-10-07 00:22:04,776 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:22:04,776 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:22:04,776 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 158#(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:22:04,777 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-07 00:22:04,777 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:22:04,777 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 134#(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:22:05,208 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:22:05,208 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30, 11] total 69 [2019-10-07 00:22:05,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-10-07 00:22:05,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-10-07 00:22:05,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1740, Invalid=2952, Unknown=0, NotChecked=0, Total=4692 [2019-10-07 00:22:05,212 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 69 states. [2019-10-07 00:22:08,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:22:08,336 INFO L93 Difference]: Finished difference Result 106 states and 136 transitions. [2019-10-07 00:22:08,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-10-07 00:22:08,336 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 54 [2019-10-07 00:22:08,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:22:08,338 INFO L225 Difference]: With dead ends: 106 [2019-10-07 00:22:08,338 INFO L226 Difference]: Without dead ends: 84 [2019-10-07 00:22:08,344 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3660 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5092, Invalid=11938, Unknown=0, NotChecked=0, Total=17030 [2019-10-07 00:22:08,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-10-07 00:22:08,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-10-07 00:22:08,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-10-07 00:22:08,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2019-10-07 00:22:08,356 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 54 [2019-10-07 00:22:08,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:22:08,356 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2019-10-07 00:22:08,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-10-07 00:22:08,356 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2019-10-07 00:22:08,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-07 00:22:08,359 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:22:08,359 INFO L385 BasicCegarLoop]: trace histogram [56, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:22:08,563 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:22:08,564 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:22:08,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:22:08,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1550959629, now seen corresponding path program 7 times [2019-10-07 00:22:08,564 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:22:08,564 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:22:08,564 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:22:08,565 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:22:08,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:22:08,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:22:09,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1652 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-07 00:22:09,949 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:22:09,949 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:22:09,949 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:22:10,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:22:10,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-07 00:22:10,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:22:10,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1652 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-07 00:22:10,140 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:22:13,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1652 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-07 00:22:13,747 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:22:13,748 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-07 00:22:13,748 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:22:13,749 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:22:13,749 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:22:13,749 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:22:13,780 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:22:13,892 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 00:22:13,906 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:22:13,910 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:22:13,910 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:22:13,911 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 144#(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:22:13,911 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 153#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:22:13,911 INFO L193 IcfgInterpreter]: Reachable states at location L17-4 satisfy 124#(and (<= 0 main_~pos~0) (<= 100000 main_~i~0) (<= 0 main_~i~1) (<= main_~pos~0 100000)) [2019-10-07 00:22:13,911 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 149#(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:22:13,911 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 130#(or (and (<= 0 main_~pos~0) (<= 100000 main_~i~0) (<= 1 main_~i~1) (<= main_~pos~0 100000)) (and (<= main_~i~1 0) (<= 0 main_~pos~0) (< main_~pos~0 100000) (<= 100000 main_~i~0) (<= 0 main_~i~1) (not (< main_~i~0 100000)) (= main_~i~1 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~pos~0) |main_~#a~0.offset|)) main_~marker~0) (<= main_~pos~0 100000))) [2019-10-07 00:22:13,912 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 139#(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:22:13,912 INFO L193 IcfgInterpreter]: Reachable states at location L9-4 satisfy 73#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-07 00:22:13,912 INFO L193 IcfgInterpreter]: Reachable states at location L17-1 satisfy 119#(and (<= 0 main_~pos~0) (<= 100000 main_~i~0) (<= 0 main_~i~1) (<= main_~pos~0 100000)) [2019-10-07 00:22:13,912 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:22:13,912 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:22:13,912 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 158#(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:22:13,913 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-07 00:22:13,913 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:22:13,913 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 134#(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:22:14,481 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:22:14,482 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59, 11] total 127 [2019-10-07 00:22:14,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 127 states [2019-10-07 00:22:14,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2019-10-07 00:22:14,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6815, Invalid=9187, Unknown=0, NotChecked=0, Total=16002 [2019-10-07 00:22:14,490 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 127 states. [2019-10-07 00:22:24,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:22:24,116 INFO L93 Difference]: Finished difference Result 164 states and 223 transitions. [2019-10-07 00:22:24,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2019-10-07 00:22:24,117 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 83 [2019-10-07 00:22:24,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:22:24,123 INFO L225 Difference]: With dead ends: 164 [2019-10-07 00:22:24,124 INFO L226 Difference]: Without dead ends: 142 [2019-10-07 00:22:24,128 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11548 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=20201, Invalid=40561, Unknown=0, NotChecked=0, Total=60762 [2019-10-07 00:22:24,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-10-07 00:22:24,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2019-10-07 00:22:24,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-10-07 00:22:24,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 143 transitions. [2019-10-07 00:22:24,161 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 143 transitions. Word has length 83 [2019-10-07 00:22:24,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:22:24,162 INFO L462 AbstractCegarLoop]: Abstraction has 142 states and 143 transitions. [2019-10-07 00:22:24,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 127 states. [2019-10-07 00:22:24,162 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 143 transitions. [2019-10-07 00:22:24,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-07 00:22:24,166 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:22:24,166 INFO L385 BasicCegarLoop]: trace histogram [114, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:22:24,366 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:22:24,367 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:22:24,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:22:24,368 INFO L82 PathProgramCache]: Analyzing trace with hash 2110620493, now seen corresponding path program 8 times [2019-10-07 00:22:24,368 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:22:24,369 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:22:24,369 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:22:24,369 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:22:24,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:22:24,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:22:29,482 INFO L134 CoverageAnalysis]: Checked inductivity of 6611 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-07 00:22:29,482 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:22:29,482 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:22:29,482 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:22:29,804 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-10-07 00:22:29,804 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:22:29,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 57 conjunts are in the unsatisfiable core [2019-10-07 00:22:29,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:22:32,050 INFO L134 CoverageAnalysis]: Checked inductivity of 6611 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 6105 trivial. 0 not checked. [2019-10-07 00:22:32,050 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:22:33,995 INFO L134 CoverageAnalysis]: Checked inductivity of 6611 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 6555 trivial. 0 not checked. [2019-10-07 00:22:33,995 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:22:33,996 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-07 00:22:33,996 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:22:33,996 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:22:33,996 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:22:33,997 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:22:34,012 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:22:34,115 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 00:22:34,124 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:22:34,127 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:22:34,127 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:22:34,127 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 144#(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:22:34,128 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 153#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:22:34,128 INFO L193 IcfgInterpreter]: Reachable states at location L17-4 satisfy 124#(and (<= 0 main_~pos~0) (<= 100000 main_~i~0) (<= 0 main_~i~1) (<= main_~pos~0 100000)) [2019-10-07 00:22:34,128 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 149#(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:22:34,128 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 130#(or (and (<= 0 main_~pos~0) (<= 100000 main_~i~0) (<= 1 main_~i~1) (<= main_~pos~0 100000)) (and (<= main_~i~1 0) (<= 0 main_~pos~0) (< main_~pos~0 100000) (<= 100000 main_~i~0) (<= 0 main_~i~1) (not (< main_~i~0 100000)) (= main_~i~1 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~pos~0) |main_~#a~0.offset|)) main_~marker~0) (<= main_~pos~0 100000))) [2019-10-07 00:22:34,128 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 139#(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:22:34,129 INFO L193 IcfgInterpreter]: Reachable states at location L9-4 satisfy 73#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-07 00:22:34,129 INFO L193 IcfgInterpreter]: Reachable states at location L17-1 satisfy 119#(and (<= 0 main_~pos~0) (<= 100000 main_~i~0) (<= 0 main_~i~1) (<= main_~pos~0 100000)) [2019-10-07 00:22:34,129 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:22:34,129 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:22:34,129 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 158#(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:22:34,130 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-07 00:22:34,130 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:22:34,130 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 134#(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:22:35,283 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:22:35,283 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [117, 24, 19, 11] total 166 [2019-10-07 00:22:35,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 166 states [2019-10-07 00:22:35,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2019-10-07 00:22:35,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7522, Invalid=19868, Unknown=0, NotChecked=0, Total=27390 [2019-10-07 00:22:35,289 INFO L87 Difference]: Start difference. First operand 142 states and 143 transitions. Second operand 166 states. [2019-10-07 00:22:52,594 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-10-07 00:22:53,207 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 65 [2019-10-07 00:22:53,934 WARN L191 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 96 [2019-10-07 00:22:54,982 WARN L191 SmtUtils]: Spent 633.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 105 [2019-10-07 00:22:55,702 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 81 [2019-10-07 00:22:56,572 WARN L191 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 89 [2019-10-07 00:22:57,277 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 73 [2019-10-07 00:22:57,886 WARN L191 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 80 [2019-10-07 00:22:58,254 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-10-07 00:22:58,737 WARN L191 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 71 [2019-10-07 00:22:59,056 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-10-07 00:22:59,466 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-10-07 00:23:00,066 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-10-07 00:23:01,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:23:01,641 INFO L93 Difference]: Finished difference Result 191 states and 201 transitions. [2019-10-07 00:23:01,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2019-10-07 00:23:01,642 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 141 [2019-10-07 00:23:01,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:23:01,644 INFO L225 Difference]: With dead ends: 191 [2019-10-07 00:23:01,644 INFO L226 Difference]: Without dead ends: 159 [2019-10-07 00:23:01,656 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 692 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 317 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20745 ImplicationChecksByTransitivity, 32.6s TimeCoverageRelationStatistics Valid=22206, Invalid=79236, Unknown=0, NotChecked=0, Total=101442 [2019-10-07 00:23:01,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-10-07 00:23:01,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2019-10-07 00:23:01,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-10-07 00:23:01,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2019-10-07 00:23:01,706 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 141 [2019-10-07 00:23:01,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:23:01,707 INFO L462 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2019-10-07 00:23:01,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 166 states. [2019-10-07 00:23:01,707 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2019-10-07 00:23:01,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-07 00:23:01,716 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:23:01,716 INFO L385 BasicCegarLoop]: trace histogram [115, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:23:01,924 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:23:01,925 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:23:01,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:23:01,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1713955767, now seen corresponding path program 9 times [2019-10-07 00:23:01,925 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:23:01,925 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:23:01,925 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:23:01,925 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:23:01,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:23:02,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:23:06,982 INFO L134 CoverageAnalysis]: Checked inductivity of 6910 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2019-10-07 00:23:06,982 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:23:06,983 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:23:06,983 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:23:07,262 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 00:23:07,262 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:23:07,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 828 conjuncts, 117 conjunts are in the unsatisfiable core [2019-10-07 00:23:07,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:23:07,341 INFO L134 CoverageAnalysis]: Checked inductivity of 6910 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2019-10-07 00:23:07,341 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:23:22,189 INFO L134 CoverageAnalysis]: Checked inductivity of 6910 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2019-10-07 00:23:22,189 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:23:22,190 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-07 00:23:22,191 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:23:22,191 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:23:22,191 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:23:22,192 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:23:22,213 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:23:22,322 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 00:23:22,332 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:23:22,334 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:23:22,335 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:23:22,335 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 144#(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:23:22,335 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 153#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:23:22,335 INFO L193 IcfgInterpreter]: Reachable states at location L17-4 satisfy 124#(and (<= 0 main_~pos~0) (<= 100000 main_~i~0) (<= 0 main_~i~1) (<= main_~pos~0 100000)) [2019-10-07 00:23:22,335 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 149#(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:23:22,335 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 130#(or (and (<= 0 main_~pos~0) (<= 100000 main_~i~0) (<= 1 main_~i~1) (<= main_~pos~0 100000)) (and (<= main_~i~1 0) (<= 0 main_~pos~0) (< main_~pos~0 100000) (<= 100000 main_~i~0) (<= 0 main_~i~1) (not (< main_~i~0 100000)) (= main_~i~1 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~pos~0) |main_~#a~0.offset|)) main_~marker~0) (<= main_~pos~0 100000))) [2019-10-07 00:23:22,335 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 139#(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:23:22,336 INFO L193 IcfgInterpreter]: Reachable states at location L9-4 satisfy 73#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-07 00:23:22,336 INFO L193 IcfgInterpreter]: Reachable states at location L17-1 satisfy 119#(and (<= 0 main_~pos~0) (<= 100000 main_~i~0) (<= 0 main_~i~1) (<= main_~pos~0 100000)) [2019-10-07 00:23:22,336 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:23:22,336 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:23:22,336 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 158#(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:23:22,340 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-07 00:23:22,341 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:23:22,341 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 134#(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:23:23,172 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:23:23,172 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [118, 118, 118, 11] total 245 [2019-10-07 00:23:23,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 245 states [2019-10-07 00:23:23,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 245 interpolants. [2019-10-07 00:23:23,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27524, Invalid=32256, Unknown=0, NotChecked=0, Total=59780 [2019-10-07 00:23:23,178 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 245 states. [2019-10-07 00:23:57,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:23:57,189 INFO L93 Difference]: Finished difference Result 314 states and 432 transitions. [2019-10-07 00:23:57,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 243 states. [2019-10-07 00:23:57,189 INFO L78 Accepts]: Start accepts. Automaton has 245 states. Word has length 158 [2019-10-07 00:23:57,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:23:57,192 INFO L225 Difference]: With dead ends: 314 [2019-10-07 00:23:57,192 INFO L226 Difference]: Without dead ends: 276 [2019-10-07 00:23:57,199 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 829 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 481 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40576 ImplicationChecksByTransitivity, 52.5s TimeCoverageRelationStatistics Valid=82092, Invalid=150714, Unknown=0, NotChecked=0, Total=232806 [2019-10-07 00:23:57,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-10-07 00:23:57,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2019-10-07 00:23:57,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-10-07 00:23:57,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 277 transitions. [2019-10-07 00:23:57,236 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 277 transitions. Word has length 158 [2019-10-07 00:23:57,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:23:57,237 INFO L462 AbstractCegarLoop]: Abstraction has 276 states and 277 transitions. [2019-10-07 00:23:57,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 245 states. [2019-10-07 00:23:57,237 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 277 transitions. [2019-10-07 00:23:57,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-10-07 00:23:57,240 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:23:57,241 INFO L385 BasicCegarLoop]: trace histogram [232, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:23:57,446 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:23:57,446 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:23:57,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:23:57,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1723315509, now seen corresponding path program 10 times [2019-10-07 00:23:57,447 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:23:57,448 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:23:57,448 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:23:57,448 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:23:57,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:23:58,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:24:17,481 INFO L134 CoverageAnalysis]: Checked inductivity of 27268 backedges. 0 proven. 27028 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2019-10-07 00:24:17,481 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:17,481 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:24:17,481 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:24:17,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:24:17,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 1530 conjuncts, 234 conjunts are in the unsatisfiable core [2019-10-07 00:24:17,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:24:18,038 INFO L134 CoverageAnalysis]: Checked inductivity of 27268 backedges. 0 proven. 27028 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2019-10-07 00:24:18,039 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:25:18,025 INFO L134 CoverageAnalysis]: Checked inductivity of 27268 backedges. 0 proven. 27028 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2019-10-07 00:25:18,025 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:25:18,027 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-07 00:25:18,027 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:25:18,027 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:25:18,027 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:25:18,028 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:25:18,053 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:25:18,137 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 00:25:18,150 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:25:18,153 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:25:18,154 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:25:18,154 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 144#(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:25:18,154 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 153#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:25:18,154 INFO L193 IcfgInterpreter]: Reachable states at location L17-4 satisfy 124#(and (<= 0 main_~pos~0) (<= 100000 main_~i~0) (<= 0 main_~i~1) (<= main_~pos~0 100000)) [2019-10-07 00:25:18,154 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 149#(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:25:18,155 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 130#(or (and (<= 0 main_~pos~0) (<= 100000 main_~i~0) (<= 1 main_~i~1) (<= main_~pos~0 100000)) (and (<= main_~i~1 0) (<= 0 main_~pos~0) (< main_~pos~0 100000) (<= 100000 main_~i~0) (<= 0 main_~i~1) (not (< main_~i~0 100000)) (= main_~i~1 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~pos~0) |main_~#a~0.offset|)) main_~marker~0) (<= main_~pos~0 100000))) [2019-10-07 00:25:18,155 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 139#(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:25:18,155 INFO L193 IcfgInterpreter]: Reachable states at location L9-4 satisfy 73#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-07 00:25:18,155 INFO L193 IcfgInterpreter]: Reachable states at location L17-1 satisfy 119#(and (<= 0 main_~pos~0) (<= 100000 main_~i~0) (<= 0 main_~i~1) (<= main_~pos~0 100000)) [2019-10-07 00:25:18,155 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:25:18,156 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:25:18,156 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 158#(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:25:18,156 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-07 00:25:18,156 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:25:18,156 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 134#(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:25:19,604 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:25:19,605 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [235, 235, 235, 11] total 479 [2019-10-07 00:25:19,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 479 states [2019-10-07 00:25:19,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 479 interpolants. [2019-10-07 00:25:19,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109775, Invalid=119187, Unknown=0, NotChecked=0, Total=228962 [2019-10-07 00:25:19,619 INFO L87 Difference]: Start difference. First operand 276 states and 277 transitions. Second operand 479 states. [2019-10-07 00:27:34,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:27:34,118 INFO L93 Difference]: Finished difference Result 548 states and 783 transitions. [2019-10-07 00:27:34,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 477 states. [2019-10-07 00:27:34,119 INFO L78 Accepts]: Start accepts. Automaton has 479 states. Word has length 275 [2019-10-07 00:27:34,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:27:34,123 INFO L225 Difference]: With dead ends: 548 [2019-10-07 00:27:34,123 INFO L226 Difference]: Without dead ends: 510 [2019-10-07 00:27:34,139 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 1531 GetRequests, 582 SyntacticMatches, 0 SemanticMatches, 949 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149620 ImplicationChecksByTransitivity, 202.1s TimeCoverageRelationStatistics Valid=328377, Invalid=575073, Unknown=0, NotChecked=0, Total=903450 [2019-10-07 00:27:34,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2019-10-07 00:27:34,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2019-10-07 00:27:34,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2019-10-07 00:27:34,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 511 transitions. [2019-10-07 00:27:34,168 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 511 transitions. Word has length 275 [2019-10-07 00:27:34,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:27:34,169 INFO L462 AbstractCegarLoop]: Abstraction has 510 states and 511 transitions. [2019-10-07 00:27:34,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 479 states. [2019-10-07 00:27:34,169 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 511 transitions. [2019-10-07 00:27:34,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2019-10-07 00:27:34,179 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:27:34,180 INFO L385 BasicCegarLoop]: trace histogram [466, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:27:34,391 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:27:34,392 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:27:34,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:27:34,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1787295115, now seen corresponding path program 11 times [2019-10-07 00:27:34,392 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:27:34,392 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:27:34,392 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:27:34,392 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:27:34,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:27:36,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:28:54,317 INFO L134 CoverageAnalysis]: Checked inductivity of 109051 backedges. 0 proven. 108811 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2019-10-07 00:28:54,318 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:28:54,318 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:28:54,318 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:29:01,720 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-10-07 00:29:01,721 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:29:01,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 116 conjunts are in the unsatisfiable core [2019-10-07 00:29:01,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:30:22,537 INFO L134 CoverageAnalysis]: Checked inductivity of 109051 backedges. 460 proven. 3021 refuted. 0 times theorem prover too weak. 105570 trivial. 0 not checked. [2019-10-07 00:30:22,537 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:30:38,013 INFO L134 CoverageAnalysis]: Checked inductivity of 109051 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 108811 trivial. 0 not checked. [2019-10-07 00:30:38,013 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:30:38,015 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-07 00:30:38,015 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:30:38,015 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:30:38,015 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:30:38,016 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:30:38,033 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:30:38,120 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 00:30:38,131 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:30:38,133 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:30:38,133 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:30:38,133 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 144#(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:30:38,133 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 153#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:30:38,133 INFO L193 IcfgInterpreter]: Reachable states at location L17-4 satisfy 124#(and (<= 0 main_~pos~0) (<= 100000 main_~i~0) (<= 0 main_~i~1) (<= main_~pos~0 100000)) [2019-10-07 00:30:38,134 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 149#(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:30:38,134 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 130#(or (and (<= 0 main_~pos~0) (<= 100000 main_~i~0) (<= 1 main_~i~1) (<= main_~pos~0 100000)) (and (<= main_~i~1 0) (<= 0 main_~pos~0) (< main_~pos~0 100000) (<= 100000 main_~i~0) (<= 0 main_~i~1) (not (< main_~i~0 100000)) (= main_~i~1 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~pos~0) |main_~#a~0.offset|)) main_~marker~0) (<= main_~pos~0 100000))) [2019-10-07 00:30:38,134 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 139#(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:30:38,134 INFO L193 IcfgInterpreter]: Reachable states at location L9-4 satisfy 73#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-07 00:30:38,134 INFO L193 IcfgInterpreter]: Reachable states at location L17-1 satisfy 119#(and (<= 0 main_~pos~0) (<= 100000 main_~i~0) (<= 0 main_~i~1) (<= main_~pos~0 100000)) [2019-10-07 00:30:38,134 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:30:38,135 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:30:38,135 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 158#(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:30:38,135 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-07 00:30:38,135 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:30:38,135 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 134#(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:30:41,522 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:30:41,523 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [469, 43, 35, 11] total 553 [2019-10-07 00:30:41,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 553 states [2019-10-07 00:30:41,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 553 interpolants. [2019-10-07 00:30:41,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113446, Invalid=191810, Unknown=0, NotChecked=0, Total=305256 [2019-10-07 00:30:41,538 INFO L87 Difference]: Start difference. First operand 510 states and 511 transitions. Second operand 553 states. [2019-10-07 00:33:51,022 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-10-07 00:33:53,148 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2019-10-07 00:33:54,205 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2019-10-07 00:33:55,235 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2019-10-07 00:33:56,338 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2019-10-07 00:33:57,389 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2019-10-07 00:33:58,521 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 81 [2019-10-07 00:33:59,627 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 85 [2019-10-07 00:34:00,810 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 86 [2019-10-07 00:34:01,942 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 90 [2019-10-07 00:34:03,185 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 90 [2019-10-07 00:34:04,355 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 94 [2019-10-07 00:34:05,626 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 96 [2019-10-07 00:34:06,865 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 100 [2019-10-07 00:34:08,300 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 101 [2019-10-07 00:34:10,762 WARN L191 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 247 DAG size of output: 106 [2019-10-07 00:34:13,645 WARN L191 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 183 DAG size of output: 175 [2019-10-07 00:34:18,241 WARN L191 SmtUtils]: Spent 2.49 s on a formula simplification. DAG size of input: 200 DAG size of output: 192 [2019-10-07 00:34:21,103 WARN L191 SmtUtils]: Spent 868.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 144 [2019-10-07 00:34:24,940 WARN L191 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 161 DAG size of output: 160 [2019-10-07 00:34:27,629 WARN L191 SmtUtils]: Spent 751.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 136 [2019-10-07 00:34:30,595 WARN L191 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 152 DAG size of output: 151 [2019-10-07 00:34:32,392 WARN L191 SmtUtils]: Spent 649.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 128 [2019-10-07 00:34:35,064 WARN L191 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 143 DAG size of output: 142