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 --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/systemc/toy1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:28:42,403 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:28:42,410 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:28:42,428 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:28:42,428 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:28:42,431 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:28:42,433 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:28:42,442 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:28:42,444 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:28:42,445 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:28:42,446 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:28:42,448 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:28:42,449 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:28:42,452 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:28:42,454 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:28:42,455 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:28:42,456 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:28:42,459 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:28:42,461 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:28:42,466 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:28:42,469 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:28:42,472 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:28:42,475 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:28:42,476 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:28:42,478 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:28:42,479 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:28:42,479 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:28:42,480 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:28:42,482 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:28:42,483 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:28:42,483 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:28:42,484 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:28:42,484 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:28:42,485 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:28:42,486 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:28:42,486 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:28:42,487 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:28:42,487 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:28:42,487 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:28:42,488 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:28:42,489 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:28:42,490 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:28:42,520 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:28:42,520 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:28:42,523 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:28:42,526 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:28:42,526 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:28:42,527 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:28:42,527 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:28:42,527 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:28:42,527 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:28:42,527 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:28:42,528 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:28:42,528 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:28:42,528 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:28:42,528 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:28:42,528 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:28:42,528 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:28:42,529 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:28:42,529 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:28:42,529 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:28:42,529 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:28:42,530 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:28:42,530 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:28:42,530 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:28:42,533 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:28:42,533 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:28:42,534 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:28:42,534 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:28:42,535 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:28:42,535 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:28:42,826 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:28:42,840 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:28:42,844 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:28:42,845 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:28:42,845 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:28:42,846 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 01:28:42,915 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dec72cc3/4e45e074f47f45408433b66482ac61ec/FLAG238b36c7e [2019-10-15 01:28:43,424 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:28:43,425 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/toy1.cil.c [2019-10-15 01:28:43,439 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dec72cc3/4e45e074f47f45408433b66482ac61ec/FLAG238b36c7e [2019-10-15 01:28:43,770 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dec72cc3/4e45e074f47f45408433b66482ac61ec [2019-10-15 01:28:43,781 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:28:43,783 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:28:43,785 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:28:43,785 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:28:43,789 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:28:43,791 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:28:43" (1/1) ... [2019-10-15 01:28:43,794 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@185bbd3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:43, skipping insertion in model container [2019-10-15 01:28:43,794 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:28:43" (1/1) ... [2019-10-15 01:28:43,802 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:28:43,864 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:28:44,097 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:28:44,103 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:28:44,247 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:28:44,264 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:28:44,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:44 WrapperNode [2019-10-15 01:28:44,264 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:28:44,265 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:28:44,265 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:28:44,265 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:28:44,275 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:44" (1/1) ... [2019-10-15 01:28:44,275 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:44" (1/1) ... [2019-10-15 01:28:44,283 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:44" (1/1) ... [2019-10-15 01:28:44,284 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:44" (1/1) ... [2019-10-15 01:28:44,295 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:44" (1/1) ... [2019-10-15 01:28:44,311 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:44" (1/1) ... [2019-10-15 01:28:44,314 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:44" (1/1) ... [2019-10-15 01:28:44,318 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:28:44,319 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:28:44,319 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:28:44,319 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:28:44,320 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:28:44,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:28:44,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:28:44,372 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-15 01:28:44,372 INFO L138 BoogieDeclarations]: Found implementation of procedure write_loop [2019-10-15 01:28:44,372 INFO L138 BoogieDeclarations]: Found implementation of procedure compute1 [2019-10-15 01:28:44,373 INFO L138 BoogieDeclarations]: Found implementation of procedure compute2 [2019-10-15 01:28:44,373 INFO L138 BoogieDeclarations]: Found implementation of procedure write_back [2019-10-15 01:28:44,373 INFO L138 BoogieDeclarations]: Found implementation of procedure read [2019-10-15 01:28:44,373 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-15 01:28:44,373 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-15 01:28:44,374 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:28:44,374 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:28:44,374 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:28:44,374 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-15 01:28:44,374 INFO L130 BoogieDeclarations]: Found specification of procedure write_loop [2019-10-15 01:28:44,374 INFO L130 BoogieDeclarations]: Found specification of procedure compute1 [2019-10-15 01:28:44,375 INFO L130 BoogieDeclarations]: Found specification of procedure compute2 [2019-10-15 01:28:44,375 INFO L130 BoogieDeclarations]: Found specification of procedure write_back [2019-10-15 01:28:44,375 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-15 01:28:44,375 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-15 01:28:44,375 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-15 01:28:44,376 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:28:44,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:28:44,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:28:45,048 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:28:45,048 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-10-15 01:28:45,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:28:45 BoogieIcfgContainer [2019-10-15 01:28:45,050 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:28:45,053 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:28:45,054 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:28:45,058 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:28:45,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:28:43" (1/3) ... [2019-10-15 01:28:45,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35545dc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:28:45, skipping insertion in model container [2019-10-15 01:28:45,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:44" (2/3) ... [2019-10-15 01:28:45,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35545dc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:28:45, skipping insertion in model container [2019-10-15 01:28:45,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:28:45" (3/3) ... [2019-10-15 01:28:45,066 INFO L109 eAbstractionObserver]: Analyzing ICFG toy1.cil.c [2019-10-15 01:28:45,076 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:28:45,098 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:28:45,111 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:28:45,146 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:28:45,146 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:28:45,146 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:28:45,147 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:28:45,147 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:28:45,147 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:28:45,147 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:28:45,147 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:28:45,167 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states. [2019-10-15 01:28:45,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-15 01:28:45,176 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:45,177 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, 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 01:28:45,179 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:45,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:45,184 INFO L82 PathProgramCache]: Analyzing trace with hash -854031758, now seen corresponding path program 1 times [2019-10-15 01:28:45,192 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:45,192 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063674759] [2019-10-15 01:28:45,193 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:45,193 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:45,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:45,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:45,512 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 01:28:45,513 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063674759] [2019-10-15 01:28:45,514 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:45,515 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:45,516 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082532790] [2019-10-15 01:28:45,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:45,524 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:45,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:45,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:45,543 INFO L87 Difference]: Start difference. First operand 161 states. Second operand 3 states. [2019-10-15 01:28:45,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:45,639 INFO L93 Difference]: Finished difference Result 306 states and 525 transitions. [2019-10-15 01:28:45,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:45,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-10-15 01:28:45,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:45,655 INFO L225 Difference]: With dead ends: 306 [2019-10-15 01:28:45,656 INFO L226 Difference]: Without dead ends: 152 [2019-10-15 01:28:45,661 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:45,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-10-15 01:28:45,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2019-10-15 01:28:45,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-10-15 01:28:45,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 245 transitions. [2019-10-15 01:28:45,717 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 245 transitions. Word has length 47 [2019-10-15 01:28:45,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:45,720 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 245 transitions. [2019-10-15 01:28:45,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:45,720 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 245 transitions. [2019-10-15 01:28:45,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-15 01:28:45,725 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:45,725 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, 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 01:28:45,726 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:45,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:45,726 INFO L82 PathProgramCache]: Analyzing trace with hash -459664972, now seen corresponding path program 1 times [2019-10-15 01:28:45,727 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:45,727 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316132437] [2019-10-15 01:28:45,727 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:45,727 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:45,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:45,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:45,887 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 01:28:45,887 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316132437] [2019-10-15 01:28:45,888 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:45,888 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:45,888 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146461528] [2019-10-15 01:28:45,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:45,891 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:45,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:45,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:45,891 INFO L87 Difference]: Start difference. First operand 152 states and 245 transitions. Second operand 3 states. [2019-10-15 01:28:45,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:45,926 INFO L93 Difference]: Finished difference Result 288 states and 469 transitions. [2019-10-15 01:28:45,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:45,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-10-15 01:28:45,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:45,929 INFO L225 Difference]: With dead ends: 288 [2019-10-15 01:28:45,929 INFO L226 Difference]: Without dead ends: 152 [2019-10-15 01:28:45,931 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:45,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-10-15 01:28:45,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2019-10-15 01:28:45,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-10-15 01:28:45,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 244 transitions. [2019-10-15 01:28:45,960 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 244 transitions. Word has length 47 [2019-10-15 01:28:45,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:45,961 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 244 transitions. [2019-10-15 01:28:45,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:45,961 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 244 transitions. [2019-10-15 01:28:45,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-15 01:28:45,964 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:45,964 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, 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 01:28:45,964 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:45,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:45,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1591319026, now seen corresponding path program 1 times [2019-10-15 01:28:45,965 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:45,965 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475028329] [2019-10-15 01:28:45,965 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:45,966 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:45,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:46,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:46,103 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 01:28:46,104 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475028329] [2019-10-15 01:28:46,104 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:46,104 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:28:46,104 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032551189] [2019-10-15 01:28:46,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:46,105 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:46,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:46,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:46,106 INFO L87 Difference]: Start difference. First operand 152 states and 244 transitions. Second operand 4 states. [2019-10-15 01:28:46,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:46,340 INFO L93 Difference]: Finished difference Result 424 states and 691 transitions. [2019-10-15 01:28:46,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:28:46,341 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-10-15 01:28:46,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:46,348 INFO L225 Difference]: With dead ends: 424 [2019-10-15 01:28:46,348 INFO L226 Difference]: Without dead ends: 289 [2019-10-15 01:28:46,353 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:46,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-10-15 01:28:46,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 279. [2019-10-15 01:28:46,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-10-15 01:28:46,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 451 transitions. [2019-10-15 01:28:46,388 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 451 transitions. Word has length 47 [2019-10-15 01:28:46,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:46,389 INFO L462 AbstractCegarLoop]: Abstraction has 279 states and 451 transitions. [2019-10-15 01:28:46,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:28:46,389 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 451 transitions. [2019-10-15 01:28:46,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-15 01:28:46,393 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:46,393 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, 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 01:28:46,393 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:46,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:46,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1541564722, now seen corresponding path program 1 times [2019-10-15 01:28:46,394 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:46,394 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064688367] [2019-10-15 01:28:46,395 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:46,395 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:46,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:46,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:46,472 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 01:28:46,472 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064688367] [2019-10-15 01:28:46,472 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:46,473 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:28:46,473 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112102797] [2019-10-15 01:28:46,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:46,474 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:46,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:46,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:46,474 INFO L87 Difference]: Start difference. First operand 279 states and 451 transitions. Second operand 4 states. [2019-10-15 01:28:46,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:46,717 INFO L93 Difference]: Finished difference Result 735 states and 1198 transitions. [2019-10-15 01:28:46,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:46,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-10-15 01:28:46,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:46,722 INFO L225 Difference]: With dead ends: 735 [2019-10-15 01:28:46,723 INFO L226 Difference]: Without dead ends: 482 [2019-10-15 01:28:46,725 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 01:28:46,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-10-15 01:28:46,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 472. [2019-10-15 01:28:46,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-10-15 01:28:46,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 763 transitions. [2019-10-15 01:28:46,785 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 763 transitions. Word has length 47 [2019-10-15 01:28:46,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:46,786 INFO L462 AbstractCegarLoop]: Abstraction has 472 states and 763 transitions. [2019-10-15 01:28:46,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:28:46,786 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 763 transitions. [2019-10-15 01:28:46,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-15 01:28:46,790 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:46,790 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, 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 01:28:46,791 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:46,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:46,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1816324336, now seen corresponding path program 1 times [2019-10-15 01:28:46,791 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:46,792 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117198614] [2019-10-15 01:28:46,792 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:46,792 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:46,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:46,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:46,851 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 01:28:46,852 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117198614] [2019-10-15 01:28:46,852 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:46,852 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:28:46,852 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169609288] [2019-10-15 01:28:46,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:46,853 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:46,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:46,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:46,854 INFO L87 Difference]: Start difference. First operand 472 states and 763 transitions. Second operand 4 states. [2019-10-15 01:28:47,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:47,080 INFO L93 Difference]: Finished difference Result 1298 states and 2118 transitions. [2019-10-15 01:28:47,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:47,081 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-10-15 01:28:47,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:47,089 INFO L225 Difference]: With dead ends: 1298 [2019-10-15 01:28:47,089 INFO L226 Difference]: Without dead ends: 854 [2019-10-15 01:28:47,092 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 01:28:47,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2019-10-15 01:28:47,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 836. [2019-10-15 01:28:47,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 836 states. [2019-10-15 01:28:47,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1357 transitions. [2019-10-15 01:28:47,172 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1357 transitions. Word has length 47 [2019-10-15 01:28:47,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:47,173 INFO L462 AbstractCegarLoop]: Abstraction has 836 states and 1357 transitions. [2019-10-15 01:28:47,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:28:47,173 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1357 transitions. [2019-10-15 01:28:47,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-15 01:28:47,180 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:47,180 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, 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 01:28:47,181 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:47,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:47,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1777043086, now seen corresponding path program 1 times [2019-10-15 01:28:47,182 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:47,182 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559661950] [2019-10-15 01:28:47,183 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:47,183 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:47,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:47,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:47,266 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 01:28:47,267 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559661950] [2019-10-15 01:28:47,268 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:47,268 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:47,269 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673599287] [2019-10-15 01:28:47,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:47,269 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:47,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:47,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:47,272 INFO L87 Difference]: Start difference. First operand 836 states and 1357 transitions. Second operand 3 states. [2019-10-15 01:28:47,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:47,379 INFO L93 Difference]: Finished difference Result 2181 states and 3529 transitions. [2019-10-15 01:28:47,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:47,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-10-15 01:28:47,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:47,389 INFO L225 Difference]: With dead ends: 2181 [2019-10-15 01:28:47,390 INFO L226 Difference]: Without dead ends: 1377 [2019-10-15 01:28:47,393 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 01:28:47,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2019-10-15 01:28:47,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 1365. [2019-10-15 01:28:47,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1365 states. [2019-10-15 01:28:47,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 2192 transitions. [2019-10-15 01:28:47,482 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 2192 transitions. Word has length 47 [2019-10-15 01:28:47,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:47,483 INFO L462 AbstractCegarLoop]: Abstraction has 1365 states and 2192 transitions. [2019-10-15 01:28:47,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:47,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 2192 transitions. [2019-10-15 01:28:47,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-15 01:28:47,486 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:47,486 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, 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 01:28:47,486 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:47,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:47,487 INFO L82 PathProgramCache]: Analyzing trace with hash -390839692, now seen corresponding path program 1 times [2019-10-15 01:28:47,487 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:47,487 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391666691] [2019-10-15 01:28:47,488 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:47,488 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:47,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:47,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:47,550 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 01:28:47,551 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391666691] [2019-10-15 01:28:47,551 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:47,551 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:47,552 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500607842] [2019-10-15 01:28:47,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:47,552 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:47,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:47,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:47,553 INFO L87 Difference]: Start difference. First operand 1365 states and 2192 transitions. Second operand 3 states. [2019-10-15 01:28:47,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:47,654 INFO L93 Difference]: Finished difference Result 2766 states and 4476 transitions. [2019-10-15 01:28:47,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:47,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-10-15 01:28:47,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:47,664 INFO L225 Difference]: With dead ends: 2766 [2019-10-15 01:28:47,664 INFO L226 Difference]: Without dead ends: 1455 [2019-10-15 01:28:47,669 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 01:28:47,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2019-10-15 01:28:47,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 1455. [2019-10-15 01:28:47,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1455 states. [2019-10-15 01:28:47,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1455 states to 1455 states and 2341 transitions. [2019-10-15 01:28:47,758 INFO L78 Accepts]: Start accepts. Automaton has 1455 states and 2341 transitions. Word has length 47 [2019-10-15 01:28:47,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:47,759 INFO L462 AbstractCegarLoop]: Abstraction has 1455 states and 2341 transitions. [2019-10-15 01:28:47,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:47,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1455 states and 2341 transitions. [2019-10-15 01:28:47,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-15 01:28:47,762 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:47,762 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, 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 01:28:47,762 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:47,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:47,763 INFO L82 PathProgramCache]: Analyzing trace with hash 409745528, now seen corresponding path program 1 times [2019-10-15 01:28:47,763 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:47,763 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674305231] [2019-10-15 01:28:47,763 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:47,763 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:47,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:47,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:47,804 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 01:28:47,805 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674305231] [2019-10-15 01:28:47,805 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:47,805 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:28:47,805 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407240437] [2019-10-15 01:28:47,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:47,806 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:47,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:47,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:47,807 INFO L87 Difference]: Start difference. First operand 1455 states and 2341 transitions. Second operand 4 states. [2019-10-15 01:28:48,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:48,080 INFO L93 Difference]: Finished difference Result 3057 states and 4916 transitions. [2019-10-15 01:28:48,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:28:48,081 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-10-15 01:28:48,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:48,094 INFO L225 Difference]: With dead ends: 3057 [2019-10-15 01:28:48,094 INFO L226 Difference]: Without dead ends: 1647 [2019-10-15 01:28:48,099 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 01:28:48,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states. [2019-10-15 01:28:48,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 1623. [2019-10-15 01:28:48,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1623 states. [2019-10-15 01:28:48,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 2575 transitions. [2019-10-15 01:28:48,206 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 2575 transitions. Word has length 47 [2019-10-15 01:28:48,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:48,206 INFO L462 AbstractCegarLoop]: Abstraction has 1623 states and 2575 transitions. [2019-10-15 01:28:48,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:28:48,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 2575 transitions. [2019-10-15 01:28:48,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-15 01:28:48,209 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:48,209 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, 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 01:28:48,209 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:48,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:48,210 INFO L82 PathProgramCache]: Analyzing trace with hash 628600246, now seen corresponding path program 1 times [2019-10-15 01:28:48,210 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:48,210 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430757883] [2019-10-15 01:28:48,210 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:48,211 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:48,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:48,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:48,252 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 01:28:48,252 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430757883] [2019-10-15 01:28:48,253 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:48,253 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:28:48,253 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408998838] [2019-10-15 01:28:48,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:48,254 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:48,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:48,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:48,254 INFO L87 Difference]: Start difference. First operand 1623 states and 2575 transitions. Second operand 4 states. [2019-10-15 01:28:48,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:48,492 INFO L93 Difference]: Finished difference Result 3227 states and 5164 transitions. [2019-10-15 01:28:48,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:28:48,492 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-10-15 01:28:48,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:48,504 INFO L225 Difference]: With dead ends: 3227 [2019-10-15 01:28:48,504 INFO L226 Difference]: Without dead ends: 1655 [2019-10-15 01:28:48,510 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 01:28:48,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1655 states. [2019-10-15 01:28:48,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1655 to 1623. [2019-10-15 01:28:48,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1623 states. [2019-10-15 01:28:48,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 2525 transitions. [2019-10-15 01:28:48,621 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 2525 transitions. Word has length 47 [2019-10-15 01:28:48,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:48,621 INFO L462 AbstractCegarLoop]: Abstraction has 1623 states and 2525 transitions. [2019-10-15 01:28:48,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:28:48,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 2525 transitions. [2019-10-15 01:28:48,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-15 01:28:48,628 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:48,628 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, 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 01:28:48,629 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:48,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:48,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1051302072, now seen corresponding path program 1 times [2019-10-15 01:28:48,630 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:48,630 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049983217] [2019-10-15 01:28:48,630 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:48,630 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:48,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:48,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:48,714 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 01:28:48,715 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049983217] [2019-10-15 01:28:48,715 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:48,715 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:28:48,716 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7390667] [2019-10-15 01:28:48,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:48,716 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:48,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:48,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:48,717 INFO L87 Difference]: Start difference. First operand 1623 states and 2525 transitions. Second operand 4 states. [2019-10-15 01:28:49,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:49,032 INFO L93 Difference]: Finished difference Result 3560 states and 5541 transitions. [2019-10-15 01:28:49,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:28:49,032 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-10-15 01:28:49,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:49,048 INFO L225 Difference]: With dead ends: 3560 [2019-10-15 01:28:49,048 INFO L226 Difference]: Without dead ends: 2000 [2019-10-15 01:28:49,054 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 01:28:49,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2000 states. [2019-10-15 01:28:49,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2000 to 1976. [2019-10-15 01:28:49,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1976 states. [2019-10-15 01:28:49,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1976 states to 1976 states and 3048 transitions. [2019-10-15 01:28:49,219 INFO L78 Accepts]: Start accepts. Automaton has 1976 states and 3048 transitions. Word has length 47 [2019-10-15 01:28:49,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:49,219 INFO L462 AbstractCegarLoop]: Abstraction has 1976 states and 3048 transitions. [2019-10-15 01:28:49,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:28:49,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1976 states and 3048 transitions. [2019-10-15 01:28:49,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-15 01:28:49,222 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:49,222 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, 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 01:28:49,222 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:49,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:49,223 INFO L82 PathProgramCache]: Analyzing trace with hash 233653622, now seen corresponding path program 1 times [2019-10-15 01:28:49,223 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:49,223 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833401425] [2019-10-15 01:28:49,224 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:49,224 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:49,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:49,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:49,290 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 01:28:49,291 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833401425] [2019-10-15 01:28:49,291 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:49,291 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:49,291 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964014392] [2019-10-15 01:28:49,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:49,292 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:49,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:49,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:49,293 INFO L87 Difference]: Start difference. First operand 1976 states and 3048 transitions. Second operand 3 states. [2019-10-15 01:28:49,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:49,498 INFO L93 Difference]: Finished difference Result 4143 states and 6431 transitions. [2019-10-15 01:28:49,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:49,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-10-15 01:28:49,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:49,515 INFO L225 Difference]: With dead ends: 4143 [2019-10-15 01:28:49,515 INFO L226 Difference]: Without dead ends: 2212 [2019-10-15 01:28:49,524 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:49,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2212 states. [2019-10-15 01:28:49,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2212 to 2212. [2019-10-15 01:28:49,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2212 states. [2019-10-15 01:28:49,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2212 states to 2212 states and 3347 transitions. [2019-10-15 01:28:49,657 INFO L78 Accepts]: Start accepts. Automaton has 2212 states and 3347 transitions. Word has length 47 [2019-10-15 01:28:49,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:49,657 INFO L462 AbstractCegarLoop]: Abstraction has 2212 states and 3347 transitions. [2019-10-15 01:28:49,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:49,657 INFO L276 IsEmpty]: Start isEmpty. Operand 2212 states and 3347 transitions. [2019-10-15 01:28:49,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-15 01:28:49,658 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:49,659 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, 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 01:28:49,659 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:49,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:49,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1760491084, now seen corresponding path program 1 times [2019-10-15 01:28:49,659 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:49,660 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480158942] [2019-10-15 01:28:49,660 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:49,660 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:49,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:49,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:49,702 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 01:28:49,702 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480158942] [2019-10-15 01:28:49,703 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:49,703 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:49,703 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17092419] [2019-10-15 01:28:49,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:49,704 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:49,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:49,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:49,704 INFO L87 Difference]: Start difference. First operand 2212 states and 3347 transitions. Second operand 3 states. [2019-10-15 01:28:49,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:49,897 INFO L93 Difference]: Finished difference Result 5109 states and 7928 transitions. [2019-10-15 01:28:49,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:49,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-10-15 01:28:49,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:49,915 INFO L225 Difference]: With dead ends: 5109 [2019-10-15 01:28:49,916 INFO L226 Difference]: Without dead ends: 2939 [2019-10-15 01:28:49,926 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:49,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2939 states. [2019-10-15 01:28:50,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2939 to 2867. [2019-10-15 01:28:50,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2867 states. [2019-10-15 01:28:50,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2867 states to 2867 states and 4350 transitions. [2019-10-15 01:28:50,172 INFO L78 Accepts]: Start accepts. Automaton has 2867 states and 4350 transitions. Word has length 47 [2019-10-15 01:28:50,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:50,172 INFO L462 AbstractCegarLoop]: Abstraction has 2867 states and 4350 transitions. [2019-10-15 01:28:50,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:50,173 INFO L276 IsEmpty]: Start isEmpty. Operand 2867 states and 4350 transitions. [2019-10-15 01:28:50,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-15 01:28:50,179 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:50,179 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, 1, 1, 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 01:28:50,179 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:50,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:50,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1060036737, now seen corresponding path program 1 times [2019-10-15 01:28:50,180 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:50,180 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628831501] [2019-10-15 01:28:50,180 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:50,180 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:50,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:50,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:50,246 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 01:28:50,247 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628831501] [2019-10-15 01:28:50,247 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:50,247 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:50,248 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299883536] [2019-10-15 01:28:50,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:50,248 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:50,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:50,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:50,249 INFO L87 Difference]: Start difference. First operand 2867 states and 4350 transitions. Second operand 5 states. [2019-10-15 01:28:51,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:51,175 INFO L93 Difference]: Finished difference Result 8481 states and 13641 transitions. [2019-10-15 01:28:51,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:28:51,176 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-10-15 01:28:51,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:51,214 INFO L225 Difference]: With dead ends: 8481 [2019-10-15 01:28:51,214 INFO L226 Difference]: Without dead ends: 5650 [2019-10-15 01:28:51,235 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 01:28:51,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5650 states. [2019-10-15 01:28:51,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5650 to 5276. [2019-10-15 01:28:51,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5276 states. [2019-10-15 01:28:51,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5276 states to 5276 states and 8280 transitions. [2019-10-15 01:28:51,714 INFO L78 Accepts]: Start accepts. Automaton has 5276 states and 8280 transitions. Word has length 67 [2019-10-15 01:28:51,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:51,714 INFO L462 AbstractCegarLoop]: Abstraction has 5276 states and 8280 transitions. [2019-10-15 01:28:51,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:51,714 INFO L276 IsEmpty]: Start isEmpty. Operand 5276 states and 8280 transitions. [2019-10-15 01:28:51,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-10-15 01:28:51,724 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:51,725 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, 1, 1, 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 01:28:51,725 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:51,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:51,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1168897503, now seen corresponding path program 1 times [2019-10-15 01:28:51,726 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:51,726 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604586463] [2019-10-15 01:28:51,726 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:51,726 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:51,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:51,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:51,838 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 01:28:51,838 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604586463] [2019-10-15 01:28:51,839 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691688944] [2019-10-15 01:28:51,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:52,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:52,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 01:28:52,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:52,078 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 01:28:52,078 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:52,234 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 01:28:52,234 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:28:52,235 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7, 3] total 9 [2019-10-15 01:28:52,235 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893593478] [2019-10-15 01:28:52,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:52,235 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:52,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:52,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:28:52,238 INFO L87 Difference]: Start difference. First operand 5276 states and 8280 transitions. Second operand 3 states. [2019-10-15 01:28:52,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:52,722 INFO L93 Difference]: Finished difference Result 11617 states and 18524 transitions. [2019-10-15 01:28:52,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:52,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-10-15 01:28:52,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:52,757 INFO L225 Difference]: With dead ends: 11617 [2019-10-15 01:28:52,758 INFO L226 Difference]: Without dead ends: 3787 [2019-10-15 01:28:52,822 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 162 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 01:28:52,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3787 states. [2019-10-15 01:28:53,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3787 to 3779. [2019-10-15 01:28:53,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3779 states. [2019-10-15 01:28:53,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3779 states to 3779 states and 5727 transitions. [2019-10-15 01:28:53,369 INFO L78 Accepts]: Start accepts. Automaton has 3779 states and 5727 transitions. Word has length 81 [2019-10-15 01:28:53,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:53,370 INFO L462 AbstractCegarLoop]: Abstraction has 3779 states and 5727 transitions. [2019-10-15 01:28:53,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:53,370 INFO L276 IsEmpty]: Start isEmpty. Operand 3779 states and 5727 transitions. [2019-10-15 01:28:53,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-15 01:28:53,385 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:53,386 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 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 01:28:53,601 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:53,601 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:53,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:53,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1422823091, now seen corresponding path program 1 times [2019-10-15 01:28:53,602 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:53,602 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527765256] [2019-10-15 01:28:53,602 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:53,603 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:53,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:53,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:53,688 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:28:53,688 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527765256] [2019-10-15 01:28:53,689 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:53,689 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:53,689 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689970557] [2019-10-15 01:28:53,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:53,692 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:53,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:53,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:53,693 INFO L87 Difference]: Start difference. First operand 3779 states and 5727 transitions. Second operand 3 states. [2019-10-15 01:28:53,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:53,931 INFO L93 Difference]: Finished difference Result 6881 states and 10598 transitions. [2019-10-15 01:28:53,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:53,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-10-15 01:28:53,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:53,970 INFO L225 Difference]: With dead ends: 6881 [2019-10-15 01:28:53,970 INFO L226 Difference]: Without dead ends: 3160 [2019-10-15 01:28:53,997 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 01:28:54,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3160 states. [2019-10-15 01:28:54,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3160 to 3102. [2019-10-15 01:28:54,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3102 states. [2019-10-15 01:28:54,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3102 states to 3102 states and 4564 transitions. [2019-10-15 01:28:54,215 INFO L78 Accepts]: Start accepts. Automaton has 3102 states and 4564 transitions. Word has length 122 [2019-10-15 01:28:54,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:54,216 INFO L462 AbstractCegarLoop]: Abstraction has 3102 states and 4564 transitions. [2019-10-15 01:28:54,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:54,217 INFO L276 IsEmpty]: Start isEmpty. Operand 3102 states and 4564 transitions. [2019-10-15 01:28:54,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-15 01:28:54,234 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:54,234 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 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 01:28:54,235 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:54,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:54,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1127988978, now seen corresponding path program 1 times [2019-10-15 01:28:54,235 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:54,235 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758159146] [2019-10-15 01:28:54,236 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:54,236 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:54,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:54,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:54,316 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-15 01:28:54,317 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758159146] [2019-10-15 01:28:54,317 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:54,317 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:54,317 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710489719] [2019-10-15 01:28:54,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:54,318 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:54,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:54,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:54,319 INFO L87 Difference]: Start difference. First operand 3102 states and 4564 transitions. Second operand 3 states. [2019-10-15 01:28:54,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:54,747 INFO L93 Difference]: Finished difference Result 8252 states and 12374 transitions. [2019-10-15 01:28:54,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:54,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-10-15 01:28:54,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:54,797 INFO L225 Difference]: With dead ends: 8252 [2019-10-15 01:28:54,797 INFO L226 Difference]: Without dead ends: 5159 [2019-10-15 01:28:54,809 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:54,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5159 states. [2019-10-15 01:28:55,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5159 to 5117. [2019-10-15 01:28:55,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5117 states. [2019-10-15 01:28:55,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5117 states to 5117 states and 7756 transitions. [2019-10-15 01:28:55,217 INFO L78 Accepts]: Start accepts. Automaton has 5117 states and 7756 transitions. Word has length 124 [2019-10-15 01:28:55,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:55,217 INFO L462 AbstractCegarLoop]: Abstraction has 5117 states and 7756 transitions. [2019-10-15 01:28:55,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:55,218 INFO L276 IsEmpty]: Start isEmpty. Operand 5117 states and 7756 transitions. [2019-10-15 01:28:55,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-15 01:28:55,244 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:55,244 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:28:55,245 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:55,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:55,245 INFO L82 PathProgramCache]: Analyzing trace with hash 343863075, now seen corresponding path program 1 times [2019-10-15 01:28:55,245 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:55,246 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542378746] [2019-10-15 01:28:55,246 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:55,246 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:55,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:55,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:55,398 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-15 01:28:55,398 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542378746] [2019-10-15 01:28:55,399 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379482500] [2019-10-15 01:28:55,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:55,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:55,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 953 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:28:55,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:55,660 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 01:28:55,660 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:55,832 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-15 01:28:55,832 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:28:55,832 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 6 [2019-10-15 01:28:55,833 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230788840] [2019-10-15 01:28:55,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:55,834 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:55,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:55,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:55,834 INFO L87 Difference]: Start difference. First operand 5117 states and 7756 transitions. Second operand 3 states. [2019-10-15 01:28:56,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:56,277 INFO L93 Difference]: Finished difference Result 11629 states and 18341 transitions. [2019-10-15 01:28:56,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:56,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2019-10-15 01:28:56,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:56,316 INFO L225 Difference]: With dead ends: 11629 [2019-10-15 01:28:56,316 INFO L226 Difference]: Without dead ends: 6545 [2019-10-15 01:28:56,342 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:56,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6545 states. [2019-10-15 01:28:56,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6545 to 6421. [2019-10-15 01:28:56,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6421 states. [2019-10-15 01:28:56,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6421 states to 6421 states and 9605 transitions. [2019-10-15 01:28:56,829 INFO L78 Accepts]: Start accepts. Automaton has 6421 states and 9605 transitions. Word has length 133 [2019-10-15 01:28:56,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:56,830 INFO L462 AbstractCegarLoop]: Abstraction has 6421 states and 9605 transitions. [2019-10-15 01:28:56,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:56,830 INFO L276 IsEmpty]: Start isEmpty. Operand 6421 states and 9605 transitions. [2019-10-15 01:28:56,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-15 01:28:56,850 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:56,850 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:28:57,063 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:57,063 INFO L410 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:57,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:57,064 INFO L82 PathProgramCache]: Analyzing trace with hash -182917330, now seen corresponding path program 1 times [2019-10-15 01:28:57,065 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:57,065 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531087157] [2019-10-15 01:28:57,065 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:57,065 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:57,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:57,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:57,187 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-15 01:28:57,187 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531087157] [2019-10-15 01:28:57,188 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760245231] [2019-10-15 01:28:57,188 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 01:28:57,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:57,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 955 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:28:57,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:57,572 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-15 01:28:57,572 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:57,614 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-15 01:28:57,615 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:28:57,615 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 6 [2019-10-15 01:28:57,615 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830017295] [2019-10-15 01:28:57,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:57,616 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:57,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:57,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:57,617 INFO L87 Difference]: Start difference. First operand 6421 states and 9605 transitions. Second operand 3 states. [2019-10-15 01:28:57,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:57,956 INFO L93 Difference]: Finished difference Result 6430 states and 9619 transitions. [2019-10-15 01:28:57,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:57,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2019-10-15 01:28:57,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:57,989 INFO L225 Difference]: With dead ends: 6430 [2019-10-15 01:28:57,989 INFO L226 Difference]: Without dead ends: 6427 [2019-10-15 01:28:57,994 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:58,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6427 states. [2019-10-15 01:28:58,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6427 to 6427. [2019-10-15 01:28:58,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6427 states. [2019-10-15 01:28:58,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6427 states to 6427 states and 9611 transitions. [2019-10-15 01:28:58,462 INFO L78 Accepts]: Start accepts. Automaton has 6427 states and 9611 transitions. Word has length 134 [2019-10-15 01:28:58,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:58,463 INFO L462 AbstractCegarLoop]: Abstraction has 6427 states and 9611 transitions. [2019-10-15 01:28:58,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:58,463 INFO L276 IsEmpty]: Start isEmpty. Operand 6427 states and 9611 transitions. [2019-10-15 01:28:58,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-15 01:28:58,485 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:58,485 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:28:58,690 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:58,691 INFO L410 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:58,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:58,692 INFO L82 PathProgramCache]: Analyzing trace with hash -182864537, now seen corresponding path program 1 times [2019-10-15 01:28:58,692 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:58,693 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367206056] [2019-10-15 01:28:58,693 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:58,693 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:58,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:58,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:58,840 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-15 01:28:58,841 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367206056] [2019-10-15 01:28:58,841 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618199593] [2019-10-15 01:28:58,842 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 01:28:59,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:59,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 954 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-15 01:28:59,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:59,777 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 01:28:59,777 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:59,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:28:59,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:28:59,976 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-15 01:28:59,977 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:28:59,977 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2019-10-15 01:28:59,977 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616661362] [2019-10-15 01:28:59,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:59,980 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:59,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:59,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:28:59,981 INFO L87 Difference]: Start difference. First operand 6427 states and 9611 transitions. Second operand 5 states. [2019-10-15 01:29:00,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:00,825 INFO L93 Difference]: Finished difference Result 13093 states and 20014 transitions. [2019-10-15 01:29:00,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:29:00,826 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 134 [2019-10-15 01:29:00,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:00,870 INFO L225 Difference]: With dead ends: 13093 [2019-10-15 01:29:00,870 INFO L226 Difference]: Without dead ends: 8270 [2019-10-15 01:29:00,885 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 263 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:29:00,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8270 states. [2019-10-15 01:29:01,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8270 to 8086. [2019-10-15 01:29:01,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8086 states. [2019-10-15 01:29:01,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8086 states to 8086 states and 12308 transitions. [2019-10-15 01:29:01,490 INFO L78 Accepts]: Start accepts. Automaton has 8086 states and 12308 transitions. Word has length 134 [2019-10-15 01:29:01,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:01,490 INFO L462 AbstractCegarLoop]: Abstraction has 8086 states and 12308 transitions. [2019-10-15 01:29:01,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:29:01,490 INFO L276 IsEmpty]: Start isEmpty. Operand 8086 states and 12308 transitions. [2019-10-15 01:29:01,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-15 01:29:01,515 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:01,516 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:29:01,730 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:01,731 INFO L410 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:01,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:01,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1470216356, now seen corresponding path program 1 times [2019-10-15 01:29:01,732 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:01,739 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344378696] [2019-10-15 01:29:01,739 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:01,739 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:01,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:01,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:01,839 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-15 01:29:01,840 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344378696] [2019-10-15 01:29:01,841 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:01,841 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:29:01,841 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708536188] [2019-10-15 01:29:01,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:29:01,843 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:01,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:29:01,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:29:01,844 INFO L87 Difference]: Start difference. First operand 8086 states and 12308 transitions. Second operand 3 states. [2019-10-15 01:29:02,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:02,350 INFO L93 Difference]: Finished difference Result 13759 states and 21102 transitions. [2019-10-15 01:29:02,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:29:02,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-10-15 01:29:02,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:02,387 INFO L225 Difference]: With dead ends: 13759 [2019-10-15 01:29:02,387 INFO L226 Difference]: Without dead ends: 5705 [2019-10-15 01:29:02,408 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:29:02,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5705 states. [2019-10-15 01:29:02,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5705 to 5692. [2019-10-15 01:29:02,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5692 states. [2019-10-15 01:29:02,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5692 states to 5692 states and 8422 transitions. [2019-10-15 01:29:02,823 INFO L78 Accepts]: Start accepts. Automaton has 5692 states and 8422 transitions. Word has length 148 [2019-10-15 01:29:02,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:02,824 INFO L462 AbstractCegarLoop]: Abstraction has 5692 states and 8422 transitions. [2019-10-15 01:29:02,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:29:02,824 INFO L276 IsEmpty]: Start isEmpty. Operand 5692 states and 8422 transitions. [2019-10-15 01:29:02,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-15 01:29:02,847 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:02,847 INFO L380 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:29:02,848 INFO L410 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:02,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:02,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1355424307, now seen corresponding path program 1 times [2019-10-15 01:29:02,849 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:02,849 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374599765] [2019-10-15 01:29:02,849 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:02,849 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:02,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:02,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:02,951 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-15 01:29:02,952 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374599765] [2019-10-15 01:29:02,952 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:02,952 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:29:02,953 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824413914] [2019-10-15 01:29:02,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:29:02,954 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:02,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:29:02,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:29:02,955 INFO L87 Difference]: Start difference. First operand 5692 states and 8422 transitions. Second operand 3 states. [2019-10-15 01:29:03,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:03,463 INFO L93 Difference]: Finished difference Result 11885 states and 17660 transitions. [2019-10-15 01:29:03,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:29:03,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-10-15 01:29:03,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:03,492 INFO L225 Difference]: With dead ends: 11885 [2019-10-15 01:29:03,492 INFO L226 Difference]: Without dead ends: 6229 [2019-10-15 01:29:03,508 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:29:03,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6229 states. [2019-10-15 01:29:03,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6229 to 6193. [2019-10-15 01:29:03,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6193 states. [2019-10-15 01:29:03,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6193 states to 6193 states and 8843 transitions. [2019-10-15 01:29:03,884 INFO L78 Accepts]: Start accepts. Automaton has 6193 states and 8843 transitions. Word has length 149 [2019-10-15 01:29:03,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:03,884 INFO L462 AbstractCegarLoop]: Abstraction has 6193 states and 8843 transitions. [2019-10-15 01:29:03,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:29:03,885 INFO L276 IsEmpty]: Start isEmpty. Operand 6193 states and 8843 transitions. [2019-10-15 01:29:03,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-15 01:29:03,901 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:03,901 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:29:03,902 INFO L410 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:03,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:03,902 INFO L82 PathProgramCache]: Analyzing trace with hash 451167095, now seen corresponding path program 1 times [2019-10-15 01:29:03,902 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:03,903 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842264237] [2019-10-15 01:29:03,903 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:03,903 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:03,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:03,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:03,964 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-15 01:29:03,965 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842264237] [2019-10-15 01:29:03,965 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:03,965 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:29:03,965 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514701361] [2019-10-15 01:29:03,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:29:03,966 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:03,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:29:03,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:29:03,967 INFO L87 Difference]: Start difference. First operand 6193 states and 8843 transitions. Second operand 3 states. [2019-10-15 01:29:04,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:04,372 INFO L93 Difference]: Finished difference Result 11829 states and 16926 transitions. [2019-10-15 01:29:04,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:29:04,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-10-15 01:29:04,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:04,402 INFO L225 Difference]: With dead ends: 11829 [2019-10-15 01:29:04,403 INFO L226 Difference]: Without dead ends: 6168 [2019-10-15 01:29:04,417 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:29:04,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6168 states. [2019-10-15 01:29:04,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6168 to 6168. [2019-10-15 01:29:04,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6168 states. [2019-10-15 01:29:04,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6168 states to 6168 states and 8809 transitions. [2019-10-15 01:29:04,910 INFO L78 Accepts]: Start accepts. Automaton has 6168 states and 8809 transitions. Word has length 149 [2019-10-15 01:29:04,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:04,911 INFO L462 AbstractCegarLoop]: Abstraction has 6168 states and 8809 transitions. [2019-10-15 01:29:04,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:29:04,911 INFO L276 IsEmpty]: Start isEmpty. Operand 6168 states and 8809 transitions. [2019-10-15 01:29:04,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-15 01:29:04,926 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:04,927 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:29:04,927 INFO L410 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:04,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:04,927 INFO L82 PathProgramCache]: Analyzing trace with hash -2055930379, now seen corresponding path program 1 times [2019-10-15 01:29:04,928 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:04,928 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575295015] [2019-10-15 01:29:04,928 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:04,928 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:04,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:04,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:05,047 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 43 proven. 16 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 01:29:05,047 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575295015] [2019-10-15 01:29:05,047 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255692996] [2019-10-15 01:29:05,048 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 01:29:05,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:05,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 1007 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 01:29:05,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:29:05,253 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-15 01:29:05,254 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:29:05,320 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 48 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-15 01:29:05,321 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:29:05,321 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9, 3] total 11 [2019-10-15 01:29:05,321 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495481746] [2019-10-15 01:29:05,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:29:05,322 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:05,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:29:05,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:29:05,323 INFO L87 Difference]: Start difference. First operand 6168 states and 8809 transitions. Second operand 3 states. [2019-10-15 01:29:05,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:05,759 INFO L93 Difference]: Finished difference Result 12819 states and 18799 transitions. [2019-10-15 01:29:05,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:29:05,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-10-15 01:29:05,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:05,796 INFO L225 Difference]: With dead ends: 12819 [2019-10-15 01:29:05,796 INFO L226 Difference]: Without dead ends: 8084 [2019-10-15 01:29:05,811 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:29:05,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8084 states. [2019-10-15 01:29:06,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8084 to 7046. [2019-10-15 01:29:06,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7046 states. [2019-10-15 01:29:06,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7046 states to 7046 states and 10155 transitions. [2019-10-15 01:29:06,458 INFO L78 Accepts]: Start accepts. Automaton has 7046 states and 10155 transitions. Word has length 149 [2019-10-15 01:29:06,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:06,458 INFO L462 AbstractCegarLoop]: Abstraction has 7046 states and 10155 transitions. [2019-10-15 01:29:06,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:29:06,459 INFO L276 IsEmpty]: Start isEmpty. Operand 7046 states and 10155 transitions. [2019-10-15 01:29:06,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-15 01:29:06,466 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:06,466 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:29:06,671 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:06,671 INFO L410 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:06,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:06,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1648571220, now seen corresponding path program 1 times [2019-10-15 01:29:06,673 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:06,673 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207153375] [2019-10-15 01:29:06,674 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:06,674 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:06,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:06,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:06,759 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 47 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-15 01:29:06,759 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207153375] [2019-10-15 01:29:06,760 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601205793] [2019-10-15 01:29:06,760 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 01:29:06,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:06,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 1060 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:29:06,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:29:07,027 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-15 01:29:07,028 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:29:07,114 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-15 01:29:07,115 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:29:07,115 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-10-15 01:29:07,116 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042401333] [2019-10-15 01:29:07,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:29:07,117 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:07,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:29:07,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:07,117 INFO L87 Difference]: Start difference. First operand 7046 states and 10155 transitions. Second operand 3 states. [2019-10-15 01:29:07,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:07,836 INFO L93 Difference]: Finished difference Result 18269 states and 27271 transitions. [2019-10-15 01:29:07,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:29:07,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-10-15 01:29:07,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:07,889 INFO L225 Difference]: With dead ends: 18269 [2019-10-15 01:29:07,890 INFO L226 Difference]: Without dead ends: 11259 [2019-10-15 01:29:07,918 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:07,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11259 states. [2019-10-15 01:29:08,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11259 to 11083. [2019-10-15 01:29:08,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11083 states. [2019-10-15 01:29:08,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11083 states to 11083 states and 15911 transitions. [2019-10-15 01:29:08,677 INFO L78 Accepts]: Start accepts. Automaton has 11083 states and 15911 transitions. Word has length 161 [2019-10-15 01:29:08,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:08,678 INFO L462 AbstractCegarLoop]: Abstraction has 11083 states and 15911 transitions. [2019-10-15 01:29:08,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:29:08,678 INFO L276 IsEmpty]: Start isEmpty. Operand 11083 states and 15911 transitions. [2019-10-15 01:29:08,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-15 01:29:08,695 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:08,696 INFO L380 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:29:08,905 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:08,906 INFO L410 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:08,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:08,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1514129236, now seen corresponding path program 1 times [2019-10-15 01:29:08,907 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:08,907 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366053663] [2019-10-15 01:29:08,907 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:08,907 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:08,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:08,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:08,990 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 37 proven. 10 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-15 01:29:08,990 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366053663] [2019-10-15 01:29:08,990 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151678341] [2019-10-15 01:29:08,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:09,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:09,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 1061 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:29:09,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:29:09,222 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-15 01:29:09,222 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:29:09,321 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-15 01:29:09,321 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:29:09,321 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 6 [2019-10-15 01:29:09,322 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614846915] [2019-10-15 01:29:09,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:29:09,323 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:09,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:29:09,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:29:09,324 INFO L87 Difference]: Start difference. First operand 11083 states and 15911 transitions. Second operand 3 states. [2019-10-15 01:29:10,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:10,348 INFO L93 Difference]: Finished difference Result 28277 states and 41370 transitions. [2019-10-15 01:29:10,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:29:10,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 162 [2019-10-15 01:29:10,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:10,446 INFO L225 Difference]: With dead ends: 28277 [2019-10-15 01:29:10,446 INFO L226 Difference]: Without dead ends: 17820 [2019-10-15 01:29:10,487 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:29:10,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17820 states. [2019-10-15 01:29:11,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17820 to 17788. [2019-10-15 01:29:11,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17788 states. [2019-10-15 01:29:11,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17788 states to 17788 states and 25490 transitions. [2019-10-15 01:29:11,532 INFO L78 Accepts]: Start accepts. Automaton has 17788 states and 25490 transitions. Word has length 162 [2019-10-15 01:29:11,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:11,532 INFO L462 AbstractCegarLoop]: Abstraction has 17788 states and 25490 transitions. [2019-10-15 01:29:11,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:29:11,533 INFO L276 IsEmpty]: Start isEmpty. Operand 17788 states and 25490 transitions. [2019-10-15 01:29:11,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-15 01:29:11,551 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:11,551 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:29:11,755 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:11,755 INFO L410 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:11,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:11,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1896839715, now seen corresponding path program 1 times [2019-10-15 01:29:11,756 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:11,756 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427543998] [2019-10-15 01:29:11,756 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:11,756 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:11,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:11,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:11,813 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-15 01:29:11,813 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427543998] [2019-10-15 01:29:11,813 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:11,813 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:29:11,814 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690719396] [2019-10-15 01:29:11,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:29:11,814 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:11,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:29:11,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:29:11,815 INFO L87 Difference]: Start difference. First operand 17788 states and 25490 transitions. Second operand 3 states. [2019-10-15 01:29:12,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:12,552 INFO L93 Difference]: Finished difference Result 30277 states and 43381 transitions. [2019-10-15 01:29:12,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:29:12,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-10-15 01:29:12,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:12,644 INFO L225 Difference]: With dead ends: 30277 [2019-10-15 01:29:12,644 INFO L226 Difference]: Without dead ends: 18000 [2019-10-15 01:29:12,690 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 01:29:12,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18000 states.