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-industry-pattern/array_ptr_single_elem_init-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:37:11,542 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:37:11,545 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:37:11,564 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:37:11,564 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:37:11,566 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:37:11,568 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:37:11,577 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:37:11,581 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:37:11,584 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:37:11,585 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:37:11,588 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:37:11,588 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:37:11,590 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:37:11,593 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:37:11,595 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:37:11,597 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:37:11,598 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:37:11,601 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:37:11,606 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:37:11,611 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:37:11,612 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:37:11,615 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:37:11,616 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:37:11,620 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:37:11,620 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:37:11,620 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:37:11,622 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:37:11,624 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:37:11,625 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:37:11,625 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:37:11,628 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:37:11,629 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:37:11,629 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:37:11,631 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:37:11,631 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:37:11,632 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:37:11,632 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:37:11,633 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:37:11,635 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:37:11,637 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:37:11,637 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:37:11,660 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:37:11,661 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:37:11,662 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:37:11,662 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:37:11,662 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:37:11,663 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:37:11,663 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:37:11,666 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:37:11,666 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:37:11,667 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:37:11,667 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:37:11,667 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:37:11,667 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:37:11,668 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:37:11,668 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:37:11,668 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:37:11,670 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:37:11,670 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:37:11,670 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:37:11,670 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:37:11,671 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:37:11,671 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:37:11,671 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:37:11,671 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:37:11,672 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:37:11,672 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:37:11,672 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:37:11,672 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:37:11,672 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-13 21:37:11,981 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:37:12,001 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:37:12,006 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:37:12,008 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:37:12,008 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:37:12,009 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-industry-pattern/array_ptr_single_elem_init-2.i [2019-10-13 21:37:12,083 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/759af00b8/16e0caed156a410db097ce26c0d89a81/FLAG940807d23 [2019-10-13 21:37:12,585 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:37:12,588 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-industry-pattern/array_ptr_single_elem_init-2.i [2019-10-13 21:37:12,595 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/759af00b8/16e0caed156a410db097ce26c0d89a81/FLAG940807d23 [2019-10-13 21:37:12,931 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/759af00b8/16e0caed156a410db097ce26c0d89a81 [2019-10-13 21:37:12,942 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:37:12,944 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:37:12,945 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:37:12,945 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:37:12,949 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:37:12,950 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:37:12" (1/1) ... [2019-10-13 21:37:12,954 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59674e76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:37:12, skipping insertion in model container [2019-10-13 21:37:12,954 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:37:12" (1/1) ... [2019-10-13 21:37:12,962 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:37:12,979 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:37:13,183 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:37:13,195 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:37:13,223 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:37:13,243 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:37:13,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:37:13 WrapperNode [2019-10-13 21:37:13,244 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:37:13,245 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:37:13,245 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:37:13,245 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:37:13,344 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:37:13" (1/1) ... [2019-10-13 21:37:13,344 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:37:13" (1/1) ... [2019-10-13 21:37:13,352 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:37:13" (1/1) ... [2019-10-13 21:37:13,354 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:37:13" (1/1) ... [2019-10-13 21:37:13,372 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:37:13" (1/1) ... [2019-10-13 21:37:13,377 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:37:13" (1/1) ... [2019-10-13 21:37:13,378 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:37:13" (1/1) ... [2019-10-13 21:37:13,381 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:37:13,381 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:37:13,381 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:37:13,381 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:37:13,382 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:37:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:37:13,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:37:13,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:37:13,436 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 21:37:13,436 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:37:13,436 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:37:13,437 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:37:13,437 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:37:13,437 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:37:13,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:37:13,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:37:13,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:37:13,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:37:13,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:37:13,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:37:13,863 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:37:13,863 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-13 21:37:13,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:37:13 BoogieIcfgContainer [2019-10-13 21:37:13,864 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:37:13,866 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:37:13,866 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:37:13,869 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:37:13,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:37:12" (1/3) ... [2019-10-13 21:37:13,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2433cac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:37:13, skipping insertion in model container [2019-10-13 21:37:13,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:37:13" (2/3) ... [2019-10-13 21:37:13,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2433cac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:37:13, skipping insertion in model container [2019-10-13 21:37:13,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:37:13" (3/3) ... [2019-10-13 21:37:13,872 INFO L109 eAbstractionObserver]: Analyzing ICFG array_ptr_single_elem_init-2.i [2019-10-13 21:37:13,883 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:37:13,890 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:37:13,901 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:37:13,925 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:37:13,926 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:37:13,926 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:37:13,926 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:37:13,926 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:37:13,926 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:37:13,926 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:37:13,926 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:37:13,940 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-10-13 21:37:13,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-13 21:37:13,946 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:37:13,947 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:37:13,949 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:37:13,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:37:13,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1264123479, now seen corresponding path program 1 times [2019-10-13 21:37:13,963 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:37:13,964 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486739869] [2019-10-13 21:37:13,964 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:37:13,964 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:37:13,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:37:14,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:37:14,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:37:14,132 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486739869] [2019-10-13 21:37:14,133 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:37:14,134 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:37:14,134 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646362957] [2019-10-13 21:37:14,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:37:14,139 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:37:14,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:37:14,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:37:14,156 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2019-10-13 21:37:14,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:37:14,233 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2019-10-13 21:37:14,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:37:14,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-13 21:37:14,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:37:14,246 INFO L225 Difference]: With dead ends: 38 [2019-10-13 21:37:14,247 INFO L226 Difference]: Without dead ends: 21 [2019-10-13 21:37:14,252 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:37:14,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-13 21:37:14,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-10-13 21:37:14,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-13 21:37:14,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2019-10-13 21:37:14,299 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 12 [2019-10-13 21:37:14,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:37:14,299 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-10-13 21:37:14,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:37:14,300 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2019-10-13 21:37:14,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-13 21:37:14,300 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:37:14,301 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:37:14,301 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:37:14,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:37:14,301 INFO L82 PathProgramCache]: Analyzing trace with hash -392956526, now seen corresponding path program 1 times [2019-10-13 21:37:14,302 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:37:14,302 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530624] [2019-10-13 21:37:14,302 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:37:14,302 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:37:14,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:37:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:37:14,402 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:37:14,404 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530624] [2019-10-13 21:37:14,404 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948003152] [2019-10-13 21:37:14,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:37:14,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:37:14,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:37:14,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:37:14,533 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:37:14,534 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:37:14,572 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:37:14,573 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1921759462] [2019-10-13 21:37:14,599 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-13 21:37:14,599 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:37:14,606 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:37:14,615 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:37:14,616 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:37:14,811 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:37:14,895 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:14,916 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:15,037 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:15,244 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:15,309 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:15,328 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:15,350 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:15,372 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:15,392 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:15,412 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:15,517 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 144 [2019-10-13 21:37:15,533 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:15,551 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:15,634 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:15,647 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:15,670 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:15,693 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:15,787 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:15,927 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:16,180 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:16,189 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:16,218 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:16,262 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:16,304 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:16,363 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:16,899 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 28 for LOIs [2019-10-13 21:37:16,920 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:37:16,929 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:37:16,929 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:37:16,930 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 190#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_1| Int) (v_prenex_8 Int)) (or (and (= |#NULL.base| 0) (not (= 1 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 60000))) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 1 (select (select |#memory_int| v_prenex_8) 60000)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:37:16,931 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 195#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_1| Int) (v_prenex_8 Int)) (or (and (= |#NULL.base| 0) (not (= 1 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 60000))) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 1 (select (select |#memory_int| v_prenex_8) 60000)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:37:16,931 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 204#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:37:16,931 INFO L193 IcfgInterpreter]: Reachable states at location L34 satisfy 171#(and (or (and (= |#NULL.base| 0) (<= 0 main_~i~0) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) (and (= |#NULL.base| 0) (< main_~i~0 100000) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0))) (or (and (<= 0 main_~i~0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#b~0.offset|) (<= main_~i~0 100000) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (<= 1 main_~i~0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#b~0.offset|) (<= main_~i~0 100000) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-13 21:37:16,932 INFO L193 IcfgInterpreter]: Reachable states at location L36 satisfy 176#(and (= |#NULL.base| 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~i~0 4) |main_~#a~0.offset|)) |main_#t~mem5|) (< main_~i~0 100000) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (= main_~i~0 15000) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 15000 main_~i~0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~i~0) (<= 0 |main_~#b~0.offset|) (= |main_~#b~0.offset| 0) (<= main_~i~0 15000) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-13 21:37:16,932 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:37:16,932 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:37:16,933 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 209#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:37:16,941 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:37:16,942 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 89#(and (or (and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |main_~#b~0.offset| 0) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) (and (< |main_~#a~0.base| |#StackHeapBarrier|) (= (store (store |old(#length)| |main_~#a~0.base| 400000) |main_~#b~0.base| 400000) |#length|) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= |main_~#b~0.offset| 0) (= |#valid| (store (store |old(#valid)| |main_~#a~0.base| 1) |main_~#b~0.base| 1)) (not (= |main_~#b~0.base| 0)) (not (= 0 |main_~#a~0.base|)) (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |main_~#b~0.offset| 0) (= |main_~#a~0.offset| 0) (< |main_~#b~0.base| |#StackHeapBarrier|) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (= (select (store |old(#valid)| |main_~#a~0.base| 1) |main_~#b~0.base|) 0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~i~0 0))) (<= |#NULL.base| 0) (<= 0 |main_~#b~0.offset|) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:37:16,942 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 153#(or (and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 60000))) (<= main_~i~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#b~0.offset|) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0)) (and (= |#NULL.base| 0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~i~0) (<= 0 |main_~#b~0.offset|) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0))) [2019-10-13 21:37:16,943 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 200#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_1| Int) (v_prenex_8 Int)) (or (and (= |#NULL.base| 0) (not (= 1 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 60000))) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 1 (select (select |#memory_int| v_prenex_8) 60000)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:37:16,946 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 185#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| Int) (v_prenex_8 Int)) (or (and (= |#NULL.base| 0) (not (= 1 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 60000))) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 1 (select (select |#memory_int| v_prenex_8) 60000)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-13 21:37:16,946 INFO L193 IcfgInterpreter]: Reachable states at location L32-2 satisfy 148#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#b~0.offset|) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-13 21:37:17,361 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 24 [2019-10-13 21:37:17,637 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:37:17,637 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 18 [2019-10-13 21:37:17,637 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204604822] [2019-10-13 21:37:17,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-13 21:37:17,641 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:37:17,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-13 21:37:17,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:37:17,644 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 18 states. [2019-10-13 21:37:18,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:37:18,720 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2019-10-13 21:37:18,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-13 21:37:18,720 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 16 [2019-10-13 21:37:18,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:37:18,722 INFO L225 Difference]: With dead ends: 44 [2019-10-13 21:37:18,722 INFO L226 Difference]: Without dead ends: 31 [2019-10-13 21:37:18,723 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=166, Invalid=646, Unknown=0, NotChecked=0, Total=812 [2019-10-13 21:37:18,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-13 21:37:18,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2019-10-13 21:37:18,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-13 21:37:18,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-10-13 21:37:18,737 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 16 [2019-10-13 21:37:18,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:37:18,738 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-10-13 21:37:18,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-13 21:37:18,738 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-10-13 21:37:18,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 21:37:18,739 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:37:18,740 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:37:18,940 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:37:18,941 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:37:18,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:37:18,942 INFO L82 PathProgramCache]: Analyzing trace with hash -127994615, now seen corresponding path program 2 times [2019-10-13 21:37:18,942 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:37:18,943 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856541942] [2019-10-13 21:37:18,943 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:37:18,943 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:37:18,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:37:19,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:37:19,103 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 21:37:19,103 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856541942] [2019-10-13 21:37:19,103 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722699449] [2019-10-13 21:37:19,103 INFO L92 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-13 21:37:19,168 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-13 21:37:19,169 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:37:19,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-13 21:37:19,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:37:19,198 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-13 21:37:19,198 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:37:19,249 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-13 21:37:19,249 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1509569234] [2019-10-13 21:37:19,251 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-13 21:37:19,251 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:37:19,252 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:37:19,252 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:37:19,253 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:37:19,290 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:37:19,333 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:19,369 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:19,378 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:19,491 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:19,511 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:19,548 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:19,561 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:19,576 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:19,593 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:19,606 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:19,691 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:19,705 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:19,740 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:19,781 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:19,812 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:19,826 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:19,875 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:19,942 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:20,174 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:20,183 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:20,211 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:20,240 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:20,266 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:20,468 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:20,717 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 28 for LOIs [2019-10-13 21:37:20,726 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:37:20,730 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:37:20,731 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:37:20,731 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 189#(and (exists ((v_prenex_16 Int) (|v_main_~#a~0.base_BEFORE_CALL_2| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (= (select (select |#memory_int| v_prenex_16) 60000) 1) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 60000) 1)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:37:20,731 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 194#(and (exists ((v_prenex_16 Int) (|v_main_~#a~0.base_BEFORE_CALL_2| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (= (select (select |#memory_int| v_prenex_16) 60000) 1) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 60000) 1)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:37:20,731 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 203#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:37:20,732 INFO L193 IcfgInterpreter]: Reachable states at location L34 satisfy 170#(and (or (and (= |#NULL.base| 0) (<= 0 main_~i~0) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) (and (= |#NULL.base| 0) (< main_~i~0 100000) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0))) (or (and (<= 0 main_~i~0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#b~0.offset|) (<= main_~i~0 100000) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (<= 1 main_~i~0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#b~0.offset|) (<= main_~i~0 100000) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-13 21:37:20,732 INFO L193 IcfgInterpreter]: Reachable states at location L36 satisfy 175#(and (= |#NULL.base| 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~i~0 4) |main_~#a~0.offset|)) |main_#t~mem5|) (< main_~i~0 100000) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (= main_~i~0 15000) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 15000 main_~i~0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~i~0) (<= 0 |main_~#b~0.offset|) (= |main_~#b~0.offset| 0) (<= main_~i~0 15000) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-13 21:37:20,733 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:37:20,733 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:37:20,733 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 208#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:37:20,733 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:37:20,733 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 88#(and (or (and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |main_~#b~0.offset| 0) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) (and (< |main_~#a~0.base| |#StackHeapBarrier|) (= (store (store |old(#length)| |main_~#a~0.base| 400000) |main_~#b~0.base| 400000) |#length|) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= |main_~#b~0.offset| 0) (= |#valid| (store (store |old(#valid)| |main_~#a~0.base| 1) |main_~#b~0.base| 1)) (not (= |main_~#b~0.base| 0)) (not (= 0 |main_~#a~0.base|)) (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |main_~#b~0.offset| 0) (= |main_~#a~0.offset| 0) (< |main_~#b~0.base| |#StackHeapBarrier|) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (= (select (store |old(#valid)| |main_~#a~0.base| 1) |main_~#b~0.base|) 0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~i~0 0))) (<= |#NULL.base| 0) (<= 0 |main_~#b~0.offset|) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:37:20,734 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 152#(or (and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 60000))) (<= main_~i~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#b~0.offset|) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0)) (and (= |#NULL.base| 0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~i~0) (<= 0 |main_~#b~0.offset|) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0))) [2019-10-13 21:37:20,734 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 199#(and (exists ((v_prenex_16 Int) (|v_main_~#a~0.base_BEFORE_CALL_2| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (= (select (select |#memory_int| v_prenex_16) 60000) 1) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 60000) 1)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:37:20,734 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 184#(exists ((v_prenex_16 Int) (|v_main_~#a~0.base_BEFORE_CALL_2| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (= (select (select |#memory_int| v_prenex_16) 60000) 1) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 60000) 1)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-13 21:37:20,735 INFO L193 IcfgInterpreter]: Reachable states at location L32-2 satisfy 147#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#b~0.offset|) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-13 21:37:21,078 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 24 [2019-10-13 21:37:21,341 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:37:21,341 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7, 11] total 24 [2019-10-13 21:37:21,341 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216164666] [2019-10-13 21:37:21,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-13 21:37:21,342 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:37:21,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-13 21:37:21,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=436, Unknown=0, NotChecked=0, Total=552 [2019-10-13 21:37:21,343 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 24 states. [2019-10-13 21:37:22,341 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 30 [2019-10-13 21:37:23,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:37:23,101 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2019-10-13 21:37:23,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-13 21:37:23,102 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 22 [2019-10-13 21:37:23,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:37:23,106 INFO L225 Difference]: With dead ends: 71 [2019-10-13 21:37:23,106 INFO L226 Difference]: Without dead ends: 55 [2019-10-13 21:37:23,107 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=364, Invalid=1276, Unknown=0, NotChecked=0, Total=1640 [2019-10-13 21:37:23,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-13 21:37:23,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 41. [2019-10-13 21:37:23,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-13 21:37:23,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2019-10-13 21:37:23,119 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 22 [2019-10-13 21:37:23,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:37:23,120 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2019-10-13 21:37:23,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-13 21:37:23,120 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2019-10-13 21:37:23,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-13 21:37:23,121 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:37:23,122 INFO L380 BasicCegarLoop]: trace histogram [10, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:37:23,335 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:37:23,335 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:37:23,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:37:23,335 INFO L82 PathProgramCache]: Analyzing trace with hash 701320466, now seen corresponding path program 3 times [2019-10-13 21:37:23,336 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:37:23,336 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603744191] [2019-10-13 21:37:23,336 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:37:23,336 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:37:23,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:37:23,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:37:23,514 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-13 21:37:23,514 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603744191] [2019-10-13 21:37:23,514 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052897685] [2019-10-13 21:37:23,515 INFO L92 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-13 21:37:23,603 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:37:23,603 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:37:23,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-13 21:37:23,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:37:23,625 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-13 21:37:23,626 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:37:23,683 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-13 21:37:23,684 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [735126433] [2019-10-13 21:37:23,686 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-13 21:37:23,686 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:37:23,687 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:37:23,687 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:37:23,687 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:37:23,709 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:37:23,740 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:23,751 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:23,760 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:23,771 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:23,800 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:23,808 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:23,916 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:23,928 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:23,940 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:23,954 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:23,968 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:23,982 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:24,017 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:24,080 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:24,092 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:24,106 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:24,117 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:24,151 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:24,184 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:24,225 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:24,312 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:24,498 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:24,537 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:24,571 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:24,580 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:24,591 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:24,627 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:25,020 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 28 for LOIs [2019-10-13 21:37:25,034 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:37:25,040 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:37:25,041 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:37:25,041 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 192#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_24 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (not (= 1 (select (select |#memory_int| v_prenex_24) 60000))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (= 1 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 60000)) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:37:25,041 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 197#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_24 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (not (= 1 (select (select |#memory_int| v_prenex_24) 60000))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (= 1 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 60000)) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:37:25,041 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 206#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:37:25,042 INFO L193 IcfgInterpreter]: Reachable states at location L34 satisfy 173#(and (or (and (= |#NULL.base| 0) (<= 0 main_~i~0) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) (and (= |#NULL.base| 0) (< main_~i~0 100000) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0))) (or (and (<= 0 main_~i~0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#b~0.offset|) (<= main_~i~0 100000) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (<= 1 main_~i~0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#b~0.offset|) (<= main_~i~0 100000) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-13 21:37:25,042 INFO L193 IcfgInterpreter]: Reachable states at location L36 satisfy 178#(and (= |#NULL.base| 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~i~0 4) |main_~#a~0.offset|)) |main_#t~mem5|) (< main_~i~0 100000) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (= main_~i~0 15000) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 15000 main_~i~0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~i~0) (<= 0 |main_~#b~0.offset|) (= |main_~#b~0.offset| 0) (<= main_~i~0 15000) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-13 21:37:25,042 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:37:25,042 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:37:25,043 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 211#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:37:25,043 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:37:25,043 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 91#(and (or (and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |main_~#b~0.offset| 0) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) (and (< |main_~#a~0.base| |#StackHeapBarrier|) (= (store (store |old(#length)| |main_~#a~0.base| 400000) |main_~#b~0.base| 400000) |#length|) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= |main_~#b~0.offset| 0) (= |#valid| (store (store |old(#valid)| |main_~#a~0.base| 1) |main_~#b~0.base| 1)) (not (= |main_~#b~0.base| 0)) (not (= 0 |main_~#a~0.base|)) (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |main_~#b~0.offset| 0) (= |main_~#a~0.offset| 0) (< |main_~#b~0.base| |#StackHeapBarrier|) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (= (select (store |old(#valid)| |main_~#a~0.base| 1) |main_~#b~0.base|) 0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~i~0 0))) (<= |#NULL.base| 0) (<= 0 |main_~#b~0.offset|) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:37:25,045 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 202#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_24 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (not (= 1 (select (select |#memory_int| v_prenex_24) 60000))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (= 1 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 60000)) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:37:25,046 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 155#(or (and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 60000))) (<= main_~i~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#b~0.offset|) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0)) (and (= |#NULL.base| 0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~i~0) (<= 0 |main_~#b~0.offset|) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0))) [2019-10-13 21:37:25,046 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 187#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_24 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (not (= 1 (select (select |#memory_int| v_prenex_24) 60000))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (= 1 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 60000)) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-13 21:37:25,046 INFO L193 IcfgInterpreter]: Reachable states at location L32-2 satisfy 150#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#b~0.offset|) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-13 21:37:25,478 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 24 [2019-10-13 21:37:25,781 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:37:25,782 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 11] total 26 [2019-10-13 21:37:25,782 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529231071] [2019-10-13 21:37:25,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-13 21:37:25,784 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:37:25,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-13 21:37:25,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2019-10-13 21:37:25,785 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 26 states. [2019-10-13 21:37:27,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:37:27,863 INFO L93 Difference]: Finished difference Result 91 states and 103 transitions. [2019-10-13 21:37:27,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-13 21:37:27,863 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 37 [2019-10-13 21:37:27,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:37:27,865 INFO L225 Difference]: With dead ends: 91 [2019-10-13 21:37:27,865 INFO L226 Difference]: Without dead ends: 66 [2019-10-13 21:37:27,866 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 101 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 640 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=455, Invalid=1615, Unknown=0, NotChecked=0, Total=2070 [2019-10-13 21:37:27,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-13 21:37:27,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2019-10-13 21:37:27,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-13 21:37:27,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2019-10-13 21:37:27,880 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 37 [2019-10-13 21:37:27,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:37:27,880 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2019-10-13 21:37:27,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-13 21:37:27,880 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2019-10-13 21:37:27,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-13 21:37:27,882 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:37:27,882 INFO L380 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:37:28,087 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:37:28,087 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:37:28,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:37:28,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1575063017, now seen corresponding path program 4 times [2019-10-13 21:37:28,088 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:37:28,088 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038346576] [2019-10-13 21:37:28,089 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:37:28,089 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:37:28,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:37:28,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:37:28,322 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-10-13 21:37:28,322 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038346576] [2019-10-13 21:37:28,322 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066604819] [2019-10-13 21:37:28,323 INFO L92 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-13 21:37:28,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:37:28,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-13 21:37:28,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:37:28,451 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-10-13 21:37:28,452 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:37:28,722 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-10-13 21:37:28,723 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1524872854] [2019-10-13 21:37:28,724 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-13 21:37:28,724 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:37:28,725 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:37:28,725 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:37:28,725 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:37:28,752 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:37:28,803 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:28,811 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:28,859 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:28,869 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:28,876 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:28,884 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:29,053 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:29,077 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:29,099 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:29,121 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:29,168 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:29,182 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:29,261 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:29,276 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:29,287 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:29,299 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:29,309 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:29,337 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:29,351 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:29,431 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:29,528 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:29,624 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:29,633 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:29,643 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:29,676 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:29,685 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:29,871 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:37:30,053 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 28 for LOIs [2019-10-13 21:37:30,060 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:37:30,063 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:37:30,063 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:37:30,063 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 191#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_32 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_32) 60000) 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 60000) 1)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0))))) [2019-10-13 21:37:30,063 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 196#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_32 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_32) 60000) 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 60000) 1)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0))))) [2019-10-13 21:37:30,064 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 205#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:37:30,064 INFO L193 IcfgInterpreter]: Reachable states at location L34 satisfy 172#(and (or (and (= |#NULL.base| 0) (<= 0 main_~i~0) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) (and (= |#NULL.base| 0) (< main_~i~0 100000) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0))) (or (and (<= 0 main_~i~0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#b~0.offset|) (<= main_~i~0 100000) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (<= 1 main_~i~0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#b~0.offset|) (<= main_~i~0 100000) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-13 21:37:30,064 INFO L193 IcfgInterpreter]: Reachable states at location L36 satisfy 177#(and (= |#NULL.base| 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~i~0 4) |main_~#a~0.offset|)) |main_#t~mem5|) (< main_~i~0 100000) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (= main_~i~0 15000) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 15000 main_~i~0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~i~0) (<= 0 |main_~#b~0.offset|) (= |main_~#b~0.offset| 0) (<= main_~i~0 15000) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-13 21:37:30,064 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:37:30,064 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:37:30,064 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 210#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:37:30,065 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:37:30,065 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 90#(and (or (and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |main_~#b~0.offset| 0) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) (and (< |main_~#a~0.base| |#StackHeapBarrier|) (= (store (store |old(#length)| |main_~#a~0.base| 400000) |main_~#b~0.base| 400000) |#length|) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= |main_~#b~0.offset| 0) (= |#valid| (store (store |old(#valid)| |main_~#a~0.base| 1) |main_~#b~0.base| 1)) (not (= |main_~#b~0.base| 0)) (not (= 0 |main_~#a~0.base|)) (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |main_~#b~0.offset| 0) (= |main_~#a~0.offset| 0) (< |main_~#b~0.base| |#StackHeapBarrier|) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (= (select (store |old(#valid)| |main_~#a~0.base| 1) |main_~#b~0.base|) 0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~i~0 0))) (<= |#NULL.base| 0) (<= 0 |main_~#b~0.offset|) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:37:30,065 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 201#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_32 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_32) 60000) 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 60000) 1)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0))))) [2019-10-13 21:37:30,065 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 154#(or (and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 60000))) (<= main_~i~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#b~0.offset|) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0)) (and (= |#NULL.base| 0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~i~0) (<= 0 |main_~#b~0.offset|) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0))) [2019-10-13 21:37:30,066 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 186#(exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_32 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_32) 60000) 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 60000) 1)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-13 21:37:30,066 INFO L193 IcfgInterpreter]: Reachable states at location L32-2 satisfy 149#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#b~0.offset|) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-13 21:37:30,901 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:37:30,901 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15, 11] total 40 [2019-10-13 21:37:30,901 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068513375] [2019-10-13 21:37:30,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-13 21:37:30,903 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:37:30,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-13 21:37:30,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=452, Invalid=1108, Unknown=0, NotChecked=0, Total=1560 [2019-10-13 21:37:30,905 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 40 states. [2019-10-13 21:37:31,984 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 30 [2019-10-13 21:37:34,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:37:34,768 INFO L93 Difference]: Finished difference Result 165 states and 195 transitions. [2019-10-13 21:37:34,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-13 21:37:34,770 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 60 [2019-10-13 21:37:34,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:37:34,772 INFO L225 Difference]: With dead ends: 165 [2019-10-13 21:37:34,772 INFO L226 Difference]: Without dead ends: 119 [2019-10-13 21:37:34,775 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 170 SyntacticMatches, 12 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1761 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1420, Invalid=3836, Unknown=0, NotChecked=0, Total=5256 [2019-10-13 21:37:34,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-10-13 21:37:34,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 81. [2019-10-13 21:37:34,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-10-13 21:37:34,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2019-10-13 21:37:34,791 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 60 [2019-10-13 21:37:34,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:37:34,791 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2019-10-13 21:37:34,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-13 21:37:34,792 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2019-10-13 21:37:34,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-13 21:37:34,794 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:37:34,794 INFO L380 BasicCegarLoop]: trace histogram [26, 14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:37:34,997 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:37:34,998 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:37:34,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:37:34,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1748959122, now seen corresponding path program 5 times [2019-10-13 21:37:34,999 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:37:34,999 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488267468] [2019-10-13 21:37:34,999 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:37:34,999 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:37:35,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:37:35,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:37:35,279 INFO L134 CoverageAnalysis]: Checked inductivity of 611 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-10-13 21:37:35,279 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488267468] [2019-10-13 21:37:35,279 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547744514] [2019-10-13 21:37:35,279 INFO L92 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