/usr/bin/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/systemc/toy1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 04:52:09,552 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 04:52:09,555 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 04:52:09,568 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 04:52:09,568 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 04:52:09,570 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 04:52:09,571 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 04:52:09,574 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 04:52:09,584 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 04:52:09,586 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 04:52:09,587 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 04:52:09,589 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 04:52:09,589 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 04:52:09,592 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 04:52:09,594 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 04:52:09,596 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 04:52:09,597 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 04:52:09,600 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 04:52:09,602 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 04:52:09,608 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 04:52:09,612 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 04:52:09,615 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 04:52:09,618 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 04:52:09,618 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 04:52:09,621 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 04:52:09,622 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 04:52:09,622 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 04:52:09,624 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 04:52:09,624 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 04:52:09,626 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 04:52:09,626 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 04:52:09,627 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 04:52:09,627 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 04:52:09,628 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 04:52:09,629 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 04:52:09,629 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 04:52:09,630 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 04:52:09,630 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 04:52:09,630 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 04:52:09,631 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 04:52:09,632 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 04:52:09,632 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-11-07 04:52:09,649 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 04:52:09,653 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 04:52:09,655 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 04:52:09,655 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 04:52:09,656 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 04:52:09,656 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 04:52:09,656 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 04:52:09,656 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 04:52:09,656 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 04:52:09,657 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 04:52:09,657 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 04:52:09,657 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 04:52:09,657 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 04:52:09,657 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 04:52:09,658 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 04:52:09,658 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 04:52:09,658 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 04:52:09,658 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 04:52:09,658 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 04:52:09,659 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 04:52:09,659 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 04:52:09,659 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 04:52:09,659 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 04:52:09,659 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 04:52:09,660 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 04:52:09,660 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 04:52:09,660 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 04:52:09,660 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 04:52:09,660 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-11-07 04:52:09,951 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 04:52:09,972 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 04:52:09,975 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 04:52:09,977 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 04:52:09,977 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 04:52:09,978 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/toy1.cil.c [2019-11-07 04:52:10,053 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e23eac0a6/5cdcfc5d499b4ee796f8a077045b8bbd/FLAG1db8e06c6 [2019-11-07 04:52:10,589 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 04:52:10,590 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/toy1.cil.c [2019-11-07 04:52:10,605 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e23eac0a6/5cdcfc5d499b4ee796f8a077045b8bbd/FLAG1db8e06c6 [2019-11-07 04:52:10,977 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e23eac0a6/5cdcfc5d499b4ee796f8a077045b8bbd [2019-11-07 04:52:10,995 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 04:52:10,999 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 04:52:11,010 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 04:52:11,010 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 04:52:11,019 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 04:52:11,020 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:52:10" (1/1) ... [2019-11-07 04:52:11,023 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b4092cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:52:11, skipping insertion in model container [2019-11-07 04:52:11,032 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:52:10" (1/1) ... [2019-11-07 04:52:11,046 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 04:52:11,146 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 04:52:11,430 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 04:52:11,437 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 04:52:11,582 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 04:52:11,597 INFO L192 MainTranslator]: Completed translation [2019-11-07 04:52:11,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:52:11 WrapperNode [2019-11-07 04:52:11,598 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 04:52:11,598 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 04:52:11,598 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 04:52:11,598 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 04:52:11,608 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:52:11" (1/1) ... [2019-11-07 04:52:11,608 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:52:11" (1/1) ... [2019-11-07 04:52:11,616 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:52:11" (1/1) ... [2019-11-07 04:52:11,616 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:52:11" (1/1) ... [2019-11-07 04:52:11,628 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:52:11" (1/1) ... [2019-11-07 04:52:11,643 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:52:11" (1/1) ... [2019-11-07 04:52:11,646 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:52:11" (1/1) ... [2019-11-07 04:52:11,650 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 04:52:11,651 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 04:52:11,651 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 04:52:11,651 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 04:52:11,652 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:52:11" (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-11-07 04:52:11,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 04:52:11,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 04:52:11,715 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-11-07 04:52:11,715 INFO L138 BoogieDeclarations]: Found implementation of procedure write_loop [2019-11-07 04:52:11,715 INFO L138 BoogieDeclarations]: Found implementation of procedure compute1 [2019-11-07 04:52:11,716 INFO L138 BoogieDeclarations]: Found implementation of procedure compute2 [2019-11-07 04:52:11,716 INFO L138 BoogieDeclarations]: Found implementation of procedure write_back [2019-11-07 04:52:11,716 INFO L138 BoogieDeclarations]: Found implementation of procedure read [2019-11-07 04:52:11,717 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-11-07 04:52:11,717 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-11-07 04:52:11,717 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 04:52:11,717 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 04:52:11,717 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 04:52:11,718 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-11-07 04:52:11,718 INFO L130 BoogieDeclarations]: Found specification of procedure write_loop [2019-11-07 04:52:11,718 INFO L130 BoogieDeclarations]: Found specification of procedure compute1 [2019-11-07 04:52:11,718 INFO L130 BoogieDeclarations]: Found specification of procedure compute2 [2019-11-07 04:52:11,718 INFO L130 BoogieDeclarations]: Found specification of procedure write_back [2019-11-07 04:52:11,718 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-11-07 04:52:11,719 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-11-07 04:52:11,719 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-11-07 04:52:11,719 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 04:52:11,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 04:52:11,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 04:52:13,145 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 04:52:13,146 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-07 04:52:13,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:52:13 BoogieIcfgContainer [2019-11-07 04:52:13,147 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 04:52:13,149 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 04:52:13,149 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 04:52:13,153 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 04:52:13,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:52:10" (1/3) ... [2019-11-07 04:52:13,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e762c76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:52:13, skipping insertion in model container [2019-11-07 04:52:13,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:52:11" (2/3) ... [2019-11-07 04:52:13,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e762c76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:52:13, skipping insertion in model container [2019-11-07 04:52:13,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:52:13" (3/3) ... [2019-11-07 04:52:13,166 INFO L109 eAbstractionObserver]: Analyzing ICFG toy1.cil.c [2019-11-07 04:52:13,176 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 04:52:13,185 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 04:52:13,197 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 04:52:13,223 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 04:52:13,224 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 04:52:13,224 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 04:52:13,224 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 04:52:13,224 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 04:52:13,224 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 04:52:13,225 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 04:52:13,225 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 04:52:13,245 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states. [2019-11-07 04:52:13,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-07 04:52:13,252 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:52:13,253 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:52:13,255 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:52:13,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:52:13,259 INFO L82 PathProgramCache]: Analyzing trace with hash -853662082, now seen corresponding path program 1 times [2019-11-07 04:52:13,268 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:52:13,269 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366905476] [2019-11-07 04:52:13,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:52:13,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:52:13,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:52:13,660 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366905476] [2019-11-07 04:52:13,661 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:52:13,662 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:52:13,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448273737] [2019-11-07 04:52:13,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:52:13,671 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:52:13,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:52:13,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:52:13,688 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 3 states. [2019-11-07 04:52:13,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:52:13,848 INFO L93 Difference]: Finished difference Result 208 states and 309 transitions. [2019-11-07 04:52:13,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:52:13,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-07 04:52:13,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:52:13,877 INFO L225 Difference]: With dead ends: 208 [2019-11-07 04:52:13,877 INFO L226 Difference]: Without dead ends: 126 [2019-11-07 04:52:13,886 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-11-07 04:52:13,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-11-07 04:52:13,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2019-11-07 04:52:13,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-11-07 04:52:13,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 182 transitions. [2019-11-07 04:52:14,002 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 182 transitions. Word has length 25 [2019-11-07 04:52:14,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:52:14,004 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 182 transitions. [2019-11-07 04:52:14,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:52:14,004 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 182 transitions. [2019-11-07 04:52:14,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-07 04:52:14,012 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:52:14,013 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:52:14,013 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:52:14,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:52:14,014 INFO L82 PathProgramCache]: Analyzing trace with hash -890517348, now seen corresponding path program 1 times [2019-11-07 04:52:14,014 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:52:14,014 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899760672] [2019-11-07 04:52:14,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:52:14,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:52:14,159 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:52:14,162 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899760672] [2019-11-07 04:52:14,162 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:52:14,162 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:52:14,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121557392] [2019-11-07 04:52:14,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:52:14,166 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:52:14,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:52:14,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:52:14,169 INFO L87 Difference]: Start difference. First operand 125 states and 182 transitions. Second operand 5 states. [2019-11-07 04:52:14,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:52:14,754 INFO L93 Difference]: Finished difference Result 478 states and 795 transitions. [2019-11-07 04:52:14,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-07 04:52:14,755 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-11-07 04:52:14,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:52:14,762 INFO L225 Difference]: With dead ends: 478 [2019-11-07 04:52:14,762 INFO L226 Difference]: Without dead ends: 361 [2019-11-07 04:52:14,771 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-07 04:52:14,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-11-07 04:52:14,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 344. [2019-11-07 04:52:14,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-11-07 04:52:14,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 562 transitions. [2019-11-07 04:52:14,865 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 562 transitions. Word has length 41 [2019-11-07 04:52:14,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:52:14,866 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 562 transitions. [2019-11-07 04:52:14,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:52:14,866 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 562 transitions. [2019-11-07 04:52:14,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-07 04:52:14,877 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:52:14,878 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:52:14,878 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:52:14,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:52:14,879 INFO L82 PathProgramCache]: Analyzing trace with hash -497151362, now seen corresponding path program 1 times [2019-11-07 04:52:14,879 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:52:14,879 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055063673] [2019-11-07 04:52:14,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:52:14,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:52:15,050 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-07 04:52:15,053 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055063673] [2019-11-07 04:52:15,053 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944239269] [2019-11-07 04:52:15,054 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-11-07 04:52:15,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:52:15,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 708 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-07 04:52:15,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 04:52:15,278 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-07 04:52:15,278 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 04:52:15,313 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-07 04:52:15,313 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-07 04:52:15,314 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7, 3] total 9 [2019-11-07 04:52:15,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679052242] [2019-11-07 04:52:15,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:52:15,315 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:52:15,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:52:15,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-07 04:52:15,315 INFO L87 Difference]: Start difference. First operand 344 states and 562 transitions. Second operand 3 states. [2019-11-07 04:52:15,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:52:15,397 INFO L93 Difference]: Finished difference Result 769 states and 1271 transitions. [2019-11-07 04:52:15,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:52:15,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-11-07 04:52:15,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:52:15,406 INFO L225 Difference]: With dead ends: 769 [2019-11-07 04:52:15,406 INFO L226 Difference]: Without dead ends: 435 [2019-11-07 04:52:15,408 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-07 04:52:15,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-11-07 04:52:15,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 408. [2019-11-07 04:52:15,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-07 04:52:15,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 660 transitions. [2019-11-07 04:52:15,466 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 660 transitions. Word has length 55 [2019-11-07 04:52:15,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:52:15,467 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 660 transitions. [2019-11-07 04:52:15,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:52:15,468 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 660 transitions. [2019-11-07 04:52:15,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-07 04:52:15,471 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:52:15,471 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:52:15,675 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 04:52:15,676 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:52:15,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:52:15,677 INFO L82 PathProgramCache]: Analyzing trace with hash -602034395, now seen corresponding path program 1 times [2019-11-07 04:52:15,677 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:52:15,678 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170571969] [2019-11-07 04:52:15,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:52:15,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:52:15,786 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-07 04:52:15,787 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170571969] [2019-11-07 04:52:15,787 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466434902] [2019-11-07 04:52:15,787 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-11-07 04:52:15,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:52:15,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 784 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-07 04:52:15,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 04:52:15,971 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-07 04:52:15,971 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 04:52:16,032 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-07 04:52:16,033 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-07 04:52:16,033 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8, 4] total 10 [2019-11-07 04:52:16,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716309882] [2019-11-07 04:52:16,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:52:16,034 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:52:16,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:52:16,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-07 04:52:16,035 INFO L87 Difference]: Start difference. First operand 408 states and 660 transitions. Second operand 3 states. [2019-11-07 04:52:16,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:52:16,096 INFO L93 Difference]: Finished difference Result 992 states and 1593 transitions. [2019-11-07 04:52:16,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:52:16,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-11-07 04:52:16,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:52:16,101 INFO L225 Difference]: With dead ends: 992 [2019-11-07 04:52:16,101 INFO L226 Difference]: Without dead ends: 594 [2019-11-07 04:52:16,104 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 135 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-07 04:52:16,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-11-07 04:52:16,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 555. [2019-11-07 04:52:16,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-11-07 04:52:16,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 868 transitions. [2019-11-07 04:52:16,142 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 868 transitions. Word has length 69 [2019-11-07 04:52:16,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:52:16,142 INFO L462 AbstractCegarLoop]: Abstraction has 555 states and 868 transitions. [2019-11-07 04:52:16,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:52:16,143 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 868 transitions. [2019-11-07 04:52:16,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-07 04:52:16,145 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:52:16,145 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:52:16,358 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 04:52:16,358 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:52:16,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:52:16,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1445071072, now seen corresponding path program 1 times [2019-11-07 04:52:16,360 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:52:16,360 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811626468] [2019-11-07 04:52:16,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:52:16,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:52:16,427 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-07 04:52:16,427 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811626468] [2019-11-07 04:52:16,428 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:52:16,428 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 04:52:16,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385838609] [2019-11-07 04:52:16,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 04:52:16,431 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:52:16,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 04:52:16,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 04:52:16,432 INFO L87 Difference]: Start difference. First operand 555 states and 868 transitions. Second operand 4 states. [2019-11-07 04:52:16,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:52:16,608 INFO L93 Difference]: Finished difference Result 1528 states and 2451 transitions. [2019-11-07 04:52:16,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:52:16,609 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-11-07 04:52:16,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:52:16,616 INFO L225 Difference]: With dead ends: 1528 [2019-11-07 04:52:16,616 INFO L226 Difference]: Without dead ends: 983 [2019-11-07 04:52:16,620 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:52:16,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2019-11-07 04:52:16,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 979. [2019-11-07 04:52:16,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 979 states. [2019-11-07 04:52:16,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 1526 transitions. [2019-11-07 04:52:16,701 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 1526 transitions. Word has length 70 [2019-11-07 04:52:16,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:52:16,701 INFO L462 AbstractCegarLoop]: Abstraction has 979 states and 1526 transitions. [2019-11-07 04:52:16,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 04:52:16,702 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1526 transitions. [2019-11-07 04:52:16,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-07 04:52:16,705 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:52:16,706 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:52:16,706 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:52:16,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:52:16,706 INFO L82 PathProgramCache]: Analyzing trace with hash 456248088, now seen corresponding path program 1 times [2019-11-07 04:52:16,707 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:52:16,707 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410391180] [2019-11-07 04:52:16,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:52:16,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:52:16,854 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 22 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-07 04:52:16,854 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410391180] [2019-11-07 04:52:16,855 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740067040] [2019-11-07 04:52:16,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-11-07 04:52:16,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:52:17,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-07 04:52:17,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 04:52:17,027 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:52:17,027 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 04:52:17,063 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-07 04:52:17,064 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-07 04:52:17,064 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12, 3] total 14 [2019-11-07 04:52:17,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67519784] [2019-11-07 04:52:17,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:52:17,072 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:52:17,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:52:17,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-11-07 04:52:17,073 INFO L87 Difference]: Start difference. First operand 979 states and 1526 transitions. Second operand 3 states. [2019-11-07 04:52:17,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:52:17,175 INFO L93 Difference]: Finished difference Result 1939 states and 3006 transitions. [2019-11-07 04:52:17,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:52:17,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-11-07 04:52:17,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:52:17,183 INFO L225 Difference]: With dead ends: 1939 [2019-11-07 04:52:17,183 INFO L226 Difference]: Without dead ends: 970 [2019-11-07 04:52:17,191 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-11-07 04:52:17,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2019-11-07 04:52:17,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 941. [2019-11-07 04:52:17,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 941 states. [2019-11-07 04:52:17,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1389 transitions. [2019-11-07 04:52:17,259 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1389 transitions. Word has length 72 [2019-11-07 04:52:17,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:52:17,260 INFO L462 AbstractCegarLoop]: Abstraction has 941 states and 1389 transitions. [2019-11-07 04:52:17,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:52:17,260 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1389 transitions. [2019-11-07 04:52:17,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-07 04:52:17,265 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:52:17,265 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:52:17,478 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 04:52:17,479 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:52:17,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:52:17,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1626708363, now seen corresponding path program 1 times [2019-11-07 04:52:17,479 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:52:17,480 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219314406] [2019-11-07 04:52:17,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:52:17,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:52:17,636 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-11-07 04:52:17,637 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219314406] [2019-11-07 04:52:17,637 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:52:17,637 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:52:17,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872437883] [2019-11-07 04:52:17,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:52:17,638 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:52:17,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:52:17,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:52:17,639 INFO L87 Difference]: Start difference. First operand 941 states and 1389 transitions. Second operand 3 states. [2019-11-07 04:52:17,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:52:17,695 INFO L93 Difference]: Finished difference Result 948 states and 1399 transitions. [2019-11-07 04:52:17,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:52:17,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-11-07 04:52:17,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:52:17,702 INFO L225 Difference]: With dead ends: 948 [2019-11-07 04:52:17,703 INFO L226 Difference]: Without dead ends: 945 [2019-11-07 04:52:17,704 INFO L630 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-11-07 04:52:17,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2019-11-07 04:52:17,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 945. [2019-11-07 04:52:17,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945 states. [2019-11-07 04:52:17,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1393 transitions. [2019-11-07 04:52:17,755 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1393 transitions. Word has length 82 [2019-11-07 04:52:17,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:52:17,756 INFO L462 AbstractCegarLoop]: Abstraction has 945 states and 1393 transitions. [2019-11-07 04:52:17,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:52:17,756 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1393 transitions. [2019-11-07 04:52:17,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-07 04:52:17,761 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:52:17,761 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:52:17,761 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:52:17,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:52:17,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1626655570, now seen corresponding path program 1 times [2019-11-07 04:52:17,762 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:52:17,762 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833717793] [2019-11-07 04:52:17,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:52:17,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:52:18,194 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 17 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-07 04:52:18,195 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833717793] [2019-11-07 04:52:18,195 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704811931] [2019-11-07 04:52:18,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 04:52:18,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:52:18,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 891 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-07 04:52:18,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 04:52:18,587 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-07 04:52:18,588 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 04:52:18,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:52:18,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:52:18,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:52:18,802 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 28 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-07 04:52:18,802 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-07 04:52:18,803 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [16, 6] total 26 [2019-11-07 04:52:18,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840620932] [2019-11-07 04:52:18,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 04:52:18,804 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:52:18,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 04:52:18,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2019-11-07 04:52:18,805 INFO L87 Difference]: Start difference. First operand 945 states and 1393 transitions. Second operand 9 states. [2019-11-07 04:52:19,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:52:19,864 INFO L93 Difference]: Finished difference Result 4167 states and 6469 transitions. [2019-11-07 04:52:19,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-07 04:52:19,865 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2019-11-07 04:52:19,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:52:19,894 INFO L225 Difference]: With dead ends: 4167 [2019-11-07 04:52:19,894 INFO L226 Difference]: Without dead ends: 3232 [2019-11-07 04:52:19,905 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=146, Invalid=976, Unknown=0, NotChecked=0, Total=1122 [2019-11-07 04:52:19,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3232 states. [2019-11-07 04:52:20,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3232 to 3043. [2019-11-07 04:52:20,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3043 states. [2019-11-07 04:52:20,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3043 states to 3043 states and 4534 transitions. [2019-11-07 04:52:20,109 INFO L78 Accepts]: Start accepts. Automaton has 3043 states and 4534 transitions. Word has length 82 [2019-11-07 04:52:20,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:52:20,109 INFO L462 AbstractCegarLoop]: Abstraction has 3043 states and 4534 transitions. [2019-11-07 04:52:20,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 04:52:20,109 INFO L276 IsEmpty]: Start isEmpty. Operand 3043 states and 4534 transitions. [2019-11-07 04:52:20,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-07 04:52:20,132 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:52:20,132 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:52:20,338 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 04:52:20,339 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:52:20,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:52:20,339 INFO L82 PathProgramCache]: Analyzing trace with hash -828517937, now seen corresponding path program 1 times [2019-11-07 04:52:20,339 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:52:20,340 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161954712] [2019-11-07 04:52:20,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:52:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:52:20,396 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-07 04:52:20,396 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161954712] [2019-11-07 04:52:20,396 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:52:20,396 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:52:20,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006954826] [2019-11-07 04:52:20,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:52:20,397 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:52:20,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:52:20,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:52:20,398 INFO L87 Difference]: Start difference. First operand 3043 states and 4534 transitions. Second operand 3 states. [2019-11-07 04:52:20,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:52:20,602 INFO L93 Difference]: Finished difference Result 7258 states and 10962 transitions. [2019-11-07 04:52:20,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:52:20,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-11-07 04:52:20,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:52:20,635 INFO L225 Difference]: With dead ends: 7258 [2019-11-07 04:52:20,635 INFO L226 Difference]: Without dead ends: 4228 [2019-11-07 04:52:20,721 INFO L630 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-11-07 04:52:20,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4228 states. [2019-11-07 04:52:21,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4228 to 4206. [2019-11-07 04:52:21,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4206 states. [2019-11-07 04:52:21,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4206 states to 4206 states and 6152 transitions. [2019-11-07 04:52:21,043 INFO L78 Accepts]: Start accepts. Automaton has 4206 states and 6152 transitions. Word has length 92 [2019-11-07 04:52:21,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:52:21,047 INFO L462 AbstractCegarLoop]: Abstraction has 4206 states and 6152 transitions. [2019-11-07 04:52:21,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:52:21,047 INFO L276 IsEmpty]: Start isEmpty. Operand 4206 states and 6152 transitions. [2019-11-07 04:52:21,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-07 04:52:21,096 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:52:21,097 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:52:21,097 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:52:21,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:52:21,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1549355052, now seen corresponding path program 1 times [2019-11-07 04:52:21,098 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:52:21,098 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729075109] [2019-11-07 04:52:21,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:52:21,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:52:21,207 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-07 04:52:21,208 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729075109] [2019-11-07 04:52:21,208 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:52:21,208 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:52:21,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302976926] [2019-11-07 04:52:21,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:52:21,209 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:52:21,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:52:21,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:52:21,210 INFO L87 Difference]: Start difference. First operand 4206 states and 6152 transitions. Second operand 5 states. [2019-11-07 04:52:21,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:52:21,520 INFO L93 Difference]: Finished difference Result 8154 states and 12006 transitions. [2019-11-07 04:52:21,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:52:21,520 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-11-07 04:52:21,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:52:21,555 INFO L225 Difference]: With dead ends: 8154 [2019-11-07 04:52:21,555 INFO L226 Difference]: Without dead ends: 4371 [2019-11-07 04:52:21,594 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-07 04:52:21,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4371 states. [2019-11-07 04:52:21,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4371 to 4206. [2019-11-07 04:52:21,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4206 states. [2019-11-07 04:52:21,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4206 states to 4206 states and 6162 transitions. [2019-11-07 04:52:21,915 INFO L78 Accepts]: Start accepts. Automaton has 4206 states and 6162 transitions. Word has length 86 [2019-11-07 04:52:21,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:52:21,916 INFO L462 AbstractCegarLoop]: Abstraction has 4206 states and 6162 transitions. [2019-11-07 04:52:21,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:52:21,916 INFO L276 IsEmpty]: Start isEmpty. Operand 4206 states and 6162 transitions. [2019-11-07 04:52:21,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-07 04:52:21,947 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:52:21,947 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:52:21,948 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:52:21,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:52:21,949 INFO L82 PathProgramCache]: Analyzing trace with hash -857073703, now seen corresponding path program 1 times [2019-11-07 04:52:21,949 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:52:21,949 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028146806] [2019-11-07 04:52:21,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:52:21,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:52:22,473 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 17 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:52:22,473 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028146806] [2019-11-07 04:52:22,473 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014921463] [2019-11-07 04:52:22,474 INFO L94 rtionOrderModulation]: Keeping assertion order 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-11-07 04:52:22,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:52:22,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 933 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-07 04:52:22,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 04:52:22,857 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-07 04:52:22,857 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 04:52:22,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:52:22,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:52:23,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:52:23,049 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 29 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-07 04:52:23,050 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-07 04:52:23,050 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [19, 6] total 29 [2019-11-07 04:52:23,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692435190] [2019-11-07 04:52:23,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 04:52:23,051 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:52:23,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 04:52:23,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=724, Unknown=0, NotChecked=0, Total=812 [2019-11-07 04:52:23,052 INFO L87 Difference]: Start difference. First operand 4206 states and 6162 transitions. Second operand 9 states. [2019-11-07 04:52:24,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:52:24,465 INFO L93 Difference]: Finished difference Result 19054 states and 28563 transitions. [2019-11-07 04:52:24,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-07 04:52:24,466 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-11-07 04:52:24,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:52:24,594 INFO L225 Difference]: With dead ends: 19054 [2019-11-07 04:52:24,595 INFO L226 Difference]: Without dead ends: 14861 [2019-11-07 04:52:24,633 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 165 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=155, Invalid=1177, Unknown=0, NotChecked=0, Total=1332 [2019-11-07 04:52:24,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14861 states. [2019-11-07 04:52:25,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14861 to 14276. [2019-11-07 04:52:25,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14276 states. [2019-11-07 04:52:25,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14276 states to 14276 states and 20355 transitions. [2019-11-07 04:52:25,649 INFO L78 Accepts]: Start accepts. Automaton has 14276 states and 20355 transitions. Word has length 87 [2019-11-07 04:52:25,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:52:25,649 INFO L462 AbstractCegarLoop]: Abstraction has 14276 states and 20355 transitions. [2019-11-07 04:52:25,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 04:52:25,650 INFO L276 IsEmpty]: Start isEmpty. Operand 14276 states and 20355 transitions. [2019-11-07 04:52:25,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-07 04:52:25,762 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:52:25,763 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:52:25,967 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 04:52:25,968 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:52:25,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:52:25,968 INFO L82 PathProgramCache]: Analyzing trace with hash -747680870, now seen corresponding path program 1 times [2019-11-07 04:52:25,968 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:52:25,968 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524475184] [2019-11-07 04:52:25,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:52:25,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:52:26,130 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-07 04:52:26,131 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524475184] [2019-11-07 04:52:26,131 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:52:26,131 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:52:26,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359888905] [2019-11-07 04:52:26,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:52:26,133 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:52:26,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:52:26,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:52:26,134 INFO L87 Difference]: Start difference. First operand 14276 states and 20355 transitions. Second operand 5 states. [2019-11-07 04:52:27,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:52:27,721 INFO L93 Difference]: Finished difference Result 26592 states and 38233 transitions. [2019-11-07 04:52:27,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:52:27,721 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-11-07 04:52:27,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:52:27,819 INFO L225 Difference]: With dead ends: 26592 [2019-11-07 04:52:27,819 INFO L226 Difference]: Without dead ends: 14551 [2019-11-07 04:52:27,889 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-07 04:52:27,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14551 states. [2019-11-07 04:52:28,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14551 to 14256. [2019-11-07 04:52:28,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14256 states. [2019-11-07 04:52:28,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14256 states to 14256 states and 20331 transitions. [2019-11-07 04:52:28,711 INFO L78 Accepts]: Start accepts. Automaton has 14256 states and 20331 transitions. Word has length 91 [2019-11-07 04:52:28,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:52:28,711 INFO L462 AbstractCegarLoop]: Abstraction has 14256 states and 20331 transitions. [2019-11-07 04:52:28,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:52:28,711 INFO L276 IsEmpty]: Start isEmpty. Operand 14256 states and 20331 transitions. [2019-11-07 04:52:28,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-07 04:52:28,803 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:52:28,804 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:52:28,804 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:52:28,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:52:28,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1922322228, now seen corresponding path program 1 times [2019-11-07 04:52:28,805 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:52:28,805 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648312105] [2019-11-07 04:52:28,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:52:28,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:52:29,153 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 17 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-07 04:52:29,154 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648312105] [2019-11-07 04:52:29,154 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430516139] [2019-11-07 04:52:29,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-11-07 04:52:29,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:52:29,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 975 conjuncts, 69 conjunts are in the unsatisfiable core [2019-11-07 04:52:29,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 04:52:29,810 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 17 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:52:29,810 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 04:52:29,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:52:29,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:52:29,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:52:29,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:52:29,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:52:30,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:52:30,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:52:30,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:52:30,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:52:30,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-07 04:52:30,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:52:30,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-07 04:52:30,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:52:30,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:52:30,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:52:30,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:52:30,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:52:30,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:52:30,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:52:30,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:52:30,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:52:30,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:52:30,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:52:30,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:52:30,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:52:30,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:52:30,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 04:52:30,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:52:30,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:52:30,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:52:30,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 04:52:30,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:52:30,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:52:31,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-07 04:52:31,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:52:31,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-07 04:52:31,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:52:31,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:52:31,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-07 04:52:31,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-07 04:52:31,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:52:31,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-07 04:52:31,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-07 04:52:31,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:52:31,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:52:31,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 04:52:31,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-07 04:52:31,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:52:31,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-07 04:52:31,526 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 14 [2019-11-07 04:52:31,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:52:31,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:52:31,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:52:31,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:52:31,626 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 17 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-07 04:52:31,626 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2059174592] [2019-11-07 04:52:31,653 INFO L159 IcfgInterpreter]: Started Sifa with 65 locations of interest [2019-11-07 04:52:31,653 INFO L166 IcfgInterpreter]: Building call graph [2019-11-07 04:52:31,665 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-07 04:52:31,670 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-07 04:52:31,670 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-07 04:52:31,871 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 144 for LOIs [2019-11-07 04:52:31,886 INFO L197 IcfgInterpreter]: Interpreting procedure start_simulation with input of size 116 for LOIs [2019-11-07 04:52:31,908 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2019-11-07 04:52:35,518 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2019-11-07 04:52:40,531 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 116 [2019-11-07 04:52:41,204 WARN L191 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 342 DAG size of output: 126 [2019-11-07 04:52:41,929 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 105 [2019-11-07 04:52:42,145 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 256 DAG size of output: 226 [2019-11-07 04:52:42,549 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 252 DAG size of output: 222 [2019-11-07 04:52:43,025 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 252 DAG size of output: 222 [2019-11-07 04:52:43,667 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10