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_running-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 00:15:49,322 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 00:15:49,325 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 00:15:49,344 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 00:15:49,344 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 00:15:49,346 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 00:15:49,348 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 00:15:49,355 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 00:15:49,357 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 00:15:49,358 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 00:15:49,360 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 00:15:49,361 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 00:15:49,362 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 00:15:49,363 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 00:15:49,364 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 00:15:49,365 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 00:15:49,366 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 00:15:49,366 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 00:15:49,368 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 00:15:49,370 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 00:15:49,371 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 00:15:49,372 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 00:15:49,373 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 00:15:49,374 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 00:15:49,376 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 00:15:49,377 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 00:15:49,377 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 00:15:49,378 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 00:15:49,379 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 00:15:49,380 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 00:15:49,380 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 00:15:49,381 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 00:15:49,381 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 00:15:49,382 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 00:15:49,383 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 00:15:49,383 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 00:15:49,384 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 00:15:49,384 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 00:15:49,384 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 00:15:49,385 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 00:15:49,386 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 00:15:49,387 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:15:49,401 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 00:15:49,401 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 00:15:49,403 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 00:15:49,403 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 00:15:49,403 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 00:15:49,403 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 00:15:49,403 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 00:15:49,404 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 00:15:49,404 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 00:15:49,404 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 00:15:49,404 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 00:15:49,404 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 00:15:49,405 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 00:15:49,405 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 00:15:49,405 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 00:15:49,405 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 00:15:49,405 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 00:15:49,406 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 00:15:49,406 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 00:15:49,406 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 00:15:49,406 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 00:15:49,406 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:15:49,407 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 00:15:49,407 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 00:15:49,407 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 00:15:49,407 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 00:15:49,407 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 00:15:49,408 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 00:15:49,408 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:15:49,683 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 00:15:49,706 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 00:15:49,710 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 00:15:49,711 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 00:15:49,712 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 00:15:49,713 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_running-2.i [2019-10-07 00:15:49,791 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/616492fc4/2a20ebd4ca48484498f2a20a71bcb949/FLAGa19317665 [2019-10-07 00:15:50,313 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 00:15:50,314 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_running-2.i [2019-10-07 00:15:50,322 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/616492fc4/2a20ebd4ca48484498f2a20a71bcb949/FLAGa19317665 [2019-10-07 00:15:50,676 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/616492fc4/2a20ebd4ca48484498f2a20a71bcb949 [2019-10-07 00:15:50,688 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 00:15:50,689 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 00:15:50,690 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 00:15:50,690 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 00:15:50,694 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 00:15:50,695 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:15:50" (1/1) ... [2019-10-07 00:15:50,698 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cbcfe5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:15:50, skipping insertion in model container [2019-10-07 00:15:50,698 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:15:50" (1/1) ... [2019-10-07 00:15:50,708 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 00:15:50,731 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 00:15:50,988 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:15:50,995 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 00:15:51,019 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:15:51,039 INFO L192 MainTranslator]: Completed translation [2019-10-07 00:15:51,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:15:51 WrapperNode [2019-10-07 00:15:51,040 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 00:15:51,041 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 00:15:51,041 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 00:15:51,041 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 00:15:51,137 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:15:51" (1/1) ... [2019-10-07 00:15:51,137 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:15:51" (1/1) ... [2019-10-07 00:15:51,146 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:15:51" (1/1) ... [2019-10-07 00:15:51,147 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:15:51" (1/1) ... [2019-10-07 00:15:51,155 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:15:51" (1/1) ... [2019-10-07 00:15:51,162 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:15:51" (1/1) ... [2019-10-07 00:15:51,163 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:15:51" (1/1) ... [2019-10-07 00:15:51,166 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 00:15:51,167 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 00:15:51,167 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 00:15:51,167 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 00:15:51,168 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:15:51" (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:15:51,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 00:15:51,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 00:15:51,232 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-07 00:15:51,232 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 00:15:51,232 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 00:15:51,232 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-07 00:15:51,232 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 00:15:51,232 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 00:15:51,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 00:15:51,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 00:15:51,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 00:15:51,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 00:15:51,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 00:15:51,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 00:15:51,789 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 00:15:51,789 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-07 00:15:51,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:15:51 BoogieIcfgContainer [2019-10-07 00:15:51,791 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 00:15:51,793 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 00:15:51,794 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 00:15:51,797 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 00:15:51,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 12:15:50" (1/3) ... [2019-10-07 00:15:51,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d7c61c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:15:51, skipping insertion in model container [2019-10-07 00:15:51,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:15:51" (2/3) ... [2019-10-07 00:15:51,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d7c61c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:15:51, skipping insertion in model container [2019-10-07 00:15:51,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:15:51" (3/3) ... [2019-10-07 00:15:51,801 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_running-2.i [2019-10-07 00:15:51,811 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 00:15:51,818 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 00:15:51,829 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 00:15:51,855 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 00:15:51,855 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 00:15:51,855 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 00:15:51,855 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 00:15:51,856 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 00:15:51,856 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 00:15:51,856 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 00:15:51,856 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 00:15:51,871 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-10-07 00:15:51,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-07 00:15:51,877 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:15:51,878 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:15:51,879 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:15:51,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:15:51,884 INFO L82 PathProgramCache]: Analyzing trace with hash 945226407, now seen corresponding path program 1 times [2019-10-07 00:15:51,891 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:15:51,891 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:15:51,891 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:15:51,892 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:15:51,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:15:51,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:15:52,045 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:15:52,046 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:15:52,047 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:15:52,047 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:15:52,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:15:52,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:15:52,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:15:52,064 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2019-10-07 00:15:52,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:15:52,137 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2019-10-07 00:15:52,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:15:52,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-07 00:15:52,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:15:52,151 INFO L225 Difference]: With dead ends: 35 [2019-10-07 00:15:52,151 INFO L226 Difference]: Without dead ends: 16 [2019-10-07 00:15:52,157 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:15:52,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-10-07 00:15:52,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-10-07 00:15:52,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-10-07 00:15:52,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2019-10-07 00:15:52,208 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 12 [2019-10-07 00:15:52,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:15:52,210 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-10-07 00:15:52,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:15:52,210 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2019-10-07 00:15:52,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-07 00:15:52,211 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:15:52,212 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:15:52,212 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:15:52,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:15:52,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1772269372, now seen corresponding path program 1 times [2019-10-07 00:15:52,214 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:15:52,214 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:15:52,215 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:15:52,215 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:15:52,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:15:52,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:15:52,337 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:15:52,338 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:15:52,338 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:15:52,338 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:15:52,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:15:52,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 00:15:52,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:15:52,464 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:15:52,464 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:15:52,498 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:15:52,499 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:15:52,521 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:15:52,521 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:15:52,528 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:15:52,537 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:15:52,538 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:15:52,734 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:15:53,542 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 00:15:53,556 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:15:53,563 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:15:53,563 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:15:53,563 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 209#(and (<= 0 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:15:53,564 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 214#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:15:53,564 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 223#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:15:53,564 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 135#(<= 0 main_~i~0) [2019-10-07 00:15:53,564 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:15:53,565 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:15:53,565 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 228#(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:15:53,565 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 219#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:15:53,565 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:15:53,566 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 68#true [2019-10-07 00:15:53,566 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 204#(and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-07 00:15:53,566 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 199#(and (<= 0 main_~i~0) (<= main_~f~0 1) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= 0 main_~f~0)) [2019-10-07 00:15:53,566 INFO L193 IcfgInterpreter]: Reachable states at location L23-2 satisfy 194#(or (and (<= 0 main_~i~0) (<= main_~f~0 1) (<= 0 main_~f~0)) (and (<= 0 main_~i~0) (<= main_~f~0 1) (= main_~f~0 1) (<= main_~i~0 0) (= main_~i~0 0) (<= 1 main_~f~0))) [2019-10-07 00:15:53,798 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:15:53,798 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 9] total 15 [2019-10-07 00:15:53,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-07 00:15:53,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-07 00:15:53,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2019-10-07 00:15:53,802 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 15 states. [2019-10-07 00:15:54,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:15:54,496 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2019-10-07 00:15:54,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-07 00:15:54,497 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-10-07 00:15:54,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:15:54,498 INFO L225 Difference]: With dead ends: 34 [2019-10-07 00:15:54,498 INFO L226 Difference]: Without dead ends: 25 [2019-10-07 00:15:54,500 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=196, Invalid=674, Unknown=0, NotChecked=0, Total=870 [2019-10-07 00:15:54,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-07 00:15:54,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-10-07 00:15:54,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-07 00:15:54,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2019-10-07 00:15:54,508 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 15 [2019-10-07 00:15:54,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:15:54,508 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-10-07 00:15:54,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-07 00:15:54,508 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2019-10-07 00:15:54,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-07 00:15:54,509 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:15:54,509 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:15:54,713 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:15:54,716 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:15:54,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:15:54,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1883799143, now seen corresponding path program 2 times [2019-10-07 00:15:54,717 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:15:54,717 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:15:54,717 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:15:54,717 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:15:54,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:15:54,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:15:54,829 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-07 00:15:54,829 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:15:54,829 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:15:54,829 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:15:54,907 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-07 00:15:54,907 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:15:54,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-07 00:15:54,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:15:54,928 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-07 00:15:54,929 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:15:54,991 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-07 00:15:54,991 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:15:54,992 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:15:54,992 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:15:54,993 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:15:54,993 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:15:54,993 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:15:55,030 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:15:55,781 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 00:15:55,798 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:15:55,811 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:15:55,811 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:15:55,812 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 210#(and (<= 0 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:15:55,812 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 215#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:15:55,812 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 224#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:15:55,812 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 135#(<= 0 main_~i~0) [2019-10-07 00:15:55,813 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:15:55,813 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:15:55,813 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 229#(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:15:55,813 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 220#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:15:55,814 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:15:55,814 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 68#true [2019-10-07 00:15:55,814 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 205#(and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-07 00:15:55,814 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 200#(and (<= 0 main_~i~0) (<= main_~f~0 1) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= 0 main_~f~0)) [2019-10-07 00:15:55,814 INFO L193 IcfgInterpreter]: Reachable states at location L23-2 satisfy 195#(or (and (<= 0 main_~i~0) (<= main_~f~0 1) (<= 0 main_~f~0)) (and (<= 0 main_~i~0) (<= main_~f~0 1) (= main_~f~0 1) (<= main_~i~0 0) (= main_~i~0 0) (<= 1 main_~f~0))) [2019-10-07 00:15:56,094 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:15:56,094 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 11] total 23 [2019-10-07 00:15:56,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-07 00:15:56,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-07 00:15:56,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2019-10-07 00:15:56,096 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 23 states. [2019-10-07 00:15:57,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:15:57,154 INFO L93 Difference]: Finished difference Result 58 states and 79 transitions. [2019-10-07 00:15:57,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-07 00:15:57,155 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 24 [2019-10-07 00:15:57,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:15:57,156 INFO L225 Difference]: With dead ends: 58 [2019-10-07 00:15:57,156 INFO L226 Difference]: Without dead ends: 43 [2019-10-07 00:15:57,159 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=539, Invalid=1911, Unknown=0, NotChecked=0, Total=2450 [2019-10-07 00:15:57,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-07 00:15:57,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-10-07 00:15:57,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-07 00:15:57,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2019-10-07 00:15:57,170 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 24 [2019-10-07 00:15:57,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:15:57,171 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2019-10-07 00:15:57,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-07 00:15:57,171 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2019-10-07 00:15:57,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-07 00:15:57,173 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:15:57,173 INFO L385 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:15:57,385 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:15:57,386 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:15:57,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:15:57,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1126640647, now seen corresponding path program 3 times [2019-10-07 00:15:57,387 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:15:57,387 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:15:57,387 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:15:57,387 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:15:57,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:15:57,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:15:57,681 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-10-07 00:15:57,681 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:15:57,682 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:15:57,682 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:15:57,803 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 00:15:57,803 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:15:57,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-07 00:15:57,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:15:57,830 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-10-07 00:15:57,830 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:15:58,063 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-10-07 00:15:58,065 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:15:58,067 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:15:58,067 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:15:58,068 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:15:58,068 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:15:58,068 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:15:58,099 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:15:58,557 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 00:15:58,565 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:15:58,569 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:15:58,570 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:15:58,570 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 210#(and (<= 0 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:15:58,570 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 215#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:15:58,570 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 224#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:15:58,571 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 135#(<= 0 main_~i~0) [2019-10-07 00:15:58,571 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:15:58,571 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:15:58,571 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 229#(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:15:58,572 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 220#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:15:58,572 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:15:58,572 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 68#true [2019-10-07 00:15:58,572 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 205#(and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-07 00:15:58,573 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 200#(and (<= 0 main_~i~0) (<= main_~f~0 1) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= 0 main_~f~0)) [2019-10-07 00:15:58,573 INFO L193 IcfgInterpreter]: Reachable states at location L23-2 satisfy 195#(or (and (<= 0 main_~i~0) (<= main_~f~0 1) (<= 0 main_~f~0)) (and (<= 0 main_~i~0) (<= main_~f~0 1) (= main_~f~0 1) (<= main_~i~0 0) (= main_~i~0 0) (<= 1 main_~f~0))) [2019-10-07 00:15:58,846 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:15:58,846 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 11] total 35 [2019-10-07 00:15:58,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-07 00:15:58,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-07 00:15:58,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=860, Unknown=0, NotChecked=0, Total=1190 [2019-10-07 00:15:58,850 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 35 states. [2019-10-07 00:16:01,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:16:01,216 INFO L93 Difference]: Finished difference Result 106 states and 145 transitions. [2019-10-07 00:16:01,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-10-07 00:16:01,222 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 42 [2019-10-07 00:16:01,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:16:01,223 INFO L225 Difference]: With dead ends: 106 [2019-10-07 00:16:01,223 INFO L226 Difference]: Without dead ends: 79 [2019-10-07 00:16:01,226 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1965 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1871, Invalid=5439, Unknown=0, NotChecked=0, Total=7310 [2019-10-07 00:16:01,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-10-07 00:16:01,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-10-07 00:16:01,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-10-07 00:16:01,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2019-10-07 00:16:01,240 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 42 [2019-10-07 00:16:01,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:16:01,241 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2019-10-07 00:16:01,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-07 00:16:01,241 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2019-10-07 00:16:01,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-07 00:16:01,244 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:16:01,244 INFO L385 BasicCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:16:01,447 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:16:01,448 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:16:01,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:16:01,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1289318585, now seen corresponding path program 4 times [2019-10-07 00:16:01,448 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:16:01,448 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:16:01,449 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:16:01,449 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:16:01,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:16:01,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:16:02,057 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2019-10-07 00:16:02,057 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:16:02,057 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:16:02,057 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:16:02,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:16:02,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-07 00:16:02,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:16:02,242 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2019-10-07 00:16:02,243 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:16:03,004 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2019-10-07 00:16:03,005 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:16:03,007 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:16:03,007 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:16:03,007 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:16:03,008 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:16:03,008 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:16:03,031 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:16:03,530 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 00:16:03,541 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:16:03,546 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:16:03,546 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:16:03,546 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 209#(and (<= 0 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:16:03,547 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 214#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:16:03,547 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 223#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:16:03,547 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 135#(<= 0 main_~i~0) [2019-10-07 00:16:03,547 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:16:03,547 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:16:03,548 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 228#(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:16:03,548 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 219#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:16:03,548 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:16:03,548 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 68#true [2019-10-07 00:16:03,548 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 204#(and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-07 00:16:03,549 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 199#(and (<= 0 main_~i~0) (<= main_~f~0 1) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= 0 main_~f~0)) [2019-10-07 00:16:03,549 INFO L193 IcfgInterpreter]: Reachable states at location L23-2 satisfy 194#(or (and (<= 0 main_~i~0) (<= main_~f~0 1) (<= 0 main_~f~0)) (and (<= 0 main_~i~0) (<= main_~f~0 1) (= main_~f~0 1) (<= main_~i~0 0) (= main_~i~0 0) (<= 1 main_~f~0))) [2019-10-07 00:16:03,950 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:16:03,951 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25, 11] total 59 [2019-10-07 00:16:03,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-10-07 00:16:03,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-10-07 00:16:03,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1206, Invalid=2216, Unknown=0, NotChecked=0, Total=3422 [2019-10-07 00:16:03,956 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand 59 states. [2019-10-07 00:16:10,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:16:10,185 INFO L93 Difference]: Finished difference Result 202 states and 277 transitions. [2019-10-07 00:16:10,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-10-07 00:16:10,186 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 78 [2019-10-07 00:16:10,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:16:10,189 INFO L225 Difference]: With dead ends: 202 [2019-10-07 00:16:10,189 INFO L226 Difference]: Without dead ends: 151 [2019-10-07 00:16:10,196 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6549 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=7127, Invalid=17679, Unknown=0, NotChecked=0, Total=24806 [2019-10-07 00:16:10,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-10-07 00:16:10,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2019-10-07 00:16:10,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-10-07 00:16:10,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 153 transitions. [2019-10-07 00:16:10,232 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 153 transitions. Word has length 78 [2019-10-07 00:16:10,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:16:10,233 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 153 transitions. [2019-10-07 00:16:10,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-10-07 00:16:10,233 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 153 transitions. [2019-10-07 00:16:10,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-07 00:16:10,244 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:16:10,244 INFO L385 BasicCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:16:10,450 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:16:10,451 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:16:10,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:16:10,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1805290041, now seen corresponding path program 5 times [2019-10-07 00:16:10,452 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:16:10,452 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:16:10,452 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:16:10,453 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:16:10,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:16:10,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:16:11,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3243 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 2162 trivial. 0 not checked. [2019-10-07 00:16:11,941 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:16:11,941 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:16:11,941 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:25:47,520 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-10-07 00:25:47,520 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:25:47,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 934 conjuncts, 48 conjunts are in the unsatisfiable core [2019-10-07 00:25:47,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:25:47,605 INFO L134 CoverageAnalysis]: Checked inductivity of 3243 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 2162 trivial. 0 not checked. [2019-10-07 00:25:47,606 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:25:50,136 INFO L134 CoverageAnalysis]: Checked inductivity of 3243 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 2162 trivial. 0 not checked. [2019-10-07 00:25:50,136 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:25:50,138 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:25:50,138 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:25:50,138 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:25:50,138 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:25:50,139 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:25:50,171 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:25:50,543 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 00:25:50,549 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:25:50,551 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:25:50,552 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:25:50,552 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 210#(and (<= 0 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:25:50,552 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 215#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:25:50,552 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 224#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:25:50,552 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 135#(<= 0 main_~i~0) [2019-10-07 00:25:50,553 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:50,553 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:25:50,553 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 229#(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:50,553 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 220#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:25:50,554 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:25:50,554 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 68#true [2019-10-07 00:25:50,554 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 205#(and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-07 00:25:50,554 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 200#(and (<= 0 main_~i~0) (<= main_~f~0 1) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= 0 main_~f~0)) [2019-10-07 00:25:50,554 INFO L193 IcfgInterpreter]: Reachable states at location L23-2 satisfy 195#(or (and (<= 0 main_~i~0) (<= main_~f~0 1) (<= 0 main_~f~0)) (and (<= 0 main_~i~0) (<= main_~f~0 1) (= main_~f~0 1) (<= main_~i~0 0) (= main_~i~0 0) (<= 1 main_~f~0))) [2019-10-07 00:25:50,957 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:25:50,957 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49, 11] total 107 [2019-10-07 00:25:50,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-10-07 00:25:50,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-10-07 00:25:50,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4686, Invalid=6656, Unknown=0, NotChecked=0, Total=11342 [2019-10-07 00:25:50,963 INFO L87 Difference]: Start difference. First operand 151 states and 153 transitions. Second operand 107 states. [2019-10-07 00:26:08,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:26:08,467 INFO L93 Difference]: Finished difference Result 394 states and 541 transitions. [2019-10-07 00:26:08,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2019-10-07 00:26:08,467 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 150 [2019-10-07 00:26:08,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:26:08,471 INFO L225 Difference]: With dead ends: 394 [2019-10-07 00:26:08,471 INFO L226 Difference]: Without dead ends: 295 [2019-10-07 00:26:08,485 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 693 GetRequests, 393 SyntacticMatches, 0 SemanticMatches, 300 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23493 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=28007, Invalid=62895, Unknown=0, NotChecked=0, Total=90902 [2019-10-07 00:26:08,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-10-07 00:26:08,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2019-10-07 00:26:08,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-10-07 00:26:08,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 297 transitions. [2019-10-07 00:26:08,519 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 297 transitions. Word has length 150 [2019-10-07 00:26:08,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:26:08,520 INFO L462 AbstractCegarLoop]: Abstraction has 295 states and 297 transitions. [2019-10-07 00:26:08,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-10-07 00:26:08,520 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 297 transitions. [2019-10-07 00:26:08,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-10-07 00:26:08,525 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:26:08,525 INFO L385 BasicCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:26:08,737 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:26:08,738 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:26:08,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:26:08,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1235468999, now seen corresponding path program 6 times [2019-10-07 00:26:08,739 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:26:08,739 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:26:08,740 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:26:08,740 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:26:08,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:26:11,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:26:14,612 INFO L134 CoverageAnalysis]: Checked inductivity of 13395 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 8930 trivial. 0 not checked. [2019-10-07 00:26:14,612 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:26:14,612 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:26:14,612 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:26:15,062 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 00:26:15,063 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:26:15,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 1846 conjuncts, 96 conjunts are in the unsatisfiable core [2019-10-07 00:26:15,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:26:15,209 INFO L134 CoverageAnalysis]: Checked inductivity of 13395 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 8930 trivial. 0 not checked. [2019-10-07 00:26:15,209 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:26:25,621 INFO L134 CoverageAnalysis]: Checked inductivity of 13395 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 8930 trivial. 0 not checked. [2019-10-07 00:26:25,621 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:26:25,622 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:26:25,622 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:26:25,623 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:26:25,623 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:26:25,623 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:26:25,645 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:26:26,012 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 00:26:26,018 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:26:26,020 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:26:26,021 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:26:26,021 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 210#(and (<= 0 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:26:26,021 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 215#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:26:26,021 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 224#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:26:26,021 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 135#(<= 0 main_~i~0) [2019-10-07 00:26:26,022 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:26:26,022 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:26:26,022 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 229#(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:26:26,022 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 220#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:26:26,023 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:26:26,023 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 68#true [2019-10-07 00:26:26,023 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 205#(and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-07 00:26:26,023 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 200#(and (<= 0 main_~i~0) (<= main_~f~0 1) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= 0 main_~f~0)) [2019-10-07 00:26:26,023 INFO L193 IcfgInterpreter]: Reachable states at location L23-2 satisfy 195#(or (and (<= 0 main_~i~0) (<= main_~f~0 1) (<= 0 main_~f~0)) (and (<= 0 main_~i~0) (<= main_~f~0 1) (= main_~f~0 1) (<= main_~i~0 0) (= main_~i~0 0) (<= 1 main_~f~0))) [2019-10-07 00:26:26,665 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:26:26,665 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97, 11] total 203 [2019-10-07 00:26:26,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 203 states [2019-10-07 00:26:26,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 203 interpolants. [2019-10-07 00:26:26,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18558, Invalid=22448, Unknown=0, NotChecked=0, Total=41006 [2019-10-07 00:26:26,672 INFO L87 Difference]: Start difference. First operand 295 states and 297 transitions. Second operand 203 states. [2019-10-07 00:27:35,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:27:35,245 INFO L93 Difference]: Finished difference Result 778 states and 1069 transitions. [2019-10-07 00:27:35,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 392 states. [2019-10-07 00:27:35,246 INFO L78 Accepts]: Start accepts. Automaton has 203 states. Word has length 294 [2019-10-07 00:27:35,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:27:35,251 INFO L225 Difference]: With dead ends: 778 [2019-10-07 00:27:35,251 INFO L226 Difference]: Without dead ends: 583 [2019-10-07 00:27:35,260 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 1365 GetRequests, 777 SyntacticMatches, 0 SemanticMatches, 588 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88485 ImplicationChecksByTransitivity, 62.5s TimeCoverageRelationStatistics Valid=111239, Invalid=236271, Unknown=0, NotChecked=0, Total=347510 [2019-10-07 00:27:35,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-10-07 00:27:35,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2019-10-07 00:27:35,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-10-07 00:27:35,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 585 transitions. [2019-10-07 00:27:35,308 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 585 transitions. Word has length 294 [2019-10-07 00:27:35,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:27:35,308 INFO L462 AbstractCegarLoop]: Abstraction has 583 states and 585 transitions. [2019-10-07 00:27:35,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 203 states. [2019-10-07 00:27:35,308 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 585 transitions. [2019-10-07 00:27:35,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 583 [2019-10-07 00:27:35,321 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:27:35,321 INFO L385 BasicCegarLoop]: trace histogram [190, 190, 190, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:27:35,528 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:27:35,529 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:27:35,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:27:35,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1390256953, now seen corresponding path program 7 times [2019-10-07 00:27:35,529 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:27:35,529 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:27:35,530 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:27:35,530 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:27:35,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:27:39,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:27:52,697 INFO L134 CoverageAnalysis]: Checked inductivity of 54435 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 36290 trivial. 0 not checked. [2019-10-07 00:27:52,697 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:27:52,697 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:27:52,697 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:27:53,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:27:53,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 3670 conjuncts, 192 conjunts are in the unsatisfiable core [2019-10-07 00:27:53,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:27:53,982 INFO L134 CoverageAnalysis]: Checked inductivity of 54435 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 36290 trivial. 0 not checked. [2019-10-07 00:27:53,983 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:28:33,700 INFO L134 CoverageAnalysis]: Checked inductivity of 54435 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 36290 trivial. 0 not checked. [2019-10-07 00:28:33,700 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:28:33,702 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:28:33,702 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:28:33,702 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:28:33,702 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:28:33,703 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:28:33,724 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:28:34,124 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 00:28:34,129 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:28:34,132 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:28:34,132 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:28:34,133 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 213#(and (<= 0 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:28:34,133 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 218#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:28:34,133 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 227#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:28:34,133 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 135#(<= 0 main_~i~0) [2019-10-07 00:28:34,133 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:28:34,134 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:28:34,134 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 232#(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:28:34,134 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 223#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:28:34,134 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:28:34,134 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 68#true [2019-10-07 00:28:34,135 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 208#(and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-07 00:28:34,135 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 203#(and (<= 0 main_~i~0) (<= main_~f~0 1) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= 0 main_~f~0)) [2019-10-07 00:28:34,135 INFO L193 IcfgInterpreter]: Reachable states at location L23-2 satisfy 198#(or (and (<= 0 main_~i~0) (<= main_~f~0 1) (<= 0 main_~f~0)) (and (<= 0 main_~i~0) (<= main_~f~0 1) (= main_~f~0 1) (<= main_~i~0 0) (= main_~i~0 0) (<= 1 main_~f~0))) [2019-10-07 00:28:35,458 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:28:35,458 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [193, 193, 193, 11] total 395 [2019-10-07 00:28:35,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 395 states [2019-10-07 00:28:35,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 395 interpolants. [2019-10-07 00:28:35,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73950, Invalid=81680, Unknown=0, NotChecked=0, Total=155630 [2019-10-07 00:28:35,472 INFO L87 Difference]: Start difference. First operand 583 states and 585 transitions. Second operand 395 states.