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-crafted/bAnd1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:29:40,869 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:29:40,872 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:29:40,890 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:29:40,890 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:29:40,893 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:29:40,895 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:29:40,907 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:29:40,910 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:29:40,910 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:29:40,912 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:29:40,913 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:29:40,914 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:29:40,918 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:29:40,921 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:29:40,922 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:29:40,924 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:29:40,927 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:29:40,929 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:29:40,935 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:29:40,940 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:29:40,943 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:29:40,946 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:29:40,947 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:29:40,951 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:29:40,951 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:29:40,952 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:29:40,953 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:29:40,955 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:29:40,956 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:29:40,956 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:29:40,958 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:29:40,959 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:29:40,960 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:29:40,961 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:29:40,961 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:29:40,962 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:29:40,962 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:29:40,963 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:29:40,964 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:29:40,965 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:29:40,966 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-15 01:29:40,986 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:29:40,987 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:29:40,991 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:29:40,991 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:29:40,992 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:29:40,992 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:29:40,992 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:29:40,992 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:29:40,993 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:29:40,993 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:29:40,994 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:29:40,994 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:29:40,994 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:29:40,995 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:29:40,995 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:29:40,995 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:29:40,996 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:29:40,996 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:29:40,996 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:29:40,996 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:29:40,997 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:29:40,997 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:29:40,997 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:29:40,997 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:29:40,997 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:29:40,998 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:29:40,998 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:29:40,998 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:29:40,998 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-15 01:29:41,334 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:29:41,348 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:29:41,351 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:29:41,353 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:29:41,353 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:29:41,354 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/bAnd1.i [2019-10-15 01:29:41,434 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d93064b4c/39973645c6154bbab3ee5df9061987a0/FLAG0885620b4 [2019-10-15 01:29:41,910 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:29:41,911 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/bAnd1.i [2019-10-15 01:29:41,919 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d93064b4c/39973645c6154bbab3ee5df9061987a0/FLAG0885620b4 [2019-10-15 01:29:42,251 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d93064b4c/39973645c6154bbab3ee5df9061987a0 [2019-10-15 01:29:42,259 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:29:42,261 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:29:42,262 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:29:42,262 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:29:42,266 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:29:42,267 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:29:42" (1/1) ... [2019-10-15 01:29:42,269 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@663c421b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:42, skipping insertion in model container [2019-10-15 01:29:42,270 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:29:42" (1/1) ... [2019-10-15 01:29:42,277 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:29:42,295 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:29:42,482 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:29:42,491 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:29:42,512 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:29:42,610 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:29:42,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:42 WrapperNode [2019-10-15 01:29:42,611 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:29:42,611 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:29:42,611 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:29:42,612 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:29:42,627 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:42" (1/1) ... [2019-10-15 01:29:42,627 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:42" (1/1) ... [2019-10-15 01:29:42,637 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:42" (1/1) ... [2019-10-15 01:29:42,637 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:42" (1/1) ... [2019-10-15 01:29:42,648 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:42" (1/1) ... [2019-10-15 01:29:42,661 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:42" (1/1) ... [2019-10-15 01:29:42,664 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:42" (1/1) ... [2019-10-15 01:29:42,672 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:29:42,673 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:29:42,673 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:29:42,675 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:29:42,675 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:42" (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-15 01:29:42,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:29:42,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:29:42,728 INFO L138 BoogieDeclarations]: Found implementation of procedure bAnd [2019-10-15 01:29:42,729 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:29:42,729 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:29:42,729 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:29:42,730 INFO L130 BoogieDeclarations]: Found specification of procedure bAnd [2019-10-15 01:29:42,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 01:29:42,730 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:29:42,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 01:29:42,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 01:29:42,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 01:29:42,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:29:42,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:29:43,139 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:29:43,139 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-15 01:29:43,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:29:43 BoogieIcfgContainer [2019-10-15 01:29:43,141 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:29:43,142 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:29:43,142 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:29:43,145 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:29:43,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:29:42" (1/3) ... [2019-10-15 01:29:43,148 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e0e2480 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:29:43, skipping insertion in model container [2019-10-15 01:29:43,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:42" (2/3) ... [2019-10-15 01:29:43,149 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e0e2480 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:29:43, skipping insertion in model container [2019-10-15 01:29:43,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:29:43" (3/3) ... [2019-10-15 01:29:43,150 INFO L109 eAbstractionObserver]: Analyzing ICFG bAnd1.i [2019-10-15 01:29:43,161 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:29:43,170 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:29:43,182 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:29:43,204 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:29:43,204 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:29:43,205 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:29:43,205 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:29:43,205 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:29:43,205 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:29:43,205 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:29:43,205 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:29:43,221 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-10-15 01:29:43,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-15 01:29:43,227 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:43,228 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:43,230 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:43,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:43,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1674969442, now seen corresponding path program 1 times [2019-10-15 01:29:43,242 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:29:43,243 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807510488] [2019-10-15 01:29:43,243 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:43,243 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:43,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:43,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:43,420 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-15 01:29:43,421 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807510488] [2019-10-15 01:29:43,422 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:43,423 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:29:43,423 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745218110] [2019-10-15 01:29:43,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:29:43,428 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:29:43,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:29:43,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:29:43,441 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2019-10-15 01:29:43,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:43,479 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2019-10-15 01:29:43,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:29:43,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-15 01:29:43,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:43,490 INFO L225 Difference]: With dead ends: 41 [2019-10-15 01:29:43,491 INFO L226 Difference]: Without dead ends: 20 [2019-10-15 01:29:43,495 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-15 01:29:43,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-15 01:29:43,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-15 01:29:43,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-15 01:29:43,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-10-15 01:29:43,539 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 24 [2019-10-15 01:29:43,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:43,539 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-10-15 01:29:43,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:29:43,540 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2019-10-15 01:29:43,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-15 01:29:43,542 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:43,542 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:43,543 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:43,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:43,544 INFO L82 PathProgramCache]: Analyzing trace with hash -2035795135, now seen corresponding path program 1 times [2019-10-15 01:29:43,544 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:29:43,544 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137076462] [2019-10-15 01:29:43,544 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:43,545 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:43,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:43,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:43,636 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:29:43,636 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137076462] [2019-10-15 01:29:43,637 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414543030] [2019-10-15 01:29:43,637 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-15 01:29:43,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:43,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 01:29:43,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:29:43,758 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:29:43,758 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:29:43,829 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:29:43,830 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:29:43,830 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2019-10-15 01:29:43,830 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526158878] [2019-10-15 01:29:43,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:29:43,833 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:29:43,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:29:43,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:43,834 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 3 states. [2019-10-15 01:29:43,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:43,852 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2019-10-15 01:29:43,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:29:43,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-15 01:29:43,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:43,854 INFO L225 Difference]: With dead ends: 33 [2019-10-15 01:29:43,854 INFO L226 Difference]: Without dead ends: 21 [2019-10-15 01:29:43,855 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:43,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-15 01:29:43,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-15 01:29:43,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-15 01:29:43,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-10-15 01:29:43,868 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 25 [2019-10-15 01:29:43,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:43,868 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-10-15 01:29:43,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:29:43,870 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-10-15 01:29:43,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-15 01:29:43,872 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:43,872 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:44,073 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:44,073 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:44,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:44,075 INFO L82 PathProgramCache]: Analyzing trace with hash -629127273, now seen corresponding path program 1 times [2019-10-15 01:29:44,075 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:29:44,076 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943684448] [2019-10-15 01:29:44,076 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:44,076 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:44,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:44,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:44,191 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 01:29:44,192 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943684448] [2019-10-15 01:29:44,192 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:44,192 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:29:44,192 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736357673] [2019-10-15 01:29:44,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:29:44,193 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:29:44,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:29:44,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:29:44,194 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 3 states. [2019-10-15 01:29:44,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:44,217 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2019-10-15 01:29:44,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:29:44,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-15 01:29:44,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:44,220 INFO L225 Difference]: With dead ends: 31 [2019-10-15 01:29:44,220 INFO L226 Difference]: Without dead ends: 22 [2019-10-15 01:29:44,221 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-15 01:29:44,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-15 01:29:44,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-15 01:29:44,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-15 01:29:44,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-10-15 01:29:44,234 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 28 [2019-10-15 01:29:44,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:44,239 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-10-15 01:29:44,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:29:44,239 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-10-15 01:29:44,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-15 01:29:44,246 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:44,247 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:44,247 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:44,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:44,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1942163656, now seen corresponding path program 1 times [2019-10-15 01:29:44,248 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:29:44,249 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750537580] [2019-10-15 01:29:44,249 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:44,249 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:44,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:44,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:44,356 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 01:29:44,356 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750537580] [2019-10-15 01:29:44,357 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046189253] [2019-10-15 01:29:44,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-15 01:29:44,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:44,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:29:44,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:29:44,457 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 01:29:44,458 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:29:44,498 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 01:29:44,498 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1085127729] [2019-10-15 01:29:44,532 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-15 01:29:44,532 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:29:44,545 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:29:44,554 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:29:44,555 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:29:44,696 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 01:29:46,966 INFO L199 IcfgInterpreter]: Interpreting procedure bAnd with input of size 1 for LOIs [2019-10-15 01:29:47,003 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 01:29:47,008 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:29:47,378 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:29:47,378 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 17 [2019-10-15 01:29:47,379 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262907698] [2019-10-15 01:29:47,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-15 01:29:47,382 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:29:47,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-15 01:29:47,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-10-15 01:29:47,385 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 18 states. [2019-10-15 01:29:48,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:48,075 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2019-10-15 01:29:48,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-15 01:29:48,075 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 29 [2019-10-15 01:29:48,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:48,080 INFO L225 Difference]: With dead ends: 40 [2019-10-15 01:29:48,080 INFO L226 Difference]: Without dead ends: 25 [2019-10-15 01:29:48,083 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=133, Invalid=737, Unknown=0, NotChecked=0, Total=870 [2019-10-15 01:29:48,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-15 01:29:48,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-10-15 01:29:48,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-15 01:29:48,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-10-15 01:29:48,094 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 29 [2019-10-15 01:29:48,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:48,094 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-10-15 01:29:48,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-15 01:29:48,095 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-10-15 01:29:48,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-15 01:29:48,096 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:48,096 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:48,318 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:48,319 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:48,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:48,320 INFO L82 PathProgramCache]: Analyzing trace with hash 143191253, now seen corresponding path program 2 times [2019-10-15 01:29:48,320 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:29:48,320 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102318815] [2019-10-15 01:29:48,320 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:48,321 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:48,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:48,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:48,407 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 01:29:48,407 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102318815] [2019-10-15 01:29:48,407 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981245977] [2019-10-15 01:29:48,408 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 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-15 01:29:48,480 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-15 01:29:48,480 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:29:48,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:29:48,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:29:48,499 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-15 01:29:48,499 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:29:48,529 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-15 01:29:48,529 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1002382846] [2019-10-15 01:29:48,531 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-15 01:29:48,531 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:29:48,532 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:29:48,532 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:29:48,532 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:29:48,553 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 01:29:50,201 INFO L199 IcfgInterpreter]: Interpreting procedure bAnd with input of size 1 for LOIs [2019-10-15 01:29:50,229 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 01:29:50,233 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:29:50,640 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:29:50,640 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4, 11] total 21 [2019-10-15 01:29:50,641 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827080191] [2019-10-15 01:29:50,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-15 01:29:50,642 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:29:50,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-15 01:29:50,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2019-10-15 01:29:50,643 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 22 states. [2019-10-15 01:29:51,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:51,558 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2019-10-15 01:29:51,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-15 01:29:51,559 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 32 [2019-10-15 01:29:51,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:51,560 INFO L225 Difference]: With dead ends: 44 [2019-10-15 01:29:51,560 INFO L226 Difference]: Without dead ends: 29 [2019-10-15 01:29:51,562 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=210, Invalid=1272, Unknown=0, NotChecked=0, Total=1482 [2019-10-15 01:29:51,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-15 01:29:51,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-10-15 01:29:51,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-15 01:29:51,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-10-15 01:29:51,570 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 32 [2019-10-15 01:29:51,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:51,570 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-10-15 01:29:51,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-15 01:29:51,571 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-10-15 01:29:51,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-15 01:29:51,572 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:51,572 INFO L380 BasicCegarLoop]: trace histogram [12, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:51,780 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:51,781 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:51,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:51,781 INFO L82 PathProgramCache]: Analyzing trace with hash 766317228, now seen corresponding path program 3 times [2019-10-15 01:29:51,781 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:29:51,781 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79821930] [2019-10-15 01:29:51,782 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:51,782 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:51,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:51,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:51,877 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-15 01:29:51,877 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79821930] [2019-10-15 01:29:51,877 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381758700] [2019-10-15 01:29:51,877 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 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-15 01:29:51,986 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-15 01:29:51,986 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:29:51,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-15 01:29:51,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:29:52,020 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-15 01:29:52,020 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:29:52,105 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-15 01:29:52,106 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [229442135] [2019-10-15 01:29:52,107 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-15 01:29:52,108 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:29:52,110 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:29:52,110 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:29:52,111 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:29:52,135 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 01:29:53,620 INFO L199 IcfgInterpreter]: Interpreting procedure bAnd with input of size 1 for LOIs [2019-10-15 01:29:53,660 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 01:29:53,665 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:29:54,172 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:29:54,172 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 11] total 25 [2019-10-15 01:29:54,173 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153164163] [2019-10-15 01:29:54,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-15 01:29:54,174 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:29:54,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-15 01:29:54,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2019-10-15 01:29:54,179 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 26 states. [2019-10-15 01:29:55,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:55,307 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2019-10-15 01:29:55,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-15 01:29:55,307 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 42 [2019-10-15 01:29:55,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:55,308 INFO L225 Difference]: With dead ends: 54 [2019-10-15 01:29:55,308 INFO L226 Difference]: Without dead ends: 36 [2019-10-15 01:29:55,310 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=369, Invalid=1701, Unknown=0, NotChecked=0, Total=2070 [2019-10-15 01:29:55,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-15 01:29:55,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-10-15 01:29:55,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-15 01:29:55,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-10-15 01:29:55,326 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 42 [2019-10-15 01:29:55,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:55,327 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-10-15 01:29:55,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-15 01:29:55,327 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-10-15 01:29:55,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-15 01:29:55,328 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:55,329 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:55,533 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:55,534 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:55,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:55,534 INFO L82 PathProgramCache]: Analyzing trace with hash 615727983, now seen corresponding path program 4 times [2019-10-15 01:29:55,535 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:29:55,535 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402969890] [2019-10-15 01:29:55,535 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:55,536 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:55,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:55,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:55,737 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-15 01:29:55,737 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402969890] [2019-10-15 01:29:55,737 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457397205] [2019-10-15 01:29:55,737 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 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-15 01:29:55,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:55,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-15 01:29:55,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:29:55,918 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-15 01:29:55,919 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:29:56,172 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-15 01:29:56,172 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2136835951] [2019-10-15 01:29:56,173 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-15 01:29:56,174 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:29:56,174 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:29:56,174 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:29:56,175 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:29:56,189 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 01:29:57,355 INFO L199 IcfgInterpreter]: Interpreting procedure bAnd with input of size 1 for LOIs [2019-10-15 01:29:57,379 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 01:29:57,382 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:29:57,833 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:29:57,833 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15, 11] total 39 [2019-10-15 01:29:57,834 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521764163] [2019-10-15 01:29:57,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-15 01:29:57,836 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:29:57,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-15 01:29:57,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1125, Unknown=0, NotChecked=0, Total=1560 [2019-10-15 01:29:57,838 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 40 states. [2019-10-15 01:30:01,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:01,082 INFO L93 Difference]: Finished difference Result 68 states and 89 transitions. [2019-10-15 01:30:01,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-15 01:30:01,082 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 49 [2019-10-15 01:30:01,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:01,083 INFO L225 Difference]: With dead ends: 68 [2019-10-15 01:30:01,084 INFO L226 Difference]: Without dead ends: 50 [2019-10-15 01:30:01,087 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1364 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1244, Invalid=4158, Unknown=0, NotChecked=0, Total=5402 [2019-10-15 01:30:01,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-15 01:30:01,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-10-15 01:30:01,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-15 01:30:01,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-10-15 01:30:01,095 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 49 [2019-10-15 01:30:01,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:01,096 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-10-15 01:30:01,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-15 01:30:01,096 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-10-15 01:30:01,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-15 01:30:01,098 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:01,098 INFO L380 BasicCegarLoop]: trace histogram [26, 12, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:30:01,302 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:30:01,304 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:01,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:01,304 INFO L82 PathProgramCache]: Analyzing trace with hash 2121294031, now seen corresponding path program 5 times [2019-10-15 01:30:01,305 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:01,305 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737805390] [2019-10-15 01:30:01,305 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:01,306 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:01,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:01,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:01,746 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-15 01:30:01,746 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737805390] [2019-10-15 01:30:01,746 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519008972] [2019-10-15 01:30:01,747 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:30:01,927 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-15 01:30:01,927 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:30:01,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:30:01,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:30:01,981 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 54 proven. 1 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2019-10-15 01:30:01,981 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:30:02,034 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2019-10-15 01:30:02,034 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1884128888] [2019-10-15 01:30:02,036 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-15 01:30:02,036 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:30:02,037 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:30:02,037 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:30:02,037 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:30:02,078 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 01:30:03,385 INFO L199 IcfgInterpreter]: Interpreting procedure bAnd with input of size 1 for LOIs [2019-10-15 01:30:03,411 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 01:30:03,413 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:30:03,974 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:30:03,974 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 4, 4, 11] total 43 [2019-10-15 01:30:03,974 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104576403] [2019-10-15 01:30:03,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-10-15 01:30:03,975 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:03,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-10-15 01:30:03,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=449, Invalid=1443, Unknown=0, NotChecked=0, Total=1892 [2019-10-15 01:30:03,976 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 44 states. [2019-10-15 01:30:05,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:05,998 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2019-10-15 01:30:05,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-15 01:30:05,998 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 63 [2019-10-15 01:30:05,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:06,000 INFO L225 Difference]: With dead ends: 72 [2019-10-15 01:30:06,000 INFO L226 Difference]: Without dead ends: 54 [2019-10-15 01:30:06,003 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1350 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1349, Invalid=5457, Unknown=0, NotChecked=0, Total=6806 [2019-10-15 01:30:06,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-15 01:30:06,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-10-15 01:30:06,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-15 01:30:06,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-10-15 01:30:06,011 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 63 [2019-10-15 01:30:06,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:06,011 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-10-15 01:30:06,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-10-15 01:30:06,011 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2019-10-15 01:30:06,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-15 01:30:06,012 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:06,013 INFO L380 BasicCegarLoop]: trace histogram [27, 12, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:30:06,216 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:30:06,217 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:06,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:06,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1728770399, now seen corresponding path program 6 times [2019-10-15 01:30:06,218 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:06,218 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048658761] [2019-10-15 01:30:06,219 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:06,219 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:06,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:06,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:06,616 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-10-15 01:30:06,616 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048658761] [2019-10-15 01:30:06,617 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052529624] [2019-10-15 01:30:06,617 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:30:06,819 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-15 01:30:06,819 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:30:06,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-15 01:30:06,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:30:06,838 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-10-15 01:30:06,838 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:30:07,952 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-10-15 01:30:07,953 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [457635730] [2019-10-15 01:30:07,955 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-15 01:30:07,955 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:30:07,955 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:30:07,956 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:30:07,956 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:30:07,971 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 01:30:09,177 INFO L199 IcfgInterpreter]: Interpreting procedure bAnd with input of size 1 for LOIs [2019-10-15 01:30:09,199 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 01:30:09,201 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:30:09,854 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:30:09,854 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30, 11] total 69 [2019-10-15 01:30:09,854 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907827030] [2019-10-15 01:30:09,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-10-15 01:30:09,855 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:09,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-10-15 01:30:09,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1740, Invalid=3090, Unknown=0, NotChecked=0, Total=4830 [2019-10-15 01:30:09,858 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 70 states. [2019-10-15 01:30:17,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:17,242 INFO L93 Difference]: Finished difference Result 104 states and 140 transitions. [2019-10-15 01:30:17,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-10-15 01:30:17,243 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 67 [2019-10-15 01:30:17,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:17,244 INFO L225 Difference]: With dead ends: 104 [2019-10-15 01:30:17,244 INFO L226 Difference]: Without dead ends: 83 [2019-10-15 01:30:17,249 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3928 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=5099, Invalid=12722, Unknown=1, NotChecked=0, Total=17822 [2019-10-15 01:30:17,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-10-15 01:30:17,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-10-15 01:30:17,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-10-15 01:30:17,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2019-10-15 01:30:17,259 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 67 [2019-10-15 01:30:17,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:17,259 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2019-10-15 01:30:17,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-10-15 01:30:17,260 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2019-10-15 01:30:17,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-15 01:30:17,261 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:17,261 INFO L380 BasicCegarLoop]: trace histogram [56, 12, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:30:17,462 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:30:17,463 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:17,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:17,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1695588190, now seen corresponding path program 7 times [2019-10-15 01:30:17,464 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:17,464 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256543925] [2019-10-15 01:30:17,464 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:17,465 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:17,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:17,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat