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/product-lines/elevator_spec14_product11.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 03:37:51,415 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 03:37:51,417 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 03:37:51,432 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 03:37:51,432 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 03:37:51,434 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 03:37:51,435 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 03:37:51,437 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 03:37:51,439 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 03:37:51,440 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 03:37:51,441 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 03:37:51,442 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 03:37:51,442 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 03:37:51,443 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 03:37:51,444 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 03:37:51,445 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 03:37:51,446 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 03:37:51,447 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 03:37:51,449 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 03:37:51,451 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 03:37:51,453 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 03:37:51,454 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 03:37:51,456 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 03:37:51,457 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 03:37:51,459 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 03:37:51,460 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 03:37:51,460 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 03:37:51,461 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 03:37:51,462 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 03:37:51,463 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 03:37:51,463 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 03:37:51,464 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 03:37:51,465 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 03:37:51,466 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 03:37:51,467 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 03:37:51,467 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 03:37:51,468 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 03:37:51,468 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 03:37:51,469 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 03:37:51,470 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 03:37:51,470 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 03:37:51,471 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-09-08 03:37:51,488 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 03:37:51,488 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 03:37:51,490 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 03:37:51,490 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 03:37:51,490 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 03:37:51,490 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 03:37:51,490 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 03:37:51,491 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 03:37:51,491 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 03:37:51,491 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 03:37:51,491 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 03:37:51,491 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 03:37:51,492 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 03:37:51,492 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 03:37:51,492 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 03:37:51,492 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 03:37:51,492 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 03:37:51,493 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 03:37:51,493 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 03:37:51,493 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 03:37:51,493 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 03:37:51,494 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 03:37:51,494 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 03:37:51,494 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 03:37:51,494 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 03:37:51,494 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 03:37:51,495 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 03:37:51,495 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 03:37:51,495 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 03:37:51,525 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 03:37:51,539 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 03:37:51,543 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 03:37:51,545 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 03:37:51,545 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 03:37:51,546 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec14_product11.cil.c [2019-09-08 03:37:51,621 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c6ac416f/08b9c51359c347a0986475283c17ead9/FLAGd4ae0c436 [2019-09-08 03:37:52,259 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 03:37:52,259 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec14_product11.cil.c [2019-09-08 03:37:52,283 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c6ac416f/08b9c51359c347a0986475283c17ead9/FLAGd4ae0c436 [2019-09-08 03:37:52,388 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c6ac416f/08b9c51359c347a0986475283c17ead9 [2019-09-08 03:37:52,400 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 03:37:52,401 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 03:37:52,403 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 03:37:52,403 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 03:37:52,407 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 03:37:52,408 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 03:37:52" (1/1) ... [2019-09-08 03:37:52,412 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b5b30fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:37:52, skipping insertion in model container [2019-09-08 03:37:52,412 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 03:37:52" (1/1) ... [2019-09-08 03:37:52,420 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 03:37:52,513 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 03:37:53,220 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 03:37:53,246 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 03:37:53,363 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 03:37:53,425 INFO L192 MainTranslator]: Completed translation [2019-09-08 03:37:53,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:37:53 WrapperNode [2019-09-08 03:37:53,426 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 03:37:53,427 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 03:37:53,427 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 03:37:53,427 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 03:37:53,442 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:37:53" (1/1) ... [2019-09-08 03:37:53,443 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:37:53" (1/1) ... [2019-09-08 03:37:53,473 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:37:53" (1/1) ... [2019-09-08 03:37:53,474 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:37:53" (1/1) ... [2019-09-08 03:37:53,530 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:37:53" (1/1) ... [2019-09-08 03:37:53,583 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:37:53" (1/1) ... [2019-09-08 03:37:53,607 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:37:53" (1/1) ... [2019-09-08 03:37:53,631 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 03:37:53,636 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 03:37:53,637 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 03:37:53,637 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 03:37:53,638 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:37:53" (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-09-08 03:37:53,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 03:37:53,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 03:37:53,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 03:37:53,727 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 03:37:53,728 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 03:37:53,728 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 03:37:53,728 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 03:37:53,728 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-09-08 03:37:53,729 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-09-08 03:37:53,729 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 03:37:53,729 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-09-08 03:37:53,730 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-09-08 03:37:53,730 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-09-08 03:37:53,730 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification14_spec__1 [2019-09-08 03:37:53,731 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-09-08 03:37:53,732 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-09-08 03:37:53,734 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-09-08 03:37:53,735 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-09-08 03:37:53,735 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-09-08 03:37:53,735 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-09-08 03:37:53,736 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-09-08 03:37:53,736 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-09-08 03:37:53,736 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-09-08 03:37:53,737 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-09-08 03:37:53,737 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-09-08 03:37:53,737 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-09-08 03:37:53,737 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-09-08 03:37:53,738 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-09-08 03:37:53,738 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 03:37:53,738 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-09-08 03:37:53,739 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 03:37:53,739 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 03:37:53,739 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 03:37:53,739 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 03:37:53,740 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 03:37:53,740 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 03:37:53,740 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 03:37:53,740 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-09-08 03:37:53,741 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-09-08 03:37:53,741 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-09-08 03:37:53,741 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-09-08 03:37:53,741 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-09-08 03:37:53,742 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-09-08 03:37:53,742 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-09-08 03:37:53,742 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-09-08 03:37:53,742 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-09-08 03:37:53,743 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-09-08 03:37:53,743 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-09-08 03:37:53,743 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-09-08 03:37:53,743 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-09-08 03:37:53,744 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-09-08 03:37:53,744 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-09-08 03:37:53,744 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-09-08 03:37:53,744 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-09-08 03:37:53,745 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-09-08 03:37:53,745 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-09-08 03:37:53,745 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-09-08 03:37:53,745 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-09-08 03:37:53,745 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-09-08 03:37:53,746 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-09-08 03:37:53,746 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-09-08 03:37:53,747 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-09-08 03:37:53,747 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-09-08 03:37:53,747 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-09-08 03:37:53,747 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-09-08 03:37:53,747 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-09-08 03:37:53,748 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-09-08 03:37:53,748 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-09-08 03:37:53,748 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-09-08 03:37:53,749 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-09-08 03:37:53,750 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-09-08 03:37:53,750 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-09-08 03:37:53,751 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-09-08 03:37:53,751 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 03:37:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 03:37:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 03:37:53,753 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 03:37:53,753 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 03:37:53,753 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 03:37:53,754 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 03:37:53,754 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-09-08 03:37:53,754 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-09-08 03:37:53,755 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-09-08 03:37:53,755 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-09-08 03:37:53,756 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-09-08 03:37:53,756 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-09-08 03:37:53,756 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-09-08 03:37:53,756 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-09-08 03:37:53,757 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-09-08 03:37:53,757 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 03:37:53,757 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-09-08 03:37:53,758 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-09-08 03:37:53,758 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-09-08 03:37:53,759 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-09-08 03:37:53,759 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-09-08 03:37:53,759 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-09-08 03:37:53,760 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification14_spec__1 [2019-09-08 03:37:53,760 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-08 03:37:53,760 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-09-08 03:37:53,761 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-09-08 03:37:53,761 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-09-08 03:37:53,761 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-09-08 03:37:53,761 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-09-08 03:37:53,761 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-09-08 03:37:53,762 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-09-08 03:37:53,762 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-09-08 03:37:53,762 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-09-08 03:37:53,762 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-09-08 03:37:53,763 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-09-08 03:37:53,763 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-09-08 03:37:53,763 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-09-08 03:37:53,763 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-09-08 03:37:53,763 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-09-08 03:37:53,764 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 03:37:53,764 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 03:37:53,764 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-09-08 03:37:53,764 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 03:37:53,764 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 03:37:53,765 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 03:37:53,765 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 03:37:53,766 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 03:37:53,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 03:37:53,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 03:37:53,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 03:37:53,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 03:37:53,768 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 03:37:53,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 03:37:53,768 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 03:37:53,768 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 03:37:53,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 03:37:53,769 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 03:37:53,769 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 03:37:53,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 03:37:53,770 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 03:37:53,770 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-09-08 03:37:53,771 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-09-08 03:37:53,771 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-09-08 03:37:53,772 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-09-08 03:37:53,772 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-09-08 03:37:53,773 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-09-08 03:37:53,778 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-09-08 03:37:53,779 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 03:37:53,779 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-09-08 03:37:53,780 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-09-08 03:37:53,789 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-09-08 03:37:53,790 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-09-08 03:37:53,790 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-09-08 03:37:53,790 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-09-08 03:37:53,790 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-09-08 03:37:53,790 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-09-08 03:37:53,791 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-09-08 03:37:53,791 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-09-08 03:37:53,791 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-09-08 03:37:53,791 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-09-08 03:37:53,791 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-09-08 03:37:53,792 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-09-08 03:37:53,792 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-09-08 03:37:53,792 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-09-08 03:37:53,792 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-09-08 03:37:53,792 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-09-08 03:37:53,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 03:37:53,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 03:37:53,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 03:37:56,172 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 03:37:56,173 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-09-08 03:37:56,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 03:37:56 BoogieIcfgContainer [2019-09-08 03:37:56,175 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 03:37:56,176 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 03:37:56,176 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 03:37:56,180 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 03:37:56,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 03:37:52" (1/3) ... [2019-09-08 03:37:56,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79a2d1c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 03:37:56, skipping insertion in model container [2019-09-08 03:37:56,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:37:53" (2/3) ... [2019-09-08 03:37:56,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79a2d1c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 03:37:56, skipping insertion in model container [2019-09-08 03:37:56,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 03:37:56" (3/3) ... [2019-09-08 03:37:56,183 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec14_product11.cil.c [2019-09-08 03:37:56,194 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 03:37:56,203 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 03:37:56,219 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 03:37:56,263 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 03:37:56,263 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 03:37:56,263 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 03:37:56,263 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 03:37:56,264 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 03:37:56,264 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 03:37:56,264 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 03:37:56,264 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 03:37:56,264 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 03:37:56,300 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states. [2019-09-08 03:37:56,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 03:37:56,338 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:37:56,340 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:37:56,342 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:37:56,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:37:56,349 INFO L82 PathProgramCache]: Analyzing trace with hash -2137869489, now seen corresponding path program 1 times [2019-09-08 03:37:56,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:37:56,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:37:56,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:37:56,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:37:56,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:37:56,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:37:57,009 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 03:37:57,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:37:57,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:37:57,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:37:57,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:37:57,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:37:57,037 INFO L87 Difference]: Start difference. First operand 730 states. Second operand 4 states. [2019-09-08 03:37:57,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:37:57,339 INFO L93 Difference]: Finished difference Result 1158 states and 1864 transitions. [2019-09-08 03:37:57,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 03:37:57,341 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-09-08 03:37:57,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:37:57,382 INFO L225 Difference]: With dead ends: 1158 [2019-09-08 03:37:57,382 INFO L226 Difference]: Without dead ends: 582 [2019-09-08 03:37:57,393 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 03:37:57,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-09-08 03:37:57,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2019-09-08 03:37:57,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-09-08 03:37:57,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 923 transitions. [2019-09-08 03:37:57,538 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 923 transitions. Word has length 135 [2019-09-08 03:37:57,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:37:57,539 INFO L475 AbstractCegarLoop]: Abstraction has 582 states and 923 transitions. [2019-09-08 03:37:57,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:37:57,539 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 923 transitions. [2019-09-08 03:37:57,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 03:37:57,547 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:37:57,547 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:37:57,548 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:37:57,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:37:57,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1566459786, now seen corresponding path program 1 times [2019-09-08 03:37:57,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:37:57,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:37:57,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:37:57,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:37:57,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:37:57,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:37:57,745 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 03:37:57,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:37:57,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:37:57,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:37:57,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:37:57,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:37:57,751 INFO L87 Difference]: Start difference. First operand 582 states and 923 transitions. Second operand 4 states. [2019-09-08 03:37:57,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:37:57,852 INFO L93 Difference]: Finished difference Result 1131 states and 1807 transitions. [2019-09-08 03:37:57,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 03:37:57,853 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-09-08 03:37:57,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:37:57,862 INFO L225 Difference]: With dead ends: 1131 [2019-09-08 03:37:57,862 INFO L226 Difference]: Without dead ends: 582 [2019-09-08 03:37:57,868 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 03:37:57,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-09-08 03:37:57,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2019-09-08 03:37:57,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-09-08 03:37:57,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 922 transitions. [2019-09-08 03:37:57,920 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 922 transitions. Word has length 136 [2019-09-08 03:37:57,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:37:57,922 INFO L475 AbstractCegarLoop]: Abstraction has 582 states and 922 transitions. [2019-09-08 03:37:57,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:37:57,922 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 922 transitions. [2019-09-08 03:37:57,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 03:37:57,933 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:37:57,933 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:37:57,933 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:37:57,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:37:57,934 INFO L82 PathProgramCache]: Analyzing trace with hash 785186859, now seen corresponding path program 1 times [2019-09-08 03:37:57,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:37:57,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:37:57,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:37:57,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:37:57,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:37:57,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:37:58,080 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 03:37:58,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:37:58,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:37:58,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:37:58,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:37:58,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:37:58,083 INFO L87 Difference]: Start difference. First operand 582 states and 922 transitions. Second operand 4 states. [2019-09-08 03:37:58,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:37:58,160 INFO L93 Difference]: Finished difference Result 1131 states and 1806 transitions. [2019-09-08 03:37:58,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 03:37:58,160 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-09-08 03:37:58,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:37:58,167 INFO L225 Difference]: With dead ends: 1131 [2019-09-08 03:37:58,168 INFO L226 Difference]: Without dead ends: 582 [2019-09-08 03:37:58,171 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 03:37:58,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-09-08 03:37:58,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2019-09-08 03:37:58,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-09-08 03:37:58,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 921 transitions. [2019-09-08 03:37:58,208 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 921 transitions. Word has length 137 [2019-09-08 03:37:58,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:37:58,208 INFO L475 AbstractCegarLoop]: Abstraction has 582 states and 921 transitions. [2019-09-08 03:37:58,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:37:58,209 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 921 transitions. [2019-09-08 03:37:58,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 03:37:58,214 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:37:58,215 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:37:58,215 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:37:58,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:37:58,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1610800858, now seen corresponding path program 1 times [2019-09-08 03:37:58,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:37:58,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:37:58,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:37:58,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:37:58,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:37:58,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:37:58,375 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 03:37:58,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:37:58,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:37:58,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:37:58,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:37:58,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:37:58,377 INFO L87 Difference]: Start difference. First operand 582 states and 921 transitions. Second operand 4 states. [2019-09-08 03:37:58,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:37:58,444 INFO L93 Difference]: Finished difference Result 1131 states and 1805 transitions. [2019-09-08 03:37:58,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 03:37:58,445 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-09-08 03:37:58,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:37:58,451 INFO L225 Difference]: With dead ends: 1131 [2019-09-08 03:37:58,452 INFO L226 Difference]: Without dead ends: 582 [2019-09-08 03:37:58,456 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 03:37:58,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-09-08 03:37:58,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2019-09-08 03:37:58,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-09-08 03:37:58,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 920 transitions. [2019-09-08 03:37:58,482 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 920 transitions. Word has length 138 [2019-09-08 03:37:58,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:37:58,483 INFO L475 AbstractCegarLoop]: Abstraction has 582 states and 920 transitions. [2019-09-08 03:37:58,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:37:58,483 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 920 transitions. [2019-09-08 03:37:58,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-08 03:37:58,488 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:37:58,488 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:37:58,488 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:37:58,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:37:58,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1771627783, now seen corresponding path program 1 times [2019-09-08 03:37:58,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:37:58,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:37:58,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:37:58,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:37:58,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:37:58,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:37:58,641 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 03:37:58,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:37:58,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:37:58,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:37:58,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:37:58,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:37:58,644 INFO L87 Difference]: Start difference. First operand 582 states and 920 transitions. Second operand 4 states. [2019-09-08 03:37:58,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:37:58,711 INFO L93 Difference]: Finished difference Result 1131 states and 1804 transitions. [2019-09-08 03:37:58,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 03:37:58,712 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-09-08 03:37:58,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:37:58,718 INFO L225 Difference]: With dead ends: 1131 [2019-09-08 03:37:58,718 INFO L226 Difference]: Without dead ends: 582 [2019-09-08 03:37:58,722 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 03:37:58,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-09-08 03:37:58,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2019-09-08 03:37:58,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-09-08 03:37:58,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 919 transitions. [2019-09-08 03:37:58,749 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 919 transitions. Word has length 139 [2019-09-08 03:37:58,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:37:58,750 INFO L475 AbstractCegarLoop]: Abstraction has 582 states and 919 transitions. [2019-09-08 03:37:58,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:37:58,750 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 919 transitions. [2019-09-08 03:37:58,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-08 03:37:58,755 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:37:58,755 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:37:58,756 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:37:58,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:37:58,756 INFO L82 PathProgramCache]: Analyzing trace with hash -398630206, now seen corresponding path program 1 times [2019-09-08 03:37:58,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:37:58,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:37:58,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:37:58,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:37:58,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:37:58,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:37:58,952 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 03:37:58,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:37:58,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 03:37:58,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 03:37:58,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 03:37:58,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:37:58,954 INFO L87 Difference]: Start difference. First operand 582 states and 919 transitions. Second operand 10 states. [2019-09-08 03:37:59,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:37:59,172 INFO L93 Difference]: Finished difference Result 1136 states and 1811 transitions. [2019-09-08 03:37:59,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 03:37:59,173 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2019-09-08 03:37:59,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:37:59,179 INFO L225 Difference]: With dead ends: 1136 [2019-09-08 03:37:59,179 INFO L226 Difference]: Without dead ends: 591 [2019-09-08 03:37:59,184 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:37:59,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-09-08 03:37:59,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 589. [2019-09-08 03:37:59,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-09-08 03:37:59,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 929 transitions. [2019-09-08 03:37:59,262 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 929 transitions. Word has length 140 [2019-09-08 03:37:59,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:37:59,263 INFO L475 AbstractCegarLoop]: Abstraction has 589 states and 929 transitions. [2019-09-08 03:37:59,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 03:37:59,263 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 929 transitions. [2019-09-08 03:37:59,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-08 03:37:59,269 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:37:59,269 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:37:59,270 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:37:59,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:37:59,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1385212895, now seen corresponding path program 1 times [2019-09-08 03:37:59,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:37:59,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:37:59,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:37:59,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:37:59,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:37:59,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:37:59,389 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 03:37:59,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:37:59,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:37:59,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:37:59,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:37:59,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:37:59,394 INFO L87 Difference]: Start difference. First operand 589 states and 929 transitions. Second operand 4 states. [2019-09-08 03:37:59,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:37:59,458 INFO L93 Difference]: Finished difference Result 1137 states and 1812 transitions. [2019-09-08 03:37:59,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 03:37:59,459 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-09-08 03:37:59,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:37:59,465 INFO L225 Difference]: With dead ends: 1137 [2019-09-08 03:37:59,465 INFO L226 Difference]: Without dead ends: 585 [2019-09-08 03:37:59,469 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 03:37:59,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2019-09-08 03:37:59,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 585. [2019-09-08 03:37:59,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2019-09-08 03:37:59,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 922 transitions. [2019-09-08 03:37:59,492 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 922 transitions. Word has length 140 [2019-09-08 03:37:59,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:37:59,493 INFO L475 AbstractCegarLoop]: Abstraction has 585 states and 922 transitions. [2019-09-08 03:37:59,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:37:59,493 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 922 transitions. [2019-09-08 03:37:59,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-08 03:37:59,498 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:37:59,498 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:37:59,498 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:37:59,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:37:59,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1670566169, now seen corresponding path program 1 times [2019-09-08 03:37:59,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:37:59,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:37:59,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:37:59,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:37:59,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:37:59,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:37:59,630 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 03:37:59,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:37:59,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:37:59,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:37:59,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:37:59,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:37:59,632 INFO L87 Difference]: Start difference. First operand 585 states and 922 transitions. Second operand 6 states. [2019-09-08 03:37:59,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:37:59,969 INFO L93 Difference]: Finished difference Result 1150 states and 1836 transitions. [2019-09-08 03:37:59,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:37:59,970 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-09-08 03:37:59,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:37:59,978 INFO L225 Difference]: With dead ends: 1150 [2019-09-08 03:37:59,978 INFO L226 Difference]: Without dead ends: 593 [2019-09-08 03:37:59,982 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:37:59,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2019-09-08 03:38:00,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 590. [2019-09-08 03:38:00,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-09-08 03:38:00,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 923 transitions. [2019-09-08 03:38:00,022 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 923 transitions. Word has length 141 [2019-09-08 03:38:00,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:38:00,022 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 923 transitions. [2019-09-08 03:38:00,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:38:00,023 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 923 transitions. [2019-09-08 03:38:00,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-08 03:38:00,027 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:38:00,027 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:38:00,028 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:38:00,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:38:00,028 INFO L82 PathProgramCache]: Analyzing trace with hash 478732421, now seen corresponding path program 1 times [2019-09-08 03:38:00,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:38:00,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:38:00,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:38:00,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:38:00,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:38:00,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:38:00,256 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 03:38:00,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:38:00,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:38:00,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:38:00,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:38:00,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:38:00,258 INFO L87 Difference]: Start difference. First operand 590 states and 923 transitions. Second operand 6 states. [2019-09-08 03:38:00,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:38:00,490 INFO L93 Difference]: Finished difference Result 1113 states and 1751 transitions. [2019-09-08 03:38:00,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:38:00,491 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-09-08 03:38:00,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:38:00,498 INFO L225 Difference]: With dead ends: 1113 [2019-09-08 03:38:00,499 INFO L226 Difference]: Without dead ends: 590 [2019-09-08 03:38:00,502 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:38:00,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-09-08 03:38:00,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-09-08 03:38:00,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-09-08 03:38:00,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 919 transitions. [2019-09-08 03:38:00,526 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 919 transitions. Word has length 142 [2019-09-08 03:38:00,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:38:00,527 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 919 transitions. [2019-09-08 03:38:00,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:38:00,527 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 919 transitions. [2019-09-08 03:38:00,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-08 03:38:00,531 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:38:00,531 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:38:00,531 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:38:00,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:38:00,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1066219550, now seen corresponding path program 1 times [2019-09-08 03:38:00,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:38:00,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:38:00,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:38:00,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:38:00,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:38:00,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:38:00,667 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 03:38:00,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:38:00,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:38:00,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:38:00,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:38:00,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:38:00,668 INFO L87 Difference]: Start difference. First operand 590 states and 919 transitions. Second operand 6 states. [2019-09-08 03:38:00,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:38:00,890 INFO L93 Difference]: Finished difference Result 1113 states and 1747 transitions. [2019-09-08 03:38:00,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:38:00,891 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-09-08 03:38:00,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:38:00,896 INFO L225 Difference]: With dead ends: 1113 [2019-09-08 03:38:00,896 INFO L226 Difference]: Without dead ends: 590 [2019-09-08 03:38:00,899 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:38:00,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-09-08 03:38:00,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-09-08 03:38:00,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-09-08 03:38:00,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 915 transitions. [2019-09-08 03:38:00,919 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 915 transitions. Word has length 143 [2019-09-08 03:38:00,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:38:00,920 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 915 transitions. [2019-09-08 03:38:00,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:38:00,920 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 915 transitions. [2019-09-08 03:38:00,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-08 03:38:00,924 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:38:00,924 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:38:00,924 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:38:00,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:38:00,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1343550622, now seen corresponding path program 1 times [2019-09-08 03:38:00,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:38:00,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:38:00,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:38:00,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:38:00,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:38:00,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:38:01,046 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 03:38:01,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:38:01,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:38:01,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:38:01,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:38:01,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:38:01,048 INFO L87 Difference]: Start difference. First operand 590 states and 915 transitions. Second operand 7 states. [2019-09-08 03:38:01,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:38:01,155 INFO L93 Difference]: Finished difference Result 1116 states and 1747 transitions. [2019-09-08 03:38:01,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:38:01,156 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-09-08 03:38:01,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:38:01,161 INFO L225 Difference]: With dead ends: 1116 [2019-09-08 03:38:01,161 INFO L226 Difference]: Without dead ends: 572 [2019-09-08 03:38:01,164 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:38:01,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2019-09-08 03:38:01,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 569. [2019-09-08 03:38:01,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2019-09-08 03:38:01,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 878 transitions. [2019-09-08 03:38:01,185 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 878 transitions. Word has length 143 [2019-09-08 03:38:01,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:38:01,186 INFO L475 AbstractCegarLoop]: Abstraction has 569 states and 878 transitions. [2019-09-08 03:38:01,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:38:01,186 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 878 transitions. [2019-09-08 03:38:01,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 03:38:01,190 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:38:01,190 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:38:01,190 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:38:01,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:38:01,191 INFO L82 PathProgramCache]: Analyzing trace with hash 978079018, now seen corresponding path program 1 times [2019-09-08 03:38:01,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:38:01,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:38:01,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:38:01,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:38:01,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:38:01,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:38:01,366 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 03:38:01,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:38:01,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:38:01,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:38:01,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:38:01,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:38:01,369 INFO L87 Difference]: Start difference. First operand 569 states and 878 transitions. Second operand 6 states. [2019-09-08 03:38:01,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:38:01,545 INFO L93 Difference]: Finished difference Result 1092 states and 1706 transitions. [2019-09-08 03:38:01,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:38:01,546 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-09-08 03:38:01,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:38:01,553 INFO L225 Difference]: With dead ends: 1092 [2019-09-08 03:38:01,553 INFO L226 Difference]: Without dead ends: 569 [2019-09-08 03:38:01,558 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:38:01,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2019-09-08 03:38:01,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 569. [2019-09-08 03:38:01,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2019-09-08 03:38:01,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 877 transitions. [2019-09-08 03:38:01,599 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 877 transitions. Word has length 144 [2019-09-08 03:38:01,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:38:01,599 INFO L475 AbstractCegarLoop]: Abstraction has 569 states and 877 transitions. [2019-09-08 03:38:01,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:38:01,600 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 877 transitions. [2019-09-08 03:38:01,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-08 03:38:01,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:38:01,607 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:38:01,607 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:38:01,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:38:01,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1420317475, now seen corresponding path program 1 times [2019-09-08 03:38:01,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:38:01,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:38:01,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:38:01,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:38:01,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:38:01,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:38:01,811 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 03:38:01,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:38:01,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:38:01,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:38:01,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:38:01,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:38:01,814 INFO L87 Difference]: Start difference. First operand 569 states and 877 transitions. Second operand 6 states. [2019-09-08 03:38:01,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:38:01,996 INFO L93 Difference]: Finished difference Result 1092 states and 1705 transitions. [2019-09-08 03:38:01,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:38:01,997 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-09-08 03:38:01,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:38:02,005 INFO L225 Difference]: With dead ends: 1092 [2019-09-08 03:38:02,005 INFO L226 Difference]: Without dead ends: 569 [2019-09-08 03:38:02,010 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:38:02,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2019-09-08 03:38:02,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 569. [2019-09-08 03:38:02,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2019-09-08 03:38:02,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 876 transitions. [2019-09-08 03:38:02,053 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 876 transitions. Word has length 145 [2019-09-08 03:38:02,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:38:02,054 INFO L475 AbstractCegarLoop]: Abstraction has 569 states and 876 transitions. [2019-09-08 03:38:02,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:38:02,055 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 876 transitions. [2019-09-08 03:38:02,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 03:38:02,062 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:38:02,062 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:38:02,063 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:38:02,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:38:02,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1124435407, now seen corresponding path program 1 times [2019-09-08 03:38:02,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:38:02,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:38:02,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:38:02,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:38:02,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:38:02,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:38:02,351 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 03:38:02,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:38:02,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 03:38:02,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 03:38:02,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 03:38:02,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-08 03:38:02,354 INFO L87 Difference]: Start difference. First operand 569 states and 876 transitions. Second operand 12 states. [2019-09-08 03:38:02,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:38:02,682 INFO L93 Difference]: Finished difference Result 1098 states and 1715 transitions. [2019-09-08 03:38:02,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 03:38:02,683 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 146 [2019-09-08 03:38:02,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:38:02,689 INFO L225 Difference]: With dead ends: 1098 [2019-09-08 03:38:02,689 INFO L226 Difference]: Without dead ends: 576 [2019-09-08 03:38:02,693 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:38:02,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-09-08 03:38:02,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 574. [2019-09-08 03:38:02,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-09-08 03:38:02,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 882 transitions. [2019-09-08 03:38:02,718 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 882 transitions. Word has length 146 [2019-09-08 03:38:02,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:38:02,720 INFO L475 AbstractCegarLoop]: Abstraction has 574 states and 882 transitions. [2019-09-08 03:38:02,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 03:38:02,720 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 882 transitions. [2019-09-08 03:38:02,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-08 03:38:02,724 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:38:02,724 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:38:02,724 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:38:02,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:38:02,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1505055730, now seen corresponding path program 1 times [2019-09-08 03:38:02,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:38:02,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:38:02,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:38:02,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:38:02,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:38:02,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:38:02,969 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 03:38:02,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:38:02,970 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:38:02,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:38:03,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:38:03,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 2599 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 03:38:03,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:38:03,497 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-08 03:38:03,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:38:03,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2019-09-08 03:38:03,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 03:38:03,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 03:38:03,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:38:03,513 INFO L87 Difference]: Start difference. First operand 574 states and 882 transitions. Second operand 13 states. [2019-09-08 03:38:14,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:38:14,269 INFO L93 Difference]: Finished difference Result 1674 states and 2709 transitions. [2019-09-08 03:38:14,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 03:38:14,270 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 147 [2019-09-08 03:38:14,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:38:14,287 INFO L225 Difference]: With dead ends: 1674 [2019-09-08 03:38:14,287 INFO L226 Difference]: Without dead ends: 1153 [2019-09-08 03:38:14,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 162 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=168, Invalid=702, Unknown=0, NotChecked=0, Total=870 [2019-09-08 03:38:14,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2019-09-08 03:38:14,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1136. [2019-09-08 03:38:14,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1136 states. [2019-09-08 03:38:14,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 1136 states and 1808 transitions. [2019-09-08 03:38:14,401 INFO L78 Accepts]: Start accepts. Automaton has 1136 states and 1808 transitions. Word has length 147 [2019-09-08 03:38:14,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:38:14,402 INFO L475 AbstractCegarLoop]: Abstraction has 1136 states and 1808 transitions. [2019-09-08 03:38:14,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 03:38:14,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 1808 transitions. [2019-09-08 03:38:14,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-08 03:38:14,408 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:38:14,409 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:38:14,409 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:38:14,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:38:14,410 INFO L82 PathProgramCache]: Analyzing trace with hash -2143848474, now seen corresponding path program 1 times [2019-09-08 03:38:14,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:38:14,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:38:14,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:38:14,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:38:14,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:38:14,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:38:14,736 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-08 03:38:14,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:38:14,740 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:38:14,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:38:15,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:38:15,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 2602 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 03:38:15,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:38:15,396 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-08 03:38:15,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:38:15,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-08 03:38:15,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:38:15,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:38:15,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:38:15,413 INFO L87 Difference]: Start difference. First operand 1136 states and 1808 transitions. Second operand 9 states. [2019-09-08 03:38:16,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:38:16,961 INFO L93 Difference]: Finished difference Result 2231 states and 3639 transitions. [2019-09-08 03:38:16,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:38:16,962 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 150 [2019-09-08 03:38:16,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:38:16,973 INFO L225 Difference]: With dead ends: 2231 [2019-09-08 03:38:16,974 INFO L226 Difference]: Without dead ends: 1144 [2019-09-08 03:38:16,982 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 149 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:38:16,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2019-09-08 03:38:17,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 1144. [2019-09-08 03:38:17,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1144 states. [2019-09-08 03:38:17,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1803 transitions. [2019-09-08 03:38:17,041 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1803 transitions. Word has length 150 [2019-09-08 03:38:17,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:38:17,042 INFO L475 AbstractCegarLoop]: Abstraction has 1144 states and 1803 transitions. [2019-09-08 03:38:17,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:38:17,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1803 transitions. [2019-09-08 03:38:17,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-08 03:38:17,047 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:38:17,047 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:38:17,047 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:38:17,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:38:17,048 INFO L82 PathProgramCache]: Analyzing trace with hash 566628864, now seen corresponding path program 1 times [2019-09-08 03:38:17,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:38:17,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:38:17,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:38:17,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:38:17,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:38:17,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:38:17,246 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 03:38:17,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:38:17,247 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:38:17,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:38:17,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:38:17,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 2607 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 03:38:17,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:38:17,720 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 03:38:17,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:38:17,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2019-09-08 03:38:17,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 03:38:17,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 03:38:17,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:38:17,732 INFO L87 Difference]: Start difference. First operand 1144 states and 1803 transitions. Second operand 13 states. [2019-09-08 03:38:28,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:38:28,501 INFO L93 Difference]: Finished difference Result 3579 states and 5834 transitions. [2019-09-08 03:38:28,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 03:38:28,501 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 157 [2019-09-08 03:38:28,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:38:28,520 INFO L225 Difference]: With dead ends: 3579 [2019-09-08 03:38:28,520 INFO L226 Difference]: Without dead ends: 2488 [2019-09-08 03:38:28,533 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 172 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=702, Unknown=0, NotChecked=0, Total=870 [2019-09-08 03:38:28,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2488 states. [2019-09-08 03:38:28,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2488 to 2450. [2019-09-08 03:38:28,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2450 states. [2019-09-08 03:38:28,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 2450 states and 3937 transitions. [2019-09-08 03:38:28,698 INFO L78 Accepts]: Start accepts. Automaton has 2450 states and 3937 transitions. Word has length 157 [2019-09-08 03:38:28,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:38:28,698 INFO L475 AbstractCegarLoop]: Abstraction has 2450 states and 3937 transitions. [2019-09-08 03:38:28,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 03:38:28,698 INFO L276 IsEmpty]: Start isEmpty. Operand 2450 states and 3937 transitions. [2019-09-08 03:38:28,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-08 03:38:28,705 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:38:28,706 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:38:28,706 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:38:28,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:38:28,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1878745502, now seen corresponding path program 1 times [2019-09-08 03:38:28,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:38:28,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:38:28,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:38:28,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:38:28,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:38:28,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:38:28,912 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-08 03:38:28,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:38:28,913 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:38:28,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:38:29,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:38:29,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 2608 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 03:38:29,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:38:29,359 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-08 03:38:29,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:38:29,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2019-09-08 03:38:29,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 03:38:29,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 03:38:29,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:38:29,377 INFO L87 Difference]: Start difference. First operand 2450 states and 3937 transitions. Second operand 13 states. [2019-09-08 03:38:40,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:38:40,126 INFO L93 Difference]: Finished difference Result 6956 states and 11423 transitions. [2019-09-08 03:38:40,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 03:38:40,131 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 156 [2019-09-08 03:38:40,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:38:40,164 INFO L225 Difference]: With dead ends: 6956 [2019-09-08 03:38:40,164 INFO L226 Difference]: Without dead ends: 4565 [2019-09-08 03:38:40,183 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=702, Unknown=0, NotChecked=0, Total=870 [2019-09-08 03:38:40,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4565 states. [2019-09-08 03:38:40,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4565 to 4486. [2019-09-08 03:38:40,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4486 states. [2019-09-08 03:38:40,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4486 states to 4486 states and 7267 transitions. [2019-09-08 03:38:40,468 INFO L78 Accepts]: Start accepts. Automaton has 4486 states and 7267 transitions. Word has length 156 [2019-09-08 03:38:40,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:38:40,468 INFO L475 AbstractCegarLoop]: Abstraction has 4486 states and 7267 transitions. [2019-09-08 03:38:40,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 03:38:40,469 INFO L276 IsEmpty]: Start isEmpty. Operand 4486 states and 7267 transitions. [2019-09-08 03:38:40,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-08 03:38:40,479 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:38:40,548 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:38:40,548 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:38:40,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:38:40,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1877071098, now seen corresponding path program 1 times [2019-09-08 03:38:40,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:38:40,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:38:40,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:38:40,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:38:40,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:38:40,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:38:40,747 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 03:38:40,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:38:40,747 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:38:40,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:38:41,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:38:41,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 2611 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-08 03:38:41,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:38:41,178 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 03:38:41,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:38:41,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2019-09-08 03:38:41,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 03:38:41,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 03:38:41,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:38:41,185 INFO L87 Difference]: Start difference. First operand 4486 states and 7267 transitions. Second operand 13 states. [2019-09-08 03:38:57,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:38:57,242 INFO L93 Difference]: Finished difference Result 18859 states and 31173 transitions. [2019-09-08 03:38:57,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-08 03:38:57,243 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 159 [2019-09-08 03:38:57,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:38:57,358 INFO L225 Difference]: With dead ends: 18859 [2019-09-08 03:38:57,358 INFO L226 Difference]: Without dead ends: 14438 [2019-09-08 03:38:57,397 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=279, Invalid=1883, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 03:38:57,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14438 states. [2019-09-08 03:38:58,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14438 to 14075. [2019-09-08 03:38:58,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14075 states. [2019-09-08 03:38:58,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14075 states to 14075 states and 23010 transitions. [2019-09-08 03:38:58,250 INFO L78 Accepts]: Start accepts. Automaton has 14075 states and 23010 transitions. Word has length 159 [2019-09-08 03:38:58,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:38:58,252 INFO L475 AbstractCegarLoop]: Abstraction has 14075 states and 23010 transitions. [2019-09-08 03:38:58,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 03:38:58,252 INFO L276 IsEmpty]: Start isEmpty. Operand 14075 states and 23010 transitions. [2019-09-08 03:38:58,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-08 03:38:58,269 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:38:58,269 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:38:58,270 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:38:58,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:38:58,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1435875264, now seen corresponding path program 1 times [2019-09-08 03:38:58,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:38:58,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:38:58,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:38:58,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:38:58,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:38:58,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:38:58,424 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-09-08 03:38:58,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:38:58,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:38:58,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:38:58,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:38:58,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:38:58,427 INFO L87 Difference]: Start difference. First operand 14075 states and 23010 transitions. Second operand 9 states. [2019-09-08 03:38:59,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:38:59,641 INFO L93 Difference]: Finished difference Result 19752 states and 32186 transitions. [2019-09-08 03:38:59,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 03:38:59,642 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 167 [2019-09-08 03:38:59,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:38:59,689 INFO L225 Difference]: With dead ends: 19752 [2019-09-08 03:38:59,690 INFO L226 Difference]: Without dead ends: 5724 [2019-09-08 03:38:59,755 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:38:59,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5724 states. [2019-09-08 03:39:00,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5724 to 5720. [2019-09-08 03:39:00,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5720 states. [2019-09-08 03:39:00,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5720 states to 5720 states and 9213 transitions. [2019-09-08 03:39:00,092 INFO L78 Accepts]: Start accepts. Automaton has 5720 states and 9213 transitions. Word has length 167 [2019-09-08 03:39:00,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:39:00,092 INFO L475 AbstractCegarLoop]: Abstraction has 5720 states and 9213 transitions. [2019-09-08 03:39:00,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:39:00,092 INFO L276 IsEmpty]: Start isEmpty. Operand 5720 states and 9213 transitions. [2019-09-08 03:39:00,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-08 03:39:00,097 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:39:00,097 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:39:00,097 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:39:00,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:39:00,098 INFO L82 PathProgramCache]: Analyzing trace with hash -782533111, now seen corresponding path program 1 times [2019-09-08 03:39:00,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:39:00,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:39:00,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:39:00,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:39:00,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:39:00,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:39:00,255 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-09-08 03:39:00,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:39:00,255 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:39:00,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:39:00,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:39:00,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 2647 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 03:39:00,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:39:00,636 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:39:00,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:39:00,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-09-08 03:39:00,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:39:00,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:39:00,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:39:00,653 INFO L87 Difference]: Start difference. First operand 5720 states and 9213 transitions. Second operand 9 states. [2019-09-08 03:39:11,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:39:11,448 INFO L93 Difference]: Finished difference Result 14350 states and 23421 transitions. [2019-09-08 03:39:11,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 03:39:11,449 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 170 [2019-09-08 03:39:11,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:39:11,501 INFO L225 Difference]: With dead ends: 14350 [2019-09-08 03:39:11,501 INFO L226 Difference]: Without dead ends: 8683 [2019-09-08 03:39:11,522 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=561, Unknown=0, NotChecked=0, Total=702 [2019-09-08 03:39:11,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8683 states. [2019-09-08 03:39:11,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8683 to 5752. [2019-09-08 03:39:11,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5752 states. [2019-09-08 03:39:11,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5752 states to 5752 states and 9264 transitions. [2019-09-08 03:39:11,876 INFO L78 Accepts]: Start accepts. Automaton has 5752 states and 9264 transitions. Word has length 170 [2019-09-08 03:39:11,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:39:11,878 INFO L475 AbstractCegarLoop]: Abstraction has 5752 states and 9264 transitions. [2019-09-08 03:39:11,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:39:11,878 INFO L276 IsEmpty]: Start isEmpty. Operand 5752 states and 9264 transitions. [2019-09-08 03:39:11,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-08 03:39:11,883 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:39:11,883 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:39:11,884 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:39:11,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:39:11,884 INFO L82 PathProgramCache]: Analyzing trace with hash -863250819, now seen corresponding path program 1 times [2019-09-08 03:39:11,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:39:11,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:39:11,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:39:11,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:39:11,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:39:11,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:39:12,021 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-08 03:39:12,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:39:12,022 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:39:12,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:39:12,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:39:12,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 2647 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-08 03:39:12,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:39:12,480 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-08 03:39:12,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:39:12,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-08 03:39:12,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:39:12,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:39:12,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:39:12,488 INFO L87 Difference]: Start difference. First operand 5752 states and 9264 transitions. Second operand 9 states. [2019-09-08 03:39:17,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:39:17,025 INFO L93 Difference]: Finished difference Result 28163 states and 45792 transitions. [2019-09-08 03:39:17,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 03:39:17,027 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 171 [2019-09-08 03:39:17,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:39:17,152 INFO L225 Difference]: With dead ends: 28163 [2019-09-08 03:39:17,152 INFO L226 Difference]: Without dead ends: 22204 [2019-09-08 03:39:17,191 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 187 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=166, Invalid=484, Unknown=0, NotChecked=0, Total=650 [2019-09-08 03:39:17,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22204 states. [2019-09-08 03:39:18,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22204 to 22031. [2019-09-08 03:39:18,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22031 states. [2019-09-08 03:39:18,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22031 states to 22031 states and 34813 transitions. [2019-09-08 03:39:18,403 INFO L78 Accepts]: Start accepts. Automaton has 22031 states and 34813 transitions. Word has length 171 [2019-09-08 03:39:18,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:39:18,403 INFO L475 AbstractCegarLoop]: Abstraction has 22031 states and 34813 transitions. [2019-09-08 03:39:18,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:39:18,403 INFO L276 IsEmpty]: Start isEmpty. Operand 22031 states and 34813 transitions. [2019-09-08 03:39:18,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-08 03:39:18,408 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:39:18,408 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:39:18,408 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:39:18,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:39:18,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1161224084, now seen corresponding path program 1 times [2019-09-08 03:39:18,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:39:18,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:39:18,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:39:18,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:39:18,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:39:18,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:39:18,569 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-09-08 03:39:18,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:39:18,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:39:18,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:39:18,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:39:18,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:39:18,570 INFO L87 Difference]: Start difference. First operand 22031 states and 34813 transitions. Second operand 7 states. [2019-09-08 03:39:22,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:39:22,447 INFO L93 Difference]: Finished difference Result 65564 states and 106220 transitions. [2019-09-08 03:39:22,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 03:39:22,448 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 177 [2019-09-08 03:39:22,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:39:22,674 INFO L225 Difference]: With dead ends: 65564 [2019-09-08 03:39:22,675 INFO L226 Difference]: Without dead ends: 43586 [2019-09-08 03:39:22,749 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:39:22,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43586 states. [2019-09-08 03:39:24,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43586 to 43399. [2019-09-08 03:39:24,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43399 states. [2019-09-08 03:39:24,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43399 states to 43399 states and 69432 transitions. [2019-09-08 03:39:24,490 INFO L78 Accepts]: Start accepts. Automaton has 43399 states and 69432 transitions. Word has length 177 [2019-09-08 03:39:24,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:39:24,491 INFO L475 AbstractCegarLoop]: Abstraction has 43399 states and 69432 transitions. [2019-09-08 03:39:24,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:39:24,491 INFO L276 IsEmpty]: Start isEmpty. Operand 43399 states and 69432 transitions. [2019-09-08 03:39:24,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-08 03:39:24,497 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:39:24,497 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:39:24,497 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:39:24,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:39:24,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1924500973, now seen corresponding path program 1 times [2019-09-08 03:39:24,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:39:24,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:39:24,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:39:24,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:39:24,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:39:24,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:39:24,636 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 03:39:24,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:39:24,637 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:39:24,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:39:25,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:39:25,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 2668 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-08 03:39:25,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:39:25,454 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-08 03:39:25,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:39:25,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 15 [2019-09-08 03:39:25,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 03:39:25,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 03:39:25,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-09-08 03:39:25,461 INFO L87 Difference]: Start difference. First operand 43399 states and 69432 transitions. Second operand 15 states. [2019-09-08 03:39:34,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:39:34,181 INFO L93 Difference]: Finished difference Result 83342 states and 134006 transitions. [2019-09-08 03:39:34,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 03:39:34,181 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 177 [2019-09-08 03:39:34,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:39:34,377 INFO L225 Difference]: With dead ends: 83342 [2019-09-08 03:39:34,377 INFO L226 Difference]: Without dead ends: 43830 [2019-09-08 03:39:34,480 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2019-09-08 03:39:34,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43830 states. [2019-09-08 03:39:37,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43830 to 43307. [2019-09-08 03:39:37,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43307 states. [2019-09-08 03:39:37,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43307 states to 43307 states and 69224 transitions. [2019-09-08 03:39:37,979 INFO L78 Accepts]: Start accepts. Automaton has 43307 states and 69224 transitions. Word has length 177 [2019-09-08 03:39:37,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:39:37,980 INFO L475 AbstractCegarLoop]: Abstraction has 43307 states and 69224 transitions. [2019-09-08 03:39:37,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 03:39:37,980 INFO L276 IsEmpty]: Start isEmpty. Operand 43307 states and 69224 transitions. [2019-09-08 03:39:37,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 03:39:37,986 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:39:37,986 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:39:37,986 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:39:37,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:39:37,987 INFO L82 PathProgramCache]: Analyzing trace with hash 971862440, now seen corresponding path program 1 times [2019-09-08 03:39:37,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:39:37,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:39:37,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:39:37,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:39:37,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:39:38,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:39:38,148 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-09-08 03:39:38,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:39:38,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:39:38,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:39:38,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:39:38,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:39:38,149 INFO L87 Difference]: Start difference. First operand 43307 states and 69224 transitions. Second operand 7 states. [2019-09-08 03:39:40,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:39:40,150 INFO L93 Difference]: Finished difference Result 83156 states and 133364 transitions. [2019-09-08 03:39:40,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 03:39:40,150 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 179 [2019-09-08 03:39:40,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:39:40,373 INFO L225 Difference]: With dead ends: 83156 [2019-09-08 03:39:40,374 INFO L226 Difference]: Without dead ends: 43760 [2019-09-08 03:39:40,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:39:40,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43760 states. [2019-09-08 03:39:42,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43760 to 43507. [2019-09-08 03:39:42,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43507 states. [2019-09-08 03:39:42,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43507 states to 43507 states and 69534 transitions. [2019-09-08 03:39:42,425 INFO L78 Accepts]: Start accepts. Automaton has 43507 states and 69534 transitions. Word has length 179 [2019-09-08 03:39:42,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:39:42,425 INFO L475 AbstractCegarLoop]: Abstraction has 43507 states and 69534 transitions. [2019-09-08 03:39:42,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:39:42,425 INFO L276 IsEmpty]: Start isEmpty. Operand 43507 states and 69534 transitions. [2019-09-08 03:39:42,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-08 03:39:42,430 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:39:42,430 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:39:42,431 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:39:42,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:39:42,431 INFO L82 PathProgramCache]: Analyzing trace with hash 991406821, now seen corresponding path program 1 times [2019-09-08 03:39:42,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:39:42,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:39:42,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:39:42,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:39:42,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:39:42,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:39:42,551 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-09-08 03:39:42,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:39:42,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:39:42,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:39:42,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:39:42,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:39:42,553 INFO L87 Difference]: Start difference. First operand 43507 states and 69534 transitions. Second operand 7 states. [2019-09-08 03:39:43,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:39:43,996 INFO L93 Difference]: Finished difference Result 83833 states and 134954 transitions. [2019-09-08 03:39:43,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:39:43,996 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 184 [2019-09-08 03:39:43,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:39:44,259 INFO L225 Difference]: With dead ends: 83833 [2019-09-08 03:39:44,259 INFO L226 Difference]: Without dead ends: 44237 [2019-09-08 03:39:44,387 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:39:44,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44237 states. [2019-09-08 03:39:47,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44237 to 44137. [2019-09-08 03:39:47,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44137 states. [2019-09-08 03:39:48,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44137 states to 44137 states and 70985 transitions. [2019-09-08 03:39:48,116 INFO L78 Accepts]: Start accepts. Automaton has 44137 states and 70985 transitions. Word has length 184 [2019-09-08 03:39:48,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:39:48,116 INFO L475 AbstractCegarLoop]: Abstraction has 44137 states and 70985 transitions. [2019-09-08 03:39:48,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:39:48,116 INFO L276 IsEmpty]: Start isEmpty. Operand 44137 states and 70985 transitions. [2019-09-08 03:39:48,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-09-08 03:39:48,121 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:39:48,122 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:39:48,122 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:39:48,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:39:48,122 INFO L82 PathProgramCache]: Analyzing trace with hash -86496406, now seen corresponding path program 1 times [2019-09-08 03:39:48,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:39:48,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:39:48,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:39:48,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:39:48,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:39:48,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:39:48,278 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-09-08 03:39:48,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:39:48,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:39:48,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:39:48,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:39:48,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:39:48,281 INFO L87 Difference]: Start difference. First operand 44137 states and 70985 transitions. Second operand 9 states. [2019-09-08 03:39:51,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:39:51,087 INFO L93 Difference]: Finished difference Result 84716 states and 136517 transitions. [2019-09-08 03:39:51,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 03:39:51,087 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 224 [2019-09-08 03:39:51,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:39:51,317 INFO L225 Difference]: With dead ends: 84716 [2019-09-08 03:39:51,317 INFO L226 Difference]: Without dead ends: 44390 [2019-09-08 03:39:51,419 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2019-09-08 03:39:51,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44390 states. [2019-09-08 03:39:52,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44390 to 44137. [2019-09-08 03:39:52,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44137 states. [2019-09-08 03:39:53,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44137 states to 44137 states and 70935 transitions. [2019-09-08 03:39:53,365 INFO L78 Accepts]: Start accepts. Automaton has 44137 states and 70935 transitions. Word has length 224 [2019-09-08 03:39:53,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:39:53,365 INFO L475 AbstractCegarLoop]: Abstraction has 44137 states and 70935 transitions. [2019-09-08 03:39:53,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:39:53,366 INFO L276 IsEmpty]: Start isEmpty. Operand 44137 states and 70935 transitions. [2019-09-08 03:39:53,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-08 03:39:53,368 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:39:53,369 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:39:53,369 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:39:53,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:39:53,369 INFO L82 PathProgramCache]: Analyzing trace with hash -578783932, now seen corresponding path program 1 times [2019-09-08 03:39:53,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:39:53,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:39:53,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:39:53,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:39:53,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:39:53,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:39:53,516 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-09-08 03:39:53,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:39:53,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:39:53,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:39:53,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:39:53,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:39:53,518 INFO L87 Difference]: Start difference. First operand 44137 states and 70935 transitions. Second operand 9 states. [2019-09-08 03:39:55,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:39:55,112 INFO L93 Difference]: Finished difference Result 87273 states and 142615 transitions. [2019-09-08 03:39:55,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:39:55,113 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 191 [2019-09-08 03:39:55,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:39:55,335 INFO L225 Difference]: With dead ends: 87273 [2019-09-08 03:39:55,335 INFO L226 Difference]: Without dead ends: 44137 [2019-09-08 03:39:55,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:39:55,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44137 states. [2019-09-08 03:39:57,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44137 to 44137. [2019-09-08 03:39:57,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44137 states. [2019-09-08 03:39:57,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44137 states to 44137 states and 70515 transitions. [2019-09-08 03:39:57,510 INFO L78 Accepts]: Start accepts. Automaton has 44137 states and 70515 transitions. Word has length 191 [2019-09-08 03:39:57,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:39:57,510 INFO L475 AbstractCegarLoop]: Abstraction has 44137 states and 70515 transitions. [2019-09-08 03:39:57,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:39:57,511 INFO L276 IsEmpty]: Start isEmpty. Operand 44137 states and 70515 transitions. [2019-09-08 03:39:57,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-09-08 03:39:57,515 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:39:57,515 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:39:57,515 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:39:57,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:39:57,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1223145708, now seen corresponding path program 1 times [2019-09-08 03:39:57,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:39:57,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:39:57,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:39:57,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:39:57,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:39:57,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:39:57,676 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-08 03:39:57,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:39:57,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:39:57,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:39:57,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:39:57,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:39:57,678 INFO L87 Difference]: Start difference. First operand 44137 states and 70515 transitions. Second operand 9 states. [2019-09-08 03:40:05,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:40:05,404 INFO L93 Difference]: Finished difference Result 87669 states and 142476 transitions. [2019-09-08 03:40:05,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 03:40:05,404 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 219 [2019-09-08 03:40:05,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:40:05,524 INFO L225 Difference]: With dead ends: 87669 [2019-09-08 03:40:05,524 INFO L226 Difference]: Without dead ends: 14859 [2019-09-08 03:40:05,690 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2019-09-08 03:40:05,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14859 states. [2019-09-08 03:40:06,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14859 to 14625. [2019-09-08 03:40:06,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14625 states. [2019-09-08 03:40:06,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14625 states to 14625 states and 22879 transitions. [2019-09-08 03:40:06,134 INFO L78 Accepts]: Start accepts. Automaton has 14625 states and 22879 transitions. Word has length 219 [2019-09-08 03:40:06,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:40:06,135 INFO L475 AbstractCegarLoop]: Abstraction has 14625 states and 22879 transitions. [2019-09-08 03:40:06,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:40:06,135 INFO L276 IsEmpty]: Start isEmpty. Operand 14625 states and 22879 transitions. [2019-09-08 03:40:06,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2019-09-08 03:40:06,164 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:40:06,165 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 12, 12, 12, 12, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:40:06,165 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:40:06,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:40:06,165 INFO L82 PathProgramCache]: Analyzing trace with hash -615941778, now seen corresponding path program 1 times [2019-09-08 03:40:06,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:40:06,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:40:06,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:40:06,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:40:06,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:40:06,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:40:06,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1338 backedges. 31 proven. 30 refuted. 0 times theorem prover too weak. 1277 trivial. 0 not checked. [2019-09-08 03:40:06,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:40:06,688 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:40:06,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:40:07,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:40:07,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 5251 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:40:07,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:40:07,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1338 backedges. 370 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2019-09-08 03:40:07,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:40:07,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2019-09-08 03:40:07,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:40:07,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:40:07,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:40:07,567 INFO L87 Difference]: Start difference. First operand 14625 states and 22879 transitions. Second operand 9 states. [2019-09-08 03:40:08,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:40:08,318 INFO L93 Difference]: Finished difference Result 29804 states and 47216 transitions. [2019-09-08 03:40:08,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 03:40:08,319 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 579 [2019-09-08 03:40:08,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:40:08,376 INFO L225 Difference]: With dead ends: 29804 [2019-09-08 03:40:08,376 INFO L226 Difference]: Without dead ends: 15927 [2019-09-08 03:40:08,406 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 587 GetRequests, 579 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:40:08,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15927 states. [2019-09-08 03:40:08,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15927 to 15885. [2019-09-08 03:40:08,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15885 states. [2019-09-08 03:40:08,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15885 states to 15885 states and 24974 transitions. [2019-09-08 03:40:08,812 INFO L78 Accepts]: Start accepts. Automaton has 15885 states and 24974 transitions. Word has length 579 [2019-09-08 03:40:08,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:40:08,813 INFO L475 AbstractCegarLoop]: Abstraction has 15885 states and 24974 transitions. [2019-09-08 03:40:08,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:40:08,813 INFO L276 IsEmpty]: Start isEmpty. Operand 15885 states and 24974 transitions. [2019-09-08 03:40:08,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 592 [2019-09-08 03:40:08,829 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:40:08,830 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 12, 12, 12, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:40:08,830 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:40:08,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:40:08,831 INFO L82 PathProgramCache]: Analyzing trace with hash 522077646, now seen corresponding path program 1 times [2019-09-08 03:40:08,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:40:08,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:40:08,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:40:08,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:40:08,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:40:08,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:40:10,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1384 backedges. 32 proven. 45 refuted. 0 times theorem prover too weak. 1307 trivial. 0 not checked. [2019-09-08 03:40:10,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:40:10,357 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:40:10,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:40:11,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:40:11,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 5261 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-08 03:40:11,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:40:11,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1384 backedges. 418 proven. 368 refuted. 0 times theorem prover too weak. 598 trivial. 0 not checked. [2019-09-08 03:40:11,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:40:11,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-09-08 03:40:11,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 03:40:11,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 03:40:11,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-09-08 03:40:11,374 INFO L87 Difference]: Start difference. First operand 15885 states and 24974 transitions. Second operand 15 states. [2019-09-08 03:40:27,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:40:27,689 INFO L93 Difference]: Finished difference Result 56951 states and 94705 transitions. [2019-09-08 03:40:27,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-08 03:40:27,690 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 591 [2019-09-08 03:40:27,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:40:27,897 INFO L225 Difference]: With dead ends: 56951 [2019-09-08 03:40:27,897 INFO L226 Difference]: Without dead ends: 40883 [2019-09-08 03:40:27,953 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 664 GetRequests, 612 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 893 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=546, Invalid=2316, Unknown=0, NotChecked=0, Total=2862 [2019-09-08 03:40:27,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40883 states. [2019-09-08 03:40:28,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40883 to 37823. [2019-09-08 03:40:28,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37823 states. [2019-09-08 03:40:29,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37823 states to 37823 states and 59927 transitions. [2019-09-08 03:40:29,498 INFO L78 Accepts]: Start accepts. Automaton has 37823 states and 59927 transitions. Word has length 591 [2019-09-08 03:40:29,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:40:29,498 INFO L475 AbstractCegarLoop]: Abstraction has 37823 states and 59927 transitions. [2019-09-08 03:40:29,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 03:40:29,498 INFO L276 IsEmpty]: Start isEmpty. Operand 37823 states and 59927 transitions. [2019-09-08 03:40:29,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2019-09-08 03:40:29,519 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:40:29,519 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 15, 14, 14, 14, 12, 12, 12, 12, 12, 11, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:40:29,519 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:40:29,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:40:29,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1293199907, now seen corresponding path program 1 times [2019-09-08 03:40:29,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:40:29,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:40:29,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:40:29,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:40:29,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:40:29,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:40:29,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1680 backedges. 47 proven. 26 refuted. 0 times theorem prover too weak. 1607 trivial. 0 not checked. [2019-09-08 03:40:29,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:40:29,817 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:40:29,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:40:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:40:30,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 4762 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 03:40:30,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:40:30,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1680 backedges. 990 proven. 166 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (12)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:40:30,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:40:30,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-09-08 03:40:30,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 03:40:30,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 03:40:30,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:40:30,795 INFO L87 Difference]: Start difference. First operand 37823 states and 59927 transitions. Second operand 11 states. [2019-09-08 03:40:37,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:40:37,164 INFO L93 Difference]: Finished difference Result 92305 states and 147040 transitions. [2019-09-08 03:40:37,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 03:40:37,164 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 571 [2019-09-08 03:40:37,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:40:37,454 INFO L225 Difference]: With dead ends: 92305 [2019-09-08 03:40:37,454 INFO L226 Difference]: Without dead ends: 54742 [2019-09-08 03:40:37,555 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 587 GetRequests, 573 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-09-08 03:40:37,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54742 states. [2019-09-08 03:40:39,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54742 to 52579. [2019-09-08 03:40:39,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52579 states. [2019-09-08 03:40:39,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52579 states to 52579 states and 81833 transitions. [2019-09-08 03:40:39,852 INFO L78 Accepts]: Start accepts. Automaton has 52579 states and 81833 transitions. Word has length 571 [2019-09-08 03:40:39,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:40:39,853 INFO L475 AbstractCegarLoop]: Abstraction has 52579 states and 81833 transitions. [2019-09-08 03:40:39,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 03:40:39,853 INFO L276 IsEmpty]: Start isEmpty. Operand 52579 states and 81833 transitions. [2019-09-08 03:40:39,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 562 [2019-09-08 03:40:39,891 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:40:39,891 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 15, 14, 14, 14, 12, 12, 12, 12, 12, 12, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:40:39,892 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:40:39,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:40:39,892 INFO L82 PathProgramCache]: Analyzing trace with hash -908935786, now seen corresponding path program 1 times [2019-09-08 03:40:39,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:40:39,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:40:39,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:40:39,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:40:39,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:40:39,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:40:40,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1647 backedges. 42 proven. 24 refuted. 0 times theorem prover too weak. 1581 trivial. 0 not checked. [2019-09-08 03:40:40,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:40:40,164 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:40:40,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:40:40,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:40:40,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 4714 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 03:40:40,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:40:41,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1647 backedges. 978 proven. 63 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2019-09-08 03:40:41,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:40:41,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9] total 12 [2019-09-08 03:40:41,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 03:40:41,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 03:40:41,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-08 03:40:41,499 INFO L87 Difference]: Start difference. First operand 52579 states and 81833 transitions. Second operand 12 states. [2019-09-08 03:40:58,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:40:58,650 INFO L93 Difference]: Finished difference Result 139836 states and 229393 transitions. [2019-09-08 03:40:58,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-08 03:40:58,650 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 561 [2019-09-08 03:40:58,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:40:59,012 INFO L225 Difference]: With dead ends: 139836 [2019-09-08 03:40:59,013 INFO L226 Difference]: Without dead ends: 87068 [2019-09-08 03:40:59,156 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 643 GetRequests, 586 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 976 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=500, Invalid=2922, Unknown=0, NotChecked=0, Total=3422 [2019-09-08 03:40:59,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87068 states. [2019-09-08 03:41:04,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87068 to 80732. [2019-09-08 03:41:04,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80732 states. [2019-09-08 03:41:05,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80732 states to 80732 states and 126272 transitions. [2019-09-08 03:41:05,283 INFO L78 Accepts]: Start accepts. Automaton has 80732 states and 126272 transitions. Word has length 561 [2019-09-08 03:41:05,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:41:05,284 INFO L475 AbstractCegarLoop]: Abstraction has 80732 states and 126272 transitions. [2019-09-08 03:41:05,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 03:41:05,284 INFO L276 IsEmpty]: Start isEmpty. Operand 80732 states and 126272 transitions. [2019-09-08 03:41:05,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 639 [2019-09-08 03:41:05,320 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:41:05,321 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 17, 16, 16, 16, 14, 14, 14, 14, 14, 13, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:41:05,321 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:41:05,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:41:05,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1023610730, now seen corresponding path program 1 times [2019-09-08 03:41:05,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:41:05,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:41:05,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:41:05,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:41:05,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:41:05,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:41:05,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2008 backedges. 52 proven. 40 refuted. 0 times theorem prover too weak. 1916 trivial. 0 not checked. [2019-09-08 03:41:05,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:41:05,844 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:41:05,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:41:06,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:41:06,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 4927 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-08 03:41:06,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:41:07,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2008 backedges. 1160 proven. 72 refuted. 0 times theorem prover too weak. 776 trivial. 0 not checked. [2019-09-08 03:41:07,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:41:07,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2019-09-08 03:41:07,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 03:41:07,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 03:41:07,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-09-08 03:41:07,072 INFO L87 Difference]: Start difference. First operand 80732 states and 126272 transitions. Second operand 15 states. [2019-09-08 03:41:27,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:41:27,036 INFO L93 Difference]: Finished difference Result 215389 states and 348643 transitions. [2019-09-08 03:41:27,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 03:41:27,036 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 638 [2019-09-08 03:41:27,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:41:27,566 INFO L225 Difference]: With dead ends: 215389 [2019-09-08 03:41:27,566 INFO L226 Difference]: Without dead ends: 141980 [2019-09-08 03:41:27,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 669 GetRequests, 643 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2019-09-08 03:41:27,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141980 states. [2019-09-08 03:41:36,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141980 to 139333. [2019-09-08 03:41:36,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139333 states. [2019-09-08 03:41:37,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139333 states to 139333 states and 222380 transitions. [2019-09-08 03:41:37,182 INFO L78 Accepts]: Start accepts. Automaton has 139333 states and 222380 transitions. Word has length 638 [2019-09-08 03:41:37,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:41:37,183 INFO L475 AbstractCegarLoop]: Abstraction has 139333 states and 222380 transitions. [2019-09-08 03:41:37,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 03:41:37,183 INFO L276 IsEmpty]: Start isEmpty. Operand 139333 states and 222380 transitions. [2019-09-08 03:41:37,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2019-09-08 03:41:37,238 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:41:37,239 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 15, 12, 12, 12, 12, 12, 12, 12, 12, 12, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:41:37,239 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:41:37,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:41:37,239 INFO L82 PathProgramCache]: Analyzing trace with hash -109998296, now seen corresponding path program 1 times [2019-09-08 03:41:37,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:41:37,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:41:37,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:41:37,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:41:37,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:41:37,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:41:38,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1455 backedges. 51 proven. 17 refuted. 0 times theorem prover too weak. 1387 trivial. 0 not checked. [2019-09-08 03:41:38,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:41:38,359 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:41:38,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:41:38,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:41:39,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 4676 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 03:41:39,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:41:39,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1455 backedges. 801 proven. 0 refuted. 0 times theorem prover too weak. 654 trivial. 0 not checked. [2019-09-08 03:41:39,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:41:39,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2019-09-08 03:41:39,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 03:41:39,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 03:41:39,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:41:39,154 INFO L87 Difference]: Start difference. First operand 139333 states and 222380 transitions. Second operand 11 states. [2019-09-08 03:41:50,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:41:50,818 INFO L93 Difference]: Finished difference Result 307062 states and 506960 transitions. [2019-09-08 03:41:50,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 03:41:50,819 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 541 [2019-09-08 03:41:50,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:41:51,787 INFO L225 Difference]: With dead ends: 307062 [2019-09-08 03:41:51,787 INFO L226 Difference]: Without dead ends: 169442 [2019-09-08 03:41:52,223 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 559 GetRequests, 544 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-09-08 03:41:52,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169442 states. [2019-09-08 03:42:03,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169442 to 162787. [2019-09-08 03:42:03,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162787 states. [2019-09-08 03:42:04,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162787 states to 162787 states and 263212 transitions. [2019-09-08 03:42:04,991 INFO L78 Accepts]: Start accepts. Automaton has 162787 states and 263212 transitions. Word has length 541 [2019-09-08 03:42:04,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:42:04,991 INFO L475 AbstractCegarLoop]: Abstraction has 162787 states and 263212 transitions. [2019-09-08 03:42:04,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 03:42:04,991 INFO L276 IsEmpty]: Start isEmpty. Operand 162787 states and 263212 transitions. [2019-09-08 03:42:05,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 691 [2019-09-08 03:42:05,048 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:42:05,049 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 18, 17, 17, 17, 15, 15, 15, 15, 15, 15, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:42:05,049 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:42:05,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:42:05,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1552914192, now seen corresponding path program 1 times [2019-09-08 03:42:05,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:42:05,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:42:05,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:05,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:42:05,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:05,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:42:05,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 51 proven. 76 refuted. 0 times theorem prover too weak. 2225 trivial. 0 not checked. [2019-09-08 03:42:05,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:42:05,983 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:42:05,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:42:06,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:42:06,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 5090 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 03:42:06,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:42:06,953 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 909 proven. 0 refuted. 0 times theorem prover too weak. 1443 trivial. 0 not checked. [2019-09-08 03:42:06,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:42:06,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 19 [2019-09-08 03:42:06,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 03:42:06,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 03:42:06,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-09-08 03:42:06,964 INFO L87 Difference]: Start difference. First operand 162787 states and 263212 transitions. Second operand 19 states. [2019-09-08 03:42:20,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:42:20,801 INFO L93 Difference]: Finished difference Result 328688 states and 550101 transitions. [2019-09-08 03:42:20,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 03:42:20,802 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 690 [2019-09-08 03:42:20,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:42:21,671 INFO L225 Difference]: With dead ends: 328688 [2019-09-08 03:42:21,671 INFO L226 Difference]: Without dead ends: 165895 [2019-09-08 03:42:22,594 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 706 GetRequests, 687 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2019-09-08 03:42:22,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165895 states. [2019-09-08 03:42:29,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165895 to 164809. [2019-09-08 03:42:29,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164809 states. [2019-09-08 03:42:30,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164809 states to 164809 states and 269185 transitions. [2019-09-08 03:42:30,630 INFO L78 Accepts]: Start accepts. Automaton has 164809 states and 269185 transitions. Word has length 690 [2019-09-08 03:42:30,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:42:30,630 INFO L475 AbstractCegarLoop]: Abstraction has 164809 states and 269185 transitions. [2019-09-08 03:42:30,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 03:42:30,630 INFO L276 IsEmpty]: Start isEmpty. Operand 164809 states and 269185 transitions. [2019-09-08 03:42:30,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 674 [2019-09-08 03:42:30,689 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:42:30,690 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 15, 15, 15, 15, 15, 14, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:42:30,690 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:42:30,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:42:30,690 INFO L82 PathProgramCache]: Analyzing trace with hash 794429421, now seen corresponding path program 1 times [2019-09-08 03:42:30,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:42:30,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:42:30,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:30,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:42:30,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:30,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:42:31,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 43 proven. 35 refuted. 0 times theorem prover too weak. 2163 trivial. 0 not checked. [2019-09-08 03:42:31,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:42:31,749 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:42:31,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:42:32,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:42:32,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 5046 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 03:42:32,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:42:32,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 851 proven. 0 refuted. 0 times theorem prover too weak. 1390 trivial. 0 not checked. [2019-09-08 03:42:32,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:42:32,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-09-08 03:42:32,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 03:42:32,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 03:42:32,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-08 03:42:32,641 INFO L87 Difference]: Start difference. First operand 164809 states and 269185 transitions. Second operand 12 states. [2019-09-08 03:42:44,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:42:44,861 INFO L93 Difference]: Finished difference Result 327643 states and 548110 transitions. [2019-09-08 03:42:44,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 03:42:44,862 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 673 [2019-09-08 03:42:44,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:42:45,506 INFO L225 Difference]: With dead ends: 327643 [2019-09-08 03:42:45,506 INFO L226 Difference]: Without dead ends: 163612 [2019-09-08 03:42:45,940 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 681 GetRequests, 670 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:42:46,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163612 states. [2019-09-08 03:42:57,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163612 to 161002. [2019-09-08 03:42:57,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161002 states. [2019-09-08 03:42:58,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161002 states to 161002 states and 258891 transitions. [2019-09-08 03:42:58,305 INFO L78 Accepts]: Start accepts. Automaton has 161002 states and 258891 transitions. Word has length 673 [2019-09-08 03:42:58,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:42:58,305 INFO L475 AbstractCegarLoop]: Abstraction has 161002 states and 258891 transitions. [2019-09-08 03:42:58,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 03:42:58,306 INFO L276 IsEmpty]: Start isEmpty. Operand 161002 states and 258891 transitions. [2019-09-08 03:42:59,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 674 [2019-09-08 03:42:59,083 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:42:59,084 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 17, 16, 16, 16, 14, 14, 14, 14, 14, 14, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:42:59,084 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:42:59,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:42:59,084 INFO L82 PathProgramCache]: Analyzing trace with hash 888965318, now seen corresponding path program 1 times [2019-09-08 03:42:59,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:42:59,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:42:59,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:59,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:42:59,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:59,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:42:59,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2205 backedges. 68 proven. 79 refuted. 0 times theorem prover too weak. 2058 trivial. 0 not checked. [2019-09-08 03:42:59,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:42:59,437 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:42:59,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:00,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:00,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 5030 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-08 03:43:00,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:43:00,513 INFO L134 CoverageAnalysis]: Checked inductivity of 2205 backedges. 639 proven. 0 refuted. 0 times theorem prover too weak. 1566 trivial. 0 not checked. [2019-09-08 03:43:00,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:43:00,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2019-09-08 03:43:00,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 03:43:00,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 03:43:00,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:43:00,534 INFO L87 Difference]: Start difference. First operand 161002 states and 258891 transitions. Second operand 14 states. [2019-09-08 03:43:21,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:21,968 INFO L93 Difference]: Finished difference Result 314419 states and 508853 transitions. [2019-09-08 03:43:21,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 03:43:21,968 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 673 [2019-09-08 03:43:21,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:22,640 INFO L225 Difference]: With dead ends: 314419 [2019-09-08 03:43:22,640 INFO L226 Difference]: Without dead ends: 163044 [2019-09-08 03:43:23,034 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 707 GetRequests, 686 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2019-09-08 03:43:23,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163044 states. [2019-09-08 03:43:30,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163044 to 161760. [2019-09-08 03:43:30,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161760 states. [2019-09-08 03:43:31,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161760 states to 161760 states and 260024 transitions. [2019-09-08 03:43:31,115 INFO L78 Accepts]: Start accepts. Automaton has 161760 states and 260024 transitions. Word has length 673 [2019-09-08 03:43:31,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:31,116 INFO L475 AbstractCegarLoop]: Abstraction has 161760 states and 260024 transitions. [2019-09-08 03:43:31,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 03:43:31,116 INFO L276 IsEmpty]: Start isEmpty. Operand 161760 states and 260024 transitions. [2019-09-08 03:43:31,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 699 [2019-09-08 03:43:31,159 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:31,159 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 19, 16, 16, 16, 14, 14, 14, 14, 14, 14, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:43:31,159 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:31,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:31,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1317166253, now seen corresponding path program 1 times [2019-09-08 03:43:31,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:31,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:31,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:31,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:31,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:31,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:32,268 INFO L134 CoverageAnalysis]: Checked inductivity of 2422 backedges. 72 proven. 48 refuted. 0 times theorem prover too weak. 2302 trivial. 0 not checked. [2019-09-08 03:43:32,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:43:32,268 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:43:32,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:32,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:32,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 5085 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 03:43:32,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:43:33,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2422 backedges. 1351 proven. 0 refuted. 0 times theorem prover too weak. 1071 trivial. 0 not checked. [2019-09-08 03:43:33,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:43:33,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2019-09-08 03:43:33,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 03:43:33,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 03:43:33,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:43:33,218 INFO L87 Difference]: Start difference. First operand 161760 states and 260024 transitions. Second operand 13 states. [2019-09-08 03:43:45,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:45,659 INFO L93 Difference]: Finished difference Result 328722 states and 539497 transitions. [2019-09-08 03:43:45,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:43:45,659 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 698 [2019-09-08 03:43:45,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:46,366 INFO L225 Difference]: With dead ends: 328722 [2019-09-08 03:43:46,366 INFO L226 Difference]: Without dead ends: 159907 [2019-09-08 03:43:47,444 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 711 GetRequests, 698 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-09-08 03:43:47,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159907 states. [2019-09-08 03:43:54,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159907 to 159877. [2019-09-08 03:43:54,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159877 states. [2019-09-08 03:44:03,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159877 states to 159877 states and 255517 transitions. [2019-09-08 03:44:03,669 INFO L78 Accepts]: Start accepts. Automaton has 159877 states and 255517 transitions. Word has length 698 [2019-09-08 03:44:03,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:44:03,670 INFO L475 AbstractCegarLoop]: Abstraction has 159877 states and 255517 transitions. [2019-09-08 03:44:03,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 03:44:03,670 INFO L276 IsEmpty]: Start isEmpty. Operand 159877 states and 255517 transitions. [2019-09-08 03:44:03,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 673 [2019-09-08 03:44:03,709 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:44:03,709 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 18, 16, 16, 16, 14, 14, 14, 14, 14, 13, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 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, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:44:03,710 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:44:03,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:44:03,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1088164875, now seen corresponding path program 1 times [2019-09-08 03:44:03,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:44:03,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:44:03,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:44:03,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:44:03,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:44:03,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:44:04,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2190 backedges. 76 proven. 9 refuted. 0 times theorem prover too weak. 2105 trivial. 0 not checked. [2019-09-08 03:44:04,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:44:04,133 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:44:04,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:44:04,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:44:04,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 4988 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-08 03:44:04,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:44:05,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2190 backedges. 642 proven. 0 refuted. 0 times theorem prover too weak. 1548 trivial. 0 not checked. [2019-09-08 03:44:05,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:44:05,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-09-08 03:44:05,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 03:44:05,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 03:44:05,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-08 03:44:05,243 INFO L87 Difference]: Start difference. First operand 159877 states and 255517 transitions. Second operand 12 states. [2019-09-08 03:44:24,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:44:24,623 INFO L93 Difference]: Finished difference Result 345531 states and 566696 transitions. [2019-09-08 03:44:24,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 03:44:24,624 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 672 [2019-09-08 03:44:24,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:44:25,439 INFO L225 Difference]: With dead ends: 345531 [2019-09-08 03:44:25,440 INFO L226 Difference]: Without dead ends: 181130 [2019-09-08 03:44:25,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 703 GetRequests, 674 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=794, Unknown=0, NotChecked=0, Total=930 [2019-09-08 03:44:26,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181130 states. [2019-09-08 03:44:44,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181130 to 169637. [2019-09-08 03:44:44,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169637 states. [2019-09-08 03:44:45,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169637 states to 169637 states and 262770 transitions. [2019-09-08 03:44:45,563 INFO L78 Accepts]: Start accepts. Automaton has 169637 states and 262770 transitions. Word has length 672 [2019-09-08 03:44:45,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:44:45,564 INFO L475 AbstractCegarLoop]: Abstraction has 169637 states and 262770 transitions. [2019-09-08 03:44:45,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 03:44:45,564 INFO L276 IsEmpty]: Start isEmpty. Operand 169637 states and 262770 transitions. [2019-09-08 03:44:45,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 691 [2019-09-08 03:44:45,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:44:45,606 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 19, 16, 16, 16, 14, 14, 14, 14, 14, 14, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:44:45,607 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:44:45,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:44:45,607 INFO L82 PathProgramCache]: Analyzing trace with hash -11095768, now seen corresponding path program 1 times [2019-09-08 03:44:45,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:44:45,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:44:45,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:44:45,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:44:45,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:44:45,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:44:46,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2388 backedges. 67 proven. 2 refuted. 0 times theorem prover too weak. 2319 trivial. 0 not checked. [2019-09-08 03:44:46,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:44:46,333 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:44:46,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:44:47,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:44:47,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 5050 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 03:44:47,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:44:47,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2388 backedges. 850 proven. 0 refuted. 0 times theorem prover too weak. 1538 trivial. 0 not checked. [2019-09-08 03:44:47,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:44:47,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2019-09-08 03:44:47,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 03:44:47,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 03:44:47,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-09-08 03:44:47,269 INFO L87 Difference]: Start difference. First operand 169637 states and 262770 transitions. Second operand 15 states. [2019-09-08 03:44:55,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:44:55,283 INFO L93 Difference]: Finished difference Result 334844 states and 522505 transitions. [2019-09-08 03:44:55,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 03:44:55,283 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 690 [2019-09-08 03:44:55,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:44:55,973 INFO L225 Difference]: With dead ends: 334844 [2019-09-08 03:44:55,973 INFO L226 Difference]: Without dead ends: 170576 [2019-09-08 03:44:56,338 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 701 GetRequests, 688 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-09-08 03:44:56,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170576 states. [2019-09-08 03:45:13,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170576 to 169777. [2019-09-08 03:45:13,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169777 states. [2019-09-08 03:45:14,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169777 states to 169777 states and 262926 transitions. [2019-09-08 03:45:14,186 INFO L78 Accepts]: Start accepts. Automaton has 169777 states and 262926 transitions. Word has length 690 [2019-09-08 03:45:14,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:45:14,186 INFO L475 AbstractCegarLoop]: Abstraction has 169777 states and 262926 transitions. [2019-09-08 03:45:14,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 03:45:14,186 INFO L276 IsEmpty]: Start isEmpty. Operand 169777 states and 262926 transitions. [2019-09-08 03:45:14,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 702 [2019-09-08 03:45:14,227 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:14,227 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 19, 16, 16, 16, 14, 14, 14, 14, 14, 13, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:45:14,228 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:14,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:14,228 INFO L82 PathProgramCache]: Analyzing trace with hash -234905815, now seen corresponding path program 1 times [2019-09-08 03:45:14,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:14,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:14,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:14,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:14,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:14,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:14,645 INFO L134 CoverageAnalysis]: Checked inductivity of 2423 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 2376 trivial. 0 not checked. [2019-09-08 03:45:14,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:45:14,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:45:14,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:45:14,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:45:14,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:45:14,648 INFO L87 Difference]: Start difference. First operand 169777 states and 262926 transitions. Second operand 7 states. [2019-09-08 03:45:22,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:45:22,339 INFO L93 Difference]: Finished difference Result 328004 states and 509344 transitions. [2019-09-08 03:45:22,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:45:22,339 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 701 [2019-09-08 03:45:22,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:45:23,152 INFO L225 Difference]: With dead ends: 328004 [2019-09-08 03:45:23,152 INFO L226 Difference]: Without dead ends: 169735 [2019-09-08 03:45:24,162 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:45:24,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169735 states. [2019-09-08 03:45:38,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169735 to 169735. [2019-09-08 03:45:38,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169735 states. [2019-09-08 03:45:39,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169735 states to 169735 states and 262842 transitions. [2019-09-08 03:45:39,614 INFO L78 Accepts]: Start accepts. Automaton has 169735 states and 262842 transitions. Word has length 701 [2019-09-08 03:45:39,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:45:39,615 INFO L475 AbstractCegarLoop]: Abstraction has 169735 states and 262842 transitions. [2019-09-08 03:45:39,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:45:39,615 INFO L276 IsEmpty]: Start isEmpty. Operand 169735 states and 262842 transitions. [2019-09-08 03:45:39,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 702 [2019-09-08 03:45:39,659 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:39,659 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 19, 16, 16, 16, 14, 14, 14, 14, 14, 13, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:45:39,660 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:39,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:39,660 INFO L82 PathProgramCache]: Analyzing trace with hash -588068472, now seen corresponding path program 1 times [2019-09-08 03:45:39,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:39,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:39,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:39,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:39,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:40,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:40,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2423 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 2376 trivial. 0 not checked. [2019-09-08 03:45:40,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:45:40,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:45:40,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:45:40,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:45:40,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:45:40,477 INFO L87 Difference]: Start difference. First operand 169735 states and 262842 transitions. Second operand 7 states. [2019-09-08 03:45:48,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:45:48,583 INFO L93 Difference]: Finished difference Result 327962 states and 509260 transitions. [2019-09-08 03:45:48,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:45:48,583 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 701 [2019-09-08 03:45:48,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:45:49,346 INFO L225 Difference]: With dead ends: 327962 [2019-09-08 03:45:49,346 INFO L226 Difference]: Without dead ends: 169735 [2019-09-08 03:45:49,714 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:45:49,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169735 states. [2019-09-08 03:46:06,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169735 to 169735. [2019-09-08 03:46:06,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169735 states. [2019-09-08 03:46:07,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169735 states to 169735 states and 262800 transitions. [2019-09-08 03:46:07,639 INFO L78 Accepts]: Start accepts. Automaton has 169735 states and 262800 transitions. Word has length 701 [2019-09-08 03:46:07,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:46:07,640 INFO L475 AbstractCegarLoop]: Abstraction has 169735 states and 262800 transitions. [2019-09-08 03:46:07,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:46:07,640 INFO L276 IsEmpty]: Start isEmpty. Operand 169735 states and 262800 transitions. [2019-09-08 03:46:07,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 703 [2019-09-08 03:46:07,679 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:46:07,680 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 19, 16, 16, 16, 14, 14, 14, 14, 14, 13, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:46:07,680 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:46:07,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:46:07,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1305442732, now seen corresponding path program 1 times [2019-09-08 03:46:07,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:46:07,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:46:07,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:07,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:46:07,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:07,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:46:07,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2423 backedges. 352 proven. 5 refuted. 0 times theorem prover too weak. 2066 trivial. 0 not checked. [2019-09-08 03:46:07,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:46:07,991 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:46:08,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:46:08,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:46:08,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 5088 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-08 03:46:08,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:46:09,539 INFO L134 CoverageAnalysis]: Checked inductivity of 2423 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 2246 trivial. 0 not checked. [2019-09-08 03:46:09,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:46:09,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2019-09-08 03:46:09,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:46:09,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:46:09,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:46:09,548 INFO L87 Difference]: Start difference. First operand 169735 states and 262800 transitions. Second operand 9 states. [2019-09-08 03:46:17,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:46:17,365 INFO L93 Difference]: Finished difference Result 295529 states and 473552 transitions. [2019-09-08 03:46:17,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:46:17,366 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 702 [2019-09-08 03:46:17,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:46:17,918 INFO L225 Difference]: With dead ends: 295529 [2019-09-08 03:46:17,919 INFO L226 Difference]: Without dead ends: 125840 [2019-09-08 03:46:18,413 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 714 GetRequests, 704 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-09-08 03:46:18,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125840 states. [2019-09-08 03:46:25,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125840 to 123170. [2019-09-08 03:46:25,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123170 states. [2019-09-08 03:46:25,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123170 states to 123170 states and 185862 transitions. [2019-09-08 03:46:25,743 INFO L78 Accepts]: Start accepts. Automaton has 123170 states and 185862 transitions. Word has length 702 [2019-09-08 03:46:25,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:46:25,744 INFO L475 AbstractCegarLoop]: Abstraction has 123170 states and 185862 transitions. [2019-09-08 03:46:25,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:46:25,744 INFO L276 IsEmpty]: Start isEmpty. Operand 123170 states and 185862 transitions. [2019-09-08 03:46:25,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 703 [2019-09-08 03:46:25,783 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:46:25,784 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 19, 16, 16, 16, 14, 14, 14, 14, 14, 14, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:46:25,784 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:46:25,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:46:25,784 INFO L82 PathProgramCache]: Analyzing trace with hash 343828715, now seen corresponding path program 2 times [2019-09-08 03:46:25,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:46:25,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:46:25,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:25,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:46:25,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:25,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:46:27,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2423 backedges. 27 proven. 30 refuted. 0 times theorem prover too weak. 2366 trivial. 0 not checked. [2019-09-08 03:46:27,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:46:27,093 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:46:27,105 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 03:46:27,864 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 03:46:27,864 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:46:27,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 5089 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-08 03:46:27,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:46:28,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2423 backedges. 598 proven. 494 refuted. 0 times theorem prover too weak. 1331 trivial. 0 not checked. [2019-09-08 03:46:28,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:46:28,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-08 03:46:28,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:46:28,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:46:28,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:46:28,149 INFO L87 Difference]: Start difference. First operand 123170 states and 185862 transitions. Second operand 8 states. [2019-09-08 03:46:39,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:46:39,419 INFO L93 Difference]: Finished difference Result 123709 states and 186944 transitions. [2019-09-08 03:46:39,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 03:46:39,420 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 702 [2019-09-08 03:46:39,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:46:39,891 INFO L225 Difference]: With dead ends: 123709 [2019-09-08 03:46:39,891 INFO L226 Difference]: Without dead ends: 123706 [2019-09-08 03:46:39,933 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 722 GetRequests, 710 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:46:40,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123706 states. [2019-09-08 03:46:45,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123706 to 123170. [2019-09-08 03:46:45,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123170 states. [2019-09-08 03:46:45,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123170 states to 123170 states and 185754 transitions. [2019-09-08 03:46:45,653 INFO L78 Accepts]: Start accepts. Automaton has 123170 states and 185754 transitions. Word has length 702 [2019-09-08 03:46:45,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:46:45,654 INFO L475 AbstractCegarLoop]: Abstraction has 123170 states and 185754 transitions. [2019-09-08 03:46:45,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 03:46:45,654 INFO L276 IsEmpty]: Start isEmpty. Operand 123170 states and 185754 transitions. [2019-09-08 03:46:45,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 760 [2019-09-08 03:46:45,736 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:46:45,737 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 18, 15, 15, 15, 13, 13, 13, 13, 13, 13, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:46:45,737 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:46:45,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:46:45,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1184564208, now seen corresponding path program 1 times [2019-09-08 03:46:45,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:46:45,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:46:45,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:45,738 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:46:45,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:45,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:46:46,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2355 backedges. 114 proven. 5 refuted. 0 times theorem prover too weak. 2236 trivial. 0 not checked. [2019-09-08 03:46:46,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:46:46,996 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:46:47,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:46:47,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:46:47,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 5472 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-08 03:46:47,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:46:48,435 INFO L134 CoverageAnalysis]: Checked inductivity of 2355 backedges. 871 proven. 314 refuted. 0 times theorem prover too weak. 1170 trivial. 0 not checked. [2019-09-08 03:46:48,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:46:48,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2019-09-08 03:46:48,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 03:46:48,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 03:46:48,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2019-09-08 03:46:48,450 INFO L87 Difference]: Start difference. First operand 123170 states and 185754 transitions. Second operand 20 states. [2019-09-08 03:47:13,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:47:13,996 INFO L93 Difference]: Finished difference Result 175308 states and 267046 transitions. [2019-09-08 03:47:13,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-08 03:47:13,997 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 759 [2019-09-08 03:47:13,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:47:14,274 INFO L225 Difference]: With dead ends: 175308 [2019-09-08 03:47:14,274 INFO L226 Difference]: Without dead ends: 54416 [2019-09-08 03:47:14,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 834 GetRequests, 771 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 954 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=584, Invalid=3076, Unknown=0, NotChecked=0, Total=3660 [2019-09-08 03:47:14,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54416 states. [2019-09-08 03:47:17,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54416 to 50265. [2019-09-08 03:47:17,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50265 states. [2019-09-08 03:47:17,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50265 states to 50265 states and 69533 transitions. [2019-09-08 03:47:17,703 INFO L78 Accepts]: Start accepts. Automaton has 50265 states and 69533 transitions. Word has length 759 [2019-09-08 03:47:17,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:47:17,704 INFO L475 AbstractCegarLoop]: Abstraction has 50265 states and 69533 transitions. [2019-09-08 03:47:17,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 03:47:17,704 INFO L276 IsEmpty]: Start isEmpty. Operand 50265 states and 69533 transitions. [2019-09-08 03:47:18,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 632 [2019-09-08 03:47:18,485 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:47:18,485 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 17, 13, 12, 12, 12, 11, 11, 11, 11, 11, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:47:18,485 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:47:18,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:47:18,486 INFO L82 PathProgramCache]: Analyzing trace with hash -160325450, now seen corresponding path program 1 times [2019-09-08 03:47:18,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:47:18,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:47:18,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:47:18,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:47:18,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:47:18,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:47:19,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1642 backedges. 49 proven. 76 refuted. 0 times theorem prover too weak. 1517 trivial. 0 not checked. [2019-09-08 03:47:19,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:47:19,046 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:47:19,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:47:19,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:47:19,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 5129 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-08 03:47:19,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:47:20,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1642 backedges. 696 proven. 234 refuted. 0 times theorem prover too weak. 712 trivial. 0 not checked. [2019-09-08 03:47:20,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:47:20,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2019-09-08 03:47:20,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 03:47:20,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 03:47:20,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2019-09-08 03:47:20,661 INFO L87 Difference]: Start difference. First operand 50265 states and 69533 transitions. Second operand 21 states. [2019-09-08 03:47:35,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:47:35,512 INFO L93 Difference]: Finished difference Result 145002 states and 207429 transitions. [2019-09-08 03:47:35,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 03:47:35,513 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 631 [2019-09-08 03:47:35,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:47:35,947 INFO L225 Difference]: With dead ends: 145002 [2019-09-08 03:47:35,948 INFO L226 Difference]: Without dead ends: 95747 [2019-09-08 03:47:36,095 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 665 GetRequests, 634 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=882, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 03:47:36,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95747 states. [2019-09-08 03:47:42,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95747 to 93932. [2019-09-08 03:47:42,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93932 states. [2019-09-08 03:47:42,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93932 states to 93932 states and 132467 transitions. [2019-09-08 03:47:42,573 INFO L78 Accepts]: Start accepts. Automaton has 93932 states and 132467 transitions. Word has length 631 [2019-09-08 03:47:42,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:47:42,573 INFO L475 AbstractCegarLoop]: Abstraction has 93932 states and 132467 transitions. [2019-09-08 03:47:42,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 03:47:42,573 INFO L276 IsEmpty]: Start isEmpty. Operand 93932 states and 132467 transitions. [2019-09-08 03:47:42,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 634 [2019-09-08 03:47:42,665 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:47:42,665 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 17, 15, 12, 12, 12, 11, 11, 11, 11, 11, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:47:42,666 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:47:42,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:47:42,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1368789994, now seen corresponding path program 2 times [2019-09-08 03:47:42,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:47:42,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:47:42,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:47:42,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:47:42,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:47:42,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:47:43,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1669 backedges. 74 proven. 84 refuted. 0 times theorem prover too weak. 1511 trivial. 0 not checked. [2019-09-08 03:47:43,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:47:43,646 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:47:43,660 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 03:47:44,416 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 03:47:44,416 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:47:44,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 5131 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 03:47:44,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:47:44,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1669 backedges. 1002 proven. 5 refuted. 0 times theorem prover too weak. 662 trivial. 0 not checked. [2019-09-08 03:47:44,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:47:44,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-09-08 03:47:44,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 03:47:44,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 03:47:44,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:47:44,753 INFO L87 Difference]: Start difference. First operand 93932 states and 132467 transitions. Second operand 10 states. [2019-09-08 03:47:56,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:47:56,206 INFO L93 Difference]: Finished difference Result 272750 states and 403363 transitions. [2019-09-08 03:47:56,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 03:47:56,206 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 633 [2019-09-08 03:47:56,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:47:57,847 INFO L225 Difference]: With dead ends: 272750 [2019-09-08 03:47:57,848 INFO L226 Difference]: Without dead ends: 179303 [2019-09-08 03:47:58,095 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 666 GetRequests, 640 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2019-09-08 03:47:58,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179303 states. [2019-09-08 03:48:13,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179303 to 169638. [2019-09-08 03:48:13,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169638 states. [2019-09-08 03:48:14,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169638 states to 169638 states and 253226 transitions. [2019-09-08 03:48:14,611 INFO L78 Accepts]: Start accepts. Automaton has 169638 states and 253226 transitions. Word has length 633 [2019-09-08 03:48:14,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:48:14,611 INFO L475 AbstractCegarLoop]: Abstraction has 169638 states and 253226 transitions. [2019-09-08 03:48:14,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 03:48:14,611 INFO L276 IsEmpty]: Start isEmpty. Operand 169638 states and 253226 transitions. [2019-09-08 03:48:14,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 640 [2019-09-08 03:48:14,717 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:48:14,717 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 17, 16, 13, 12, 12, 11, 11, 11, 11, 11, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:48:14,717 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:48:14,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:48:14,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1432624435, now seen corresponding path program 1 times [2019-09-08 03:48:14,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:48:14,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:48:14,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:48:14,719 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:48:14,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:48:14,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:48:15,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1699 backedges. 48 proven. 64 refuted. 0 times theorem prover too weak. 1587 trivial. 0 not checked. [2019-09-08 03:48:15,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:48:15,072 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:48:15,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:48:15,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:48:15,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 5137 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-08 03:48:15,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:48:16,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1699 backedges. 989 proven. 114 refuted. 0 times theorem prover too weak. 596 trivial. 0 not checked. [2019-09-08 03:48:16,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:48:16,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-09-08 03:48:16,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 03:48:16,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 03:48:16,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-09-08 03:48:16,566 INFO L87 Difference]: Start difference. First operand 169638 states and 253226 transitions. Second operand 15 states. [2019-09-08 03:48:37,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:48:37,517 INFO L93 Difference]: Finished difference Result 335755 states and 502403 transitions. [2019-09-08 03:48:37,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 03:48:37,517 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 639 [2019-09-08 03:48:37,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:48:38,809 INFO L225 Difference]: With dead ends: 335755 [2019-09-08 03:48:38,809 INFO L226 Difference]: Without dead ends: 166233 [2019-09-08 03:48:39,136 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 688 GetRequests, 657 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=247, Invalid=809, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 03:48:39,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166233 states.