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 -i ../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 19:46:43,517 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 19:46:43,520 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 19:46:43,541 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 19:46:43,541 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 19:46:43,544 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 19:46:43,546 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 19:46:43,556 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 19:46:43,560 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 19:46:43,563 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 19:46:43,565 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 19:46:43,567 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 19:46:43,567 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 19:46:43,569 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 19:46:43,572 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 19:46:43,573 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 19:46:43,575 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 19:46:43,577 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 19:46:43,579 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 19:46:43,584 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 19:46:43,589 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 19:46:43,592 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 19:46:43,596 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 19:46:43,597 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 19:46:43,599 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 19:46:43,599 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 19:46:43,599 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 19:46:43,601 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 19:46:43,603 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 19:46:43,604 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 19:46:43,604 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 19:46:43,605 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 19:46:43,606 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 19:46:43,606 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 19:46:43,608 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 19:46:43,608 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 19:46:43,609 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 19:46:43,609 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 19:46:43,609 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 19:46:43,610 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 19:46:43,612 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 19:46:43,612 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-13 19:46:43,641 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 19:46:43,641 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 19:46:43,642 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 19:46:43,642 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 19:46:43,643 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 19:46:43,643 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 19:46:43,644 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 19:46:43,644 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 19:46:43,644 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 19:46:43,644 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 19:46:43,646 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 19:46:43,646 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 19:46:43,646 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 19:46:43,647 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 19:46:43,647 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 19:46:43,647 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 19:46:43,647 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 19:46:43,647 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 19:46:43,648 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 19:46:43,648 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 19:46:43,648 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 19:46:43,648 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:46:43,648 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 19:46:43,649 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 19:46:43,649 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 19:46:43,649 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 19:46:43,649 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 19:46:43,649 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 19:46:43,649 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 19:46:43,934 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 19:46:43,948 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 19:46:43,951 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 19:46:43,952 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 19:46:43,952 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 19:46:43,953 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2019-10-13 19:46:44,013 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/503bb7259/fb2aa166de444552a44f901bee8a0076/FLAG02e5e8bbb [2019-10-13 19:46:44,471 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 19:46:44,471 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2019-10-13 19:46:44,483 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/503bb7259/fb2aa166de444552a44f901bee8a0076/FLAG02e5e8bbb [2019-10-13 19:46:44,845 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/503bb7259/fb2aa166de444552a44f901bee8a0076 [2019-10-13 19:46:44,855 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 19:46:44,857 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 19:46:44,858 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 19:46:44,858 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 19:46:44,864 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 19:46:44,865 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:46:44" (1/1) ... [2019-10-13 19:46:44,868 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4432d2ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:46:44, skipping insertion in model container [2019-10-13 19:46:44,868 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:46:44" (1/1) ... [2019-10-13 19:46:44,876 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 19:46:44,935 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 19:46:45,303 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:46:45,312 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 19:46:45,374 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:46:45,398 INFO L192 MainTranslator]: Completed translation [2019-10-13 19:46:45,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:46:45 WrapperNode [2019-10-13 19:46:45,398 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 19:46:45,399 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 19:46:45,399 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 19:46:45,400 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 19:46:45,415 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:46:45" (1/1) ... [2019-10-13 19:46:45,415 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:46:45" (1/1) ... [2019-10-13 19:46:45,428 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:46:45" (1/1) ... [2019-10-13 19:46:45,429 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:46:45" (1/1) ... [2019-10-13 19:46:45,446 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:46:45" (1/1) ... [2019-10-13 19:46:45,459 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:46:45" (1/1) ... [2019-10-13 19:46:45,463 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:46:45" (1/1) ... [2019-10-13 19:46:45,469 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 19:46:45,470 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 19:46:45,470 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 19:46:45,470 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 19:46:45,471 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:46:45" (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-13 19:46:45,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 19:46:45,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 19:46:45,523 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2019-10-13 19:46:45,524 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2019-10-13 19:46:45,524 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2019-10-13 19:46:45,524 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_int8 [2019-10-13 19:46:45,524 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2019-10-13 19:46:45,524 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-10-13 19:46:45,524 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-10-13 19:46:45,525 INFO L138 BoogieDeclarations]: Found implementation of procedure gate1_each_pals_period [2019-10-13 19:46:45,525 INFO L138 BoogieDeclarations]: Found implementation of procedure gate2_each_pals_period [2019-10-13 19:46:45,525 INFO L138 BoogieDeclarations]: Found implementation of procedure gate3_each_pals_period [2019-10-13 19:46:45,525 INFO L138 BoogieDeclarations]: Found implementation of procedure voter [2019-10-13 19:46:45,525 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 19:46:45,525 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-10-13 19:46:45,526 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 19:46:45,526 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 19:46:45,526 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 19:46:45,526 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 19:46:45,526 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 19:46:45,527 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 19:46:45,527 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 19:46:45,527 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2019-10-13 19:46:45,527 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2019-10-13 19:46:45,527 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2019-10-13 19:46:45,527 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_int8 [2019-10-13 19:46:45,527 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2019-10-13 19:46:45,528 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 19:46:45,528 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 19:46:45,528 INFO L130 BoogieDeclarations]: Found specification of procedure gate1_each_pals_period [2019-10-13 19:46:45,528 INFO L130 BoogieDeclarations]: Found specification of procedure gate2_each_pals_period [2019-10-13 19:46:45,528 INFO L130 BoogieDeclarations]: Found specification of procedure gate3_each_pals_period [2019-10-13 19:46:45,528 INFO L130 BoogieDeclarations]: Found specification of procedure voter [2019-10-13 19:46:45,529 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 19:46:45,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 19:46:45,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 19:46:46,396 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 19:46:46,396 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-13 19:46:46,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:46:46 BoogieIcfgContainer [2019-10-13 19:46:46,399 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 19:46:46,400 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 19:46:46,400 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 19:46:46,403 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 19:46:46,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:46:44" (1/3) ... [2019-10-13 19:46:46,405 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11f9d1f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:46:46, skipping insertion in model container [2019-10-13 19:46:46,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:46:45" (2/3) ... [2019-10-13 19:46:46,406 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11f9d1f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:46:46, skipping insertion in model container [2019-10-13 19:46:46,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:46:46" (3/3) ... [2019-10-13 19:46:46,409 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2019-10-13 19:46:46,419 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 19:46:46,427 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 19:46:46,437 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 19:46:46,474 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 19:46:46,474 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 19:46:46,474 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 19:46:46,475 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 19:46:46,475 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 19:46:46,475 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 19:46:46,475 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 19:46:46,476 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 19:46:46,500 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states. [2019-10-13 19:46:46,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 19:46:46,511 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:46:46,512 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] [2019-10-13 19:46:46,516 INFO L410 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:46:46,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:46:46,522 INFO L82 PathProgramCache]: Analyzing trace with hash 310880814, now seen corresponding path program 1 times [2019-10-13 19:46:46,531 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:46:46,531 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793014267] [2019-10-13 19:46:46,532 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:46,532 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:46,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:46:46,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:46,960 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-10-13 19:46:46,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:46,991 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-13 19:46:46,992 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793014267] [2019-10-13 19:46:46,993 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:46:46,993 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:46:46,994 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320410608] [2019-10-13 19:46:46,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:46:46,999 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:46:47,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:46:47,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:46:47,011 INFO L87 Difference]: Start difference. First operand 209 states. Second operand 5 states. [2019-10-13 19:46:47,388 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-10-13 19:46:48,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:46:48,780 INFO L93 Difference]: Finished difference Result 416 states and 679 transitions. [2019-10-13 19:46:48,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:46:48,782 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-10-13 19:46:48,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:46:48,796 INFO L225 Difference]: With dead ends: 416 [2019-10-13 19:46:48,797 INFO L226 Difference]: Without dead ends: 216 [2019-10-13 19:46:48,804 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-13 19:46:48,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-10-13 19:46:48,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 210. [2019-10-13 19:46:48,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-10-13 19:46:48,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 313 transitions. [2019-10-13 19:46:48,881 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 313 transitions. Word has length 21 [2019-10-13 19:46:48,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:46:48,881 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 313 transitions. [2019-10-13 19:46:48,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:46:48,882 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 313 transitions. [2019-10-13 19:46:48,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 19:46:48,884 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:46:48,885 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] [2019-10-13 19:46:48,885 INFO L410 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:46:48,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:46:48,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1405375627, now seen corresponding path program 1 times [2019-10-13 19:46:48,886 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:46:48,886 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713437147] [2019-10-13 19:46:48,886 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:48,886 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:48,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:46:48,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:49,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:49,086 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-13 19:46:49,086 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713437147] [2019-10-13 19:46:49,087 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:46:49,087 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:46:49,087 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766471090] [2019-10-13 19:46:49,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:46:49,092 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:46:49,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:46:49,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:46:49,093 INFO L87 Difference]: Start difference. First operand 210 states and 313 transitions. Second operand 5 states. [2019-10-13 19:46:49,318 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-10-13 19:46:50,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:46:50,497 INFO L93 Difference]: Finished difference Result 431 states and 649 transitions. [2019-10-13 19:46:50,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:46:50,503 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-10-13 19:46:50,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:46:50,507 INFO L225 Difference]: With dead ends: 431 [2019-10-13 19:46:50,508 INFO L226 Difference]: Without dead ends: 230 [2019-10-13 19:46:50,510 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-13 19:46:50,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-10-13 19:46:50,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 223. [2019-10-13 19:46:50,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-10-13 19:46:50,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 329 transitions. [2019-10-13 19:46:50,551 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 329 transitions. Word has length 22 [2019-10-13 19:46:50,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:46:50,551 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 329 transitions. [2019-10-13 19:46:50,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:46:50,552 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 329 transitions. [2019-10-13 19:46:50,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-13 19:46:50,554 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:46:50,554 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 19:46:50,554 INFO L410 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:46:50,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:46:50,555 INFO L82 PathProgramCache]: Analyzing trace with hash -152672816, now seen corresponding path program 1 times [2019-10-13 19:46:50,555 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:46:50,555 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230875280] [2019-10-13 19:46:50,555 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:50,556 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:50,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:46:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:50,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:50,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:50,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:46:50,739 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230875280] [2019-10-13 19:46:50,739 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:46:50,739 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:46:50,739 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225715453] [2019-10-13 19:46:50,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:46:50,740 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:46:50,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:46:50,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:46:50,741 INFO L87 Difference]: Start difference. First operand 223 states and 329 transitions. Second operand 4 states. [2019-10-13 19:46:51,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:46:51,849 INFO L93 Difference]: Finished difference Result 463 states and 695 transitions. [2019-10-13 19:46:51,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:46:51,851 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-10-13 19:46:51,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:46:51,854 INFO L225 Difference]: With dead ends: 463 [2019-10-13 19:46:51,854 INFO L226 Difference]: Without dead ends: 256 [2019-10-13 19:46:51,855 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:46:51,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-10-13 19:46:51,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 225. [2019-10-13 19:46:51,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-10-13 19:46:51,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 331 transitions. [2019-10-13 19:46:51,888 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 331 transitions. Word has length 30 [2019-10-13 19:46:51,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:46:51,888 INFO L462 AbstractCegarLoop]: Abstraction has 225 states and 331 transitions. [2019-10-13 19:46:51,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:46:51,889 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 331 transitions. [2019-10-13 19:46:51,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-13 19:46:51,891 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:46:51,891 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 19:46:51,891 INFO L410 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:46:51,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:46:51,891 INFO L82 PathProgramCache]: Analyzing trace with hash 279611359, now seen corresponding path program 1 times [2019-10-13 19:46:51,892 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:46:51,892 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141062130] [2019-10-13 19:46:51,892 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:51,892 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:51,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:46:51,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:52,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:52,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:52,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:52,097 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:46:52,098 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141062130] [2019-10-13 19:46:52,098 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:46:52,098 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:46:52,099 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177162048] [2019-10-13 19:46:52,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:46:52,099 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:46:52,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:46:52,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:46:52,100 INFO L87 Difference]: Start difference. First operand 225 states and 331 transitions. Second operand 6 states. [2019-10-13 19:46:53,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:46:53,522 INFO L93 Difference]: Finished difference Result 440 states and 653 transitions. [2019-10-13 19:46:53,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:46:53,523 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-10-13 19:46:53,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:46:53,527 INFO L225 Difference]: With dead ends: 440 [2019-10-13 19:46:53,527 INFO L226 Difference]: Without dead ends: 237 [2019-10-13 19:46:53,529 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-13 19:46:53,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-10-13 19:46:53,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 229. [2019-10-13 19:46:53,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-10-13 19:46:53,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 335 transitions. [2019-10-13 19:46:53,594 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 335 transitions. Word has length 38 [2019-10-13 19:46:53,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:46:53,595 INFO L462 AbstractCegarLoop]: Abstraction has 229 states and 335 transitions. [2019-10-13 19:46:53,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:46:53,596 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 335 transitions. [2019-10-13 19:46:53,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-13 19:46:53,606 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:46:53,606 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] [2019-10-13 19:46:53,607 INFO L410 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:46:53,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:46:53,607 INFO L82 PathProgramCache]: Analyzing trace with hash -955467248, now seen corresponding path program 1 times [2019-10-13 19:46:53,608 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:46:53,608 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802123495] [2019-10-13 19:46:53,609 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:53,609 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:53,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:46:53,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:53,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:53,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:53,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:53,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:53,808 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-13 19:46:53,809 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802123495] [2019-10-13 19:46:53,809 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:46:53,810 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:46:53,810 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077383620] [2019-10-13 19:46:53,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:46:53,811 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:46:53,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:46:53,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:46:53,812 INFO L87 Difference]: Start difference. First operand 229 states and 335 transitions. Second operand 5 states. [2019-10-13 19:46:54,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:46:54,939 INFO L93 Difference]: Finished difference Result 401 states and 592 transitions. [2019-10-13 19:46:54,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:46:54,940 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-10-13 19:46:54,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:46:54,943 INFO L225 Difference]: With dead ends: 401 [2019-10-13 19:46:54,943 INFO L226 Difference]: Without dead ends: 229 [2019-10-13 19:46:54,944 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:46:54,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-10-13 19:46:54,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 225. [2019-10-13 19:46:54,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-10-13 19:46:54,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 326 transitions. [2019-10-13 19:46:54,969 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 326 transitions. Word has length 39 [2019-10-13 19:46:54,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:46:54,970 INFO L462 AbstractCegarLoop]: Abstraction has 225 states and 326 transitions. [2019-10-13 19:46:54,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:46:54,970 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 326 transitions. [2019-10-13 19:46:54,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-13 19:46:54,971 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:46:54,973 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 19:46:54,973 INFO L410 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:46:54,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:46:54,974 INFO L82 PathProgramCache]: Analyzing trace with hash -13889788, now seen corresponding path program 1 times [2019-10-13 19:46:54,974 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:46:54,974 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672289527] [2019-10-13 19:46:54,975 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:54,975 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:54,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:46:54,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:55,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:55,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:55,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:55,133 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 19:46:55,134 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672289527] [2019-10-13 19:46:55,135 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:46:55,135 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:46:55,136 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393177211] [2019-10-13 19:46:55,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:46:55,137 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:46:55,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:46:55,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:46:55,137 INFO L87 Difference]: Start difference. First operand 225 states and 326 transitions. Second operand 5 states. [2019-10-13 19:46:56,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:46:56,469 INFO L93 Difference]: Finished difference Result 450 states and 662 transitions. [2019-10-13 19:46:56,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:46:56,470 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-10-13 19:46:56,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:46:56,474 INFO L225 Difference]: With dead ends: 450 [2019-10-13 19:46:56,474 INFO L226 Difference]: Without dead ends: 248 [2019-10-13 19:46:56,476 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-13 19:46:56,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-10-13 19:46:56,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 241. [2019-10-13 19:46:56,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-10-13 19:46:56,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 345 transitions. [2019-10-13 19:46:56,500 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 345 transitions. Word has length 41 [2019-10-13 19:46:56,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:46:56,500 INFO L462 AbstractCegarLoop]: Abstraction has 241 states and 345 transitions. [2019-10-13 19:46:56,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:46:56,501 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 345 transitions. [2019-10-13 19:46:56,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-13 19:46:56,501 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:46:56,502 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 19:46:56,502 INFO L410 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:46:56,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:46:56,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1194739861, now seen corresponding path program 1 times [2019-10-13 19:46:56,503 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:46:56,503 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282878810] [2019-10-13 19:46:56,503 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:56,503 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:56,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:46:56,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:56,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:56,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:56,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:56,647 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-13 19:46:56,647 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282878810] [2019-10-13 19:46:56,647 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:46:56,648 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:46:56,648 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461551326] [2019-10-13 19:46:56,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:46:56,649 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:46:56,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:46:56,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:46:56,650 INFO L87 Difference]: Start difference. First operand 241 states and 345 transitions. Second operand 5 states. [2019-10-13 19:46:57,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:46:57,888 INFO L93 Difference]: Finished difference Result 470 states and 690 transitions. [2019-10-13 19:46:57,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:46:57,890 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-10-13 19:46:57,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:46:57,893 INFO L225 Difference]: With dead ends: 470 [2019-10-13 19:46:57,893 INFO L226 Difference]: Without dead ends: 254 [2019-10-13 19:46:57,895 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-13 19:46:57,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-10-13 19:46:57,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 248. [2019-10-13 19:46:57,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-10-13 19:46:57,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 353 transitions. [2019-10-13 19:46:57,927 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 353 transitions. Word has length 41 [2019-10-13 19:46:57,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:46:57,927 INFO L462 AbstractCegarLoop]: Abstraction has 248 states and 353 transitions. [2019-10-13 19:46:57,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:46:57,928 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 353 transitions. [2019-10-13 19:46:57,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-13 19:46:57,930 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:46:57,930 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-10-13 19:46:57,930 INFO L410 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:46:57,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:46:57,931 INFO L82 PathProgramCache]: Analyzing trace with hash -291623798, now seen corresponding path program 1 times [2019-10-13 19:46:57,931 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:46:57,931 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654606185] [2019-10-13 19:46:57,931 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:57,931 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:57,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:46:57,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:58,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:58,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:58,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:58,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:58,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:58,106 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-13 19:46:58,106 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654606185] [2019-10-13 19:46:58,107 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:46:58,107 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:46:58,107 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334965508] [2019-10-13 19:46:58,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:46:58,109 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:46:58,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:46:58,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:46:58,110 INFO L87 Difference]: Start difference. First operand 248 states and 353 transitions. Second operand 6 states. [2019-10-13 19:46:59,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:46:59,486 INFO L93 Difference]: Finished difference Result 469 states and 677 transitions. [2019-10-13 19:46:59,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:46:59,487 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-10-13 19:46:59,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:46:59,489 INFO L225 Difference]: With dead ends: 469 [2019-10-13 19:46:59,489 INFO L226 Difference]: Without dead ends: 254 [2019-10-13 19:46:59,491 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-13 19:46:59,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-10-13 19:46:59,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 248. [2019-10-13 19:46:59,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-10-13 19:46:59,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 352 transitions. [2019-10-13 19:46:59,514 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 352 transitions. Word has length 59 [2019-10-13 19:46:59,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:46:59,514 INFO L462 AbstractCegarLoop]: Abstraction has 248 states and 352 transitions. [2019-10-13 19:46:59,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:46:59,515 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 352 transitions. [2019-10-13 19:46:59,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-13 19:46:59,515 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:46:59,516 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 19:46:59,516 INFO L410 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:46:59,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:46:59,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1361992071, now seen corresponding path program 1 times [2019-10-13 19:46:59,517 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:46:59,517 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860050485] [2019-10-13 19:46:59,517 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:59,517 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:59,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:46:59,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:59,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:59,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:59,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:59,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:59,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:59,701 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-13 19:46:59,702 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860050485] [2019-10-13 19:46:59,702 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:46:59,702 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:46:59,702 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707375860] [2019-10-13 19:46:59,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:46:59,703 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:46:59,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:46:59,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:46:59,704 INFO L87 Difference]: Start difference. First operand 248 states and 352 transitions. Second operand 5 states. [2019-10-13 19:47:01,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:47:01,032 INFO L93 Difference]: Finished difference Result 483 states and 699 transitions. [2019-10-13 19:47:01,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:47:01,033 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-10-13 19:47:01,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:47:01,035 INFO L225 Difference]: With dead ends: 483 [2019-10-13 19:47:01,035 INFO L226 Difference]: Without dead ends: 273 [2019-10-13 19:47:01,038 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-13 19:47:01,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-10-13 19:47:01,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 266. [2019-10-13 19:47:01,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-10-13 19:47:01,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 373 transitions. [2019-10-13 19:47:01,074 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 373 transitions. Word has length 62 [2019-10-13 19:47:01,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:47:01,074 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 373 transitions. [2019-10-13 19:47:01,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:47:01,074 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 373 transitions. [2019-10-13 19:47:01,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-13 19:47:01,075 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:47:01,075 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 19:47:01,076 INFO L410 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:47:01,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:47:01,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1503019715, now seen corresponding path program 1 times [2019-10-13 19:47:01,076 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:47:01,076 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55712864] [2019-10-13 19:47:01,077 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:47:01,077 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:47:01,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:47:01,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:01,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:01,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:01,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:01,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:01,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:01,248 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-13 19:47:01,248 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55712864] [2019-10-13 19:47:01,248 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:47:01,248 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:47:01,249 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571498062] [2019-10-13 19:47:01,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:47:01,249 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:47:01,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:47:01,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:47:01,250 INFO L87 Difference]: Start difference. First operand 266 states and 373 transitions. Second operand 5 states. [2019-10-13 19:47:02,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:47:02,417 INFO L93 Difference]: Finished difference Result 490 states and 703 transitions. [2019-10-13 19:47:02,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:47:02,418 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-10-13 19:47:02,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:47:02,421 INFO L225 Difference]: With dead ends: 490 [2019-10-13 19:47:02,422 INFO L226 Difference]: Without dead ends: 264 [2019-10-13 19:47:02,423 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-13 19:47:02,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-10-13 19:47:02,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 260. [2019-10-13 19:47:02,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-10-13 19:47:02,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 359 transitions. [2019-10-13 19:47:02,444 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 359 transitions. Word has length 63 [2019-10-13 19:47:02,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:47:02,445 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 359 transitions. [2019-10-13 19:47:02,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:47:02,445 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 359 transitions. [2019-10-13 19:47:02,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-13 19:47:02,446 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:47:02,446 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:47:02,446 INFO L410 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:47:02,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:47:02,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1498693946, now seen corresponding path program 1 times [2019-10-13 19:47:02,447 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:47:02,447 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472352908] [2019-10-13 19:47:02,448 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:47:02,448 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:47:02,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:47:02,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:02,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:02,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:02,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:02,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:02,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:02,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:02,623 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-13 19:47:02,623 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472352908] [2019-10-13 19:47:02,624 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:47:02,624 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:47:02,624 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123578997] [2019-10-13 19:47:02,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:47:02,625 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:47:02,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:47:02,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:47:02,626 INFO L87 Difference]: Start difference. First operand 260 states and 359 transitions. Second operand 6 states. [2019-10-13 19:47:04,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:47:04,052 INFO L93 Difference]: Finished difference Result 477 states and 670 transitions. [2019-10-13 19:47:04,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:47:04,053 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-10-13 19:47:04,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:47:04,056 INFO L225 Difference]: With dead ends: 477 [2019-10-13 19:47:04,056 INFO L226 Difference]: Without dead ends: 266 [2019-10-13 19:47:04,057 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-13 19:47:04,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-10-13 19:47:04,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 260. [2019-10-13 19:47:04,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-10-13 19:47:04,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 358 transitions. [2019-10-13 19:47:04,078 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 358 transitions. Word has length 82 [2019-10-13 19:47:04,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:47:04,078 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 358 transitions. [2019-10-13 19:47:04,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:47:04,079 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 358 transitions. [2019-10-13 19:47:04,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-13 19:47:04,080 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:47:04,080 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:47:04,080 INFO L410 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:47:04,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:47:04,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1251929143, now seen corresponding path program 1 times [2019-10-13 19:47:04,081 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:47:04,081 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657330498] [2019-10-13 19:47:04,081 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:47:04,081 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:47:04,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:47:04,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:04,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:04,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:04,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:04,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:04,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:04,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:04,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:04,240 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-10-13 19:47:04,241 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657330498] [2019-10-13 19:47:04,241 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:47:04,241 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:47:04,241 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237242910] [2019-10-13 19:47:04,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:47:04,242 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:47:04,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:47:04,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:47:04,243 INFO L87 Difference]: Start difference. First operand 260 states and 358 transitions. Second operand 5 states. [2019-10-13 19:47:05,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:47:05,417 INFO L93 Difference]: Finished difference Result 466 states and 668 transitions. [2019-10-13 19:47:05,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:47:05,417 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-10-13 19:47:05,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:47:05,419 INFO L225 Difference]: With dead ends: 466 [2019-10-13 19:47:05,419 INFO L226 Difference]: Without dead ends: 262 [2019-10-13 19:47:05,420 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-13 19:47:05,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-10-13 19:47:05,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 258. [2019-10-13 19:47:05,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-10-13 19:47:05,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 354 transitions. [2019-10-13 19:47:05,440 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 354 transitions. Word has length 85 [2019-10-13 19:47:05,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:47:05,443 INFO L462 AbstractCegarLoop]: Abstraction has 258 states and 354 transitions. [2019-10-13 19:47:05,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:47:05,444 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 354 transitions. [2019-10-13 19:47:05,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-13 19:47:05,445 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:47:05,445 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-10-13 19:47:05,445 INFO L410 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:47:05,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:47:05,446 INFO L82 PathProgramCache]: Analyzing trace with hash 599019244, now seen corresponding path program 1 times [2019-10-13 19:47:05,446 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:47:05,446 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289163916] [2019-10-13 19:47:05,446 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:47:05,446 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:47:05,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:47:05,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:05,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:05,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:05,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:05,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:05,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:05,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:05,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:05,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:05,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:05,625 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-13 19:47:05,626 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289163916] [2019-10-13 19:47:05,626 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918848785] [2019-10-13 19:47:05,626 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-13 19:47:05,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:05,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 19:47:05,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:47:05,815 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-10-13 19:47:05,816 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:47:05,816 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2019-10-13 19:47:05,816 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12372813] [2019-10-13 19:47:05,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:47:05,817 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:47:05,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:47:05,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:47:05,817 INFO L87 Difference]: Start difference. First operand 258 states and 354 transitions. Second operand 5 states. [2019-10-13 19:47:07,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:47:07,110 INFO L93 Difference]: Finished difference Result 596 states and 828 transitions. [2019-10-13 19:47:07,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:47:07,110 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-10-13 19:47:07,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:47:07,113 INFO L225 Difference]: With dead ends: 596 [2019-10-13 19:47:07,113 INFO L226 Difference]: Without dead ends: 355 [2019-10-13 19:47:07,114 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-13 19:47:07,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2019-10-13 19:47:07,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 303. [2019-10-13 19:47:07,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-10-13 19:47:07,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 414 transitions. [2019-10-13 19:47:07,151 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 414 transitions. Word has length 100 [2019-10-13 19:47:07,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:47:07,151 INFO L462 AbstractCegarLoop]: Abstraction has 303 states and 414 transitions. [2019-10-13 19:47:07,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:47:07,151 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 414 transitions. [2019-10-13 19:47:07,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-13 19:47:07,154 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:47:07,154 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 4, 4, 4, 4, 3, 3, 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] [2019-10-13 19:47:07,362 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:47:07,362 INFO L410 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:47:07,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:47:07,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1779021272, now seen corresponding path program 1 times [2019-10-13 19:47:07,363 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:47:07,363 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86545716] [2019-10-13 19:47:07,363 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:47:07,363 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:47:07,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:47:07,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:07,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:07,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:07,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:07,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:07,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:07,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:07,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:07,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:07,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:07,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:07,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:07,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:07,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:07,580 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-10-13 19:47:07,581 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86545716] [2019-10-13 19:47:07,581 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:47:07,581 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:47:07,581 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907914973] [2019-10-13 19:47:07,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:47:07,583 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:47:07,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:47:07,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:47:07,583 INFO L87 Difference]: Start difference. First operand 303 states and 414 transitions. Second operand 5 states. [2019-10-13 19:47:08,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:47:08,977 INFO L93 Difference]: Finished difference Result 479 states and 666 transitions. [2019-10-13 19:47:08,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:47:08,978 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 141 [2019-10-13 19:47:08,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:47:08,980 INFO L225 Difference]: With dead ends: 479 [2019-10-13 19:47:08,980 INFO L226 Difference]: Without dead ends: 296 [2019-10-13 19:47:08,982 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-13 19:47:08,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-10-13 19:47:09,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 292. [2019-10-13 19:47:09,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-10-13 19:47:09,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 396 transitions. [2019-10-13 19:47:09,011 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 396 transitions. Word has length 141 [2019-10-13 19:47:09,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:47:09,014 INFO L462 AbstractCegarLoop]: Abstraction has 292 states and 396 transitions. [2019-10-13 19:47:09,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:47:09,014 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 396 transitions. [2019-10-13 19:47:09,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-13 19:47:09,017 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:47:09,017 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 5, 5, 4, 4, 3, 3, 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] [2019-10-13 19:47:09,018 INFO L410 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:47:09,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:47:09,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1060309692, now seen corresponding path program 1 times [2019-10-13 19:47:09,018 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:47:09,018 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995034569] [2019-10-13 19:47:09,019 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:47:09,019 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:47:09,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:47:09,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:09,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:09,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:09,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:09,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:09,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:09,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:09,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:09,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:09,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:09,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:09,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:09,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:09,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:09,230 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2019-10-13 19:47:09,230 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995034569] [2019-10-13 19:47:09,230 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:47:09,231 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:47:09,231 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249881613] [2019-10-13 19:47:09,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:47:09,232 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:47:09,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:47:09,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:47:09,232 INFO L87 Difference]: Start difference. First operand 292 states and 396 transitions. Second operand 5 states. [2019-10-13 19:47:09,524 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-10-13 19:47:10,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:47:10,528 INFO L93 Difference]: Finished difference Result 468 states and 648 transitions. [2019-10-13 19:47:10,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:47:10,529 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2019-10-13 19:47:10,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:47:10,533 INFO L225 Difference]: With dead ends: 468 [2019-10-13 19:47:10,533 INFO L226 Difference]: Without dead ends: 284 [2019-10-13 19:47:10,535 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-13 19:47:10,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-10-13 19:47:10,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 280. [2019-10-13 19:47:10,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-10-13 19:47:10,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 377 transitions. [2019-10-13 19:47:10,556 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 377 transitions. Word has length 143 [2019-10-13 19:47:10,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:47:10,557 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 377 transitions. [2019-10-13 19:47:10,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:47:10,557 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 377 transitions. [2019-10-13 19:47:10,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-13 19:47:10,559 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:47:10,559 INFO L380 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2019-10-13 19:47:10,559 INFO L410 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:47:10,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:47:10,560 INFO L82 PathProgramCache]: Analyzing trace with hash 158839533, now seen corresponding path program 1 times [2019-10-13 19:47:10,560 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:47:10,560 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471374583] [2019-10-13 19:47:10,560 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:47:10,560 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:47:10,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:47:10,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:10,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:10,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:10,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:10,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:10,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:10,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:10,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:10,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:10,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:10,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:10,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:10,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:10,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:10,767 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-10-13 19:47:10,767 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471374583] [2019-10-13 19:47:10,768 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238003730] [2019-10-13 19:47:10,768 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-13 19:47:10,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:10,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 19:47:10,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:47:10,979 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 74 proven. 8 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-13 19:47:10,980 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:47:10,980 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2019-10-13 19:47:10,980 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459621574] [2019-10-13 19:47:10,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:47:10,982 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:47:10,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:47:10,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:47:10,983 INFO L87 Difference]: Start difference. First operand 280 states and 377 transitions. Second operand 6 states. [2019-10-13 19:47:11,124 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-10-13 19:47:12,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:47:12,381 INFO L93 Difference]: Finished difference Result 585 states and 795 transitions. [2019-10-13 19:47:12,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:47:12,382 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-10-13 19:47:12,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:47:12,384 INFO L225 Difference]: With dead ends: 585 [2019-10-13 19:47:12,385 INFO L226 Difference]: Without dead ends: 328 [2019-10-13 19:47:12,386 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-10-13 19:47:12,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-10-13 19:47:12,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 318. [2019-10-13 19:47:12,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-10-13 19:47:12,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 424 transitions. [2019-10-13 19:47:12,413 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 424 transitions. Word has length 144 [2019-10-13 19:47:12,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:47:12,413 INFO L462 AbstractCegarLoop]: Abstraction has 318 states and 424 transitions. [2019-10-13 19:47:12,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:47:12,414 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 424 transitions. [2019-10-13 19:47:12,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-10-13 19:47:12,416 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:47:12,416 INFO L380 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 19:47:12,620 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:47:12,620 INFO L410 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:47:12,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:47:12,621 INFO L82 PathProgramCache]: Analyzing trace with hash 978746992, now seen corresponding path program 2 times [2019-10-13 19:47:12,621 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:47:12,621 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310862571] [2019-10-13 19:47:12,621 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:47:12,621 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:47:12,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:47:12,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:12,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:12,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:12,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:12,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:12,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:12,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:12,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:12,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:12,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:12,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:12,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:12,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:12,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:12,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:12,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:12,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:12,893 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2019-10-13 19:47:12,894 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310862571] [2019-10-13 19:47:12,894 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:47:12,894 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:47:12,894 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457068209] [2019-10-13 19:47:12,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:47:12,895 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:47:12,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:47:12,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:47:12,896 INFO L87 Difference]: Start difference. First operand 318 states and 424 transitions. Second operand 6 states. [2019-10-13 19:47:14,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:47:14,266 INFO L93 Difference]: Finished difference Result 493 states and 675 transitions. [2019-10-13 19:47:14,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:47:14,267 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 183 [2019-10-13 19:47:14,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:47:14,271 INFO L225 Difference]: With dead ends: 493 [2019-10-13 19:47:14,271 INFO L226 Difference]: Without dead ends: 322 [2019-10-13 19:47:14,272 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-13 19:47:14,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-10-13 19:47:14,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 318. [2019-10-13 19:47:14,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-10-13 19:47:14,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 418 transitions. [2019-10-13 19:47:14,296 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 418 transitions. Word has length 183 [2019-10-13 19:47:14,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:47:14,297 INFO L462 AbstractCegarLoop]: Abstraction has 318 states and 418 transitions. [2019-10-13 19:47:14,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:47:14,298 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 418 transitions. [2019-10-13 19:47:14,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-10-13 19:47:14,300 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:47:14,300 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 19:47:14,300 INFO L410 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:47:14,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:47:14,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1851165220, now seen corresponding path program 2 times [2019-10-13 19:47:14,301 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:47:14,301 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679522108] [2019-10-13 19:47:14,301 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:47:14,302 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:47:14,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:47:14,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:14,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:14,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:14,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:14,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:14,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:14,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:14,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:14,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:14,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:14,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:14,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:14,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:14,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:14,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:14,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:14,594 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 138 proven. 11 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2019-10-13 19:47:14,594 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679522108] [2019-10-13 19:47:14,594 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580864266] [2019-10-13 19:47:14,595 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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-13 19:47:14,752 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-10-13 19:47:14,752 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 19:47:14,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-13 19:47:14,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:47:14,866 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-10-13 19:47:14,867 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 19:47:14,867 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-10-13 19:47:14,867 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822262030] [2019-10-13 19:47:14,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:47:14,868 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:47:14,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:47:14,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 19:47:14,869 INFO L87 Difference]: Start difference. First operand 318 states and 418 transitions. Second operand 4 states. [2019-10-13 19:47:14,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:47:14,921 INFO L93 Difference]: Finished difference Result 488 states and 665 transitions. [2019-10-13 19:47:14,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:47:14,922 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 190 [2019-10-13 19:47:14,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:47:14,924 INFO L225 Difference]: With dead ends: 488 [2019-10-13 19:47:14,924 INFO L226 Difference]: Without dead ends: 324 [2019-10-13 19:47:14,925 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-13 19:47:14,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-10-13 19:47:14,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 322. [2019-10-13 19:47:14,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-10-13 19:47:14,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 421 transitions. [2019-10-13 19:47:14,950 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 421 transitions. Word has length 190 [2019-10-13 19:47:14,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:47:14,951 INFO L462 AbstractCegarLoop]: Abstraction has 322 states and 421 transitions. [2019-10-13 19:47:14,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:47:14,951 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 421 transitions. [2019-10-13 19:47:14,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-10-13 19:47:14,952 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:47:14,953 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-13 19:47:15,157 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:47:15,157 INFO L410 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:47:15,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:47:15,158 INFO L82 PathProgramCache]: Analyzing trace with hash -55995379, now seen corresponding path program 1 times [2019-10-13 19:47:15,158 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:47:15,158 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496627076] [2019-10-13 19:47:15,158 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:47:15,159 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:47:15,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:47:15,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:15,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:15,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:15,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:15,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:15,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:15,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:15,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:15,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:15,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:15,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:15,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:15,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:15,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:15,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:15,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:15,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:15,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:15,475 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 140 proven. 11 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2019-10-13 19:47:15,476 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496627076] [2019-10-13 19:47:15,476 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131125181] [2019-10-13 19:47:15,476 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-13 19:47:15,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:15,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 947 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-13 19:47:15,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:47:15,687 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 138 proven. 11 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2019-10-13 19:47:15,688 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:47:15,688 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 7 [2019-10-13 19:47:15,688 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79413726] [2019-10-13 19:47:15,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 19:47:15,689 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:47:15,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 19:47:15,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-13 19:47:15,690 INFO L87 Difference]: Start difference. First operand 322 states and 421 transitions. Second operand 7 states. [2019-10-13 19:47:17,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:47:17,635 INFO L93 Difference]: Finished difference Result 563 states and 758 transitions. [2019-10-13 19:47:17,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 19:47:17,636 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 202 [2019-10-13 19:47:17,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:47:17,645 INFO L225 Difference]: With dead ends: 563 [2019-10-13 19:47:17,645 INFO L226 Difference]: Without dead ends: 327 [2019-10-13 19:47:17,647 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:47:17,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-10-13 19:47:17,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 301. [2019-10-13 19:47:17,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-10-13 19:47:17,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 390 transitions. [2019-10-13 19:47:17,695 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 390 transitions. Word has length 202 [2019-10-13 19:47:17,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:47:17,696 INFO L462 AbstractCegarLoop]: Abstraction has 301 states and 390 transitions. [2019-10-13 19:47:17,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 19:47:17,696 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 390 transitions. [2019-10-13 19:47:17,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-10-13 19:47:17,697 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:47:17,698 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-13 19:47:17,902 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:47:17,902 INFO L410 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:47:17,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:47:17,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1204328224, now seen corresponding path program 1 times [2019-10-13 19:47:17,903 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:47:17,906 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488734793] [2019-10-13 19:47:17,906 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:47:17,906 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:47:17,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:47:17,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:18,115 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-10-13 19:47:18,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:18,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:18,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:18,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:18,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:18,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:18,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:18,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:18,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:18,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:18,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:18,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:18,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:18,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:18,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:18,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:18,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:18,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:18,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:18,393 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2019-10-13 19:47:18,394 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488734793] [2019-10-13 19:47:18,394 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862167314] [2019-10-13 19:47:18,395 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-13 19:47:18,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:18,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 1025 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-13 19:47:18,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:47:18,761 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2019-10-13 19:47:18,763 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 19:47:18,763 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 7 [2019-10-13 19:47:18,763 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879166289] [2019-10-13 19:47:18,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:47:18,765 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:47:18,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:47:18,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-13 19:47:18,766 INFO L87 Difference]: Start difference. First operand 301 states and 390 transitions. Second operand 4 states. [2019-10-13 19:47:18,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:47:18,837 INFO L93 Difference]: Finished difference Result 476 states and 641 transitions. [2019-10-13 19:47:18,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:47:18,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 226 [2019-10-13 19:47:18,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:47:18,841 INFO L225 Difference]: With dead ends: 476 [2019-10-13 19:47:18,841 INFO L226 Difference]: Without dead ends: 308 [2019-10-13 19:47:18,842 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-10-13 19:47:18,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-10-13 19:47:18,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 306. [2019-10-13 19:47:18,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-10-13 19:47:18,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 394 transitions. [2019-10-13 19:47:18,879 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 394 transitions. Word has length 226 [2019-10-13 19:47:18,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:47:18,880 INFO L462 AbstractCegarLoop]: Abstraction has 306 states and 394 transitions. [2019-10-13 19:47:18,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:47:18,881 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 394 transitions. [2019-10-13 19:47:18,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-10-13 19:47:18,884 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:47:18,884 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:47:19,091 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:47:19,091 INFO L410 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:47:19,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:47:19,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1446004142, now seen corresponding path program 1 times [2019-10-13 19:47:19,092 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:47:19,093 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738206469] [2019-10-13 19:47:19,093 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:47:19,093 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:47:19,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:47:19,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:19,322 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-10-13 19:47:19,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:19,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:19,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:19,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:19,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:19,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:19,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:19,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:19,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:19,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:19,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:19,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:19,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:19,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:19,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:19,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:19,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:19,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:19,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:19,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:19,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:19,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:19,659 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2019-10-13 19:47:19,660 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738206469] [2019-10-13 19:47:19,660 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175640476] [2019-10-13 19:47:19,660 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