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/bAnd2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:29:41,072 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:29:41,074 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:29:41,093 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:29:41,093 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:29:41,095 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:29:41,097 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:29:41,106 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:29:41,111 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:29:41,115 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:29:41,117 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:29:41,118 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:29:41,118 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:29:41,120 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:29:41,123 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:29:41,124 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:29:41,126 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:29:41,127 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:29:41,128 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:29:41,133 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:29:41,138 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:29:41,141 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:29:41,144 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:29:41,145 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:29:41,148 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:29:41,148 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:29:41,148 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:29:41,150 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:29:41,151 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:29:41,152 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:29:41,153 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:29:41,153 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:29:41,154 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:29:41,155 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:29:41,156 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:29:41,156 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:29:41,157 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:29:41,157 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:29:41,157 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:29:41,158 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:29:41,159 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:29:41,160 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:41,174 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:29:41,174 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:29:41,175 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:29:41,176 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:29:41,176 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:29:41,176 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:29:41,176 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:29:41,177 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:29:41,177 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:29:41,177 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:29:41,177 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:29:41,177 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:29:41,177 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:29:41,178 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:29:41,178 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:29:41,178 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:29:41,178 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:29:41,179 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:29:41,179 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:29:41,179 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:29:41,179 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:29:41,179 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:29:41,180 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:29:41,180 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:29:41,180 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:29:41,180 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:29:41,180 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:29:41,181 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:29:41,181 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,511 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:29:41,523 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:29:41,526 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:29:41,528 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:29:41,528 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:29:41,529 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/bAnd2.i [2019-10-15 01:29:41,612 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd95dd913/36ef685d22ef4e4e8ff4ed69a7f6a138/FLAG9242b475a [2019-10-15 01:29:42,092 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:29:42,094 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/bAnd2.i [2019-10-15 01:29:42,101 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd95dd913/36ef685d22ef4e4e8ff4ed69a7f6a138/FLAG9242b475a [2019-10-15 01:29:42,494 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd95dd913/36ef685d22ef4e4e8ff4ed69a7f6a138 [2019-10-15 01:29:42,505 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:29:42,507 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:29:42,508 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:29:42,508 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:29:42,511 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:29:42,513 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,516 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47ae0c4d 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,516 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,524 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:29:42,545 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:29:42,741 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:29:42,750 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:29:42,771 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:29:42,785 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:29:42,786 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,786 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:29:42,786 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:29:42,786 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:29:42,787 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:29:42,886 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,887 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,897 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,899 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,916 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,924 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,926 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,928 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:29:42,929 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:29:42,929 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:29:42,929 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:29:42,930 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,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:29:42,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:29:42,985 INFO L138 BoogieDeclarations]: Found implementation of procedure bAnd [2019-10-15 01:29:42,985 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:29:42,986 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:29:42,986 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:29:42,986 INFO L130 BoogieDeclarations]: Found specification of procedure bAnd [2019-10-15 01:29:42,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 01:29:42,988 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:29:42,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 01:29:42,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 01:29:42,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 01:29:42,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:29:42,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:29:43,358 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:29:43,359 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-15 01:29:43,360 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,360 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:29:43,361 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:29:43,362 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:29:43,365 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:29:43,365 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,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19ab6b41 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,366 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,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19ab6b41 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,367 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,368 INFO L109 eAbstractionObserver]: Analyzing ICFG bAnd2.i [2019-10-15 01:29:43,386 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:29:43,393 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:29:43,404 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:29:43,426 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:29:43,426 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:29:43,426 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:29:43,427 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:29:43,427 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:29:43,427 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:29:43,427 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:29:43,428 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:29:43,446 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-10-15 01:29:43,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-15 01:29:43,454 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:43,455 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,457 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:43,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:43,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1674969442, now seen corresponding path program 1 times [2019-10-15 01:29:43,472 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:29:43,473 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999609834] [2019-10-15 01:29:43,473 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:43,473 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:43,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:43,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:43,648 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,649 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999609834] [2019-10-15 01:29:43,650 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:43,650 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:29:43,651 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445386326] [2019-10-15 01:29:43,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:29:43,656 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:29:43,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:29:43,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:29:43,674 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2019-10-15 01:29:43,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:43,712 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2019-10-15 01:29:43,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:29:43,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-15 01:29:43,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:43,724 INFO L225 Difference]: With dead ends: 41 [2019-10-15 01:29:43,724 INFO L226 Difference]: Without dead ends: 20 [2019-10-15 01:29:43,728 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,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-15 01:29:43,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-15 01:29:43,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-15 01:29:43,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-10-15 01:29:43,775 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 24 [2019-10-15 01:29:43,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:43,776 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-10-15 01:29:43,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:29:43,776 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2019-10-15 01:29:43,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-15 01:29:43,778 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:43,779 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,779 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:43,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:43,780 INFO L82 PathProgramCache]: Analyzing trace with hash -2035795135, now seen corresponding path program 1 times [2019-10-15 01:29:43,780 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:29:43,780 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369520512] [2019-10-15 01:29:43,781 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:43,781 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:43,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:43,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:43,953 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,954 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369520512] [2019-10-15 01:29:43,955 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125744804] [2019-10-15 01:29:43,955 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:44,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:44,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 01:29:44,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:29:44,134 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:44,134 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:29:44,186 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:44,186 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:29:44,186 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2019-10-15 01:29:44,187 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028263443] [2019-10-15 01:29:44,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:29:44,189 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:29:44,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:29:44,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:44,190 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 3 states. [2019-10-15 01:29:44,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:44,204 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2019-10-15 01:29:44,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:29:44,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-15 01:29:44,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:44,206 INFO L225 Difference]: With dead ends: 33 [2019-10-15 01:29:44,206 INFO L226 Difference]: Without dead ends: 21 [2019-10-15 01:29:44,208 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:44,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-15 01:29:44,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-15 01:29:44,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-15 01:29:44,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-10-15 01:29:44,219 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 25 [2019-10-15 01:29:44,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:44,219 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-10-15 01:29:44,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:29:44,221 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-10-15 01:29:44,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-15 01:29:44,223 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:44,224 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,424 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:44,425 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:44,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:44,427 INFO L82 PathProgramCache]: Analyzing trace with hash -629127273, now seen corresponding path program 1 times [2019-10-15 01:29:44,427 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:29:44,427 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045940016] [2019-10-15 01:29:44,427 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:44,428 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:44,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:44,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:44,554 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,555 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045940016] [2019-10-15 01:29:44,555 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:44,555 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:29:44,556 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380125921] [2019-10-15 01:29:44,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:29:44,556 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:29:44,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:29:44,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:29:44,558 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 3 states. [2019-10-15 01:29:44,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:44,576 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2019-10-15 01:29:44,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:29:44,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-15 01:29:44,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:44,579 INFO L225 Difference]: With dead ends: 31 [2019-10-15 01:29:44,579 INFO L226 Difference]: Without dead ends: 22 [2019-10-15 01:29:44,580 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,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-15 01:29:44,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-15 01:29:44,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-15 01:29:44,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-10-15 01:29:44,593 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 28 [2019-10-15 01:29:44,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:44,598 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-10-15 01:29:44,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:29:44,598 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-10-15 01:29:44,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-15 01:29:44,605 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:44,605 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,606 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:44,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:44,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1942163656, now seen corresponding path program 1 times [2019-10-15 01:29:44,607 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:29:44,607 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403687571] [2019-10-15 01:29:44,607 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:44,607 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:44,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:44,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:44,737 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,738 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403687571] [2019-10-15 01:29:44,738 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168002168] [2019-10-15 01:29:44,738 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,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:44,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:29:44,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:29:44,855 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,856 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:29:44,901 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,902 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [939091039] [2019-10-15 01:29:44,935 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-15 01:29:44,935 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:29:44,944 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:29:44,958 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:29:44,959 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:29:45,112 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 01:29:47,266 INFO L199 IcfgInterpreter]: Interpreting procedure bAnd with input of size 1 for LOIs [2019-10-15 01:29:47,326 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 01:29:47,331 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:29:47,720 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:29:47,720 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 17 [2019-10-15 01:29:47,720 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047477164] [2019-10-15 01:29:47,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-15 01:29:47,723 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:29:47,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-15 01:29:47,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-10-15 01:29:47,725 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 18 states. [2019-10-15 01:29:48,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:48,529 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2019-10-15 01:29:48,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-15 01:29:48,530 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 29 [2019-10-15 01:29:48,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:48,533 INFO L225 Difference]: With dead ends: 40 [2019-10-15 01:29:48,533 INFO L226 Difference]: Without dead ends: 25 [2019-10-15 01:29:48,535 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,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-15 01:29:48,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-10-15 01:29:48,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-15 01:29:48,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-10-15 01:29:48,546 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 29 [2019-10-15 01:29:48,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:48,547 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-10-15 01:29:48,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-15 01:29:48,547 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-10-15 01:29:48,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-15 01:29:48,548 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:48,551 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,768 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:48,769 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:48,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:48,770 INFO L82 PathProgramCache]: Analyzing trace with hash 143191253, now seen corresponding path program 2 times [2019-10-15 01:29:48,770 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:29:48,770 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366608143] [2019-10-15 01:29:48,771 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:48,771 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:48,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:48,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:48,896 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,897 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366608143] [2019-10-15 01:29:48,897 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19852768] [2019-10-15 01:29:48,897 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,971 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-15 01:29:48,971 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:29:48,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:29:48,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:29:49,002 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:49,004 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:29:49,037 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:49,037 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1987296419] [2019-10-15 01:29:49,041 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-15 01:29:49,043 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:29:49,044 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:29:49,044 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:29:49,044 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:29:49,068 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 01:29:50,558 INFO L199 IcfgInterpreter]: Interpreting procedure bAnd with input of size 1 for LOIs [2019-10-15 01:29:50,598 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 01:29:50,603 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:29:50,949 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:29:50,950 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4, 11] total 21 [2019-10-15 01:29:50,950 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353769388] [2019-10-15 01:29:50,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-15 01:29:50,952 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:29:50,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-15 01:29:50,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2019-10-15 01:29:50,953 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 22 states. [2019-10-15 01:29:51,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:51,894 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2019-10-15 01:29:51,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-15 01:29:51,895 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 32 [2019-10-15 01:29:51,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:51,896 INFO L225 Difference]: With dead ends: 44 [2019-10-15 01:29:51,896 INFO L226 Difference]: Without dead ends: 29 [2019-10-15 01:29:51,897 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,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-15 01:29:51,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-10-15 01:29:51,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-15 01:29:51,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-10-15 01:29:51,904 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 32 [2019-10-15 01:29:51,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:51,904 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-10-15 01:29:51,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-15 01:29:51,904 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-10-15 01:29:51,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-15 01:29:51,906 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:51,906 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:52,109 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:52,110 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:52,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:52,111 INFO L82 PathProgramCache]: Analyzing trace with hash 766317228, now seen corresponding path program 3 times [2019-10-15 01:29:52,111 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:29:52,111 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932333698] [2019-10-15 01:29:52,112 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:52,112 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:52,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:52,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:52,218 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,218 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932333698] [2019-10-15 01:29:52,219 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131168325] [2019-10-15 01:29:52,219 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:52,321 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-15 01:29:52,322 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:29:52,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-15 01:29:52,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:29:52,338 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,338 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:29:52,436 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,436 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [914923045] [2019-10-15 01:29:52,438 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-15 01:29:52,438 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:29:52,439 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:29:52,440 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:29:52,440 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:29:52,479 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 01:29:54,123 INFO L199 IcfgInterpreter]: Interpreting procedure bAnd with input of size 1 for LOIs [2019-10-15 01:29:54,146 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 01:29:54,149 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:29:54,484 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:29:54,485 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 11] total 25 [2019-10-15 01:29:54,485 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977423260] [2019-10-15 01:29:54,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-15 01:29:54,486 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:29:54,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-15 01:29:54,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2019-10-15 01:29:54,487 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 26 states. [2019-10-15 01:29:55,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:55,397 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2019-10-15 01:29:55,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-15 01:29:55,397 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 42 [2019-10-15 01:29:55,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:55,399 INFO L225 Difference]: With dead ends: 54 [2019-10-15 01:29:55,399 INFO L226 Difference]: Without dead ends: 36 [2019-10-15 01:29:55,400 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=369, Invalid=1701, Unknown=0, NotChecked=0, Total=2070 [2019-10-15 01:29:55,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-15 01:29:55,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-10-15 01:29:55,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-15 01:29:55,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-10-15 01:29:55,408 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 42 [2019-10-15 01:29:55,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:55,409 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-10-15 01:29:55,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-15 01:29:55,409 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-10-15 01:29:55,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-15 01:29:55,410 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:55,411 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,614 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:55,614 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:55,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:55,615 INFO L82 PathProgramCache]: Analyzing trace with hash 615727983, now seen corresponding path program 4 times [2019-10-15 01:29:55,615 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:29:55,616 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356767493] [2019-10-15 01:29:55,616 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:55,616 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:55,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:55,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:55,786 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,787 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356767493] [2019-10-15 01:29:55,787 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903356726] [2019-10-15 01:29:55,787 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,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:55,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-15 01:29:55,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:29:55,942 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,943 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:29:56,306 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,307 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1879281558] [2019-10-15 01:29:56,311 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-15 01:29:56,312 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:29:56,312 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:29:56,313 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:29:56,314 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:29:56,343 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 01:29:57,602 INFO L199 IcfgInterpreter]: Interpreting procedure bAnd with input of size 1 for LOIs [2019-10-15 01:29:57,622 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 01:29:57,625 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:29:58,045 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:29:58,045 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15, 11] total 39 [2019-10-15 01:29:58,045 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558905976] [2019-10-15 01:29:58,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-15 01:29:58,047 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:29:58,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-15 01:29:58,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1125, Unknown=0, NotChecked=0, Total=1560 [2019-10-15 01:29:58,048 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 40 states. [2019-10-15 01:29:59,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:59,577 INFO L93 Difference]: Finished difference Result 68 states and 89 transitions. [2019-10-15 01:29:59,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-15 01:29:59,577 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 49 [2019-10-15 01:29:59,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:59,578 INFO L225 Difference]: With dead ends: 68 [2019-10-15 01:29:59,578 INFO L226 Difference]: Without dead ends: 50 [2019-10-15 01:29:59,581 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1364 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1244, Invalid=4158, Unknown=0, NotChecked=0, Total=5402 [2019-10-15 01:29:59,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-15 01:29:59,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-10-15 01:29:59,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-15 01:29:59,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-10-15 01:29:59,592 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 49 [2019-10-15 01:29:59,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:59,592 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-10-15 01:29:59,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-15 01:29:59,593 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-10-15 01:29:59,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-15 01:29:59,595 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:59,595 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:29:59,811 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:59,812 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:59,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:59,812 INFO L82 PathProgramCache]: Analyzing trace with hash 2121294031, now seen corresponding path program 5 times [2019-10-15 01:29:59,812 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:29:59,812 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376565251] [2019-10-15 01:29:59,813 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:59,813 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:59,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:59,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:00,269 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:00,269 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376565251] [2019-10-15 01:30:00,270 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203857006] [2019-10-15 01:30:00,270 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:00,445 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-15 01:30:00,446 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:30:00,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:30:00,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:30:00,496 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:00,496 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:30:00,551 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:00,551 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [909136282] [2019-10-15 01:30:00,553 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-15 01:30:00,553 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:30:00,554 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:30:00,554 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:30:00,554 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:30:00,570 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 01:30:01,804 INFO L199 IcfgInterpreter]: Interpreting procedure bAnd with input of size 1 for LOIs [2019-10-15 01:30:01,829 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 01:30:01,832 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:30:02,314 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:30:02,314 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 4, 4, 11] total 43 [2019-10-15 01:30:02,315 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162858999] [2019-10-15 01:30:02,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-10-15 01:30:02,316 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:02,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-10-15 01:30:02,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=449, Invalid=1443, Unknown=0, NotChecked=0, Total=1892 [2019-10-15 01:30:02,318 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 44 states. [2019-10-15 01:30:06,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:06,455 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2019-10-15 01:30:06,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-15 01:30:06,456 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 63 [2019-10-15 01:30:06,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:06,457 INFO L225 Difference]: With dead ends: 72 [2019-10-15 01:30:06,457 INFO L226 Difference]: Without dead ends: 54 [2019-10-15 01:30:06,460 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1350 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1349, Invalid=5457, Unknown=0, NotChecked=0, Total=6806 [2019-10-15 01:30:06,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-15 01:30:06,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-10-15 01:30:06,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-15 01:30:06,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-10-15 01:30:06,469 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 63 [2019-10-15 01:30:06,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:06,469 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-10-15 01:30:06,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-10-15 01:30:06,469 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2019-10-15 01:30:06,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-15 01:30:06,471 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:06,471 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,674 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:30:06,674 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:06,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:06,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1728770399, now seen corresponding path program 6 times [2019-10-15 01:30:06,675 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:06,675 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586742352] [2019-10-15 01:30:06,676 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:06,676 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:06,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:06,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:07,099 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,099 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586742352] [2019-10-15 01:30:07,099 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612166609] [2019-10-15 01:30:07,100 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:07,344 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-15 01:30:07,344 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:30:07,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-15 01:30:07,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:30:07,365 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,365 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:30:08,322 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:08,322 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1055696823] [2019-10-15 01:30:08,324 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-15 01:30:08,324 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:30:08,324 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:30:08,324 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:30:08,325 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:30:08,342 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 01:30:09,494 INFO L199 IcfgInterpreter]: Interpreting procedure bAnd with input of size 1 for LOIs [2019-10-15 01:30:09,515 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 01:30:09,518 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:30:12,148 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:30:12,149 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30, 11] total 69 [2019-10-15 01:30:12,149 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370293832] [2019-10-15 01:30:12,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-10-15 01:30:12,150 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:12,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-10-15 01:30:12,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1740, Invalid=3089, Unknown=1, NotChecked=0, Total=4830 [2019-10-15 01:30:12,153 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 70 states. [2019-10-15 01:30:17,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:17,990 INFO L93 Difference]: Finished difference Result 104 states and 140 transitions. [2019-10-15 01:30:17,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-10-15 01:30:17,990 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 67 [2019-10-15 01:30:17,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:17,991 INFO L225 Difference]: With dead ends: 104 [2019-10-15 01:30:17,991 INFO L226 Difference]: Without dead ends: 83 [2019-10-15 01:30:17,996 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3929 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=5099, Invalid=12722, Unknown=1, NotChecked=0, Total=17822 [2019-10-15 01:30:17,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-10-15 01:30:18,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-10-15 01:30:18,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-10-15 01:30:18,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2019-10-15 01:30:18,007 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 67 [2019-10-15 01:30:18,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:18,007 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2019-10-15 01:30:18,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-10-15 01:30:18,008 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2019-10-15 01:30:18,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-15 01:30:18,009 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:18,009 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:18,213 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:30:18,214 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:18,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:18,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1695588190, now seen corresponding path program 7 times [2019-10-15 01:30:18,215 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:18,215 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741970326] [2019-10-15 01:30:18,215 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:18,216 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:18,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:18,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat