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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/product-lines/elevator_spec2_product17.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:40:56,554 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:40:56,557 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:40:56,578 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:40:56,579 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:40:56,580 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:40:56,582 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:40:56,585 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:40:56,591 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:40:56,592 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:40:56,593 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:40:56,594 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:40:56,594 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:40:56,595 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:40:56,596 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:40:56,600 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:40:56,600 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:40:56,604 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:40:56,607 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:40:56,609 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:40:56,612 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:40:56,613 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:40:56,614 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:40:56,616 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:40:56,620 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:40:56,620 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:40:56,620 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:40:56,622 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:40:56,622 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:40:56,623 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:40:56,623 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:40:56,624 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:40:56,624 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:40:56,625 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:40:56,626 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:40:56,626 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:40:56,627 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:40:56,627 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:40:56,627 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:40:56,629 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:40:56,630 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:40:56,631 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-03 02:40:56,649 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:40:56,649 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:40:56,650 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:40:56,651 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:40:56,651 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:40:56,651 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:40:56,652 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:40:56,652 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:40:56,652 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:40:56,652 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:40:56,653 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:40:56,653 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:40:56,653 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:40:56,654 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:40:56,654 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:40:56,654 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:40:56,654 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:40:56,654 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:40:56,655 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:40:56,655 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:40:56,656 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:40:56,657 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:40:56,657 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:40:56,657 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:40:56,658 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:40:56,658 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:40:56,658 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:40:56,658 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:40:56,658 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:40:56,659 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:40:56,713 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:40:56,729 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:40:56,734 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:40:56,736 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:40:56,737 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:40:56,738 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product17.cil.c [2019-10-03 02:40:56,805 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/feedef603/4a6a35bbf3a64985bc39552bdb97da9c/FLAG99c66889f [2019-10-03 02:40:57,498 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:40:57,499 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product17.cil.c [2019-10-03 02:40:57,527 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/feedef603/4a6a35bbf3a64985bc39552bdb97da9c/FLAG99c66889f [2019-10-03 02:40:57,734 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/feedef603/4a6a35bbf3a64985bc39552bdb97da9c [2019-10-03 02:40:57,748 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:40:57,749 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:40:57,750 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:40:57,751 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:40:57,754 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:40:57,755 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:40:57" (1/1) ... [2019-10-03 02:40:57,758 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@184d652c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:40:57, skipping insertion in model container [2019-10-03 02:40:57,758 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:40:57" (1/1) ... [2019-10-03 02:40:57,766 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:40:57,859 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:40:58,559 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:40:58,579 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:40:58,728 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:40:58,794 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:40:58,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:40:58 WrapperNode [2019-10-03 02:40:58,794 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:40:58,795 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:40:58,795 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:40:58,796 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:40:58,811 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:40:58" (1/1) ... [2019-10-03 02:40:58,812 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:40:58" (1/1) ... [2019-10-03 02:40:58,878 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:40:58" (1/1) ... [2019-10-03 02:40:58,879 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:40:58" (1/1) ... [2019-10-03 02:40:58,954 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:40:58" (1/1) ... [2019-10-03 02:40:58,986 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:40:58" (1/1) ... [2019-10-03 02:40:58,995 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:40:58" (1/1) ... [2019-10-03 02:40:59,017 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:40:59,017 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:40:59,018 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:40:59,018 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:40:59,022 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:40:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:40:59,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:40:59,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:40:59,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-03 02:40:59,104 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-03 02:40:59,105 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-03 02:40:59,105 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-03 02:40:59,105 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-03 02:40:59,105 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-03 02:40:59,105 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-03 02:40:59,105 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-03 02:40:59,106 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-03 02:40:59,106 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-03 02:40:59,107 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-03 02:40:59,108 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-03 02:40:59,108 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-03 02:40:59,109 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-03 02:40:59,109 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-03 02:40:59,109 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-03 02:40:59,111 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-03 02:40:59,111 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-03 02:40:59,111 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-03 02:40:59,112 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-03 02:40:59,112 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-03 02:40:59,112 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-03 02:40:59,112 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-03 02:40:59,113 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-03 02:40:59,113 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-03 02:40:59,113 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-03 02:40:59,113 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-03 02:40:59,114 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-03 02:40:59,114 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-03 02:40:59,114 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-03 02:40:59,114 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-03 02:40:59,114 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-03 02:40:59,114 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-03 02:40:59,115 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-03 02:40:59,115 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-03 02:40:59,115 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:40:59,116 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-03 02:40:59,116 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-03 02:40:59,116 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-03 02:40:59,116 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-03 02:40:59,116 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-03 02:40:59,116 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-03 02:40:59,117 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-03 02:40:59,117 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-03 02:40:59,117 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-03 02:40:59,117 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-03 02:40:59,117 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-03 02:40:59,117 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-03 02:40:59,118 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-03 02:40:59,118 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-03 02:40:59,118 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-03 02:40:59,118 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-03 02:40:59,118 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-03 02:40:59,118 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-03 02:40:59,119 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-03 02:40:59,119 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-03 02:40:59,119 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-03 02:40:59,119 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-03 02:40:59,119 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-03 02:40:59,119 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-03 02:40:59,120 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-03 02:40:59,120 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-10-03 02:40:59,121 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-10-03 02:40:59,121 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-10-03 02:40:59,121 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-10-03 02:40:59,121 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-03 02:40:59,122 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-03 02:40:59,122 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-03 02:40:59,122 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-03 02:40:59,122 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-03 02:40:59,122 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-03 02:40:59,123 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-03 02:40:59,123 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:40:59,123 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:40:59,124 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-03 02:40:59,124 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-03 02:40:59,124 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-03 02:40:59,125 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-03 02:40:59,125 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-03 02:40:59,125 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-03 02:40:59,125 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-03 02:40:59,125 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-03 02:40:59,126 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-03 02:40:59,126 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-03 02:40:59,127 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-03 02:40:59,127 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-03 02:40:59,127 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-03 02:40:59,127 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-03 02:40:59,128 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-03 02:40:59,128 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-03 02:40:59,128 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-03 02:40:59,128 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-03 02:40:59,128 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-03 02:40:59,128 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-03 02:40:59,129 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-03 02:40:59,129 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-03 02:40:59,129 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-03 02:40:59,129 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-03 02:40:59,129 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-03 02:40:59,129 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-03 02:40:59,130 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-03 02:40:59,130 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-03 02:40:59,130 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-03 02:40:59,130 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-03 02:40:59,130 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-03 02:40:59,130 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-03 02:40:59,131 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-03 02:40:59,131 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-03 02:40:59,131 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-03 02:40:59,131 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-03 02:40:59,131 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-03 02:40:59,131 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-03 02:40:59,132 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-03 02:40:59,132 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-03 02:40:59,132 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-10-03 02:40:59,133 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-10-03 02:40:59,133 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-03 02:40:59,134 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-03 02:40:59,134 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:40:59,134 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-03 02:40:59,134 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-03 02:40:59,136 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-03 02:40:59,136 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-03 02:40:59,136 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-03 02:40:59,136 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-03 02:40:59,137 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-03 02:40:59,137 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-03 02:40:59,137 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-03 02:40:59,138 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-03 02:40:59,138 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-10-03 02:40:59,138 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-03 02:40:59,138 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-03 02:40:59,138 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-03 02:40:59,139 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-03 02:40:59,139 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-03 02:40:59,139 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-03 02:40:59,140 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-03 02:40:59,143 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-03 02:40:59,144 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-03 02:40:59,144 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-10-03 02:40:59,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-03 02:40:59,150 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-03 02:40:59,150 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-03 02:40:59,150 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-03 02:40:59,150 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-03 02:40:59,151 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-03 02:40:59,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-03 02:40:59,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-03 02:40:59,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-03 02:40:59,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-03 02:40:59,152 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-03 02:40:59,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-03 02:40:59,153 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-03 02:40:59,153 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-03 02:40:59,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-03 02:40:59,153 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-03 02:40:59,153 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-03 02:40:59,153 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-03 02:40:59,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:40:59,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-03 02:40:59,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:41:01,434 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:41:01,435 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-03 02:41:01,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:41:01 BoogieIcfgContainer [2019-10-03 02:41:01,437 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:41:01,438 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:41:01,438 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:41:01,441 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:41:01,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:40:57" (1/3) ... [2019-10-03 02:41:01,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b87c728 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:41:01, skipping insertion in model container [2019-10-03 02:41:01,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:40:58" (2/3) ... [2019-10-03 02:41:01,443 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b87c728 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:41:01, skipping insertion in model container [2019-10-03 02:41:01,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:41:01" (3/3) ... [2019-10-03 02:41:01,445 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product17.cil.c [2019-10-03 02:41:01,454 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:41:01,467 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:41:01,485 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:41:01,518 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:41:01,518 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:41:01,519 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:41:01,519 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:41:01,519 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:41:01,519 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:41:01,519 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:41:01,519 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:41:01,557 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states. [2019-10-03 02:41:01,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-03 02:41:01,591 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:01,593 INFO L411 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, 1, 1, 1] [2019-10-03 02:41:01,597 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:01,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:01,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1835526368, now seen corresponding path program 1 times [2019-10-03 02:41:01,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:01,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:01,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:01,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:01,665 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:01,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:02,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:41:02,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:02,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:41:02,188 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:02,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:41:02,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:41:02,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:41:02,218 INFO L87 Difference]: Start difference. First operand 742 states. Second operand 4 states. [2019-10-03 02:41:02,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:02,392 INFO L93 Difference]: Finished difference Result 593 states and 949 transitions. [2019-10-03 02:41:02,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:41:02,395 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-10-03 02:41:02,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:02,432 INFO L225 Difference]: With dead ends: 593 [2019-10-03 02:41:02,432 INFO L226 Difference]: Without dead ends: 582 [2019-10-03 02:41:02,435 INFO L640 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-10-03 02:41:02,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-10-03 02:41:02,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2019-10-03 02:41:02,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-10-03 02:41:02,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 937 transitions. [2019-10-03 02:41:02,560 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 937 transitions. Word has length 107 [2019-10-03 02:41:02,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:02,561 INFO L475 AbstractCegarLoop]: Abstraction has 582 states and 937 transitions. [2019-10-03 02:41:02,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:41:02,600 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 937 transitions. [2019-10-03 02:41:02,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-03 02:41:02,613 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:02,613 INFO L411 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, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:02,613 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:02,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:02,614 INFO L82 PathProgramCache]: Analyzing trace with hash 443776321, now seen corresponding path program 1 times [2019-10-03 02:41:02,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:02,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:02,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:02,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:02,619 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:02,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:02,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:41:02,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:02,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:41:02,884 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:02,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:41:02,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:41:02,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:41:02,890 INFO L87 Difference]: Start difference. First operand 582 states and 937 transitions. Second operand 4 states. [2019-10-03 02:41:02,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:02,967 INFO L93 Difference]: Finished difference Result 584 states and 938 transitions. [2019-10-03 02:41:02,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:41:02,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-10-03 02:41:02,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:02,976 INFO L225 Difference]: With dead ends: 584 [2019-10-03 02:41:02,976 INFO L226 Difference]: Without dead ends: 582 [2019-10-03 02:41:02,978 INFO L640 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-10-03 02:41:02,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-10-03 02:41:03,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2019-10-03 02:41:03,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-10-03 02:41:03,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 936 transitions. [2019-10-03 02:41:03,007 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 936 transitions. Word has length 110 [2019-10-03 02:41:03,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:03,008 INFO L475 AbstractCegarLoop]: Abstraction has 582 states and 936 transitions. [2019-10-03 02:41:03,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:41:03,008 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 936 transitions. [2019-10-03 02:41:03,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-03 02:41:03,012 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:03,012 INFO L411 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, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:03,013 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:03,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:03,013 INFO L82 PathProgramCache]: Analyzing trace with hash 15474447, now seen corresponding path program 1 times [2019-10-03 02:41:03,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:03,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:03,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:03,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:03,018 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:03,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:03,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:41:03,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:03,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:41:03,223 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:03,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:41:03,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:41:03,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:41:03,225 INFO L87 Difference]: Start difference. First operand 582 states and 936 transitions. Second operand 4 states. [2019-10-03 02:41:03,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:03,281 INFO L93 Difference]: Finished difference Result 584 states and 937 transitions. [2019-10-03 02:41:03,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:41:03,282 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-10-03 02:41:03,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:03,286 INFO L225 Difference]: With dead ends: 584 [2019-10-03 02:41:03,287 INFO L226 Difference]: Without dead ends: 582 [2019-10-03 02:41:03,287 INFO L640 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-10-03 02:41:03,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-10-03 02:41:03,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2019-10-03 02:41:03,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-10-03 02:41:03,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 935 transitions. [2019-10-03 02:41:03,331 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 935 transitions. Word has length 111 [2019-10-03 02:41:03,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:03,331 INFO L475 AbstractCegarLoop]: Abstraction has 582 states and 935 transitions. [2019-10-03 02:41:03,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:41:03,332 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 935 transitions. [2019-10-03 02:41:03,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-03 02:41:03,338 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:03,338 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:03,339 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:03,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:03,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1301085565, now seen corresponding path program 1 times [2019-10-03 02:41:03,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:03,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:03,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:03,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:03,344 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:03,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:03,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:41:03,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:03,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:41:03,555 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:03,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:41:03,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:41:03,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:41:03,556 INFO L87 Difference]: Start difference. First operand 582 states and 935 transitions. Second operand 4 states. [2019-10-03 02:41:03,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:03,607 INFO L93 Difference]: Finished difference Result 584 states and 936 transitions. [2019-10-03 02:41:03,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:41:03,608 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-10-03 02:41:03,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:03,615 INFO L225 Difference]: With dead ends: 584 [2019-10-03 02:41:03,615 INFO L226 Difference]: Without dead ends: 582 [2019-10-03 02:41:03,616 INFO L640 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-10-03 02:41:03,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-10-03 02:41:03,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2019-10-03 02:41:03,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-10-03 02:41:03,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 934 transitions. [2019-10-03 02:41:03,642 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 934 transitions. Word has length 112 [2019-10-03 02:41:03,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:03,643 INFO L475 AbstractCegarLoop]: Abstraction has 582 states and 934 transitions. [2019-10-03 02:41:03,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:41:03,643 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 934 transitions. [2019-10-03 02:41:03,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-03 02:41:03,647 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:03,647 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:03,647 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:03,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:03,648 INFO L82 PathProgramCache]: Analyzing trace with hash -116575413, now seen corresponding path program 1 times [2019-10-03 02:41:03,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:03,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:03,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:03,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:03,652 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:03,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:03,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-10-03 02:41:03,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:03,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:41:03,803 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:03,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:41:03,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:41:03,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:41:03,807 INFO L87 Difference]: Start difference. First operand 582 states and 934 transitions. Second operand 4 states. [2019-10-03 02:41:03,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:03,859 INFO L93 Difference]: Finished difference Result 584 states and 935 transitions. [2019-10-03 02:41:03,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:41:03,860 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-10-03 02:41:03,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:03,870 INFO L225 Difference]: With dead ends: 584 [2019-10-03 02:41:03,870 INFO L226 Difference]: Without dead ends: 582 [2019-10-03 02:41:03,871 INFO L640 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-10-03 02:41:03,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-10-03 02:41:03,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2019-10-03 02:41:03,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-10-03 02:41:03,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 933 transitions. [2019-10-03 02:41:03,890 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 933 transitions. Word has length 113 [2019-10-03 02:41:03,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:03,890 INFO L475 AbstractCegarLoop]: Abstraction has 582 states and 933 transitions. [2019-10-03 02:41:03,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:41:03,891 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 933 transitions. [2019-10-03 02:41:03,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-03 02:41:03,897 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:03,897 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:03,897 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:03,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:03,898 INFO L82 PathProgramCache]: Analyzing trace with hash 563674553, now seen corresponding path program 1 times [2019-10-03 02:41:03,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:03,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:03,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:03,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:03,903 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:03,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:04,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:41:04,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:04,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 02:41:04,091 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:04,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 02:41:04,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 02:41:04,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:41:04,092 INFO L87 Difference]: Start difference. First operand 582 states and 933 transitions. Second operand 10 states. [2019-10-03 02:41:04,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:04,252 INFO L93 Difference]: Finished difference Result 591 states and 944 transitions. [2019-10-03 02:41:04,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 02:41:04,253 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 114 [2019-10-03 02:41:04,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:04,263 INFO L225 Difference]: With dead ends: 591 [2019-10-03 02:41:04,265 INFO L226 Difference]: Without dead ends: 591 [2019-10-03 02:41:04,266 INFO L640 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-10-03 02:41:04,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-10-03 02:41:04,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 589. [2019-10-03 02:41:04,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-10-03 02:41:04,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 942 transitions. [2019-10-03 02:41:04,314 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 942 transitions. Word has length 114 [2019-10-03 02:41:04,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:04,314 INFO L475 AbstractCegarLoop]: Abstraction has 589 states and 942 transitions. [2019-10-03 02:41:04,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 02:41:04,315 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 942 transitions. [2019-10-03 02:41:04,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-03 02:41:04,322 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:04,322 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:04,323 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:04,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:04,324 INFO L82 PathProgramCache]: Analyzing trace with hash 983191384, now seen corresponding path program 1 times [2019-10-03 02:41:04,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:04,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:04,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:04,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:04,328 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:04,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:04,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:41:04,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:04,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:41:04,444 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:04,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:41:04,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:41:04,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:41:04,446 INFO L87 Difference]: Start difference. First operand 589 states and 942 transitions. Second operand 4 states. [2019-10-03 02:41:04,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:04,500 INFO L93 Difference]: Finished difference Result 587 states and 937 transitions. [2019-10-03 02:41:04,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:41:04,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-10-03 02:41:04,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:04,507 INFO L225 Difference]: With dead ends: 587 [2019-10-03 02:41:04,507 INFO L226 Difference]: Without dead ends: 576 [2019-10-03 02:41:04,508 INFO L640 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-10-03 02:41:04,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-10-03 02:41:04,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 576. [2019-10-03 02:41:04,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-10-03 02:41:04,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 919 transitions. [2019-10-03 02:41:04,538 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 919 transitions. Word has length 114 [2019-10-03 02:41:04,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:04,540 INFO L475 AbstractCegarLoop]: Abstraction has 576 states and 919 transitions. [2019-10-03 02:41:04,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:41:04,540 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 919 transitions. [2019-10-03 02:41:04,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-03 02:41:04,545 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:04,546 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:04,546 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:04,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:04,547 INFO L82 PathProgramCache]: Analyzing trace with hash 881745063, now seen corresponding path program 1 times [2019-10-03 02:41:04,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:04,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:04,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:04,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:04,552 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:04,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:04,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:41:04,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:04,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:41:04,814 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:04,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:41:04,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:41:04,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:41:04,816 INFO L87 Difference]: Start difference. First operand 576 states and 919 transitions. Second operand 6 states. [2019-10-03 02:41:05,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:05,036 INFO L93 Difference]: Finished difference Result 579 states and 922 transitions. [2019-10-03 02:41:05,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:41:05,037 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 115 [2019-10-03 02:41:05,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:05,042 INFO L225 Difference]: With dead ends: 579 [2019-10-03 02:41:05,042 INFO L226 Difference]: Without dead ends: 576 [2019-10-03 02:41:05,042 INFO L640 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-10-03 02:41:05,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-10-03 02:41:05,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 576. [2019-10-03 02:41:05,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-10-03 02:41:05,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 915 transitions. [2019-10-03 02:41:05,060 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 915 transitions. Word has length 115 [2019-10-03 02:41:05,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:05,062 INFO L475 AbstractCegarLoop]: Abstraction has 576 states and 915 transitions. [2019-10-03 02:41:05,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:41:05,063 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 915 transitions. [2019-10-03 02:41:05,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-03 02:41:05,066 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:05,066 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:05,067 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:05,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:05,070 INFO L82 PathProgramCache]: Analyzing trace with hash -2138395236, now seen corresponding path program 1 times [2019-10-03 02:41:05,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:05,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:05,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:05,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:05,074 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:05,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:05,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:41:05,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:05,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:41:05,221 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:05,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:41:05,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:41:05,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:41:05,222 INFO L87 Difference]: Start difference. First operand 576 states and 915 transitions. Second operand 6 states. [2019-10-03 02:41:05,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:05,421 INFO L93 Difference]: Finished difference Result 579 states and 918 transitions. [2019-10-03 02:41:05,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:41:05,421 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 116 [2019-10-03 02:41:05,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:05,426 INFO L225 Difference]: With dead ends: 579 [2019-10-03 02:41:05,426 INFO L226 Difference]: Without dead ends: 576 [2019-10-03 02:41:05,427 INFO L640 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-10-03 02:41:05,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-10-03 02:41:05,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 576. [2019-10-03 02:41:05,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-10-03 02:41:05,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 911 transitions. [2019-10-03 02:41:05,449 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 911 transitions. Word has length 116 [2019-10-03 02:41:05,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:05,449 INFO L475 AbstractCegarLoop]: Abstraction has 576 states and 911 transitions. [2019-10-03 02:41:05,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:41:05,450 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 911 transitions. [2019-10-03 02:41:05,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-03 02:41:05,454 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:05,454 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:05,454 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:05,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:05,455 INFO L82 PathProgramCache]: Analyzing trace with hash 603126668, now seen corresponding path program 1 times [2019-10-03 02:41:05,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:05,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:05,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:05,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:05,460 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:05,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:05,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-10-03 02:41:05,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:05,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:41:05,585 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:05,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:41:05,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:41:05,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:41:05,587 INFO L87 Difference]: Start difference. First operand 576 states and 911 transitions. Second operand 6 states. [2019-10-03 02:41:05,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:05,810 INFO L93 Difference]: Finished difference Result 579 states and 914 transitions. [2019-10-03 02:41:05,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:41:05,811 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 117 [2019-10-03 02:41:05,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:05,815 INFO L225 Difference]: With dead ends: 579 [2019-10-03 02:41:05,815 INFO L226 Difference]: Without dead ends: 576 [2019-10-03 02:41:05,816 INFO L640 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-10-03 02:41:05,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-10-03 02:41:05,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 576. [2019-10-03 02:41:05,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-10-03 02:41:05,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 907 transitions. [2019-10-03 02:41:05,833 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 907 transitions. Word has length 117 [2019-10-03 02:41:05,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:05,833 INFO L475 AbstractCegarLoop]: Abstraction has 576 states and 907 transitions. [2019-10-03 02:41:05,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:41:05,833 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 907 transitions. [2019-10-03 02:41:05,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-03 02:41:05,837 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:05,837 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:05,837 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:05,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:05,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1057986572, now seen corresponding path program 1 times [2019-10-03 02:41:05,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:05,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:05,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:05,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:05,841 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:05,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:05,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:41:05,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:05,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:41:05,961 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:05,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:41:05,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:41:05,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:41:05,962 INFO L87 Difference]: Start difference. First operand 576 states and 907 transitions. Second operand 7 states. [2019-10-03 02:41:06,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:06,036 INFO L93 Difference]: Finished difference Result 579 states and 910 transitions. [2019-10-03 02:41:06,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:41:06,037 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 117 [2019-10-03 02:41:06,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:06,042 INFO L225 Difference]: With dead ends: 579 [2019-10-03 02:41:06,042 INFO L226 Difference]: Without dead ends: 555 [2019-10-03 02:41:06,043 INFO L640 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-10-03 02:41:06,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-10-03 02:41:06,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2019-10-03 02:41:06,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-10-03 02:41:06,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 873 transitions. [2019-10-03 02:41:06,065 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 873 transitions. Word has length 117 [2019-10-03 02:41:06,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:06,066 INFO L475 AbstractCegarLoop]: Abstraction has 555 states and 873 transitions. [2019-10-03 02:41:06,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:41:06,066 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 873 transitions. [2019-10-03 02:41:06,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-03 02:41:06,070 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:06,070 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:06,070 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:06,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:06,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1567550433, now seen corresponding path program 1 times [2019-10-03 02:41:06,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:06,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:06,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:06,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:06,075 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:06,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:06,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:41:06,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:06,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:41:06,204 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:06,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:41:06,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:41:06,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:41:06,207 INFO L87 Difference]: Start difference. First operand 555 states and 873 transitions. Second operand 6 states. [2019-10-03 02:41:06,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:06,292 INFO L93 Difference]: Finished difference Result 558 states and 876 transitions. [2019-10-03 02:41:06,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:41:06,293 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 118 [2019-10-03 02:41:06,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:06,297 INFO L225 Difference]: With dead ends: 558 [2019-10-03 02:41:06,297 INFO L226 Difference]: Without dead ends: 555 [2019-10-03 02:41:06,298 INFO L640 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-10-03 02:41:06,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-10-03 02:41:06,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2019-10-03 02:41:06,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-10-03 02:41:06,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 872 transitions. [2019-10-03 02:41:06,315 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 872 transitions. Word has length 118 [2019-10-03 02:41:06,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:06,316 INFO L475 AbstractCegarLoop]: Abstraction has 555 states and 872 transitions. [2019-10-03 02:41:06,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:41:06,316 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 872 transitions. [2019-10-03 02:41:06,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-03 02:41:06,320 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:06,320 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:06,320 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:06,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:06,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1018460559, now seen corresponding path program 1 times [2019-10-03 02:41:06,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:06,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:06,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:06,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:06,324 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:06,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:06,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:41:06,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:06,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:41:06,455 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:06,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:41:06,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:41:06,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:41:06,457 INFO L87 Difference]: Start difference. First operand 555 states and 872 transitions. Second operand 6 states. [2019-10-03 02:41:06,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:06,540 INFO L93 Difference]: Finished difference Result 558 states and 875 transitions. [2019-10-03 02:41:06,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:41:06,540 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2019-10-03 02:41:06,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:06,544 INFO L225 Difference]: With dead ends: 558 [2019-10-03 02:41:06,545 INFO L226 Difference]: Without dead ends: 555 [2019-10-03 02:41:06,545 INFO L640 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-10-03 02:41:06,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-10-03 02:41:06,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2019-10-03 02:41:06,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-10-03 02:41:06,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 871 transitions. [2019-10-03 02:41:06,562 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 871 transitions. Word has length 119 [2019-10-03 02:41:06,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:06,564 INFO L475 AbstractCegarLoop]: Abstraction has 555 states and 871 transitions. [2019-10-03 02:41:06,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:41:06,564 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 871 transitions. [2019-10-03 02:41:06,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-03 02:41:06,568 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:06,568 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:06,569 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:06,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:06,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1998799322, now seen corresponding path program 1 times [2019-10-03 02:41:06,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:06,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:06,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:06,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:06,572 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:06,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:06,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:41:06,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:06,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-03 02:41:06,787 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:06,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-03 02:41:06,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-03 02:41:06,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-03 02:41:06,791 INFO L87 Difference]: Start difference. First operand 555 states and 871 transitions. Second operand 12 states. [2019-10-03 02:41:07,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:07,071 INFO L93 Difference]: Finished difference Result 559 states and 874 transitions. [2019-10-03 02:41:07,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-03 02:41:07,072 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 120 [2019-10-03 02:41:07,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:07,078 INFO L225 Difference]: With dead ends: 559 [2019-10-03 02:41:07,078 INFO L226 Difference]: Without dead ends: 555 [2019-10-03 02:41:07,081 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-03 02:41:07,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-10-03 02:41:07,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2019-10-03 02:41:07,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-10-03 02:41:07,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 870 transitions. [2019-10-03 02:41:07,107 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 870 transitions. Word has length 120 [2019-10-03 02:41:07,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:07,108 INFO L475 AbstractCegarLoop]: Abstraction has 555 states and 870 transitions. [2019-10-03 02:41:07,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-03 02:41:07,108 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 870 transitions. [2019-10-03 02:41:07,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-03 02:41:07,114 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:07,114 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:07,116 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:07,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:07,116 INFO L82 PathProgramCache]: Analyzing trace with hash 504527096, now seen corresponding path program 1 times [2019-10-03 02:41:07,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:07,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:07,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:07,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:07,123 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:07,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:07,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:41:07,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:07,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:41:07,307 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:07,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:41:07,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:41:07,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:41:07,309 INFO L87 Difference]: Start difference. First operand 555 states and 870 transitions. Second operand 9 states. [2019-10-03 02:41:10,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:10,910 INFO L93 Difference]: Finished difference Result 561 states and 891 transitions. [2019-10-03 02:41:10,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:41:10,910 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-10-03 02:41:10,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:10,916 INFO L225 Difference]: With dead ends: 561 [2019-10-03 02:41:10,916 INFO L226 Difference]: Without dead ends: 561 [2019-10-03 02:41:10,917 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-10-03 02:41:10,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-10-03 02:41:10,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 559. [2019-10-03 02:41:10,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2019-10-03 02:41:10,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 889 transitions. [2019-10-03 02:41:10,935 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 889 transitions. Word has length 121 [2019-10-03 02:41:10,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:10,936 INFO L475 AbstractCegarLoop]: Abstraction has 559 states and 889 transitions. [2019-10-03 02:41:10,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:41:10,936 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 889 transitions. [2019-10-03 02:41:10,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-03 02:41:10,940 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:10,940 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:10,940 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:10,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:10,940 INFO L82 PathProgramCache]: Analyzing trace with hash -250381492, now seen corresponding path program 1 times [2019-10-03 02:41:10,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:10,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:10,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:10,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:10,944 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:10,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:11,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:41:11,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:11,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:41:11,092 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:11,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:41:11,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:41:11,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:41:11,094 INFO L87 Difference]: Start difference. First operand 559 states and 889 transitions. Second operand 8 states. [2019-10-03 02:41:17,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:17,854 INFO L93 Difference]: Finished difference Result 1469 states and 2349 transitions. [2019-10-03 02:41:17,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-03 02:41:17,855 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 122 [2019-10-03 02:41:17,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:17,874 INFO L225 Difference]: With dead ends: 1469 [2019-10-03 02:41:17,874 INFO L226 Difference]: Without dead ends: 1469 [2019-10-03 02:41:17,875 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-10-03 02:41:17,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2019-10-03 02:41:17,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1430. [2019-10-03 02:41:17,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1430 states. [2019-10-03 02:41:17,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1430 states to 1430 states and 2296 transitions. [2019-10-03 02:41:17,924 INFO L78 Accepts]: Start accepts. Automaton has 1430 states and 2296 transitions. Word has length 122 [2019-10-03 02:41:17,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:17,925 INFO L475 AbstractCegarLoop]: Abstraction has 1430 states and 2296 transitions. [2019-10-03 02:41:17,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:41:17,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1430 states and 2296 transitions. [2019-10-03 02:41:17,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-03 02:41:17,928 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:17,928 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:17,928 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:17,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:17,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1214123081, now seen corresponding path program 1 times [2019-10-03 02:41:17,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:17,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:17,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:17,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:17,933 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:17,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:18,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-10-03 02:41:18,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:18,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:41:18,100 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:18,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:41:18,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:41:18,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:41:18,102 INFO L87 Difference]: Start difference. First operand 1430 states and 2296 transitions. Second operand 9 states. [2019-10-03 02:41:25,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:25,227 INFO L93 Difference]: Finished difference Result 3140 states and 5126 transitions. [2019-10-03 02:41:25,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-03 02:41:25,227 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 128 [2019-10-03 02:41:25,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:25,259 INFO L225 Difference]: With dead ends: 3140 [2019-10-03 02:41:25,259 INFO L226 Difference]: Without dead ends: 3140 [2019-10-03 02:41:25,260 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-10-03 02:41:25,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3140 states. [2019-10-03 02:41:25,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3140 to 2917. [2019-10-03 02:41:25,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2917 states. [2019-10-03 02:41:25,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2917 states to 2917 states and 4711 transitions. [2019-10-03 02:41:25,390 INFO L78 Accepts]: Start accepts. Automaton has 2917 states and 4711 transitions. Word has length 128 [2019-10-03 02:41:25,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:25,390 INFO L475 AbstractCegarLoop]: Abstraction has 2917 states and 4711 transitions. [2019-10-03 02:41:25,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:41:25,391 INFO L276 IsEmpty]: Start isEmpty. Operand 2917 states and 4711 transitions. [2019-10-03 02:41:25,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-03 02:41:25,394 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:25,394 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:25,395 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:25,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:25,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1206363722, now seen corresponding path program 1 times [2019-10-03 02:41:25,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:25,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:25,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:25,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:25,399 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:25,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:25,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:41:25,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:25,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:41:25,582 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:25,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:41:25,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:41:25,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:41:25,583 INFO L87 Difference]: Start difference. First operand 2917 states and 4711 transitions. Second operand 5 states. [2019-10-03 02:41:28,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:28,148 INFO L93 Difference]: Finished difference Result 4294 states and 6857 transitions. [2019-10-03 02:41:28,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:41:28,149 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 128 [2019-10-03 02:41:28,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:28,178 INFO L225 Difference]: With dead ends: 4294 [2019-10-03 02:41:28,178 INFO L226 Difference]: Without dead ends: 4288 [2019-10-03 02:41:28,178 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:41:28,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4288 states. [2019-10-03 02:41:28,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4288 to 4261. [2019-10-03 02:41:28,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4261 states. [2019-10-03 02:41:28,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4261 states to 4261 states and 6797 transitions. [2019-10-03 02:41:28,323 INFO L78 Accepts]: Start accepts. Automaton has 4261 states and 6797 transitions. Word has length 128 [2019-10-03 02:41:28,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:28,323 INFO L475 AbstractCegarLoop]: Abstraction has 4261 states and 6797 transitions. [2019-10-03 02:41:28,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:41:28,324 INFO L276 IsEmpty]: Start isEmpty. Operand 4261 states and 6797 transitions. [2019-10-03 02:41:28,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-03 02:41:28,327 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:28,327 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:28,327 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:28,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:28,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1039215732, now seen corresponding path program 1 times [2019-10-03 02:41:28,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:28,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:28,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:28,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:28,331 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:28,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:28,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:41:28,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:28,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:41:28,510 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:28,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:41:28,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:41:28,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:41:28,511 INFO L87 Difference]: Start difference. First operand 4261 states and 6797 transitions. Second operand 7 states. [2019-10-03 02:41:32,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:32,890 INFO L93 Difference]: Finished difference Result 8363 states and 13539 transitions. [2019-10-03 02:41:32,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 02:41:32,890 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 128 [2019-10-03 02:41:32,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:32,943 INFO L225 Difference]: With dead ends: 8363 [2019-10-03 02:41:32,943 INFO L226 Difference]: Without dead ends: 8363 [2019-10-03 02:41:32,944 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-10-03 02:41:32,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8363 states. [2019-10-03 02:41:33,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8363 to 8200. [2019-10-03 02:41:33,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8200 states. [2019-10-03 02:41:33,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8200 states to 8200 states and 13229 transitions. [2019-10-03 02:41:33,238 INFO L78 Accepts]: Start accepts. Automaton has 8200 states and 13229 transitions. Word has length 128 [2019-10-03 02:41:33,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:33,239 INFO L475 AbstractCegarLoop]: Abstraction has 8200 states and 13229 transitions. [2019-10-03 02:41:33,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:41:33,239 INFO L276 IsEmpty]: Start isEmpty. Operand 8200 states and 13229 transitions. [2019-10-03 02:41:33,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-03 02:41:33,245 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:33,245 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:33,246 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:33,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:33,246 INFO L82 PathProgramCache]: Analyzing trace with hash -944417101, now seen corresponding path program 1 times [2019-10-03 02:41:33,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:33,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:33,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:33,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:33,251 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:33,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:33,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:41:33,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:33,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:41:33,384 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:33,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:41:33,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:41:33,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:41:33,386 INFO L87 Difference]: Start difference. First operand 8200 states and 13229 transitions. Second operand 5 states. [2019-10-03 02:41:33,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:33,503 INFO L93 Difference]: Finished difference Result 8422 states and 13591 transitions. [2019-10-03 02:41:33,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:41:33,503 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-10-03 02:41:33,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:33,549 INFO L225 Difference]: With dead ends: 8422 [2019-10-03 02:41:33,550 INFO L226 Difference]: Without dead ends: 8422 [2019-10-03 02:41:33,550 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:41:33,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8422 states. [2019-10-03 02:41:33,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8422 to 8290. [2019-10-03 02:41:33,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8290 states. [2019-10-03 02:41:33,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8290 states to 8290 states and 13356 transitions. [2019-10-03 02:41:33,827 INFO L78 Accepts]: Start accepts. Automaton has 8290 states and 13356 transitions. Word has length 133 [2019-10-03 02:41:33,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:33,828 INFO L475 AbstractCegarLoop]: Abstraction has 8290 states and 13356 transitions. [2019-10-03 02:41:33,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:41:33,828 INFO L276 IsEmpty]: Start isEmpty. Operand 8290 states and 13356 transitions. [2019-10-03 02:41:33,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-03 02:41:33,832 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:33,833 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:33,833 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:33,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:33,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1512564016, now seen corresponding path program 1 times [2019-10-03 02:41:33,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:33,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:33,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:33,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:33,837 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:33,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:34,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:41:34,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:34,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:41:34,003 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:34,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:41:34,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:41:34,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:41:34,004 INFO L87 Difference]: Start difference. First operand 8290 states and 13356 transitions. Second operand 7 states. [2019-10-03 02:41:34,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:34,224 INFO L93 Difference]: Finished difference Result 9206 states and 14816 transitions. [2019-10-03 02:41:34,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:41:34,225 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 140 [2019-10-03 02:41:34,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:34,269 INFO L225 Difference]: With dead ends: 9206 [2019-10-03 02:41:34,270 INFO L226 Difference]: Without dead ends: 8290 [2019-10-03 02:41:34,270 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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-10-03 02:41:34,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8290 states. [2019-10-03 02:41:34,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8290 to 8290. [2019-10-03 02:41:34,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8290 states. [2019-10-03 02:41:34,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8290 states to 8290 states and 13180 transitions. [2019-10-03 02:41:34,610 INFO L78 Accepts]: Start accepts. Automaton has 8290 states and 13180 transitions. Word has length 140 [2019-10-03 02:41:34,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:34,611 INFO L475 AbstractCegarLoop]: Abstraction has 8290 states and 13180 transitions. [2019-10-03 02:41:34,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:41:34,611 INFO L276 IsEmpty]: Start isEmpty. Operand 8290 states and 13180 transitions. [2019-10-03 02:41:34,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-03 02:41:34,616 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:34,616 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:34,616 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:34,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:34,617 INFO L82 PathProgramCache]: Analyzing trace with hash 260228654, now seen corresponding path program 1 times [2019-10-03 02:41:34,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:34,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:34,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:34,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:34,620 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:34,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:34,771 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-03 02:41:34,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:34,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:41:34,771 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:34,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:41:34,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:41:34,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:41:34,773 INFO L87 Difference]: Start difference. First operand 8290 states and 13180 transitions. Second operand 7 states. [2019-10-03 02:41:39,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:39,453 INFO L93 Difference]: Finished difference Result 8965 states and 14182 transitions. [2019-10-03 02:41:39,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-03 02:41:39,455 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 145 [2019-10-03 02:41:39,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:39,501 INFO L225 Difference]: With dead ends: 8965 [2019-10-03 02:41:39,501 INFO L226 Difference]: Without dead ends: 8965 [2019-10-03 02:41:39,502 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-10-03 02:41:39,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8965 states. [2019-10-03 02:41:39,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8965 to 8754. [2019-10-03 02:41:39,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8754 states. [2019-10-03 02:41:39,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8754 states to 8754 states and 13806 transitions. [2019-10-03 02:41:39,762 INFO L78 Accepts]: Start accepts. Automaton has 8754 states and 13806 transitions. Word has length 145 [2019-10-03 02:41:39,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:39,762 INFO L475 AbstractCegarLoop]: Abstraction has 8754 states and 13806 transitions. [2019-10-03 02:41:39,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:41:39,762 INFO L276 IsEmpty]: Start isEmpty. Operand 8754 states and 13806 transitions. [2019-10-03 02:41:39,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-03 02:41:39,767 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:39,768 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 02:41:39,768 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:39,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:39,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1820540613, now seen corresponding path program 1 times [2019-10-03 02:41:39,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:39,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:39,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:39,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:39,773 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:39,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:39,954 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-03 02:41:39,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:39,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 02:41:39,955 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:39,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:41:39,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:41:39,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:41:39,956 INFO L87 Difference]: Start difference. First operand 8754 states and 13806 transitions. Second operand 11 states. [2019-10-03 02:41:48,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:48,194 INFO L93 Difference]: Finished difference Result 11369 states and 17714 transitions. [2019-10-03 02:41:48,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-03 02:41:48,195 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 152 [2019-10-03 02:41:48,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:48,247 INFO L225 Difference]: With dead ends: 11369 [2019-10-03 02:41:48,247 INFO L226 Difference]: Without dead ends: 11345 [2019-10-03 02:41:48,248 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2019-10-03 02:41:48,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11345 states. [2019-10-03 02:41:48,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11345 to 11082. [2019-10-03 02:41:48,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11082 states. [2019-10-03 02:41:48,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11082 states to 11082 states and 17200 transitions. [2019-10-03 02:41:48,686 INFO L78 Accepts]: Start accepts. Automaton has 11082 states and 17200 transitions. Word has length 152 [2019-10-03 02:41:48,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:48,686 INFO L475 AbstractCegarLoop]: Abstraction has 11082 states and 17200 transitions. [2019-10-03 02:41:48,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:41:48,686 INFO L276 IsEmpty]: Start isEmpty. Operand 11082 states and 17200 transitions. [2019-10-03 02:41:48,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-03 02:41:48,691 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:48,691 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 02:41:48,691 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:48,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:48,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1705256668, now seen corresponding path program 1 times [2019-10-03 02:41:48,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:48,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:48,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:48,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:48,698 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:48,824 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-03 02:41:48,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:48,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:41:48,826 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:48,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:41:48,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:41:48,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:41:48,829 INFO L87 Difference]: Start difference. First operand 11082 states and 17200 transitions. Second operand 6 states. [2019-10-03 02:41:49,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:49,128 INFO L93 Difference]: Finished difference Result 16321 states and 25570 transitions. [2019-10-03 02:41:49,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:41:49,128 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 152 [2019-10-03 02:41:49,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:49,210 INFO L225 Difference]: With dead ends: 16321 [2019-10-03 02:41:49,210 INFO L226 Difference]: Without dead ends: 16321 [2019-10-03 02:41:49,216 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:41:49,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16321 states. [2019-10-03 02:41:49,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16321 to 13480. [2019-10-03 02:41:49,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13480 states. [2019-10-03 02:41:49,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13480 states to 13480 states and 21072 transitions. [2019-10-03 02:41:49,597 INFO L78 Accepts]: Start accepts. Automaton has 13480 states and 21072 transitions. Word has length 152 [2019-10-03 02:41:49,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:49,598 INFO L475 AbstractCegarLoop]: Abstraction has 13480 states and 21072 transitions. [2019-10-03 02:41:49,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:41:49,598 INFO L276 IsEmpty]: Start isEmpty. Operand 13480 states and 21072 transitions. [2019-10-03 02:41:49,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-03 02:41:49,602 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:49,603 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 02:41:49,603 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:49,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:49,603 INFO L82 PathProgramCache]: Analyzing trace with hash 578609595, now seen corresponding path program 1 times [2019-10-03 02:41:49,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:49,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:49,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:49,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:49,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:49,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:49,722 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-03 02:41:49,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:49,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:41:49,723 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:49,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:41:49,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:41:49,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:41:49,724 INFO L87 Difference]: Start difference. First operand 13480 states and 21072 transitions. Second operand 4 states. [2019-10-03 02:41:52,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:52,363 INFO L93 Difference]: Finished difference Result 28582 states and 46574 transitions. [2019-10-03 02:41:52,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:41:52,364 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-10-03 02:41:52,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:52,516 INFO L225 Difference]: With dead ends: 28582 [2019-10-03 02:41:52,517 INFO L226 Difference]: Without dead ends: 28582 [2019-10-03 02:41:52,517 INFO L640 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-10-03 02:41:52,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28582 states. [2019-10-03 02:41:53,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28582 to 28210. [2019-10-03 02:41:53,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28210 states. [2019-10-03 02:41:53,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28210 states to 28210 states and 45535 transitions. [2019-10-03 02:41:53,296 INFO L78 Accepts]: Start accepts. Automaton has 28210 states and 45535 transitions. Word has length 150 [2019-10-03 02:41:53,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:53,297 INFO L475 AbstractCegarLoop]: Abstraction has 28210 states and 45535 transitions. [2019-10-03 02:41:53,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:41:53,297 INFO L276 IsEmpty]: Start isEmpty. Operand 28210 states and 45535 transitions. [2019-10-03 02:41:53,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-03 02:41:53,302 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:53,302 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:53,303 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:53,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:53,303 INFO L82 PathProgramCache]: Analyzing trace with hash 755748053, now seen corresponding path program 1 times [2019-10-03 02:41:53,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:53,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:53,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:53,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:53,306 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:53,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:53,413 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-03 02:41:53,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:53,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:41:53,414 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:53,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:41:53,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:41:53,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:41:53,416 INFO L87 Difference]: Start difference. First operand 28210 states and 45535 transitions. Second operand 4 states. [2019-10-03 02:41:55,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:55,912 INFO L93 Difference]: Finished difference Result 60798 states and 106235 transitions. [2019-10-03 02:41:55,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:41:55,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-10-03 02:41:55,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:56,230 INFO L225 Difference]: With dead ends: 60798 [2019-10-03 02:41:56,231 INFO L226 Difference]: Without dead ends: 60798 [2019-10-03 02:41:56,231 INFO L640 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-10-03 02:41:56,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60798 states. [2019-10-03 02:41:58,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60798 to 59951. [2019-10-03 02:41:58,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59951 states. [2019-10-03 02:41:59,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59951 states to 59951 states and 102549 transitions. [2019-10-03 02:41:59,075 INFO L78 Accepts]: Start accepts. Automaton has 59951 states and 102549 transitions. Word has length 151 [2019-10-03 02:41:59,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:59,076 INFO L475 AbstractCegarLoop]: Abstraction has 59951 states and 102549 transitions. [2019-10-03 02:41:59,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:41:59,076 INFO L276 IsEmpty]: Start isEmpty. Operand 59951 states and 102549 transitions. [2019-10-03 02:41:59,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-03 02:41:59,082 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:59,082 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 02:41:59,083 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:59,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:59,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1952076861, now seen corresponding path program 1 times [2019-10-03 02:41:59,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:59,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:59,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:59,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:59,086 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:59,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:59,190 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-03 02:41:59,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:59,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:41:59,191 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:59,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:41:59,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:41:59,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:41:59,192 INFO L87 Difference]: Start difference. First operand 59951 states and 102549 transitions. Second operand 4 states. [2019-10-03 02:42:04,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:42:04,061 INFO L93 Difference]: Finished difference Result 131732 states and 259479 transitions. [2019-10-03 02:42:04,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:42:04,061 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-10-03 02:42:04,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:42:04,759 INFO L225 Difference]: With dead ends: 131732 [2019-10-03 02:42:04,760 INFO L226 Difference]: Without dead ends: 131732 [2019-10-03 02:42:04,760 INFO L640 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-10-03 02:42:04,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131732 states. [2019-10-03 02:42:07,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131732 to 129728. [2019-10-03 02:42:07,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129728 states. [2019-10-03 02:42:08,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129728 states to 129728 states and 245124 transitions. [2019-10-03 02:42:08,550 INFO L78 Accepts]: Start accepts. Automaton has 129728 states and 245124 transitions. Word has length 152 [2019-10-03 02:42:08,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:42:08,551 INFO L475 AbstractCegarLoop]: Abstraction has 129728 states and 245124 transitions. [2019-10-03 02:42:08,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:42:08,551 INFO L276 IsEmpty]: Start isEmpty. Operand 129728 states and 245124 transitions. [2019-10-03 02:42:08,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-03 02:42:08,558 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:42:08,559 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 02:42:08,559 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:42:08,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:42:08,559 INFO L82 PathProgramCache]: Analyzing trace with hash 351647052, now seen corresponding path program 1 times [2019-10-03 02:42:08,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:42:08,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:08,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:42:08,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:08,563 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:42:08,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:42:08,662 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-03 02:42:08,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:42:08,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:42:08,662 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:42:08,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:42:08,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:42:08,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:42:08,663 INFO L87 Difference]: Start difference. First operand 129728 states and 245124 transitions. Second operand 4 states. [2019-10-03 02:42:17,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:42:17,425 INFO L93 Difference]: Finished difference Result 291678 states and 697595 transitions. [2019-10-03 02:42:17,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:42:17,426 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-10-03 02:42:17,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:42:20,143 INFO L225 Difference]: With dead ends: 291678 [2019-10-03 02:42:20,143 INFO L226 Difference]: Without dead ends: 291678 [2019-10-03 02:42:20,143 INFO L640 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-10-03 02:42:20,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291678 states. [2019-10-03 02:42:36,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291678 to 286737. [2019-10-03 02:42:36,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286737 states. [2019-10-03 02:42:47,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286737 states to 286737 states and 637135 transitions. [2019-10-03 02:42:47,573 INFO L78 Accepts]: Start accepts. Automaton has 286737 states and 637135 transitions. Word has length 155 [2019-10-03 02:42:47,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:42:47,573 INFO L475 AbstractCegarLoop]: Abstraction has 286737 states and 637135 transitions. [2019-10-03 02:42:47,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:42:47,573 INFO L276 IsEmpty]: Start isEmpty. Operand 286737 states and 637135 transitions. [2019-10-03 02:42:47,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-03 02:42:47,580 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:42:47,580 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 02:42:47,581 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:42:47,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:42:47,581 INFO L82 PathProgramCache]: Analyzing trace with hash -995557697, now seen corresponding path program 1 times [2019-10-03 02:42:47,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:42:47,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:47,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:42:47,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:47,585 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:42:47,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:42:47,697 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-03 02:42:47,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:42:47,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:42:47,698 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:42:47,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:42:47,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:42:47,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:42:47,699 INFO L87 Difference]: Start difference. First operand 286737 states and 637135 transitions. Second operand 4 states. [2019-10-03 02:43:17,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:43:17,841 INFO L93 Difference]: Finished difference Result 661802 states and 2117690 transitions. [2019-10-03 02:43:17,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:43:17,842 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-10-03 02:43:17,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:43:34,235 INFO L225 Difference]: With dead ends: 661802 [2019-10-03 02:43:34,235 INFO L226 Difference]: Without dead ends: 661790 [2019-10-03 02:43:34,235 INFO L640 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-10-03 02:43:34,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661790 states. [2019-10-03 02:44:39,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661790 to 649106. [2019-10-03 02:44:39,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 649106 states.