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-13a467a-m [2019-10-15 03:32:03,272 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:32:03,274 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:32:03,293 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:32:03,293 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:32:03,295 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:32:03,297 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:32:03,302 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:32:03,303 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:32:03,304 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:32:03,305 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:32:03,306 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:32:03,308 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:32:03,309 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:32:03,310 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:32:03,311 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:32:03,312 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:32:03,313 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:32:03,314 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:32:03,316 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:32:03,317 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:32:03,318 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:32:03,319 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:32:03,320 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:32:03,322 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:32:03,323 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:32:03,323 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:32:03,324 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:32:03,324 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:32:03,325 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:32:03,325 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:32:03,326 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:32:03,327 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:32:03,328 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:32:03,329 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:32:03,329 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:32:03,330 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:32:03,330 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:32:03,330 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:32:03,331 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:32:03,332 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:32:03,332 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 03:32:03,347 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:32:03,347 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:32:03,348 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:32:03,348 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:32:03,349 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:32:03,349 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:32:03,349 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:32:03,349 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:32:03,349 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:32:03,350 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:32:03,350 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:32:03,350 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:32:03,350 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:32:03,350 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:32:03,350 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:32:03,351 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:32:03,351 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:32:03,351 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:32:03,351 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:32:03,351 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:32:03,352 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:32:03,352 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:32:03,352 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:32:03,352 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:32:03,352 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:32:03,353 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:32:03,353 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:32:03,353 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:32:03,353 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-15 03:32:03,616 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:32:03,629 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:32:03,633 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:32:03,634 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:32:03,635 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:32:03,635 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/toy1.cil.c [2019-10-15 03:32:03,696 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/194ccae90/e0aa9add3b9b4f4ab66acdf167ee182c/FLAG4415f7b3c [2019-10-15 03:32:04,209 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:32:04,212 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/toy1.cil.c [2019-10-15 03:32:04,222 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/194ccae90/e0aa9add3b9b4f4ab66acdf167ee182c/FLAG4415f7b3c [2019-10-15 03:32:04,553 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/194ccae90/e0aa9add3b9b4f4ab66acdf167ee182c [2019-10-15 03:32:04,564 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:32:04,566 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:32:04,567 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:32:04,567 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:32:04,571 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:32:04,572 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:32:04" (1/1) ... [2019-10-15 03:32:04,575 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@596ca61b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:32:04, skipping insertion in model container [2019-10-15 03:32:04,575 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:32:04" (1/1) ... [2019-10-15 03:32:04,583 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:32:04,630 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:32:04,899 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:32:04,905 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:32:05,047 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:32:05,067 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:32:05,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:32:05 WrapperNode [2019-10-15 03:32:05,068 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:32:05,068 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:32:05,069 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:32:05,069 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:32:05,079 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:32:05" (1/1) ... [2019-10-15 03:32:05,079 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:32:05" (1/1) ... [2019-10-15 03:32:05,094 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:32:05" (1/1) ... [2019-10-15 03:32:05,095 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:32:05" (1/1) ... [2019-10-15 03:32:05,118 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:32:05" (1/1) ... [2019-10-15 03:32:05,138 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:32:05" (1/1) ... [2019-10-15 03:32:05,141 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:32:05" (1/1) ... [2019-10-15 03:32:05,144 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:32:05,147 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:32:05,147 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:32:05,147 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:32:05,150 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:32:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:32:05,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:32:05,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:32:05,206 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-15 03:32:05,206 INFO L138 BoogieDeclarations]: Found implementation of procedure write_loop [2019-10-15 03:32:05,206 INFO L138 BoogieDeclarations]: Found implementation of procedure compute1 [2019-10-15 03:32:05,207 INFO L138 BoogieDeclarations]: Found implementation of procedure compute2 [2019-10-15 03:32:05,208 INFO L138 BoogieDeclarations]: Found implementation of procedure write_back [2019-10-15 03:32:05,208 INFO L138 BoogieDeclarations]: Found implementation of procedure read [2019-10-15 03:32:05,208 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-15 03:32:05,208 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-15 03:32:05,209 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:32:05,209 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:32:05,209 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 03:32:05,209 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-15 03:32:05,210 INFO L130 BoogieDeclarations]: Found specification of procedure write_loop [2019-10-15 03:32:05,210 INFO L130 BoogieDeclarations]: Found specification of procedure compute1 [2019-10-15 03:32:05,210 INFO L130 BoogieDeclarations]: Found specification of procedure compute2 [2019-10-15 03:32:05,210 INFO L130 BoogieDeclarations]: Found specification of procedure write_back [2019-10-15 03:32:05,210 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-15 03:32:05,210 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-15 03:32:05,211 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-15 03:32:05,211 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:32:05,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:32:05,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:32:06,630 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:32:06,630 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-10-15 03:32:06,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:32:06 BoogieIcfgContainer [2019-10-15 03:32:06,633 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:32:06,634 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:32:06,634 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:32:06,637 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:32:06,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:32:04" (1/3) ... [2019-10-15 03:32:06,638 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@636ee4d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:32:06, skipping insertion in model container [2019-10-15 03:32:06,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:32:05" (2/3) ... [2019-10-15 03:32:06,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@636ee4d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:32:06, skipping insertion in model container [2019-10-15 03:32:06,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:32:06" (3/3) ... [2019-10-15 03:32:06,641 INFO L109 eAbstractionObserver]: Analyzing ICFG toy1.cil.c [2019-10-15 03:32:06,653 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:32:06,663 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 03:32:06,675 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 03:32:06,711 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:32:06,711 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:32:06,711 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:32:06,711 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:32:06,712 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:32:06,712 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:32:06,713 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:32:06,713 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:32:06,733 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states. [2019-10-15 03:32:06,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-15 03:32:06,740 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:32:06,741 INFO L380 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-10-15 03:32:06,743 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:32:06,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:32:06,749 INFO L82 PathProgramCache]: Analyzing trace with hash -853662082, now seen corresponding path program 1 times [2019-10-15 03:32:06,758 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:32:06,759 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702707327] [2019-10-15 03:32:06,759 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:32:06,759 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:32:06,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:32:06,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:32:07,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:32:07,156 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702707327] [2019-10-15 03:32:07,158 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:32:07,158 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:32:07,158 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798673015] [2019-10-15 03:32:07,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:32:07,164 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:32:07,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:32:07,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:32:07,181 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 3 states. [2019-10-15 03:32:07,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:32:07,288 INFO L93 Difference]: Finished difference Result 208 states and 309 transitions. [2019-10-15 03:32:07,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:32:07,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-15 03:32:07,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:32:07,307 INFO L225 Difference]: With dead ends: 208 [2019-10-15 03:32:07,308 INFO L226 Difference]: Without dead ends: 126 [2019-10-15 03:32:07,312 INFO L600 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-10-15 03:32:07,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-10-15 03:32:07,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2019-10-15 03:32:07,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-10-15 03:32:07,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 182 transitions. [2019-10-15 03:32:07,385 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 182 transitions. Word has length 25 [2019-10-15 03:32:07,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:32:07,386 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 182 transitions. [2019-10-15 03:32:07,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:32:07,387 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 182 transitions. [2019-10-15 03:32:07,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-15 03:32:07,390 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:32:07,390 INFO L380 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-10-15 03:32:07,391 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:32:07,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:32:07,391 INFO L82 PathProgramCache]: Analyzing trace with hash -890517348, now seen corresponding path program 1 times [2019-10-15 03:32:07,392 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:32:07,392 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975415547] [2019-10-15 03:32:07,392 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:32:07,392 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:32:07,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:32:07,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:32:07,551 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:32:07,552 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975415547] [2019-10-15 03:32:07,553 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:32:07,553 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:32:07,553 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507673927] [2019-10-15 03:32:07,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:32:07,558 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:32:07,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:32:07,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:32:07,559 INFO L87 Difference]: Start difference. First operand 125 states and 182 transitions. Second operand 5 states. [2019-10-15 03:32:08,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:32:08,159 INFO L93 Difference]: Finished difference Result 478 states and 795 transitions. [2019-10-15 03:32:08,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 03:32:08,160 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-10-15 03:32:08,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:32:08,168 INFO L225 Difference]: With dead ends: 478 [2019-10-15 03:32:08,169 INFO L226 Difference]: Without dead ends: 361 [2019-10-15 03:32:08,175 INFO L600 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-10-15 03:32:08,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-10-15 03:32:08,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 344. [2019-10-15 03:32:08,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-10-15 03:32:08,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 562 transitions. [2019-10-15 03:32:08,270 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 562 transitions. Word has length 41 [2019-10-15 03:32:08,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:32:08,271 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 562 transitions. [2019-10-15 03:32:08,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:32:08,271 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 562 transitions. [2019-10-15 03:32:08,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-15 03:32:08,275 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:32:08,275 INFO L380 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-10-15 03:32:08,275 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:32:08,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:32:08,276 INFO L82 PathProgramCache]: Analyzing trace with hash -497151362, now seen corresponding path program 1 times [2019-10-15 03:32:08,276 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:32:08,276 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382611531] [2019-10-15 03:32:08,277 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:32:08,277 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:32:08,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:32:08,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:32:08,404 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 03:32:08,405 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382611531] [2019-10-15 03:32:08,405 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183009232] [2019-10-15 03:32:08,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:32:08,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:32:08,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 708 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 03:32:08,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:32:08,614 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 03:32:08,614 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:32:08,681 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-15 03:32:08,682 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 03:32:08,682 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7, 3] total 9 [2019-10-15 03:32:08,682 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084845995] [2019-10-15 03:32:08,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:32:08,683 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:32:08,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:32:08,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:32:08,684 INFO L87 Difference]: Start difference. First operand 344 states and 562 transitions. Second operand 3 states. [2019-10-15 03:32:08,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:32:08,739 INFO L93 Difference]: Finished difference Result 769 states and 1271 transitions. [2019-10-15 03:32:08,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:32:08,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-10-15 03:32:08,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:32:08,745 INFO L225 Difference]: With dead ends: 769 [2019-10-15 03:32:08,745 INFO L226 Difference]: Without dead ends: 435 [2019-10-15 03:32:08,747 INFO L600 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-10-15 03:32:08,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-10-15 03:32:08,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 408. [2019-10-15 03:32:08,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-10-15 03:32:08,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 660 transitions. [2019-10-15 03:32:08,784 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 660 transitions. Word has length 55 [2019-10-15 03:32:08,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:32:08,785 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 660 transitions. [2019-10-15 03:32:08,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:32:08,785 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 660 transitions. [2019-10-15 03:32:08,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-15 03:32:08,798 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:32:08,800 INFO L380 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-10-15 03:32:09,005 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:32:09,006 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:32:09,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:32:09,006 INFO L82 PathProgramCache]: Analyzing trace with hash -602034395, now seen corresponding path program 1 times [2019-10-15 03:32:09,007 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:32:09,007 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118700233] [2019-10-15 03:32:09,007 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:32:09,008 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:32:09,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:32:09,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:32:09,156 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-15 03:32:09,157 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118700233] [2019-10-15 03:32:09,157 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578508145] [2019-10-15 03:32:09,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:32:09,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:32:09,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 784 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 03:32:09,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:32:09,357 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-15 03:32:09,358 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:32:09,408 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-15 03:32:09,409 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 03:32:09,409 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8, 4] total 10 [2019-10-15 03:32:09,409 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031101599] [2019-10-15 03:32:09,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:32:09,410 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:32:09,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:32:09,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-10-15 03:32:09,411 INFO L87 Difference]: Start difference. First operand 408 states and 660 transitions. Second operand 3 states. [2019-10-15 03:32:09,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:32:09,475 INFO L93 Difference]: Finished difference Result 992 states and 1593 transitions. [2019-10-15 03:32:09,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:32:09,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-10-15 03:32:09,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:32:09,488 INFO L225 Difference]: With dead ends: 992 [2019-10-15 03:32:09,488 INFO L226 Difference]: Without dead ends: 594 [2019-10-15 03:32:09,490 INFO L600 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-10-15 03:32:09,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-10-15 03:32:09,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 555. [2019-10-15 03:32:09,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-10-15 03:32:09,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 868 transitions. [2019-10-15 03:32:09,546 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 868 transitions. Word has length 69 [2019-10-15 03:32:09,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:32:09,546 INFO L462 AbstractCegarLoop]: Abstraction has 555 states and 868 transitions. [2019-10-15 03:32:09,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:32:09,549 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 868 transitions. [2019-10-15 03:32:09,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-15 03:32:09,550 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:32:09,550 INFO L380 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-10-15 03:32:09,751 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:32:09,752 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:32:09,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:32:09,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1445071072, now seen corresponding path program 1 times [2019-10-15 03:32:09,753 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:32:09,754 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801777106] [2019-10-15 03:32:09,754 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:32:09,754 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:32:09,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:32:09,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:32:09,829 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-15 03:32:09,829 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801777106] [2019-10-15 03:32:09,829 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:32:09,830 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:32:09,830 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099216151] [2019-10-15 03:32:09,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:32:09,832 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:32:09,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:32:09,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:32:09,832 INFO L87 Difference]: Start difference. First operand 555 states and 868 transitions. Second operand 4 states. [2019-10-15 03:32:09,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:32:09,983 INFO L93 Difference]: Finished difference Result 1528 states and 2451 transitions. [2019-10-15 03:32:09,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:32:09,984 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-10-15 03:32:09,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:32:09,991 INFO L225 Difference]: With dead ends: 1528 [2019-10-15 03:32:09,991 INFO L226 Difference]: Without dead ends: 983 [2019-10-15 03:32:09,995 INFO L600 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-10-15 03:32:09,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2019-10-15 03:32:10,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 979. [2019-10-15 03:32:10,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 979 states. [2019-10-15 03:32:10,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 1526 transitions. [2019-10-15 03:32:10,057 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 1526 transitions. Word has length 70 [2019-10-15 03:32:10,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:32:10,058 INFO L462 AbstractCegarLoop]: Abstraction has 979 states and 1526 transitions. [2019-10-15 03:32:10,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:32:10,059 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1526 transitions. [2019-10-15 03:32:10,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-15 03:32:10,064 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:32:10,064 INFO L380 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-10-15 03:32:10,065 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:32:10,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:32:10,065 INFO L82 PathProgramCache]: Analyzing trace with hash 456248088, now seen corresponding path program 1 times [2019-10-15 03:32:10,066 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:32:10,066 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425801274] [2019-10-15 03:32:10,066 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:32:10,067 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:32:10,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:32:10,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:32:10,273 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 22 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 03:32:10,274 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425801274] [2019-10-15 03:32:10,274 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260460889] [2019-10-15 03:32:10,274 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-10-15 03:32:10,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:32:10,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 03:32:10,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:32:10,448 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:32:10,449 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:32:10,484 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 03:32:10,485 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 03:32:10,485 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12, 3] total 14 [2019-10-15 03:32:10,485 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149103291] [2019-10-15 03:32:10,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:32:10,486 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:32:10,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:32:10,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-10-15 03:32:10,487 INFO L87 Difference]: Start difference. First operand 979 states and 1526 transitions. Second operand 3 states. [2019-10-15 03:32:10,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:32:10,572 INFO L93 Difference]: Finished difference Result 1939 states and 3006 transitions. [2019-10-15 03:32:10,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:32:10,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-10-15 03:32:10,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:32:10,584 INFO L225 Difference]: With dead ends: 1939 [2019-10-15 03:32:10,584 INFO L226 Difference]: Without dead ends: 970 [2019-10-15 03:32:10,596 INFO L600 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-10-15 03:32:10,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2019-10-15 03:32:10,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 941. [2019-10-15 03:32:10,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 941 states. [2019-10-15 03:32:10,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1389 transitions. [2019-10-15 03:32:10,665 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1389 transitions. Word has length 72 [2019-10-15 03:32:10,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:32:10,666 INFO L462 AbstractCegarLoop]: Abstraction has 941 states and 1389 transitions. [2019-10-15 03:32:10,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:32:10,666 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1389 transitions. [2019-10-15 03:32:10,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-15 03:32:10,672 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:32:10,673 INFO L380 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-10-15 03:32:10,883 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:32:10,884 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:32:10,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:32:10,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1626708363, now seen corresponding path program 1 times [2019-10-15 03:32:10,885 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:32:10,886 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996297071] [2019-10-15 03:32:10,886 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:32:10,886 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:32:10,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:32:10,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:32:11,007 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-15 03:32:11,008 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996297071] [2019-10-15 03:32:11,008 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:32:11,008 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:32:11,008 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823436024] [2019-10-15 03:32:11,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:32:11,009 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:32:11,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:32:11,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:32:11,011 INFO L87 Difference]: Start difference. First operand 941 states and 1389 transitions. Second operand 3 states. [2019-10-15 03:32:11,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:32:11,076 INFO L93 Difference]: Finished difference Result 948 states and 1399 transitions. [2019-10-15 03:32:11,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:32:11,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-10-15 03:32:11,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:32:11,085 INFO L225 Difference]: With dead ends: 948 [2019-10-15 03:32:11,085 INFO L226 Difference]: Without dead ends: 945 [2019-10-15 03:32:11,086 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:32:11,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2019-10-15 03:32:11,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 945. [2019-10-15 03:32:11,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945 states. [2019-10-15 03:32:11,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1393 transitions. [2019-10-15 03:32:11,144 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1393 transitions. Word has length 82 [2019-10-15 03:32:11,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:32:11,145 INFO L462 AbstractCegarLoop]: Abstraction has 945 states and 1393 transitions. [2019-10-15 03:32:11,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:32:11,145 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1393 transitions. [2019-10-15 03:32:11,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-15 03:32:11,153 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:32:11,153 INFO L380 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-10-15 03:32:11,153 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:32:11,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:32:11,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1626655570, now seen corresponding path program 1 times [2019-10-15 03:32:11,154 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:32:11,156 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667330804] [2019-10-15 03:32:11,156 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:32:11,156 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:32:11,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:32:11,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:32:11,560 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 17 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 03:32:11,561 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667330804] [2019-10-15 03:32:11,561 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365944057] [2019-10-15 03:32:11,561 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-10-15 03:32:11,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:32:11,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 891 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-15 03:32:11,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:32:11,911 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 03:32:11,911 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:32:12,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:32:12,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:32:12,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:32:12,087 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 28 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-15 03:32:12,088 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 03:32:12,088 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [16, 6] total 26 [2019-10-15 03:32:12,088 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459241519] [2019-10-15 03:32:12,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 03:32:12,090 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:32:12,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 03:32:12,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2019-10-15 03:32:12,092 INFO L87 Difference]: Start difference. First operand 945 states and 1393 transitions. Second operand 9 states. [2019-10-15 03:32:13,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:32:13,090 INFO L93 Difference]: Finished difference Result 4167 states and 6469 transitions. [2019-10-15 03:32:13,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-15 03:32:13,091 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2019-10-15 03:32:13,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:32:13,114 INFO L225 Difference]: With dead ends: 4167 [2019-10-15 03:32:13,114 INFO L226 Difference]: Without dead ends: 3232 [2019-10-15 03:32:13,125 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=146, Invalid=976, Unknown=0, NotChecked=0, Total=1122 [2019-10-15 03:32:13,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3232 states. [2019-10-15 03:32:13,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3232 to 3043. [2019-10-15 03:32:13,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3043 states. [2019-10-15 03:32:13,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3043 states to 3043 states and 4534 transitions. [2019-10-15 03:32:13,343 INFO L78 Accepts]: Start accepts. Automaton has 3043 states and 4534 transitions. Word has length 82 [2019-10-15 03:32:13,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:32:13,344 INFO L462 AbstractCegarLoop]: Abstraction has 3043 states and 4534 transitions. [2019-10-15 03:32:13,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 03:32:13,344 INFO L276 IsEmpty]: Start isEmpty. Operand 3043 states and 4534 transitions. [2019-10-15 03:32:13,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-15 03:32:13,362 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:32:13,362 INFO L380 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-10-15 03:32:13,575 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:32:13,576 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:32:13,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:32:13,577 INFO L82 PathProgramCache]: Analyzing trace with hash -828517937, now seen corresponding path program 1 times [2019-10-15 03:32:13,577 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:32:13,577 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047426559] [2019-10-15 03:32:13,578 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:32:13,578 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:32:13,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:32:13,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:32:13,637 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-15 03:32:13,637 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047426559] [2019-10-15 03:32:13,638 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:32:13,638 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:32:13,640 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639290302] [2019-10-15 03:32:13,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:32:13,642 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:32:13,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:32:13,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:32:13,642 INFO L87 Difference]: Start difference. First operand 3043 states and 4534 transitions. Second operand 3 states. [2019-10-15 03:32:13,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:32:13,868 INFO L93 Difference]: Finished difference Result 7258 states and 10962 transitions. [2019-10-15 03:32:13,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:32:13,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-10-15 03:32:13,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:32:13,901 INFO L225 Difference]: With dead ends: 7258 [2019-10-15 03:32:13,901 INFO L226 Difference]: Without dead ends: 4228 [2019-10-15 03:32:13,940 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:32:13,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4228 states. [2019-10-15 03:32:14,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4228 to 4206. [2019-10-15 03:32:14,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4206 states. [2019-10-15 03:32:14,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4206 states to 4206 states and 6152 transitions. [2019-10-15 03:32:14,243 INFO L78 Accepts]: Start accepts. Automaton has 4206 states and 6152 transitions. Word has length 92 [2019-10-15 03:32:14,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:32:14,243 INFO L462 AbstractCegarLoop]: Abstraction has 4206 states and 6152 transitions. [2019-10-15 03:32:14,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:32:14,243 INFO L276 IsEmpty]: Start isEmpty. Operand 4206 states and 6152 transitions. [2019-10-15 03:32:14,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-15 03:32:14,282 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:32:14,283 INFO L380 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-10-15 03:32:14,283 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:32:14,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:32:14,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1549355052, now seen corresponding path program 1 times [2019-10-15 03:32:14,284 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:32:14,284 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50120301] [2019-10-15 03:32:14,285 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:32:14,285 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:32:14,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:32:14,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:32:14,382 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-15 03:32:14,383 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50120301] [2019-10-15 03:32:14,383 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:32:14,383 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:32:14,383 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128677258] [2019-10-15 03:32:14,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:32:14,384 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:32:14,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:32:14,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:32:14,385 INFO L87 Difference]: Start difference. First operand 4206 states and 6152 transitions. Second operand 5 states. [2019-10-15 03:32:14,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:32:14,689 INFO L93 Difference]: Finished difference Result 8154 states and 12006 transitions. [2019-10-15 03:32:14,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:32:14,690 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-10-15 03:32:14,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:32:14,726 INFO L225 Difference]: With dead ends: 8154 [2019-10-15 03:32:14,727 INFO L226 Difference]: Without dead ends: 4371 [2019-10-15 03:32:14,773 INFO L600 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-10-15 03:32:14,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4371 states. [2019-10-15 03:32:15,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4371 to 4206. [2019-10-15 03:32:15,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4206 states. [2019-10-15 03:32:15,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4206 states to 4206 states and 6162 transitions. [2019-10-15 03:32:15,085 INFO L78 Accepts]: Start accepts. Automaton has 4206 states and 6162 transitions. Word has length 86 [2019-10-15 03:32:15,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:32:15,085 INFO L462 AbstractCegarLoop]: Abstraction has 4206 states and 6162 transitions. [2019-10-15 03:32:15,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:32:15,086 INFO L276 IsEmpty]: Start isEmpty. Operand 4206 states and 6162 transitions. [2019-10-15 03:32:15,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-15 03:32:15,116 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:32:15,116 INFO L380 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-10-15 03:32:15,117 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:32:15,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:32:15,117 INFO L82 PathProgramCache]: Analyzing trace with hash -857073703, now seen corresponding path program 1 times [2019-10-15 03:32:15,117 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:32:15,118 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929671454] [2019-10-15 03:32:15,118 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:32:15,118 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:32:15,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:32:15,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:32:15,571 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 17 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:32:15,571 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929671454] [2019-10-15 03:32:15,571 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113443845] [2019-10-15 03:32:15,572 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-10-15 03:32:15,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:32:15,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 933 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-15 03:32:15,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:32:15,858 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 03:32:15,858 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:32:16,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:32:16,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:32:16,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:32:16,113 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 29 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-15 03:32:16,113 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 03:32:16,113 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [19, 6] total 29 [2019-10-15 03:32:16,113 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417456016] [2019-10-15 03:32:16,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 03:32:16,114 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:32:16,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 03:32:16,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=724, Unknown=0, NotChecked=0, Total=812 [2019-10-15 03:32:16,115 INFO L87 Difference]: Start difference. First operand 4206 states and 6162 transitions. Second operand 9 states. [2019-10-15 03:32:17,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:32:17,393 INFO L93 Difference]: Finished difference Result 19054 states and 28563 transitions. [2019-10-15 03:32:17,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-15 03:32:17,394 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-10-15 03:32:17,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:32:17,501 INFO L225 Difference]: With dead ends: 19054 [2019-10-15 03:32:17,502 INFO L226 Difference]: Without dead ends: 14861 [2019-10-15 03:32:17,541 INFO L600 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-10-15 03:32:17,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14861 states. [2019-10-15 03:32:18,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14861 to 14276. [2019-10-15 03:32:18,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14276 states. [2019-10-15 03:32:18,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14276 states to 14276 states and 20355 transitions. [2019-10-15 03:32:18,403 INFO L78 Accepts]: Start accepts. Automaton has 14276 states and 20355 transitions. Word has length 87 [2019-10-15 03:32:18,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:32:18,403 INFO L462 AbstractCegarLoop]: Abstraction has 14276 states and 20355 transitions. [2019-10-15 03:32:18,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 03:32:18,404 INFO L276 IsEmpty]: Start isEmpty. Operand 14276 states and 20355 transitions. [2019-10-15 03:32:18,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-15 03:32:18,505 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:32:18,506 INFO L380 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, 1, 1, 1, 1, 1] [2019-10-15 03:32:18,715 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:32:18,716 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:32:18,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:32:18,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1470927595, now seen corresponding path program 1 times [2019-10-15 03:32:18,717 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:32:18,718 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608925245] [2019-10-15 03:32:18,718 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:32:18,718 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:32:18,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:32:18,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:32:18,822 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-15 03:32:18,822 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608925245] [2019-10-15 03:32:18,822 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:32:18,823 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:32:18,823 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647840976] [2019-10-15 03:32:18,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:32:18,824 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:32:18,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:32:18,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:32:18,825 INFO L87 Difference]: Start difference. First operand 14276 states and 20355 transitions. Second operand 3 states. [2019-10-15 03:32:20,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:32:20,406 INFO L93 Difference]: Finished difference Result 28687 states and 41024 transitions. [2019-10-15 03:32:20,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:32:20,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-10-15 03:32:20,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:32:20,485 INFO L225 Difference]: With dead ends: 28687 [2019-10-15 03:32:20,485 INFO L226 Difference]: Without dead ends: 14754 [2019-10-15 03:32:20,579 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:32:20,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14754 states. [2019-10-15 03:32:21,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14754 to 14079. [2019-10-15 03:32:21,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14079 states. [2019-10-15 03:32:21,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14079 states to 14079 states and 19474 transitions. [2019-10-15 03:32:21,121 INFO L78 Accepts]: Start accepts. Automaton has 14079 states and 19474 transitions. Word has length 97 [2019-10-15 03:32:21,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:32:21,121 INFO L462 AbstractCegarLoop]: Abstraction has 14079 states and 19474 transitions. [2019-10-15 03:32:21,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:32:21,122 INFO L276 IsEmpty]: Start isEmpty. Operand 14079 states and 19474 transitions. [2019-10-15 03:32:21,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-15 03:32:21,213 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:32:21,213 INFO L380 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-10-15 03:32:21,213 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:32:21,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:32:21,214 INFO L82 PathProgramCache]: Analyzing trace with hash -747680870, now seen corresponding path program 1 times [2019-10-15 03:32:21,214 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:32:21,214 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543452367] [2019-10-15 03:32:21,214 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:32:21,214 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:32:21,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:32:21,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:32:21,292 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-15 03:32:21,293 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543452367] [2019-10-15 03:32:21,293 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:32:21,293 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:32:21,293 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670799570] [2019-10-15 03:32:21,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:32:21,294 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:32:21,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:32:21,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:32:21,294 INFO L87 Difference]: Start difference. First operand 14079 states and 19474 transitions. Second operand 5 states. [2019-10-15 03:32:21,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:32:21,869 INFO L93 Difference]: Finished difference Result 26434 states and 36819 transitions. [2019-10-15 03:32:21,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:32:21,870 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-10-15 03:32:21,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:32:21,932 INFO L225 Difference]: With dead ends: 26434 [2019-10-15 03:32:21,933 INFO L226 Difference]: Without dead ends: 14456 [2019-10-15 03:32:21,979 INFO L600 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-10-15 03:32:21,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14456 states. [2019-10-15 03:32:22,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14456 to 14059. [2019-10-15 03:32:22,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14059 states. [2019-10-15 03:32:22,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14059 states to 14059 states and 19450 transitions. [2019-10-15 03:32:22,734 INFO L78 Accepts]: Start accepts. Automaton has 14059 states and 19450 transitions. Word has length 91 [2019-10-15 03:32:22,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:32:22,735 INFO L462 AbstractCegarLoop]: Abstraction has 14059 states and 19450 transitions. [2019-10-15 03:32:22,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:32:22,735 INFO L276 IsEmpty]: Start isEmpty. Operand 14059 states and 19450 transitions. [2019-10-15 03:32:22,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-15 03:32:22,794 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:32:22,795 INFO L380 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-10-15 03:32:22,795 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:32:22,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:32:22,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1922322228, now seen corresponding path program 1 times [2019-10-15 03:32:22,796 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:32:22,796 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687152596] [2019-10-15 03:32:22,796 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:32:22,796 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:32:22,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:32:22,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:32:23,138 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 17 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 03:32:23,138 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687152596] [2019-10-15 03:32:23,138 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809618004] [2019-10-15 03:32:23,139 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-10-15 03:32:23,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:32:23,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 975 conjuncts, 69 conjunts are in the unsatisfiable core [2019-10-15 03:32:23,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:32:23,754 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 17 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:32:23,755 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:32:23,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:32:23,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:32:23,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:32:23,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:32:23,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:32:24,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:32:24,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:32:24,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:32:24,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:32:24,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-15 03:32:24,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:32:24,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-15 03:32:24,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:32:24,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:32:24,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:32:24,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:32:24,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:32:24,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:32:24,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:32:24,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:32:24,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:32:24,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:32:24,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:32:24,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:32:24,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:32:24,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:32:24,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 03:32:24,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:32:24,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:32:24,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:32:24,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 03:32:24,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:32:24,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:32:25,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-15 03:32:25,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:32:25,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-15 03:32:25,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:32:25,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:32:25,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-15 03:32:25,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-15 03:32:25,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:32:25,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-15 03:32:25,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-15 03:32:25,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:32:25,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:32:25,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 03:32:25,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-15 03:32:25,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:32:25,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-15 03:32:25,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:32:25,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:32:25,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:32:25,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:32:25,473 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 17 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-15 03:32:25,474 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1292623617] [2019-10-15 03:32:25,504 INFO L162 IcfgInterpreter]: Started Sifa with 65 locations of interest [2019-10-15 03:32:25,504 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:32:25,510 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:32:25,518 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:32:25,519 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:32:26,100 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 144 for LOIs [2019-10-15 03:32:26,502 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 222 [2019-10-15 03:32:26,842 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 224 [2019-10-15 03:32:26,847 INFO L199 IcfgInterpreter]: Interpreting procedure start_simulation with input of size 116 for LOIs [2019-10-15 03:32:27,045 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 204 [2019-10-15 03:32:27,111 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-10-15 03:32:28,962 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-10-15 03:32:30,721 WARN L191 SmtUtils]: Spent 522.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-10-15 03:32:31,106 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2019-10-15 03:32:34,428 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10