java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/array-examples/standard_minInArray_ground-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:35:39,146 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:35:39,149 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:35:39,166 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:35:39,166 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:35:39,167 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:35:39,168 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:35:39,173 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:35:39,181 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:35:39,183 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:35:39,185 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:35:39,186 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:35:39,186 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:35:39,189 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:35:39,192 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:35:39,193 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:35:39,194 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:35:39,194 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:35:39,197 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:35:39,203 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:35:39,207 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:35:39,210 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:35:39,213 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:35:39,213 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:35:39,216 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:35:39,217 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:35:39,217 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:35:39,218 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:35:39,220 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:35:39,221 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:35:39,221 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:35:39,223 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:35:39,223 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:35:39,224 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:35:39,226 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:35:39,226 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:35:39,227 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:35:39,227 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:35:39,228 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:35:39,228 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:35:39,230 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:35:39,230 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:35:39,263 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:35:39,265 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:35:39,267 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:35:39,267 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:35:39,270 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:35:39,271 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:35:39,272 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:35:39,273 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:35:39,273 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:35:39,273 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:35:39,273 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:35:39,273 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:35:39,273 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:35:39,274 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:35:39,274 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:35:39,274 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:35:39,274 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:35:39,274 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:35:39,275 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:35:39,275 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:35:39,275 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:35:39,275 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:35:39,275 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:35:39,276 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:35:39,276 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:35:39,276 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:35:39,279 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:35:39,280 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:35:39,280 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:35:39,574 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:35:39,587 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:35:39,591 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:35:39,593 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:35:39,593 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:35:39,594 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_minInArray_ground-2.i [2019-10-13 21:35:39,673 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb96edb32/c38a5750e28d45669d0ff28308965f6a/FLAG7c0b26ae3 [2019-10-13 21:35:40,167 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:35:40,168 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_minInArray_ground-2.i [2019-10-13 21:35:40,176 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb96edb32/c38a5750e28d45669d0ff28308965f6a/FLAG7c0b26ae3 [2019-10-13 21:35:40,650 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb96edb32/c38a5750e28d45669d0ff28308965f6a [2019-10-13 21:35:40,661 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:35:40,663 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:35:40,664 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:35:40,664 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:35:40,667 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:35:40,668 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:35:40" (1/1) ... [2019-10-13 21:35:40,670 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b7220a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:40, skipping insertion in model container [2019-10-13 21:35:40,671 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:35:40" (1/1) ... [2019-10-13 21:35:40,678 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:35:40,701 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:35:40,893 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:35:40,897 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:35:40,918 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:35:40,936 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:35:40,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:40 WrapperNode [2019-10-13 21:35:40,936 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:35:40,937 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:35:40,937 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:35:40,937 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:35:41,027 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:40" (1/1) ... [2019-10-13 21:35:41,030 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:40" (1/1) ... [2019-10-13 21:35:41,038 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:40" (1/1) ... [2019-10-13 21:35:41,039 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:40" (1/1) ... [2019-10-13 21:35:41,050 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:40" (1/1) ... [2019-10-13 21:35:41,056 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:40" (1/1) ... [2019-10-13 21:35:41,057 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:40" (1/1) ... [2019-10-13 21:35:41,059 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:35:41,060 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:35:41,060 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:35:41,060 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:35:41,061 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:40" (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:35:41,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:35:41,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:35:41,113 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 21:35:41,114 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:35:41,114 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:35:41,114 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:35:41,114 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:35:41,114 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:35:41,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:35:41,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:35:41,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:35:41,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:35:41,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:35:41,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:35:41,491 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:35:41,491 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-13 21:35:41,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:35:41 BoogieIcfgContainer [2019-10-13 21:35:41,493 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:35:41,495 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:35:41,495 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:35:41,499 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:35:41,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:35:40" (1/3) ... [2019-10-13 21:35:41,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@407b8f8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:35:41, skipping insertion in model container [2019-10-13 21:35:41,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:40" (2/3) ... [2019-10-13 21:35:41,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@407b8f8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:35:41, skipping insertion in model container [2019-10-13 21:35:41,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:35:41" (3/3) ... [2019-10-13 21:35:41,503 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_minInArray_ground-2.i [2019-10-13 21:35:41,513 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:35:41,522 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:35:41,535 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:35:41,561 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:35:41,562 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:35:41,562 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:35:41,562 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:35:41,563 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:35:41,563 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:35:41,563 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:35:41,563 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:35:41,581 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-10-13 21:35:41,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-13 21:35:41,587 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:35:41,588 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:35:41,590 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:35:41,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:35:41,596 INFO L82 PathProgramCache]: Analyzing trace with hash -242987165, now seen corresponding path program 1 times [2019-10-13 21:35:41,603 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:35:41,603 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916449665] [2019-10-13 21:35:41,604 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:41,604 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:41,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:35:41,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:41,780 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:35:41,781 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916449665] [2019-10-13 21:35:41,782 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:35:41,783 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:35:41,784 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369068078] [2019-10-13 21:35:41,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:35:41,790 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:35:41,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:35:41,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:35:41,812 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2019-10-13 21:35:41,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:35:41,883 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2019-10-13 21:35:41,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:35:41,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-13 21:35:41,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:35:41,896 INFO L225 Difference]: With dead ends: 34 [2019-10-13 21:35:41,897 INFO L226 Difference]: Without dead ends: 18 [2019-10-13 21:35:41,905 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:35:41,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-10-13 21:35:41,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-13 21:35:41,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-13 21:35:41,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-10-13 21:35:41,941 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 12 [2019-10-13 21:35:41,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:35:41,941 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-10-13 21:35:41,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:35:41,941 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-10-13 21:35:41,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 21:35:41,942 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:35:41,942 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:35:41,943 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:35:41,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:35:41,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1448285990, now seen corresponding path program 1 times [2019-10-13 21:35:41,944 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:35:41,944 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341394353] [2019-10-13 21:35:41,944 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:41,944 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:41,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:35:41,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:42,018 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:35:42,018 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341394353] [2019-10-13 21:35:42,019 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220271137] [2019-10-13 21:35:42,019 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:35:42,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:42,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:35:42,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:35:42,138 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:35:42,138 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:35:42,178 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:35:42,179 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [116133700] [2019-10-13 21:35:42,208 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:35:42,209 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:35:42,216 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:35:42,226 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:35:42,226 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:35:42,419 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:35:42,744 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 21:35:42,798 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:35:42,805 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:35:42,805 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:35:42,806 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 130#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 21:35:42,821 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 135#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:35:42,821 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 144#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:35:42,822 INFO L193 IcfgInterpreter]: Reachable states at location L24 satisfy 120#(and (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (= |main_#t~mem5| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:35:42,822 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 110#(<= 0 main_~i~0) [2019-10-13 21:35:42,822 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:35:42,823 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:35:42,823 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 149#(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:35:42,823 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:35:42,824 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 68#true [2019-10-13 21:35:42,824 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 140#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:35:42,824 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 125#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1))) [2019-10-13 21:35:42,825 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 115#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:35:43,165 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:35:43,165 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 17 [2019-10-13 21:35:43,166 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490410431] [2019-10-13 21:35:43,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-13 21:35:43,169 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:35:43,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-13 21:35:43,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2019-10-13 21:35:43,173 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 17 states. [2019-10-13 21:35:43,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:35:43,711 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2019-10-13 21:35:43,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-13 21:35:43,711 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 14 [2019-10-13 21:35:43,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:35:43,715 INFO L225 Difference]: With dead ends: 38 [2019-10-13 21:35:43,715 INFO L226 Difference]: Without dead ends: 27 [2019-10-13 21:35:43,723 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=142, Invalid=614, Unknown=0, NotChecked=0, Total=756 [2019-10-13 21:35:43,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-10-13 21:35:43,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2019-10-13 21:35:43,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-13 21:35:43,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-10-13 21:35:43,753 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 14 [2019-10-13 21:35:43,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:35:43,754 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-10-13 21:35:43,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-13 21:35:43,754 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-10-13 21:35:43,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 21:35:43,755 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:35:43,755 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:35:43,960 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:35:43,960 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:35:43,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:35:43,961 INFO L82 PathProgramCache]: Analyzing trace with hash 119243939, now seen corresponding path program 2 times [2019-10-13 21:35:43,961 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:35:43,961 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992059192] [2019-10-13 21:35:43,961 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:43,962 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:43,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:35:43,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:44,055 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 21:35:44,056 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992059192] [2019-10-13 21:35:44,056 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304173237] [2019-10-13 21:35:44,056 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:35:44,137 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-13 21:35:44,137 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:35:44,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-13 21:35:44,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:35:44,157 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 21:35:44,158 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:35:44,223 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 21:35:44,224 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1835418311] [2019-10-13 21:35:44,225 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:35:44,225 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:35:44,226 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:35:44,226 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:35:44,227 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:35:44,274 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:35:44,444 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 21:35:44,481 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:35:44,491 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:35:44,491 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:35:44,491 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 130#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 21:35:44,492 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 135#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:35:44,492 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 144#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:35:44,492 INFO L193 IcfgInterpreter]: Reachable states at location L24 satisfy 120#(and (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (= |main_#t~mem5| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:35:44,493 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 110#(<= 0 main_~i~0) [2019-10-13 21:35:44,493 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:35:44,493 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:35:44,493 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 149#(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:35:44,494 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:35:44,494 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 68#true [2019-10-13 21:35:44,495 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 140#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:35:44,495 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 125#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1))) [2019-10-13 21:35:44,495 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 115#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:35:44,820 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:35:44,820 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 11] total 23 [2019-10-13 21:35:44,820 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041705042] [2019-10-13 21:35:44,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-13 21:35:44,822 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:35:44,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-13 21:35:44,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2019-10-13 21:35:44,825 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 23 states. [2019-10-13 21:35:45,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:35:45,599 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2019-10-13 21:35:45,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-13 21:35:45,600 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 20 [2019-10-13 21:35:45,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:35:45,601 INFO L225 Difference]: With dead ends: 53 [2019-10-13 21:35:45,601 INFO L226 Difference]: Without dead ends: 39 [2019-10-13 21:35:45,602 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=313, Invalid=1247, Unknown=0, NotChecked=0, Total=1560 [2019-10-13 21:35:45,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-13 21:35:45,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2019-10-13 21:35:45,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-13 21:35:45,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-10-13 21:35:45,616 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 20 [2019-10-13 21:35:45,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:35:45,616 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-10-13 21:35:45,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-13 21:35:45,616 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2019-10-13 21:35:45,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-13 21:35:45,618 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:35:45,618 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:35:45,821 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:35:45,822 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:35:45,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:35:45,823 INFO L82 PathProgramCache]: Analyzing trace with hash 92938371, now seen corresponding path program 3 times [2019-10-13 21:35:45,824 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:35:45,824 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843991025] [2019-10-13 21:35:45,825 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:45,825 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:45,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:35:45,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:46,046 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-13 21:35:46,047 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843991025] [2019-10-13 21:35:46,048 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473768509] [2019-10-13 21:35:46,048 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:35:46,145 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:35:46,145 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:35:46,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-13 21:35:46,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:35:46,165 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-13 21:35:46,166 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:35:46,377 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-13 21:35:46,378 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1378739959] [2019-10-13 21:35:46,379 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:35:46,380 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:35:46,380 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:35:46,380 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:35:46,381 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:35:46,422 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:35:46,574 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 21:35:46,599 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:35:46,605 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:35:46,605 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:35:46,606 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 130#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 21:35:46,606 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 135#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:35:46,606 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 144#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:35:46,606 INFO L193 IcfgInterpreter]: Reachable states at location L24 satisfy 120#(and (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (= |main_#t~mem5| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:35:46,607 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 110#(<= 0 main_~i~0) [2019-10-13 21:35:46,607 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:35:46,608 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:35:46,608 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 149#(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:35:46,608 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:35:46,608 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 68#true [2019-10-13 21:35:46,610 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 140#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:35:46,611 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 125#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-13 21:35:46,611 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 115#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:35:46,959 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:35:46,960 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 11] total 35 [2019-10-13 21:35:46,960 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071788443] [2019-10-13 21:35:46,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-13 21:35:46,961 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:35:46,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-13 21:35:46,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=860, Unknown=0, NotChecked=0, Total=1190 [2019-10-13 21:35:46,963 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 35 states. [2019-10-13 21:35:48,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:35:48,357 INFO L93 Difference]: Finished difference Result 83 states and 111 transitions. [2019-10-13 21:35:48,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-13 21:35:48,358 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 32 [2019-10-13 21:35:48,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:35:48,359 INFO L225 Difference]: With dead ends: 83 [2019-10-13 21:35:48,359 INFO L226 Difference]: Without dead ends: 63 [2019-10-13 21:35:48,362 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1009 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=979, Invalid=3053, Unknown=0, NotChecked=0, Total=4032 [2019-10-13 21:35:48,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-13 21:35:48,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2019-10-13 21:35:48,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-13 21:35:48,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2019-10-13 21:35:48,375 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 32 [2019-10-13 21:35:48,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:35:48,375 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2019-10-13 21:35:48,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-13 21:35:48,375 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2019-10-13 21:35:48,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-13 21:35:48,377 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:35:48,377 INFO L380 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:35:48,582 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:35:48,583 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:35:48,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:35:48,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1097584707, now seen corresponding path program 4 times [2019-10-13 21:35:48,584 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:35:48,584 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716908644] [2019-10-13 21:35:48,585 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:48,585 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:48,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:35:48,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:48,986 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-13 21:35:48,986 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716908644] [2019-10-13 21:35:48,986 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432288770] [2019-10-13 21:35:48,987 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:35:49,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:49,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-13 21:35:49,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:35:49,118 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-13 21:35:49,118 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:35:49,803 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-13 21:35:49,804 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1045512016] [2019-10-13 21:35:49,805 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:35:49,805 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:35:49,805 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:35:49,806 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:35:49,806 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:35:49,834 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:35:49,939 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 21:35:49,954 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:35:49,959 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:35:49,959 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:35:49,963 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 130#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 21:35:49,963 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 135#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:35:49,964 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 144#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:35:49,964 INFO L193 IcfgInterpreter]: Reachable states at location L24 satisfy 120#(and (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (= |main_#t~mem5| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:35:49,964 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 110#(<= 0 main_~i~0) [2019-10-13 21:35:49,964 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:35:49,964 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:35:49,965 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 149#(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:35:49,965 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:35:49,965 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 68#true [2019-10-13 21:35:49,965 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 140#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:35:49,966 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 125#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-13 21:35:49,966 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 115#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:35:50,313 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:35:50,314 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25, 11] total 59 [2019-10-13 21:35:50,314 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61409939] [2019-10-13 21:35:50,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-10-13 21:35:50,316 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:35:50,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-10-13 21:35:50,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1206, Invalid=2216, Unknown=0, NotChecked=0, Total=3422 [2019-10-13 21:35:50,320 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 59 states. [2019-10-13 21:35:53,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:35:53,754 INFO L93 Difference]: Finished difference Result 143 states and 195 transitions. [2019-10-13 21:35:53,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-10-13 21:35:53,755 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 56 [2019-10-13 21:35:53,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:35:53,757 INFO L225 Difference]: With dead ends: 143 [2019-10-13 21:35:53,757 INFO L226 Difference]: Without dead ends: 111 [2019-10-13 21:35:53,763 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2755 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=3607, Invalid=8825, Unknown=0, NotChecked=0, Total=12432 [2019-10-13 21:35:53,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-10-13 21:35:53,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 108. [2019-10-13 21:35:53,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-10-13 21:35:53,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2019-10-13 21:35:53,799 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 56 [2019-10-13 21:35:53,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:35:53,800 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2019-10-13 21:35:53,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-10-13 21:35:53,800 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2019-10-13 21:35:53,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-13 21:35:53,805 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:35:53,806 INFO L380 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:35:54,010 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:35:54,011 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:35:54,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:35:54,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1168568381, now seen corresponding path program 5 times [2019-10-13 21:35:54,012 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:35:54,012 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785080696] [2019-10-13 21:35:54,013 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:54,013 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:54,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:35:54,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:55,188 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-10-13 21:35:55,189 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785080696] [2019-10-13 21:35:55,189 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520834313] [2019-10-13 21:35:55,189 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 [2019-10-13 21:36:13,509 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-10-13 21:36:13,509 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:36:13,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 48 conjunts are in the unsatisfiable core [2019-10-13 21:36:13,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:36:13,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-10-13 21:36:13,553 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:36:16,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-10-13 21:36:16,217 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1783113169] [2019-10-13 21:36:16,220 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:36:16,220 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:36:16,220 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:36:16,221 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:36:16,221 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:36:16,243 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:36:16,322 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 21:36:16,335 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:36:16,341 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:36:16,341 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:36:16,342 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 130#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 21:36:16,342 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 135#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:36:16,342 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 144#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:36:16,342 INFO L193 IcfgInterpreter]: Reachable states at location L24 satisfy 120#(and (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (= |main_#t~mem5| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:36:16,343 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 110#(<= 0 main_~i~0) [2019-10-13 21:36:16,343 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:36:16,343 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0))) [2019-10-13 21:36:16,344 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 149#(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:36:16,344 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:36:16,344 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 68#true [2019-10-13 21:36:16,344 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 140#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:36:16,344 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 125#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-13 21:36:16,345 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 115#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:36:16,856 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:36:16,856 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49, 11] total 107 [2019-10-13 21:36:16,857 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115266136] [2019-10-13 21:36:16,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-10-13 21:36:16,859 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:36:16,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-10-13 21:36:16,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4686, Invalid=6656, Unknown=0, NotChecked=0, Total=11342 [2019-10-13 21:36:16,866 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 107 states.