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_spec2_product30.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 04:08:57,396 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 04:08:57,398 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 04:08:57,411 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 04:08:57,411 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 04:08:57,412 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 04:08:57,414 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 04:08:57,415 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 04:08:57,417 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 04:08:57,418 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 04:08:57,419 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 04:08:57,420 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 04:08:57,420 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 04:08:57,421 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 04:08:57,422 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 04:08:57,423 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 04:08:57,423 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 04:08:57,424 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 04:08:57,426 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 04:08:57,428 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 04:08:57,430 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 04:08:57,431 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 04:08:57,432 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 04:08:57,432 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 04:08:57,434 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 04:08:57,435 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 04:08:57,435 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 04:08:57,436 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 04:08:57,436 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 04:08:57,437 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 04:08:57,437 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 04:08:57,438 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 04:08:57,439 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 04:08:57,439 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 04:08:57,444 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 04:08:57,444 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 04:08:57,445 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 04:08:57,445 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 04:08:57,445 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 04:08:57,446 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 04:08:57,447 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 04:08:57,448 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 04:08:57,470 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 04:08:57,471 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 04:08:57,472 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 04:08:57,472 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 04:08:57,472 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 04:08:57,473 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 04:08:57,473 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 04:08:57,473 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 04:08:57,473 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 04:08:57,473 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 04:08:57,474 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 04:08:57,474 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 04:08:57,474 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 04:08:57,474 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 04:08:57,474 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 04:08:57,475 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 04:08:57,475 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 04:08:57,475 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 04:08:57,475 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 04:08:57,475 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 04:08:57,476 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 04:08:57,476 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 04:08:57,476 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 04:08:57,476 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 04:08:57,477 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 04:08:57,477 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 04:08:57,477 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 04:08:57,477 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 04:08:57,477 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 04:08:57,504 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 04:08:57,516 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 04:08:57,521 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 04:08:57,522 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 04:08:57,522 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 04:08:57,523 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product30.cil.c [2019-09-08 04:08:57,594 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d0943f45/2e2fda048b414aef8dae1cfbf55b9be3/FLAG300f6043b [2019-09-08 04:08:58,232 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 04:08:58,233 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product30.cil.c [2019-09-08 04:08:58,251 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d0943f45/2e2fda048b414aef8dae1cfbf55b9be3/FLAG300f6043b [2019-09-08 04:08:58,448 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d0943f45/2e2fda048b414aef8dae1cfbf55b9be3 [2019-09-08 04:08:58,457 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 04:08:58,459 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 04:08:58,460 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 04:08:58,460 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 04:08:58,463 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 04:08:58,464 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:08:58" (1/1) ... [2019-09-08 04:08:58,467 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@732386ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:08:58, skipping insertion in model container [2019-09-08 04:08:58,467 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:08:58" (1/1) ... [2019-09-08 04:08:58,475 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 04:08:58,559 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 04:08:59,246 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:08:59,270 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 04:08:59,434 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:08:59,492 INFO L192 MainTranslator]: Completed translation [2019-09-08 04:08:59,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:08:59 WrapperNode [2019-09-08 04:08:59,493 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 04:08:59,493 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 04:08:59,493 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 04:08:59,494 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 04:08:59,505 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:08:59" (1/1) ... [2019-09-08 04:08:59,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:08:59" (1/1) ... [2019-09-08 04:08:59,541 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:08:59" (1/1) ... [2019-09-08 04:08:59,542 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:08:59" (1/1) ... [2019-09-08 04:08:59,615 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:08:59" (1/1) ... [2019-09-08 04:08:59,660 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:08:59" (1/1) ... [2019-09-08 04:08:59,670 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:08:59" (1/1) ... [2019-09-08 04:08:59,684 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 04:08:59,685 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 04:08:59,685 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 04:08:59,685 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 04:08:59,686 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:08:59" (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 04:08:59,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 04:08:59,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 04:08:59,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 04:08:59,759 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-09-08 04:08:59,759 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-09-08 04:08:59,760 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-09-08 04:08:59,760 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-09-08 04:08:59,760 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-09-08 04:08:59,761 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-09-08 04:08:59,761 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-09-08 04:08:59,761 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-09-08 04:08:59,762 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-09-08 04:08:59,763 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-09-08 04:08:59,763 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-09-08 04:08:59,764 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-09-08 04:08:59,764 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-09-08 04:08:59,767 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-09-08 04:08:59,767 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-09-08 04:08:59,767 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-09-08 04:08:59,768 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-09-08 04:08:59,768 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 04:08:59,768 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-09-08 04:08:59,768 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 04:08:59,769 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-09-08 04:08:59,769 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-09-08 04:08:59,769 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 04:08:59,770 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-09-08 04:08:59,770 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-09-08 04:08:59,770 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-09-08 04:08:59,771 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-09-08 04:08:59,771 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-09-08 04:08:59,771 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-09-08 04:08:59,772 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-09-08 04:08:59,772 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-09-08 04:08:59,772 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 04:08:59,772 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 04:08:59,773 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 04:08:59,773 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 04:08:59,773 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 04:08:59,773 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-09-08 04:08:59,774 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-09-08 04:08:59,774 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-09-08 04:08:59,775 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-09-08 04:08:59,775 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-09-08 04:08:59,775 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-09-08 04:08:59,775 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-09-08 04:08:59,776 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-09-08 04:08:59,776 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-09-08 04:08:59,776 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-09-08 04:08:59,776 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-09-08 04:08:59,776 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-09-08 04:08:59,776 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-09-08 04:08:59,777 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-09-08 04:08:59,777 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-09-08 04:08:59,777 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-09-08 04:08:59,777 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-09-08 04:08:59,777 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-09-08 04:08:59,777 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-09-08 04:08:59,778 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-09-08 04:08:59,778 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-09-08 04:08:59,778 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-09-08 04:08:59,778 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-09-08 04:08:59,779 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-09-08 04:08:59,779 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-09-08 04:08:59,779 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-09-08 04:08:59,779 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-09-08 04:08:59,780 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-09-08 04:08:59,780 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-09-08 04:08:59,781 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__twothirdsfull [2019-09-08 04:08:59,781 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-09-08 04:08:59,781 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__twothirdsfull [2019-09-08 04:08:59,782 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-09-08 04:08:59,782 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-09-08 04:08:59,782 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 04:08:59,783 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 04:08:59,784 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 04:08:59,784 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 04:08:59,784 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 04:08:59,784 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 04:08:59,785 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 04:08:59,785 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 04:08:59,785 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-09-08 04:08:59,786 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-09-08 04:08:59,786 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-09-08 04:08:59,787 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-08 04:08:59,787 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-09-08 04:08:59,787 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-09-08 04:08:59,788 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-09-08 04:08:59,788 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-09-08 04:08:59,788 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-09-08 04:08:59,789 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-09-08 04:08:59,789 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-09-08 04:08:59,789 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-09-08 04:08:59,790 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-09-08 04:08:59,790 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-09-08 04:08:59,790 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-09-08 04:08:59,790 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-09-08 04:08:59,790 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-09-08 04:08:59,791 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-09-08 04:08:59,791 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-09-08 04:08:59,791 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-09-08 04:08:59,791 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-09-08 04:08:59,791 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-09-08 04:08:59,791 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-09-08 04:08:59,792 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-09-08 04:08:59,792 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 04:08:59,792 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-09-08 04:08:59,792 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-09-08 04:08:59,792 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 04:08:59,793 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-09-08 04:08:59,793 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 04:08:59,793 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 04:08:59,793 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 04:08:59,793 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 04:08:59,793 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-09-08 04:08:59,794 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-09-08 04:08:59,794 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-09-08 04:08:59,794 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 04:08:59,794 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-09-08 04:08:59,795 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-09-08 04:08:59,795 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-09-08 04:08:59,795 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-09-08 04:08:59,795 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-09-08 04:08:59,796 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-09-08 04:08:59,797 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-09-08 04:08:59,797 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 04:08:59,797 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-09-08 04:08:59,797 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-09-08 04:08:59,798 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-09-08 04:08:59,798 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-09-08 04:08:59,798 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 04:08:59,799 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-09-08 04:08:59,799 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-09-08 04:08:59,799 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-09-08 04:08:59,800 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-09-08 04:08:59,800 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-09-08 04:08:59,800 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-09-08 04:08:59,800 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-09-08 04:08:59,801 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-09-08 04:08:59,802 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-09-08 04:08:59,806 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-09-08 04:08:59,807 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-09-08 04:08:59,807 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-09-08 04:08:59,808 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-09-08 04:08:59,817 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-09-08 04:08:59,817 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-09-08 04:08:59,818 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-09-08 04:08:59,818 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-09-08 04:08:59,818 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-09-08 04:08:59,818 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-09-08 04:08:59,819 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__twothirdsfull [2019-09-08 04:08:59,819 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__twothirdsfull [2019-09-08 04:08:59,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 04:08:59,819 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-09-08 04:08:59,819 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 04:08:59,819 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 04:08:59,819 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 04:08:59,820 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 04:08:59,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 04:08:59,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 04:08:59,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 04:08:59,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 04:08:59,820 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 04:08:59,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 04:08:59,821 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 04:08:59,821 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 04:08:59,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 04:08:59,821 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 04:08:59,822 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 04:08:59,822 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 04:08:59,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 04:08:59,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 04:08:59,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 04:09:02,352 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 04:09:02,352 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-09-08 04:09:02,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:09:02 BoogieIcfgContainer [2019-09-08 04:09:02,354 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 04:09:02,355 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 04:09:02,355 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 04:09:02,358 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 04:09:02,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 04:08:58" (1/3) ... [2019-09-08 04:09:02,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@533893ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:09:02, skipping insertion in model container [2019-09-08 04:09:02,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:08:59" (2/3) ... [2019-09-08 04:09:02,360 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@533893ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:09:02, skipping insertion in model container [2019-09-08 04:09:02,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:09:02" (3/3) ... [2019-09-08 04:09:02,362 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product30.cil.c [2019-09-08 04:09:02,371 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 04:09:02,381 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 04:09:02,398 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 04:09:02,437 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 04:09:02,437 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 04:09:02,437 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 04:09:02,438 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 04:09:02,438 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 04:09:02,438 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 04:09:02,438 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 04:09:02,438 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 04:09:02,438 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 04:09:02,472 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states. [2019-09-08 04:09:02,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 04:09:02,486 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:09:02,487 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:09:02,489 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:09:02,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:09:02,495 INFO L82 PathProgramCache]: Analyzing trace with hash -157007896, now seen corresponding path program 1 times [2019-09-08 04:09:02,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:09:02,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:09:02,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:02,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:09:02,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:02,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:09:03,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:09:03,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:09:03,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:09:03,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:09:03,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:09:03,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:09:03,048 INFO L87 Difference]: Start difference. First operand 805 states. Second operand 4 states. [2019-09-08 04:09:03,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:09:03,272 INFO L93 Difference]: Finished difference Result 1259 states and 2029 transitions. [2019-09-08 04:09:03,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:09:03,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-09-08 04:09:03,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:09:03,306 INFO L225 Difference]: With dead ends: 1259 [2019-09-08 04:09:03,306 INFO L226 Difference]: Without dead ends: 638 [2019-09-08 04:09:03,319 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 04:09:03,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-09-08 04:09:03,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2019-09-08 04:09:03,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-09-08 04:09:03,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 1016 transitions. [2019-09-08 04:09:03,459 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 1016 transitions. Word has length 85 [2019-09-08 04:09:03,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:09:03,460 INFO L475 AbstractCegarLoop]: Abstraction has 638 states and 1016 transitions. [2019-09-08 04:09:03,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:09:03,460 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 1016 transitions. [2019-09-08 04:09:03,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 04:09:03,476 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:09:03,476 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:09:03,477 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:09:03,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:09:03,478 INFO L82 PathProgramCache]: Analyzing trace with hash -2067866645, now seen corresponding path program 1 times [2019-09-08 04:09:03,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:09:03,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:09:03,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:03,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:09:03,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:03,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:09:03,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:09:03,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:09:03,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:09:03,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:09:03,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:09:03,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:09:03,700 INFO L87 Difference]: Start difference. First operand 638 states and 1016 transitions. Second operand 4 states. [2019-09-08 04:09:03,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:09:03,768 INFO L93 Difference]: Finished difference Result 1239 states and 1990 transitions. [2019-09-08 04:09:03,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:09:03,769 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-09-08 04:09:03,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:09:03,777 INFO L225 Difference]: With dead ends: 1239 [2019-09-08 04:09:03,777 INFO L226 Difference]: Without dead ends: 638 [2019-09-08 04:09:03,782 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 04:09:03,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-09-08 04:09:03,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2019-09-08 04:09:03,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-09-08 04:09:03,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 1015 transitions. [2019-09-08 04:09:03,817 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 1015 transitions. Word has length 88 [2019-09-08 04:09:03,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:09:03,817 INFO L475 AbstractCegarLoop]: Abstraction has 638 states and 1015 transitions. [2019-09-08 04:09:03,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:09:03,818 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 1015 transitions. [2019-09-08 04:09:03,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 04:09:03,820 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:09:03,820 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:09:03,820 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:09:03,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:09:03,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1753669847, now seen corresponding path program 1 times [2019-09-08 04:09:03,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:09:03,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:09:03,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:03,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:09:03,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:03,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:09:03,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:09:03,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:09:03,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:09:03,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:09:03,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:09:03,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:09:03,965 INFO L87 Difference]: Start difference. First operand 638 states and 1015 transitions. Second operand 4 states. [2019-09-08 04:09:04,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:09:04,037 INFO L93 Difference]: Finished difference Result 1239 states and 1989 transitions. [2019-09-08 04:09:04,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:09:04,037 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-09-08 04:09:04,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:09:04,046 INFO L225 Difference]: With dead ends: 1239 [2019-09-08 04:09:04,047 INFO L226 Difference]: Without dead ends: 638 [2019-09-08 04:09:04,050 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 04:09:04,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-09-08 04:09:04,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2019-09-08 04:09:04,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-09-08 04:09:04,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 1014 transitions. [2019-09-08 04:09:04,093 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 1014 transitions. Word has length 89 [2019-09-08 04:09:04,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:09:04,093 INFO L475 AbstractCegarLoop]: Abstraction has 638 states and 1014 transitions. [2019-09-08 04:09:04,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:09:04,094 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 1014 transitions. [2019-09-08 04:09:04,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 04:09:04,095 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:09:04,096 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:09:04,096 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:09:04,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:09:04,097 INFO L82 PathProgramCache]: Analyzing trace with hash 43566311, now seen corresponding path program 1 times [2019-09-08 04:09:04,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:09:04,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:09:04,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:04,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:09:04,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:04,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:09:04,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:09:04,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:09:04,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:09:04,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:09:04,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:09:04,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:09:04,291 INFO L87 Difference]: Start difference. First operand 638 states and 1014 transitions. Second operand 4 states. [2019-09-08 04:09:04,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:09:04,366 INFO L93 Difference]: Finished difference Result 1239 states and 1988 transitions. [2019-09-08 04:09:04,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:09:04,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-09-08 04:09:04,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:09:04,375 INFO L225 Difference]: With dead ends: 1239 [2019-09-08 04:09:04,376 INFO L226 Difference]: Without dead ends: 638 [2019-09-08 04:09:04,381 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 04:09:04,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-09-08 04:09:04,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2019-09-08 04:09:04,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-09-08 04:09:04,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 1013 transitions. [2019-09-08 04:09:04,412 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 1013 transitions. Word has length 90 [2019-09-08 04:09:04,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:09:04,413 INFO L475 AbstractCegarLoop]: Abstraction has 638 states and 1013 transitions. [2019-09-08 04:09:04,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:09:04,413 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 1013 transitions. [2019-09-08 04:09:04,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 04:09:04,420 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:09:04,421 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:09:04,421 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:09:04,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:09:04,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1348686253, now seen corresponding path program 1 times [2019-09-08 04:09:04,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:09:04,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:09:04,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:04,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:09:04,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:04,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:09:04,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:09:04,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:09:04,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:09:04,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:09:04,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:09:04,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:09:04,587 INFO L87 Difference]: Start difference. First operand 638 states and 1013 transitions. Second operand 4 states. [2019-09-08 04:09:04,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:09:04,645 INFO L93 Difference]: Finished difference Result 1239 states and 1987 transitions. [2019-09-08 04:09:04,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:09:04,646 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-09-08 04:09:04,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:09:04,659 INFO L225 Difference]: With dead ends: 1239 [2019-09-08 04:09:04,659 INFO L226 Difference]: Without dead ends: 638 [2019-09-08 04:09:04,663 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 04:09:04,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-09-08 04:09:04,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2019-09-08 04:09:04,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-09-08 04:09:04,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 1012 transitions. [2019-09-08 04:09:04,687 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 1012 transitions. Word has length 91 [2019-09-08 04:09:04,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:09:04,688 INFO L475 AbstractCegarLoop]: Abstraction has 638 states and 1012 transitions. [2019-09-08 04:09:04,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:09:04,688 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 1012 transitions. [2019-09-08 04:09:04,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 04:09:04,691 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:09:04,691 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:09:04,691 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:09:04,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:09:04,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1477493277, now seen corresponding path program 1 times [2019-09-08 04:09:04,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:09:04,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:09:04,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:04,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:09:04,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:04,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:09:04,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:09:04,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:09:04,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 04:09:04,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 04:09:04,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 04:09:04,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 04:09:04,875 INFO L87 Difference]: Start difference. First operand 638 states and 1012 transitions. Second operand 10 states. [2019-09-08 04:09:05,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:09:05,044 INFO L93 Difference]: Finished difference Result 1197 states and 1907 transitions. [2019-09-08 04:09:05,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:09:05,047 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2019-09-08 04:09:05,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:09:05,052 INFO L225 Difference]: With dead ends: 1197 [2019-09-08 04:09:05,052 INFO L226 Difference]: Without dead ends: 647 [2019-09-08 04:09:05,058 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 04:09:05,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2019-09-08 04:09:05,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 645. [2019-09-08 04:09:05,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2019-09-08 04:09:05,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 1021 transitions. [2019-09-08 04:09:05,096 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 1021 transitions. Word has length 92 [2019-09-08 04:09:05,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:09:05,097 INFO L475 AbstractCegarLoop]: Abstraction has 645 states and 1021 transitions. [2019-09-08 04:09:05,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 04:09:05,098 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 1021 transitions. [2019-09-08 04:09:05,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 04:09:05,101 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:09:05,101 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:09:05,102 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:09:05,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:09:05,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1457155902, now seen corresponding path program 1 times [2019-09-08 04:09:05,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:09:05,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:09:05,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:05,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:09:05,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:05,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:09:05,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:09:05,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:09:05,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:09:05,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:09:05,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:09:05,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:09:05,233 INFO L87 Difference]: Start difference. First operand 645 states and 1021 transitions. Second operand 4 states. [2019-09-08 04:09:05,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:09:05,334 INFO L93 Difference]: Finished difference Result 1245 states and 1993 transitions. [2019-09-08 04:09:05,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:09:05,335 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-09-08 04:09:05,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:09:05,343 INFO L225 Difference]: With dead ends: 1245 [2019-09-08 04:09:05,343 INFO L226 Difference]: Without dead ends: 632 [2019-09-08 04:09:05,346 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 04:09:05,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-09-08 04:09:05,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 632. [2019-09-08 04:09:05,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-09-08 04:09:05,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 998 transitions. [2019-09-08 04:09:05,369 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 998 transitions. Word has length 92 [2019-09-08 04:09:05,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:09:05,370 INFO L475 AbstractCegarLoop]: Abstraction has 632 states and 998 transitions. [2019-09-08 04:09:05,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:09:05,370 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 998 transitions. [2019-09-08 04:09:05,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 04:09:05,374 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:09:05,374 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:09:05,375 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:09:05,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:09:05,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1488514411, now seen corresponding path program 1 times [2019-09-08 04:09:05,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:09:05,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:09:05,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:05,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:09:05,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:05,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:09:05,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:09:05,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:09:05,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:09:05,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:09:05,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:09:05,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:09:05,501 INFO L87 Difference]: Start difference. First operand 632 states and 998 transitions. Second operand 6 states. [2019-09-08 04:09:05,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:09:05,722 INFO L93 Difference]: Finished difference Result 1185 states and 1885 transitions. [2019-09-08 04:09:05,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:09:05,723 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-09-08 04:09:05,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:09:05,727 INFO L225 Difference]: With dead ends: 1185 [2019-09-08 04:09:05,728 INFO L226 Difference]: Without dead ends: 632 [2019-09-08 04:09:05,731 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 04:09:05,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-09-08 04:09:05,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 632. [2019-09-08 04:09:05,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-09-08 04:09:05,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 994 transitions. [2019-09-08 04:09:05,753 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 994 transitions. Word has length 93 [2019-09-08 04:09:05,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:09:05,753 INFO L475 AbstractCegarLoop]: Abstraction has 632 states and 994 transitions. [2019-09-08 04:09:05,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:09:05,754 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 994 transitions. [2019-09-08 04:09:05,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 04:09:05,755 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:09:05,755 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:09:05,756 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:09:05,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:09:05,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1742740858, now seen corresponding path program 1 times [2019-09-08 04:09:05,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:09:05,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:09:05,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:05,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:09:05,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:05,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:09:05,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:09:05,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:09:05,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:09:05,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:09:05,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:09:05,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:09:05,870 INFO L87 Difference]: Start difference. First operand 632 states and 994 transitions. Second operand 6 states. [2019-09-08 04:09:06,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:09:06,085 INFO L93 Difference]: Finished difference Result 1185 states and 1881 transitions. [2019-09-08 04:09:06,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:09:06,086 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-09-08 04:09:06,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:09:06,091 INFO L225 Difference]: With dead ends: 1185 [2019-09-08 04:09:06,091 INFO L226 Difference]: Without dead ends: 632 [2019-09-08 04:09:06,095 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 04:09:06,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-09-08 04:09:06,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 632. [2019-09-08 04:09:06,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-09-08 04:09:06,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 990 transitions. [2019-09-08 04:09:06,126 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 990 transitions. Word has length 94 [2019-09-08 04:09:06,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:09:06,126 INFO L475 AbstractCegarLoop]: Abstraction has 632 states and 990 transitions. [2019-09-08 04:09:06,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:09:06,127 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 990 transitions. [2019-09-08 04:09:06,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 04:09:06,128 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:09:06,128 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:09:06,129 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:09:06,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:09:06,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1072622918, now seen corresponding path program 1 times [2019-09-08 04:09:06,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:09:06,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:09:06,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:06,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:09:06,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:06,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:09:06,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:09:06,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:09:06,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:09:06,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:09:06,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:09:06,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:09:06,315 INFO L87 Difference]: Start difference. First operand 632 states and 990 transitions. Second operand 6 states. [2019-09-08 04:09:06,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:09:06,504 INFO L93 Difference]: Finished difference Result 1185 states and 1877 transitions. [2019-09-08 04:09:06,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:09:06,505 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-09-08 04:09:06,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:09:06,510 INFO L225 Difference]: With dead ends: 1185 [2019-09-08 04:09:06,510 INFO L226 Difference]: Without dead ends: 632 [2019-09-08 04:09:06,513 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 04:09:06,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-09-08 04:09:06,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 632. [2019-09-08 04:09:06,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-09-08 04:09:06,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 986 transitions. [2019-09-08 04:09:06,537 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 986 transitions. Word has length 95 [2019-09-08 04:09:06,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:09:06,537 INFO L475 AbstractCegarLoop]: Abstraction has 632 states and 986 transitions. [2019-09-08 04:09:06,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:09:06,537 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 986 transitions. [2019-09-08 04:09:06,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 04:09:06,539 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:09:06,539 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:09:06,539 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:09:06,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:09:06,540 INFO L82 PathProgramCache]: Analyzing trace with hash -24768710, now seen corresponding path program 1 times [2019-09-08 04:09:06,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:09:06,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:09:06,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:06,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:09:06,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:06,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:09:06,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:09:06,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:09:06,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:09:06,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:09:06,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:09:06,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:09:06,669 INFO L87 Difference]: Start difference. First operand 632 states and 986 transitions. Second operand 7 states. [2019-09-08 04:09:06,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:09:06,776 INFO L93 Difference]: Finished difference Result 1185 states and 1873 transitions. [2019-09-08 04:09:06,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:09:06,777 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-09-08 04:09:06,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:09:06,784 INFO L225 Difference]: With dead ends: 1185 [2019-09-08 04:09:06,784 INFO L226 Difference]: Without dead ends: 611 [2019-09-08 04:09:06,790 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 04:09:06,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-09-08 04:09:06,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-09-08 04:09:06,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-09-08 04:09:06,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 952 transitions. [2019-09-08 04:09:06,819 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 952 transitions. Word has length 95 [2019-09-08 04:09:06,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:09:06,819 INFO L475 AbstractCegarLoop]: Abstraction has 611 states and 952 transitions. [2019-09-08 04:09:06,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:09:06,820 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 952 transitions. [2019-09-08 04:09:06,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 04:09:06,821 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:09:06,821 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:09:06,822 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:09:06,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:09:06,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1812600053, now seen corresponding path program 1 times [2019-09-08 04:09:06,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:09:06,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:09:06,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:06,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:09:06,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:06,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:09:06,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:09:06,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:09:06,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:09:06,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:09:06,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:09:06,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:09:06,942 INFO L87 Difference]: Start difference. First operand 611 states and 952 transitions. Second operand 6 states. [2019-09-08 04:09:07,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:09:07,043 INFO L93 Difference]: Finished difference Result 1164 states and 1839 transitions. [2019-09-08 04:09:07,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:09:07,043 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-09-08 04:09:07,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:09:07,048 INFO L225 Difference]: With dead ends: 1164 [2019-09-08 04:09:07,048 INFO L226 Difference]: Without dead ends: 611 [2019-09-08 04:09:07,052 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 04:09:07,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-09-08 04:09:07,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-09-08 04:09:07,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-09-08 04:09:07,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 951 transitions. [2019-09-08 04:09:07,078 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 951 transitions. Word has length 96 [2019-09-08 04:09:07,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:09:07,079 INFO L475 AbstractCegarLoop]: Abstraction has 611 states and 951 transitions. [2019-09-08 04:09:07,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:09:07,080 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 951 transitions. [2019-09-08 04:09:07,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 04:09:07,081 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:09:07,081 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:09:07,082 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:09:07,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:09:07,082 INFO L82 PathProgramCache]: Analyzing trace with hash 979115743, now seen corresponding path program 1 times [2019-09-08 04:09:07,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:09:07,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:09:07,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:07,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:09:07,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:07,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:09:07,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:09:07,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:09:07,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:09:07,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:09:07,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:09:07,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:09:07,209 INFO L87 Difference]: Start difference. First operand 611 states and 951 transitions. Second operand 6 states. [2019-09-08 04:09:07,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:09:07,307 INFO L93 Difference]: Finished difference Result 1164 states and 1838 transitions. [2019-09-08 04:09:07,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:09:07,307 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-09-08 04:09:07,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:09:07,312 INFO L225 Difference]: With dead ends: 1164 [2019-09-08 04:09:07,313 INFO L226 Difference]: Without dead ends: 611 [2019-09-08 04:09:07,316 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 04:09:07,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-09-08 04:09:07,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-09-08 04:09:07,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-09-08 04:09:07,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 950 transitions. [2019-09-08 04:09:07,345 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 950 transitions. Word has length 97 [2019-09-08 04:09:07,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:09:07,347 INFO L475 AbstractCegarLoop]: Abstraction has 611 states and 950 transitions. [2019-09-08 04:09:07,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:09:07,347 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 950 transitions. [2019-09-08 04:09:07,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 04:09:07,349 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:09:07,349 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:09:07,349 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:09:07,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:09:07,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1568643986, now seen corresponding path program 1 times [2019-09-08 04:09:07,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:09:07,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:09:07,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:07,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:09:07,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:07,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:09:07,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:09:07,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:09:07,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:09:07,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:09:07,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:09:07,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:09:07,513 INFO L87 Difference]: Start difference. First operand 611 states and 950 transitions. Second operand 4 states. [2019-09-08 04:09:07,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:09:07,563 INFO L93 Difference]: Finished difference Result 1164 states and 1837 transitions. [2019-09-08 04:09:07,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:09:07,563 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-09-08 04:09:07,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:09:07,568 INFO L225 Difference]: With dead ends: 1164 [2019-09-08 04:09:07,569 INFO L226 Difference]: Without dead ends: 611 [2019-09-08 04:09:07,572 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 04:09:07,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-09-08 04:09:07,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-09-08 04:09:07,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-09-08 04:09:07,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 949 transitions. [2019-09-08 04:09:07,597 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 949 transitions. Word has length 98 [2019-09-08 04:09:07,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:09:07,598 INFO L475 AbstractCegarLoop]: Abstraction has 611 states and 949 transitions. [2019-09-08 04:09:07,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:09:07,598 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 949 transitions. [2019-09-08 04:09:07,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 04:09:07,600 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:09:07,600 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:09:07,600 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:09:07,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:09:07,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1584162704, now seen corresponding path program 1 times [2019-09-08 04:09:07,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:09:07,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:09:07,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:07,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:09:07,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:07,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:09:07,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:09:07,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:09:07,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 04:09:07,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 04:09:07,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 04:09:07,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:09:07,804 INFO L87 Difference]: Start difference. First operand 611 states and 949 transitions. Second operand 12 states. [2019-09-08 04:09:07,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:09:07,977 INFO L93 Difference]: Finished difference Result 1165 states and 1836 transitions. [2019-09-08 04:09:07,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 04:09:07,978 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 98 [2019-09-08 04:09:07,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:09:07,982 INFO L225 Difference]: With dead ends: 1165 [2019-09-08 04:09:07,983 INFO L226 Difference]: Without dead ends: 611 [2019-09-08 04:09:07,986 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-08 04:09:07,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-09-08 04:09:08,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-09-08 04:09:08,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-09-08 04:09:08,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 948 transitions. [2019-09-08 04:09:08,006 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 948 transitions. Word has length 98 [2019-09-08 04:09:08,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:09:08,007 INFO L475 AbstractCegarLoop]: Abstraction has 611 states and 948 transitions. [2019-09-08 04:09:08,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 04:09:08,007 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 948 transitions. [2019-09-08 04:09:08,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 04:09:08,008 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:09:08,009 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:09:08,009 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:09:08,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:09:08,009 INFO L82 PathProgramCache]: Analyzing trace with hash -225790824, now seen corresponding path program 1 times [2019-09-08 04:09:08,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:09:08,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:09:08,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:08,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:09:08,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:08,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:09:08,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:09:08,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:09:08,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 04:09:08,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:09:08,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:09:08,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:09:08,190 INFO L87 Difference]: Start difference. First operand 611 states and 948 transitions. Second operand 9 states. [2019-09-08 04:09:15,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:09:15,874 INFO L93 Difference]: Finished difference Result 1667 states and 2655 transitions. [2019-09-08 04:09:15,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 04:09:15,875 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-08 04:09:15,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:09:15,887 INFO L225 Difference]: With dead ends: 1667 [2019-09-08 04:09:15,887 INFO L226 Difference]: Without dead ends: 1122 [2019-09-08 04:09:15,891 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2019-09-08 04:09:15,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2019-09-08 04:09:15,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 1090. [2019-09-08 04:09:15,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1090 states. [2019-09-08 04:09:15,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1688 transitions. [2019-09-08 04:09:15,947 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 1688 transitions. Word has length 99 [2019-09-08 04:09:15,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:09:15,948 INFO L475 AbstractCegarLoop]: Abstraction has 1090 states and 1688 transitions. [2019-09-08 04:09:15,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:09:15,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1688 transitions. [2019-09-08 04:09:15,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 04:09:15,950 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:09:15,950 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:09:15,951 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:09:15,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:09:15,951 INFO L82 PathProgramCache]: Analyzing trace with hash 238992682, now seen corresponding path program 1 times [2019-09-08 04:09:15,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:09:15,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:09:15,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:15,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:09:15,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:15,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:09:16,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:09:16,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:09:16,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:09:16,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:09:16,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:09:16,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:09:16,101 INFO L87 Difference]: Start difference. First operand 1090 states and 1688 transitions. Second operand 5 states. [2019-09-08 04:09:18,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:09:18,469 INFO L93 Difference]: Finished difference Result 3272 states and 5205 transitions. [2019-09-08 04:09:18,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:09:18,470 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-09-08 04:09:18,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:09:18,489 INFO L225 Difference]: With dead ends: 3272 [2019-09-08 04:09:18,489 INFO L226 Difference]: Without dead ends: 2249 [2019-09-08 04:09:18,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:09:18,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2249 states. [2019-09-08 04:09:18,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2249 to 2221. [2019-09-08 04:09:18,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2221 states. [2019-09-08 04:09:18,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2221 states to 2221 states and 3535 transitions. [2019-09-08 04:09:18,634 INFO L78 Accepts]: Start accepts. Automaton has 2221 states and 3535 transitions. Word has length 100 [2019-09-08 04:09:18,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:09:18,635 INFO L475 AbstractCegarLoop]: Abstraction has 2221 states and 3535 transitions. [2019-09-08 04:09:18,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:09:18,636 INFO L276 IsEmpty]: Start isEmpty. Operand 2221 states and 3535 transitions. [2019-09-08 04:09:18,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 04:09:18,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:09:18,637 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:09:18,638 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:09:18,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:09:18,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1182567146, now seen corresponding path program 1 times [2019-09-08 04:09:18,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:09:18,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:09:18,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:18,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:09:18,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:18,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:09:18,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:09:18,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:09:18,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:09:18,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:09:18,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:09:18,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:09:18,798 INFO L87 Difference]: Start difference. First operand 2221 states and 3535 transitions. Second operand 4 states. [2019-09-08 04:09:20,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:09:20,981 INFO L93 Difference]: Finished difference Result 6897 states and 11306 transitions. [2019-09-08 04:09:20,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:09:20,981 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-09-08 04:09:20,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:09:21,021 INFO L225 Difference]: With dead ends: 6897 [2019-09-08 04:09:21,022 INFO L226 Difference]: Without dead ends: 4744 [2019-09-08 04:09:21,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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 04:09:21,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4744 states. [2019-09-08 04:09:21,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4744 to 4687. [2019-09-08 04:09:21,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4687 states. [2019-09-08 04:09:21,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4687 states to 4687 states and 7714 transitions. [2019-09-08 04:09:21,264 INFO L78 Accepts]: Start accepts. Automaton has 4687 states and 7714 transitions. Word has length 101 [2019-09-08 04:09:21,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:09:21,265 INFO L475 AbstractCegarLoop]: Abstraction has 4687 states and 7714 transitions. [2019-09-08 04:09:21,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:09:21,265 INFO L276 IsEmpty]: Start isEmpty. Operand 4687 states and 7714 transitions. [2019-09-08 04:09:21,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 04:09:21,267 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:09:21,267 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:09:21,267 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:09:21,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:09:21,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1993722348, now seen corresponding path program 1 times [2019-09-08 04:09:21,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:09:21,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:09:21,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:21,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:09:21,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:21,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:09:21,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:09:21,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:09:21,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:09:21,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:09:21,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:09:21,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:09:21,380 INFO L87 Difference]: Start difference. First operand 4687 states and 7714 transitions. Second operand 4 states. [2019-09-08 04:09:23,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:09:23,766 INFO L93 Difference]: Finished difference Result 14913 states and 25594 transitions. [2019-09-08 04:09:23,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:09:23,767 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-08 04:09:23,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:09:23,873 INFO L225 Difference]: With dead ends: 14913 [2019-09-08 04:09:23,873 INFO L226 Difference]: Without dead ends: 10296 [2019-09-08 04:09:23,908 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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 04:09:23,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10296 states. [2019-09-08 04:09:24,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10296 to 10178. [2019-09-08 04:09:24,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10178 states. [2019-09-08 04:09:24,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10178 states to 10178 states and 17570 transitions. [2019-09-08 04:09:24,578 INFO L78 Accepts]: Start accepts. Automaton has 10178 states and 17570 transitions. Word has length 102 [2019-09-08 04:09:24,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:09:24,578 INFO L475 AbstractCegarLoop]: Abstraction has 10178 states and 17570 transitions. [2019-09-08 04:09:24,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:09:24,579 INFO L276 IsEmpty]: Start isEmpty. Operand 10178 states and 17570 transitions. [2019-09-08 04:09:24,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 04:09:24,580 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:09:24,581 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:09:24,581 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:09:24,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:09:24,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1674452760, now seen corresponding path program 1 times [2019-09-08 04:09:24,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:09:24,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:09:24,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:24,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:09:24,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:24,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:09:24,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:09:24,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:09:24,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:09:24,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:09:24,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:09:24,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:09:24,752 INFO L87 Difference]: Start difference. First operand 10178 states and 17570 transitions. Second operand 4 states. [2019-09-08 04:09:27,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:09:27,986 INFO L93 Difference]: Finished difference Result 33056 states and 60889 transitions. [2019-09-08 04:09:27,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:09:27,987 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-08 04:09:27,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:09:28,265 INFO L225 Difference]: With dead ends: 33056 [2019-09-08 04:09:28,265 INFO L226 Difference]: Without dead ends: 22952 [2019-09-08 04:09:28,340 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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 04:09:28,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22952 states. [2019-09-08 04:09:29,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22952 to 22701. [2019-09-08 04:09:29,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22701 states. [2019-09-08 04:09:29,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22701 states to 22701 states and 42042 transitions. [2019-09-08 04:09:29,834 INFO L78 Accepts]: Start accepts. Automaton has 22701 states and 42042 transitions. Word has length 103 [2019-09-08 04:09:29,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:09:29,835 INFO L475 AbstractCegarLoop]: Abstraction has 22701 states and 42042 transitions. [2019-09-08 04:09:29,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:09:29,835 INFO L276 IsEmpty]: Start isEmpty. Operand 22701 states and 42042 transitions. [2019-09-08 04:09:29,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 04:09:29,837 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:09:29,837 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:09:29,837 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:09:29,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:09:29,838 INFO L82 PathProgramCache]: Analyzing trace with hash 367034030, now seen corresponding path program 1 times [2019-09-08 04:09:29,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:09:29,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:09:29,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:29,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:09:29,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:29,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:09:29,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:09:29,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:09:29,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:09:29,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:09:29,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:09:29,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:09:29,959 INFO L87 Difference]: Start difference. First operand 22701 states and 42042 transitions. Second operand 4 states. [2019-09-08 04:09:34,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:09:34,716 INFO L93 Difference]: Finished difference Result 75175 states and 154143 transitions. [2019-09-08 04:09:34,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:09:34,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-08 04:09:34,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:09:35,292 INFO L225 Difference]: With dead ends: 75175 [2019-09-08 04:09:35,292 INFO L226 Difference]: Without dead ends: 52544 [2019-09-08 04:09:35,447 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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 04:09:35,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52544 states. [2019-09-08 04:09:38,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52544 to 51994. [2019-09-08 04:09:38,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51994 states. [2019-09-08 04:09:38,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51994 states to 51994 states and 106682 transitions. [2019-09-08 04:09:38,684 INFO L78 Accepts]: Start accepts. Automaton has 51994 states and 106682 transitions. Word has length 104 [2019-09-08 04:09:38,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:09:38,685 INFO L475 AbstractCegarLoop]: Abstraction has 51994 states and 106682 transitions. [2019-09-08 04:09:38,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:09:38,685 INFO L276 IsEmpty]: Start isEmpty. Operand 51994 states and 106682 transitions. [2019-09-08 04:09:38,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-09-08 04:09:38,717 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:09:38,717 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 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, 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 04:09:38,717 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:09:38,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:09:38,718 INFO L82 PathProgramCache]: Analyzing trace with hash -477376988, now seen corresponding path program 1 times [2019-09-08 04:09:38,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:09:38,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:09:38,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:38,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:09:38,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:38,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:09:40,758 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-09-08 04:09:40,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:09:40,758 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 04:09:40,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:09:41,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:09:41,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 3760 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 04:09:41,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:09:41,566 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 04:09:41,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:09:41,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2019-09-08 04:09:41,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:09:41,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:09:41,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:09:41,588 INFO L87 Difference]: Start difference. First operand 51994 states and 106682 transitions. Second operand 9 states. [2019-09-08 04:09:44,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:09:44,612 INFO L93 Difference]: Finished difference Result 104817 states and 226794 transitions. [2019-09-08 04:09:44,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 04:09:44,612 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 234 [2019-09-08 04:09:44,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:09:45,342 INFO L225 Difference]: With dead ends: 104817 [2019-09-08 04:09:45,342 INFO L226 Difference]: Without dead ends: 52890 [2019-09-08 04:09:45,720 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-08 04:09:45,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52890 states. [2019-09-08 04:09:52,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52890 to 52890. [2019-09-08 04:09:52,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52890 states. [2019-09-08 04:09:53,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52890 states to 52890 states and 107834 transitions. [2019-09-08 04:09:53,361 INFO L78 Accepts]: Start accepts. Automaton has 52890 states and 107834 transitions. Word has length 234 [2019-09-08 04:09:53,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:09:53,361 INFO L475 AbstractCegarLoop]: Abstraction has 52890 states and 107834 transitions. [2019-09-08 04:09:53,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:09:53,361 INFO L276 IsEmpty]: Start isEmpty. Operand 52890 states and 107834 transitions. [2019-09-08 04:09:53,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-08 04:09:53,393 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:09:53,394 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 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, 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 04:09:53,394 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:09:53,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:09:53,395 INFO L82 PathProgramCache]: Analyzing trace with hash -2146268448, now seen corresponding path program 1 times [2019-09-08 04:09:53,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:09:53,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:09:53,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:53,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:09:53,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:53,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:09:53,641 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-08 04:09:53,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:09:53,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 04:09:53,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 04:09:53,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 04:09:53,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:09:53,644 INFO L87 Difference]: Start difference. First operand 52890 states and 107834 transitions. Second operand 12 states. [2019-09-08 04:10:08,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:10:08,493 INFO L93 Difference]: Finished difference Result 148808 states and 316927 transitions. [2019-09-08 04:10:08,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 04:10:08,493 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 238 [2019-09-08 04:10:08,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:10:09,722 INFO L225 Difference]: With dead ends: 148808 [2019-09-08 04:10:09,722 INFO L226 Difference]: Without dead ends: 95984 [2019-09-08 04:10:09,927 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2019-09-08 04:10:09,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95984 states. [2019-09-08 04:10:16,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95984 to 95132. [2019-09-08 04:10:16,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95132 states. [2019-09-08 04:10:17,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95132 states to 95132 states and 195786 transitions. [2019-09-08 04:10:17,789 INFO L78 Accepts]: Start accepts. Automaton has 95132 states and 195786 transitions. Word has length 238 [2019-09-08 04:10:17,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:10:17,790 INFO L475 AbstractCegarLoop]: Abstraction has 95132 states and 195786 transitions. [2019-09-08 04:10:17,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 04:10:17,790 INFO L276 IsEmpty]: Start isEmpty. Operand 95132 states and 195786 transitions. [2019-09-08 04:10:17,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2019-09-08 04:10:17,819 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:10:17,820 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:10:17,820 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:10:17,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:10:17,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1859842731, now seen corresponding path program 1 times [2019-09-08 04:10:17,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:10:17,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:10:17,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:10:17,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:10:17,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:10:17,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:10:18,003 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-08 04:10:18,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:10:18,004 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 04:10:18,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:10:18,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:10:18,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 4132 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-08 04:10:18,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:10:18,819 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-09-08 04:10:18,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 04:10:18,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2019-09-08 04:10:18,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 04:10:18,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 04:10:18,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:10:18,836 INFO L87 Difference]: Start difference. First operand 95132 states and 195786 transitions. Second operand 12 states. [2019-09-08 04:10:32,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:10:32,791 INFO L93 Difference]: Finished difference Result 207128 states and 428413 transitions. [2019-09-08 04:10:32,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 04:10:32,792 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 293 [2019-09-08 04:10:32,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:10:33,725 INFO L225 Difference]: With dead ends: 207128 [2019-09-08 04:10:33,725 INFO L226 Difference]: Without dead ends: 111960 [2019-09-08 04:10:34,156 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2019-09-08 04:10:34,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111960 states. [2019-09-08 04:10:43,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111960 to 102545. [2019-09-08 04:10:43,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102545 states. [2019-09-08 04:10:44,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102545 states to 102545 states and 209536 transitions. [2019-09-08 04:10:44,709 INFO L78 Accepts]: Start accepts. Automaton has 102545 states and 209536 transitions. Word has length 293 [2019-09-08 04:10:44,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:10:44,710 INFO L475 AbstractCegarLoop]: Abstraction has 102545 states and 209536 transitions. [2019-09-08 04:10:44,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 04:10:44,710 INFO L276 IsEmpty]: Start isEmpty. Operand 102545 states and 209536 transitions. [2019-09-08 04:10:44,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-08 04:10:44,737 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:10:44,738 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 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, 1, 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 04:10:44,738 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:10:44,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:10:44,738 INFO L82 PathProgramCache]: Analyzing trace with hash -440955299, now seen corresponding path program 1 times [2019-09-08 04:10:44,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:10:44,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:10:44,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:10:44,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:10:44,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:10:44,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:10:44,885 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-09-08 04:10:44,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:10:44,886 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) [2019-09-08 04:10:44,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:10:46,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:10:46,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 3765 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 04:10:46,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:10:46,553 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-08 04:10:46,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:10:46,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 04:10:46,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:10:46,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:10:46,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:10:46,565 INFO L87 Difference]: Start difference. First operand 102545 states and 209536 transitions. Second operand 6 states. [2019-09-08 04:10:51,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:10:51,545 INFO L93 Difference]: Finished difference Result 206277 states and 453350 transitions. [2019-09-08 04:10:51,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:10:51,545 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 239 [2019-09-08 04:10:51,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:10:52,256 INFO L225 Difference]: With dead ends: 206277 [2019-09-08 04:10:52,256 INFO L226 Difference]: Without dead ends: 103799 [2019-09-08 04:10:58,485 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:10:58,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103799 states. [2019-09-08 04:11:02,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103799 to 103799. [2019-09-08 04:11:02,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103799 states. [2019-09-08 04:11:04,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103799 states to 103799 states and 211054 transitions. [2019-09-08 04:11:04,294 INFO L78 Accepts]: Start accepts. Automaton has 103799 states and 211054 transitions. Word has length 239 [2019-09-08 04:11:04,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:11:04,294 INFO L475 AbstractCegarLoop]: Abstraction has 103799 states and 211054 transitions. [2019-09-08 04:11:04,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:11:04,294 INFO L276 IsEmpty]: Start isEmpty. Operand 103799 states and 211054 transitions. [2019-09-08 04:11:04,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-09-08 04:11:04,319 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:11:04,319 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:11:04,319 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:11:04,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:11:04,320 INFO L82 PathProgramCache]: Analyzing trace with hash 347416773, now seen corresponding path program 1 times [2019-09-08 04:11:04,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:11:04,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:11:04,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:11:04,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:11:04,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:11:04,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:11:04,506 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-09-08 04:11:04,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:11:04,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:11:04,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:11:04,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:11:04,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:11:04,508 INFO L87 Difference]: Start difference. First operand 103799 states and 211054 transitions. Second operand 5 states. [2019-09-08 04:11:34,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:11:34,766 INFO L93 Difference]: Finished difference Result 410779 states and 1115510 transitions. [2019-09-08 04:11:34,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 04:11:34,766 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 276 [2019-09-08 04:11:34,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:11:38,474 INFO L225 Difference]: With dead ends: 410779 [2019-09-08 04:11:38,475 INFO L226 Difference]: Without dead ends: 306919 [2019-09-08 04:11:39,096 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:11:39,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306919 states. [2019-09-08 04:12:11,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306919 to 291567. [2019-09-08 04:12:11,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291567 states. [2019-09-08 04:12:16,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291567 states to 291567 states and 740008 transitions. [2019-09-08 04:12:16,229 INFO L78 Accepts]: Start accepts. Automaton has 291567 states and 740008 transitions. Word has length 276 [2019-09-08 04:12:16,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:12:16,229 INFO L475 AbstractCegarLoop]: Abstraction has 291567 states and 740008 transitions. [2019-09-08 04:12:16,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:12:16,229 INFO L276 IsEmpty]: Start isEmpty. Operand 291567 states and 740008 transitions. [2019-09-08 04:12:16,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-09-08 04:12:16,256 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:12:16,256 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 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 04:12:16,257 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:12:16,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:12:16,257 INFO L82 PathProgramCache]: Analyzing trace with hash -716796976, now seen corresponding path program 1 times [2019-09-08 04:12:16,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:12:16,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:12:16,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:16,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:12:16,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:16,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:12:16,403 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-09-08 04:12:16,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:12:16,404 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 04:12:16,418 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 04:12:16,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:12:16,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 3774 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 04:12:16,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:12:16,991 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 04:12:17,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:12:17,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 04:12:17,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:12:17,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:12:17,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:12:17,003 INFO L87 Difference]: Start difference. First operand 291567 states and 740008 transitions. Second operand 6 states. [2019-09-08 04:12:50,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:12:50,188 INFO L93 Difference]: Finished difference Result 587723 states and 1683422 transitions. [2019-09-08 04:12:50,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:12:50,188 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 248 [2019-09-08 04:12:50,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:13:07,783 INFO L225 Difference]: With dead ends: 587723 [2019-09-08 04:13:07,784 INFO L226 Difference]: Without dead ends: 296223 [2019-09-08 04:13:22,774 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:13:22,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296223 states. [2019-09-08 04:13:41,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296223 to 296223. [2019-09-08 04:13:41,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296223 states. [2019-09-08 04:13:46,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296223 states to 296223 states and 745440 transitions. [2019-09-08 04:13:46,253 INFO L78 Accepts]: Start accepts. Automaton has 296223 states and 745440 transitions. Word has length 248 [2019-09-08 04:13:46,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:13:46,253 INFO L475 AbstractCegarLoop]: Abstraction has 296223 states and 745440 transitions. [2019-09-08 04:13:46,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:13:46,254 INFO L276 IsEmpty]: Start isEmpty. Operand 296223 states and 745440 transitions. [2019-09-08 04:13:46,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-09-08 04:13:46,283 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:13:46,284 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:13:46,284 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:13:46,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:13:46,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1204670464, now seen corresponding path program 1 times [2019-09-08 04:13:46,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:13:46,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:13:46,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:13:46,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:13:46,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:13:59,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:14:00,022 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-09-08 04:14:00,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:14:00,023 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 04:14:00,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:14:00,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:14:00,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 3777 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 04:14:00,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:14:00,594 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 04:14:00,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:14:00,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2019-09-08 04:14:00,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 04:14:00,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 04:14:00,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 04:14:00,602 INFO L87 Difference]: Start difference. First operand 296223 states and 745440 transitions. Second operand 10 states. [2019-09-08 04:14:44,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:14:44,742 INFO L93 Difference]: Finished difference Result 637210 states and 1849613 transitions. [2019-09-08 04:14:44,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 04:14:44,743 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 251 [2019-09-08 04:14:44,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:14:49,044 INFO L225 Difference]: With dead ends: 637210 [2019-09-08 04:14:49,045 INFO L226 Difference]: Without dead ends: 342725 [2019-09-08 04:15:06,704 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2019-09-08 04:15:06,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342725 states. [2019-09-08 04:15:34,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342725 to 305433. [2019-09-08 04:15:34,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305433 states.