java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/product-lines/elevator_spec9_product29.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 12:38:44,736 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 12:38:44,738 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 12:38:44,750 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 12:38:44,750 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 12:38:44,751 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 12:38:44,753 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 12:38:44,755 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 12:38:44,756 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 12:38:44,757 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 12:38:44,758 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 12:38:44,759 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 12:38:44,760 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 12:38:44,761 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 12:38:44,762 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 12:38:44,763 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 12:38:44,764 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 12:38:44,765 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 12:38:44,766 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 12:38:44,768 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 12:38:44,770 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 12:38:44,771 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 12:38:44,772 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 12:38:44,773 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 12:38:44,775 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 12:38:44,776 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 12:38:44,776 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 12:38:44,777 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 12:38:44,777 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 12:38:44,778 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 12:38:44,779 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 12:38:44,779 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 12:38:44,780 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 12:38:44,781 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 12:38:44,782 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 12:38:44,782 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 12:38:44,783 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 12:38:44,783 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 12:38:44,783 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 12:38:44,784 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 12:38:44,785 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 12:38:44,786 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 12:38:44,800 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 12:38:44,801 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 12:38:44,802 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 12:38:44,802 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 12:38:44,802 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 12:38:44,802 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 12:38:44,803 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 12:38:44,803 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 12:38:44,803 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 12:38:44,803 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 12:38:44,803 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 12:38:44,804 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 12:38:44,804 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 12:38:44,804 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 12:38:44,804 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 12:38:44,804 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 12:38:44,805 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 12:38:44,805 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 12:38:44,805 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 12:38:44,805 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 12:38:44,806 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 12:38:44,806 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:38:44,806 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 12:38:44,806 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 12:38:44,806 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 12:38:44,807 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 12:38:44,807 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 12:38:44,807 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 12:38:44,807 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 12:38:44,835 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 12:38:44,848 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 12:38:44,852 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 12:38:44,854 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 12:38:44,854 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 12:38:44,855 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec9_product29.cil.c [2019-10-02 12:38:44,917 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c453e1ed/c7d9f61ac3f24f71a51d5fdf86e29f32/FLAGcf53c5941 [2019-10-02 12:38:45,597 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 12:38:45,600 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec9_product29.cil.c [2019-10-02 12:38:45,632 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c453e1ed/c7d9f61ac3f24f71a51d5fdf86e29f32/FLAGcf53c5941 [2019-10-02 12:38:45,771 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c453e1ed/c7d9f61ac3f24f71a51d5fdf86e29f32 [2019-10-02 12:38:45,780 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 12:38:45,782 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 12:38:45,783 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 12:38:45,783 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 12:38:45,786 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 12:38:45,787 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:38:45" (1/1) ... [2019-10-02 12:38:45,789 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5baf383 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:38:45, skipping insertion in model container [2019-10-02 12:38:45,790 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:38:45" (1/1) ... [2019-10-02 12:38:45,796 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 12:38:45,874 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 12:38:46,636 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:38:46,660 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 12:38:46,794 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:38:46,855 INFO L192 MainTranslator]: Completed translation [2019-10-02 12:38:46,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:38:46 WrapperNode [2019-10-02 12:38:46,855 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 12:38:46,856 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 12:38:46,856 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 12:38:46,857 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 12:38:46,868 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:38:46" (1/1) ... [2019-10-02 12:38:46,869 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:38:46" (1/1) ... [2019-10-02 12:38:46,908 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:38:46" (1/1) ... [2019-10-02 12:38:46,908 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:38:46" (1/1) ... [2019-10-02 12:38:46,984 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:38:46" (1/1) ... [2019-10-02 12:38:47,006 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:38:46" (1/1) ... [2019-10-02 12:38:47,017 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:38:46" (1/1) ... [2019-10-02 12:38:47,034 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 12:38:47,035 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 12:38:47,035 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 12:38:47,035 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 12:38:47,036 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:38:46" (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-02 12:38:47,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 12:38:47,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 12:38:47,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 12:38:47,119 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 12:38:47,119 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 12:38:47,119 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__1 [2019-10-02 12:38:47,120 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__2 [2019-10-02 12:38:47,120 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__3 [2019-10-02 12:38:47,120 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__4 [2019-10-02 12:38:47,120 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-02 12:38:47,120 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-02 12:38:47,121 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-02 12:38:47,121 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-02 12:38:47,121 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-02 12:38:47,121 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-02 12:38:47,122 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-02 12:38:47,122 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-02 12:38:47,122 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-02 12:38:47,122 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-02 12:38:47,122 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-02 12:38:47,123 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-02 12:38:47,123 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-02 12:38:47,124 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-02 12:38:47,124 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-02 12:38:47,124 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-02 12:38:47,124 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-02 12:38:47,124 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-02 12:38:47,124 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-02 12:38:47,125 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-02 12:38:47,125 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-02 12:38:47,125 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-02 12:38:47,125 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 12:38:47,125 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-02 12:38:47,126 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 12:38:47,126 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-02 12:38:47,126 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-02 12:38:47,126 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 12:38:47,126 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 12:38:47,126 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 12:38:47,127 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 12:38:47,127 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 12:38:47,127 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 12:38:47,127 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 12:38:47,127 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 12:38:47,128 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 12:38:47,128 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 12:38:47,128 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-02 12:38:47,128 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-02 12:38:47,128 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-02 12:38:47,129 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-02 12:38:47,129 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-02 12:38:47,129 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-02 12:38:47,129 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-10-02 12:38:47,129 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-02 12:38:47,129 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-02 12:38:47,130 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-02 12:38:47,130 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-02 12:38:47,130 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-02 12:38:47,130 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-02 12:38:47,130 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-02 12:38:47,131 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-02 12:38:47,131 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-02 12:38:47,131 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-02 12:38:47,131 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-10-02 12:38:47,131 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-02 12:38:47,131 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-02 12:38:47,132 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-02 12:38:47,132 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-02 12:38:47,132 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-02 12:38:47,132 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-02 12:38:47,133 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-02 12:38:47,133 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-02 12:38:47,133 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-02 12:38:47,133 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-02 12:38:47,133 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-02 12:38:47,133 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-02 12:38:47,134 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-02 12:38:47,134 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 12:38:47,134 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 12:38:47,134 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-02 12:38:47,135 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-02 12:38:47,135 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 12:38:47,135 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 12:38:47,135 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-02 12:38:47,135 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-02 12:38:47,136 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-02 12:38:47,136 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__1 [2019-10-02 12:38:47,136 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__2 [2019-10-02 12:38:47,136 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__3 [2019-10-02 12:38:47,136 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__4 [2019-10-02 12:38:47,136 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-02 12:38:47,137 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-02 12:38:47,137 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-02 12:38:47,137 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-02 12:38:47,137 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-02 12:38:47,137 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-02 12:38:47,138 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-02 12:38:47,138 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-02 12:38:47,138 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 12:38:47,138 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-02 12:38:47,138 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-02 12:38:47,139 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-02 12:38:47,139 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-02 12:38:47,139 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-02 12:38:47,139 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-02 12:38:47,139 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-02 12:38:47,140 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-02 12:38:47,140 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-02 12:38:47,140 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-02 12:38:47,140 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-02 12:38:47,140 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-02 12:38:47,140 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-02 12:38:47,141 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-02 12:38:47,141 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-02 12:38:47,141 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-02 12:38:47,141 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-02 12:38:47,141 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-02 12:38:47,141 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 12:38:47,141 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-02 12:38:47,142 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 12:38:47,142 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 12:38:47,142 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 12:38:47,142 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 12:38:47,142 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-02 12:38:47,142 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-02 12:38:47,143 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-02 12:38:47,143 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 12:38:47,143 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 12:38:47,143 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 12:38:47,143 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 12:38:47,143 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 12:38:47,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 12:38:47,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 12:38:47,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 12:38:47,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 12:38:47,144 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 12:38:47,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 12:38:47,145 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 12:38:47,145 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 12:38:47,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 12:38:47,145 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 12:38:47,145 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 12:38:47,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 12:38:47,146 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 12:38:47,146 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 12:38:47,146 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-02 12:38:47,146 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-02 12:38:47,146 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-02 12:38:47,146 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-02 12:38:47,147 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-02 12:38:47,147 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-02 12:38:47,147 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-02 12:38:47,147 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-10-02 12:38:47,147 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-02 12:38:47,147 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-02 12:38:47,148 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-02 12:38:47,148 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-02 12:38:47,148 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-02 12:38:47,148 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-10-02 12:38:47,148 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-02 12:38:47,148 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-02 12:38:47,148 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-02 12:38:47,149 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-02 12:38:47,149 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-02 12:38:47,149 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-02 12:38:47,149 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-02 12:38:47,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 12:38:47,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 12:38:47,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 12:38:49,603 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 12:38:49,603 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-02 12:38:49,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:38:49 BoogieIcfgContainer [2019-10-02 12:38:49,605 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 12:38:49,606 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 12:38:49,606 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 12:38:49,610 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 12:38:49,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:38:45" (1/3) ... [2019-10-02 12:38:49,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e77f7ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:38:49, skipping insertion in model container [2019-10-02 12:38:49,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:38:46" (2/3) ... [2019-10-02 12:38:49,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e77f7ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:38:49, skipping insertion in model container [2019-10-02 12:38:49,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:38:49" (3/3) ... [2019-10-02 12:38:49,614 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product29.cil.c [2019-10-02 12:38:49,625 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 12:38:49,642 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 12:38:49,661 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 12:38:49,719 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 12:38:49,720 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 12:38:49,720 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 12:38:49,720 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 12:38:49,720 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 12:38:49,720 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 12:38:49,721 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 12:38:49,721 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 12:38:49,721 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 12:38:49,770 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states. [2019-10-02 12:38:49,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-02 12:38:49,804 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:38:49,805 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] [2019-10-02 12:38:49,807 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:38:49,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:38:49,813 INFO L82 PathProgramCache]: Analyzing trace with hash 998764860, now seen corresponding path program 1 times [2019-10-02 12:38:49,815 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:38:49,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:38:49,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:38:49,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:38:49,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:38:50,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:38:50,430 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:38:50,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:38:50,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:38:50,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:38:50,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:38:50,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:38:50,462 INFO L87 Difference]: Start difference. First operand 780 states. Second operand 4 states. [2019-10-02 12:38:50,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:38:50,712 INFO L93 Difference]: Finished difference Result 1223 states and 1973 transitions. [2019-10-02 12:38:50,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:38:50,714 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2019-10-02 12:38:50,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:38:50,741 INFO L225 Difference]: With dead ends: 1223 [2019-10-02 12:38:50,741 INFO L226 Difference]: Without dead ends: 620 [2019-10-02 12:38:50,760 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-02 12:38:50,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-10-02 12:38:50,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-10-02 12:38:50,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-10-02 12:38:50,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 988 transitions. [2019-10-02 12:38:50,917 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 988 transitions. Word has length 126 [2019-10-02 12:38:50,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:38:50,917 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 988 transitions. [2019-10-02 12:38:50,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:38:50,918 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 988 transitions. [2019-10-02 12:38:50,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-02 12:38:50,930 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:38:50,931 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] [2019-10-02 12:38:50,931 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:38:50,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:38:50,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1436115491, now seen corresponding path program 1 times [2019-10-02 12:38:50,933 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:38:50,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:38:50,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:38:50,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:38:50,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:38:51,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:38:51,220 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:38:51,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:38:51,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:38:51,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:38:51,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:38:51,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:38:51,227 INFO L87 Difference]: Start difference. First operand 620 states and 988 transitions. Second operand 4 states. [2019-10-02 12:38:51,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:38:51,365 INFO L93 Difference]: Finished difference Result 1203 states and 1934 transitions. [2019-10-02 12:38:51,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:38:51,367 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-10-02 12:38:51,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:38:51,381 INFO L225 Difference]: With dead ends: 1203 [2019-10-02 12:38:51,382 INFO L226 Difference]: Without dead ends: 620 [2019-10-02 12:38:51,388 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-02 12:38:51,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-10-02 12:38:51,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-10-02 12:38:51,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-10-02 12:38:51,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 987 transitions. [2019-10-02 12:38:51,437 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 987 transitions. Word has length 129 [2019-10-02 12:38:51,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:38:51,440 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 987 transitions. [2019-10-02 12:38:51,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:38:51,440 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 987 transitions. [2019-10-02 12:38:51,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-02 12:38:51,452 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:38:51,453 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] [2019-10-02 12:38:51,454 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:38:51,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:38:51,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1964351121, now seen corresponding path program 1 times [2019-10-02 12:38:51,462 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:38:51,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:38:51,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:38:51,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:38:51,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:38:51,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:38:51,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:38:51,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:38:51,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:38:51,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:38:51,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:38:51,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:38:51,670 INFO L87 Difference]: Start difference. First operand 620 states and 987 transitions. Second operand 4 states. [2019-10-02 12:38:51,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:38:51,817 INFO L93 Difference]: Finished difference Result 1203 states and 1933 transitions. [2019-10-02 12:38:51,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:38:51,817 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-10-02 12:38:51,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:38:51,824 INFO L225 Difference]: With dead ends: 1203 [2019-10-02 12:38:51,824 INFO L226 Difference]: Without dead ends: 620 [2019-10-02 12:38:51,827 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-02 12:38:51,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-10-02 12:38:51,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-10-02 12:38:51,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-10-02 12:38:51,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 986 transitions. [2019-10-02 12:38:51,862 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 986 transitions. Word has length 130 [2019-10-02 12:38:51,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:38:51,862 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 986 transitions. [2019-10-02 12:38:51,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:38:51,863 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 986 transitions. [2019-10-02 12:38:51,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-02 12:38:51,867 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:38:51,867 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] [2019-10-02 12:38:51,868 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:38:51,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:38:51,868 INFO L82 PathProgramCache]: Analyzing trace with hash 2042355745, now seen corresponding path program 1 times [2019-10-02 12:38:51,868 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:38:51,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:38:51,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:38:51,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:38:51,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:38:51,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:38:52,007 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:38:52,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:38:52,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:38:52,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:38:52,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:38:52,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:38:52,010 INFO L87 Difference]: Start difference. First operand 620 states and 986 transitions. Second operand 4 states. [2019-10-02 12:38:52,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:38:52,079 INFO L93 Difference]: Finished difference Result 1203 states and 1932 transitions. [2019-10-02 12:38:52,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:38:52,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2019-10-02 12:38:52,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:38:52,085 INFO L225 Difference]: With dead ends: 1203 [2019-10-02 12:38:52,085 INFO L226 Difference]: Without dead ends: 620 [2019-10-02 12:38:52,088 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-02 12:38:52,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-10-02 12:38:52,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-10-02 12:38:52,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-10-02 12:38:52,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 985 transitions. [2019-10-02 12:38:52,110 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 985 transitions. Word has length 131 [2019-10-02 12:38:52,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:38:52,111 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 985 transitions. [2019-10-02 12:38:52,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:38:52,111 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 985 transitions. [2019-10-02 12:38:52,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-02 12:38:52,116 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:38:52,116 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] [2019-10-02 12:38:52,117 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:38:52,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:38:52,117 INFO L82 PathProgramCache]: Analyzing trace with hash 603391923, now seen corresponding path program 1 times [2019-10-02 12:38:52,117 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:38:52,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:38:52,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:38:52,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:38:52,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:38:52,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:38:52,240 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:38:52,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:38:52,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:38:52,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:38:52,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:38:52,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:38:52,242 INFO L87 Difference]: Start difference. First operand 620 states and 985 transitions. Second operand 4 states. [2019-10-02 12:38:52,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:38:52,310 INFO L93 Difference]: Finished difference Result 1203 states and 1931 transitions. [2019-10-02 12:38:52,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:38:52,311 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2019-10-02 12:38:52,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:38:52,316 INFO L225 Difference]: With dead ends: 1203 [2019-10-02 12:38:52,316 INFO L226 Difference]: Without dead ends: 620 [2019-10-02 12:38:52,320 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-02 12:38:52,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-10-02 12:38:52,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-10-02 12:38:52,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-10-02 12:38:52,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 984 transitions. [2019-10-02 12:38:52,345 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 984 transitions. Word has length 132 [2019-10-02 12:38:52,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:38:52,346 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 984 transitions. [2019-10-02 12:38:52,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:38:52,346 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 984 transitions. [2019-10-02 12:38:52,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-02 12:38:52,351 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:38:52,351 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] [2019-10-02 12:38:52,352 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:38:52,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:38:52,352 INFO L82 PathProgramCache]: Analyzing trace with hash 2147328613, now seen corresponding path program 1 times [2019-10-02 12:38:52,352 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:38:52,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:38:52,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:38:52,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:38:52,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:38:52,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:38:52,556 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:38:52,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:38:52,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 12:38:52,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 12:38:52,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 12:38:52,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:38:52,558 INFO L87 Difference]: Start difference. First operand 620 states and 984 transitions. Second operand 10 states. [2019-10-02 12:38:52,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:38:52,776 INFO L93 Difference]: Finished difference Result 1161 states and 1851 transitions. [2019-10-02 12:38:52,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:38:52,776 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 133 [2019-10-02 12:38:52,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:38:52,782 INFO L225 Difference]: With dead ends: 1161 [2019-10-02 12:38:52,784 INFO L226 Difference]: Without dead ends: 629 [2019-10-02 12:38:52,788 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-02 12:38:52,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-10-02 12:38:52,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 627. [2019-10-02 12:38:52,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-10-02 12:38:52,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 993 transitions. [2019-10-02 12:38:52,837 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 993 transitions. Word has length 133 [2019-10-02 12:38:52,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:38:52,837 INFO L475 AbstractCegarLoop]: Abstraction has 627 states and 993 transitions. [2019-10-02 12:38:52,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 12:38:52,838 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 993 transitions. [2019-10-02 12:38:52,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-02 12:38:52,843 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:38:52,843 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] [2019-10-02 12:38:52,843 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:38:52,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:38:52,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1347103130, now seen corresponding path program 1 times [2019-10-02 12:38:52,844 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:38:52,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:38:52,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:38:52,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:38:52,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:38:52,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:38:52,955 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:38:52,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:38:52,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:38:52,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:38:52,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:38:52,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:38:52,956 INFO L87 Difference]: Start difference. First operand 627 states and 993 transitions. Second operand 4 states. [2019-10-02 12:38:53,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:38:53,008 INFO L93 Difference]: Finished difference Result 1209 states and 1937 transitions. [2019-10-02 12:38:53,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:38:53,008 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-10-02 12:38:53,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:38:53,013 INFO L225 Difference]: With dead ends: 1209 [2019-10-02 12:38:53,014 INFO L226 Difference]: Without dead ends: 614 [2019-10-02 12:38:53,017 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-02 12:38:53,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-10-02 12:38:53,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2019-10-02 12:38:53,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-10-02 12:38:53,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 970 transitions. [2019-10-02 12:38:53,037 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 970 transitions. Word has length 133 [2019-10-02 12:38:53,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:38:53,038 INFO L475 AbstractCegarLoop]: Abstraction has 614 states and 970 transitions. [2019-10-02 12:38:53,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:38:53,038 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 970 transitions. [2019-10-02 12:38:53,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-02 12:38:53,042 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:38:53,043 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] [2019-10-02 12:38:53,043 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:38:53,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:38:53,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1290451205, now seen corresponding path program 1 times [2019-10-02 12:38:53,043 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:38:53,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:38:53,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:38:53,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:38:53,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:38:53,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:38:53,178 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:38:53,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:38:53,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:38:53,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:38:53,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:38:53,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:38:53,181 INFO L87 Difference]: Start difference. First operand 614 states and 970 transitions. Second operand 6 states. [2019-10-02 12:38:53,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:38:53,446 INFO L93 Difference]: Finished difference Result 1149 states and 1829 transitions. [2019-10-02 12:38:53,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:38:53,447 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 134 [2019-10-02 12:38:53,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:38:53,454 INFO L225 Difference]: With dead ends: 1149 [2019-10-02 12:38:53,454 INFO L226 Difference]: Without dead ends: 614 [2019-10-02 12:38:53,457 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-02 12:38:53,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-10-02 12:38:53,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2019-10-02 12:38:53,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-10-02 12:38:53,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 966 transitions. [2019-10-02 12:38:53,494 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 966 transitions. Word has length 134 [2019-10-02 12:38:53,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:38:53,497 INFO L475 AbstractCegarLoop]: Abstraction has 614 states and 966 transitions. [2019-10-02 12:38:53,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:38:53,497 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 966 transitions. [2019-10-02 12:38:53,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-02 12:38:53,502 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:38:53,502 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] [2019-10-02 12:38:53,502 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:38:53,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:38:53,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1379251042, now seen corresponding path program 1 times [2019-10-02 12:38:53,503 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:38:53,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:38:53,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:38:53,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:38:53,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:38:53,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:38:53,742 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:38:53,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:38:53,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:38:53,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:38:53,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:38:53,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:38:53,744 INFO L87 Difference]: Start difference. First operand 614 states and 966 transitions. Second operand 6 states. [2019-10-02 12:38:53,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:38:53,967 INFO L93 Difference]: Finished difference Result 1149 states and 1825 transitions. [2019-10-02 12:38:53,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:38:53,967 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 135 [2019-10-02 12:38:53,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:38:53,972 INFO L225 Difference]: With dead ends: 1149 [2019-10-02 12:38:53,972 INFO L226 Difference]: Without dead ends: 614 [2019-10-02 12:38:53,976 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-02 12:38:53,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-10-02 12:38:53,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2019-10-02 12:38:53,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-10-02 12:38:53,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 962 transitions. [2019-10-02 12:38:53,996 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 962 transitions. Word has length 135 [2019-10-02 12:38:53,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:38:53,996 INFO L475 AbstractCegarLoop]: Abstraction has 614 states and 962 transitions. [2019-10-02 12:38:53,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:38:53,996 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 962 transitions. [2019-10-02 12:38:54,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-02 12:38:54,001 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:38:54,001 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] [2019-10-02 12:38:54,001 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:38:54,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:38:54,002 INFO L82 PathProgramCache]: Analyzing trace with hash 234769472, now seen corresponding path program 1 times [2019-10-02 12:38:54,002 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:38:54,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:38:54,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:38:54,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:38:54,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:38:54,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:38:54,132 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:38:54,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:38:54,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:38:54,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:38:54,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:38:54,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:38:54,134 INFO L87 Difference]: Start difference. First operand 614 states and 962 transitions. Second operand 6 states. [2019-10-02 12:38:54,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:38:54,344 INFO L93 Difference]: Finished difference Result 1149 states and 1821 transitions. [2019-10-02 12:38:54,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:38:54,344 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 136 [2019-10-02 12:38:54,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:38:54,350 INFO L225 Difference]: With dead ends: 1149 [2019-10-02 12:38:54,350 INFO L226 Difference]: Without dead ends: 614 [2019-10-02 12:38:54,353 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-02 12:38:54,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-10-02 12:38:54,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2019-10-02 12:38:54,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-10-02 12:38:54,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 958 transitions. [2019-10-02 12:38:54,374 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 958 transitions. Word has length 136 [2019-10-02 12:38:54,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:38:54,374 INFO L475 AbstractCegarLoop]: Abstraction has 614 states and 958 transitions. [2019-10-02 12:38:54,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:38:54,374 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 958 transitions. [2019-10-02 12:38:54,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-02 12:38:54,379 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:38:54,379 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] [2019-10-02 12:38:54,380 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:38:54,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:38:54,380 INFO L82 PathProgramCache]: Analyzing trace with hash -185638976, now seen corresponding path program 1 times [2019-10-02 12:38:54,380 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:38:54,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:38:54,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:38:54,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:38:54,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:38:54,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:38:54,514 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:38:54,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:38:54,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:38:54,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:38:54,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:38:54,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:38:54,516 INFO L87 Difference]: Start difference. First operand 614 states and 958 transitions. Second operand 7 states. [2019-10-02 12:38:54,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:38:54,598 INFO L93 Difference]: Finished difference Result 1149 states and 1817 transitions. [2019-10-02 12:38:54,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:38:54,598 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 136 [2019-10-02 12:38:54,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:38:54,604 INFO L225 Difference]: With dead ends: 1149 [2019-10-02 12:38:54,604 INFO L226 Difference]: Without dead ends: 593 [2019-10-02 12:38:54,608 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-02 12:38:54,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2019-10-02 12:38:54,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 593. [2019-10-02 12:38:54,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2019-10-02 12:38:54,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 924 transitions. [2019-10-02 12:38:54,635 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 924 transitions. Word has length 136 [2019-10-02 12:38:54,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:38:54,636 INFO L475 AbstractCegarLoop]: Abstraction has 593 states and 924 transitions. [2019-10-02 12:38:54,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:38:54,636 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 924 transitions. [2019-10-02 12:38:54,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-02 12:38:54,641 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:38:54,641 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] [2019-10-02 12:38:54,641 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:38:54,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:38:54,641 INFO L82 PathProgramCache]: Analyzing trace with hash -486730051, now seen corresponding path program 1 times [2019-10-02 12:38:54,642 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:38:54,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:38:54,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:38:54,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:38:54,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:38:54,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:38:54,804 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:38:54,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:38:54,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:38:54,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:38:54,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:38:54,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:38:54,806 INFO L87 Difference]: Start difference. First operand 593 states and 924 transitions. Second operand 6 states. [2019-10-02 12:38:54,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:38:54,929 INFO L93 Difference]: Finished difference Result 1128 states and 1783 transitions. [2019-10-02 12:38:54,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:38:54,930 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 137 [2019-10-02 12:38:54,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:38:54,934 INFO L225 Difference]: With dead ends: 1128 [2019-10-02 12:38:54,935 INFO L226 Difference]: Without dead ends: 593 [2019-10-02 12:38:54,938 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-02 12:38:54,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2019-10-02 12:38:54,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 593. [2019-10-02 12:38:54,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2019-10-02 12:38:54,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 923 transitions. [2019-10-02 12:38:54,959 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 923 transitions. Word has length 137 [2019-10-02 12:38:54,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:38:54,960 INFO L475 AbstractCegarLoop]: Abstraction has 593 states and 923 transitions. [2019-10-02 12:38:54,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:38:54,961 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 923 transitions. [2019-10-02 12:38:54,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-02 12:38:54,965 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:38:54,966 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] [2019-10-02 12:38:54,966 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:38:54,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:38:54,966 INFO L82 PathProgramCache]: Analyzing trace with hash -980688005, now seen corresponding path program 1 times [2019-10-02 12:38:54,966 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:38:54,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:38:54,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:38:54,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:38:54,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:38:55,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:38:55,103 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:38:55,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:38:55,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:38:55,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:38:55,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:38:55,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:38:55,105 INFO L87 Difference]: Start difference. First operand 593 states and 923 transitions. Second operand 6 states. [2019-10-02 12:38:55,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:38:55,202 INFO L93 Difference]: Finished difference Result 1128 states and 1782 transitions. [2019-10-02 12:38:55,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:38:55,203 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 138 [2019-10-02 12:38:55,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:38:55,208 INFO L225 Difference]: With dead ends: 1128 [2019-10-02 12:38:55,208 INFO L226 Difference]: Without dead ends: 593 [2019-10-02 12:38:55,211 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-02 12:38:55,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2019-10-02 12:38:55,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 593. [2019-10-02 12:38:55,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2019-10-02 12:38:55,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 922 transitions. [2019-10-02 12:38:55,231 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 922 transitions. Word has length 138 [2019-10-02 12:38:55,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:38:55,232 INFO L475 AbstractCegarLoop]: Abstraction has 593 states and 922 transitions. [2019-10-02 12:38:55,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:38:55,232 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 922 transitions. [2019-10-02 12:38:55,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-02 12:38:55,237 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:38:55,237 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] [2019-10-02 12:38:55,237 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:38:55,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:38:55,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1284175384, now seen corresponding path program 1 times [2019-10-02 12:38:55,238 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:38:55,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:38:55,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:38:55,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:38:55,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:38:55,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:38:55,496 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:38:55,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:38:55,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 12:38:55,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:38:55,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:38:55,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:38:55,498 INFO L87 Difference]: Start difference. First operand 593 states and 922 transitions. Second operand 12 states. [2019-10-02 12:38:55,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:38:55,756 INFO L93 Difference]: Finished difference Result 1129 states and 1781 transitions. [2019-10-02 12:38:55,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:38:55,756 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 139 [2019-10-02 12:38:55,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:38:55,762 INFO L225 Difference]: With dead ends: 1129 [2019-10-02 12:38:55,762 INFO L226 Difference]: Without dead ends: 593 [2019-10-02 12:38:55,766 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-02 12:38:55,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2019-10-02 12:38:55,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 593. [2019-10-02 12:38:55,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2019-10-02 12:38:55,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 921 transitions. [2019-10-02 12:38:55,795 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 921 transitions. Word has length 139 [2019-10-02 12:38:55,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:38:55,796 INFO L475 AbstractCegarLoop]: Abstraction has 593 states and 921 transitions. [2019-10-02 12:38:55,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:38:55,796 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 921 transitions. [2019-10-02 12:38:55,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-02 12:38:55,804 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:38:55,804 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] [2019-10-02 12:38:55,804 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:38:55,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:38:55,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1594513904, now seen corresponding path program 1 times [2019-10-02 12:38:55,805 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:38:55,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:38:55,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:38:55,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:38:55,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:38:55,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:38:56,041 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:38:56,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:38:56,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:38:56,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:38:56,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:38:56,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:38:56,043 INFO L87 Difference]: Start difference. First operand 593 states and 921 transitions. Second operand 6 states. [2019-10-02 12:39:00,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:00,472 INFO L93 Difference]: Finished difference Result 1777 states and 2884 transitions. [2019-10-02 12:39:00,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:39:00,472 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2019-10-02 12:39:00,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:00,486 INFO L225 Difference]: With dead ends: 1777 [2019-10-02 12:39:00,486 INFO L226 Difference]: Without dead ends: 1250 [2019-10-02 12:39:00,491 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:39:00,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2019-10-02 12:39:00,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1167. [2019-10-02 12:39:00,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1167 states. [2019-10-02 12:39:00,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 1860 transitions. [2019-10-02 12:39:00,562 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 1860 transitions. Word has length 140 [2019-10-02 12:39:00,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:00,563 INFO L475 AbstractCegarLoop]: Abstraction has 1167 states and 1860 transitions. [2019-10-02 12:39:00,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:39:00,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1860 transitions. [2019-10-02 12:39:00,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-02 12:39:00,568 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:00,568 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] [2019-10-02 12:39:00,569 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:00,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:00,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1854401282, now seen corresponding path program 1 times [2019-10-02 12:39:00,569 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:00,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:00,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:00,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:00,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:00,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:00,734 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:39:00,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:00,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:39:00,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:39:00,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:39:00,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:39:00,736 INFO L87 Difference]: Start difference. First operand 1167 states and 1860 transitions. Second operand 6 states. [2019-10-02 12:39:05,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:05,251 INFO L93 Difference]: Finished difference Result 3724 states and 6160 transitions. [2019-10-02 12:39:05,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:39:05,252 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-10-02 12:39:05,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:05,281 INFO L225 Difference]: With dead ends: 3724 [2019-10-02 12:39:05,281 INFO L226 Difference]: Without dead ends: 2624 [2019-10-02 12:39:05,294 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:39:05,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2624 states. [2019-10-02 12:39:05,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2624 to 2428. [2019-10-02 12:39:05,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2428 states. [2019-10-02 12:39:05,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2428 states to 2428 states and 3951 transitions. [2019-10-02 12:39:05,524 INFO L78 Accepts]: Start accepts. Automaton has 2428 states and 3951 transitions. Word has length 141 [2019-10-02 12:39:05,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:05,525 INFO L475 AbstractCegarLoop]: Abstraction has 2428 states and 3951 transitions. [2019-10-02 12:39:05,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:39:05,525 INFO L276 IsEmpty]: Start isEmpty. Operand 2428 states and 3951 transitions. [2019-10-02 12:39:05,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-02 12:39:05,532 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:05,533 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] [2019-10-02 12:39:05,533 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:05,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:05,534 INFO L82 PathProgramCache]: Analyzing trace with hash -2086190540, now seen corresponding path program 1 times [2019-10-02 12:39:05,534 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:05,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:05,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:05,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:05,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:05,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:05,773 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:39:05,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:05,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:39:05,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:39:05,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:39:05,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:39:05,776 INFO L87 Difference]: Start difference. First operand 2428 states and 3951 transitions. Second operand 6 states. [2019-10-02 12:39:10,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:10,140 INFO L93 Difference]: Finished difference Result 8163 states and 13810 transitions. [2019-10-02 12:39:10,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:39:10,141 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-10-02 12:39:10,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:10,184 INFO L225 Difference]: With dead ends: 8163 [2019-10-02 12:39:10,184 INFO L226 Difference]: Without dead ends: 5804 [2019-10-02 12:39:10,203 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:39:10,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5804 states. [2019-10-02 12:39:10,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5804 to 5283. [2019-10-02 12:39:10,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5283 states. [2019-10-02 12:39:10,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5283 states to 5283 states and 8798 transitions. [2019-10-02 12:39:10,590 INFO L78 Accepts]: Start accepts. Automaton has 5283 states and 8798 transitions. Word has length 142 [2019-10-02 12:39:10,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:10,592 INFO L475 AbstractCegarLoop]: Abstraction has 5283 states and 8798 transitions. [2019-10-02 12:39:10,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:39:10,593 INFO L276 IsEmpty]: Start isEmpty. Operand 5283 states and 8798 transitions. [2019-10-02 12:39:10,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-02 12:39:10,598 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:10,598 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] [2019-10-02 12:39:10,599 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:10,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:10,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1197315910, now seen corresponding path program 1 times [2019-10-02 12:39:10,599 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:10,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:10,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:10,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:10,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:10,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:10,769 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:39:10,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:10,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:39:10,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:39:10,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:39:10,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:39:10,771 INFO L87 Difference]: Start difference. First operand 5283 states and 8798 transitions. Second operand 6 states. [2019-10-02 12:39:15,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:15,330 INFO L93 Difference]: Finished difference Result 18708 states and 32638 transitions. [2019-10-02 12:39:15,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:39:15,330 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-10-02 12:39:15,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:15,436 INFO L225 Difference]: With dead ends: 18708 [2019-10-02 12:39:15,436 INFO L226 Difference]: Without dead ends: 13498 [2019-10-02 12:39:15,474 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:39:15,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13498 states. [2019-10-02 12:39:16,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13498 to 12022. [2019-10-02 12:39:16,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12022 states. [2019-10-02 12:39:16,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12022 states to 12022 states and 20671 transitions. [2019-10-02 12:39:16,436 INFO L78 Accepts]: Start accepts. Automaton has 12022 states and 20671 transitions. Word has length 143 [2019-10-02 12:39:16,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:16,437 INFO L475 AbstractCegarLoop]: Abstraction has 12022 states and 20671 transitions. [2019-10-02 12:39:16,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:39:16,437 INFO L276 IsEmpty]: Start isEmpty. Operand 12022 states and 20671 transitions. [2019-10-02 12:39:16,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-02 12:39:16,442 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:16,442 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] [2019-10-02 12:39:16,442 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:16,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:16,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1130931207, now seen corresponding path program 1 times [2019-10-02 12:39:16,443 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:16,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:16,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:16,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:16,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:16,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:16,629 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:39:16,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:16,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:39:16,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:39:16,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:39:16,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:39:16,631 INFO L87 Difference]: Start difference. First operand 12022 states and 20671 transitions. Second operand 9 states. [2019-10-02 12:39:23,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:23,950 INFO L93 Difference]: Finished difference Result 38849 states and 66933 transitions. [2019-10-02 12:39:23,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 12:39:23,950 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 144 [2019-10-02 12:39:23,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:24,187 INFO L225 Difference]: With dead ends: 38849 [2019-10-02 12:39:24,188 INFO L226 Difference]: Without dead ends: 26908 [2019-10-02 12:39:24,292 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2019-10-02 12:39:24,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26908 states. [2019-10-02 12:39:26,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26908 to 26489. [2019-10-02 12:39:26,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26489 states. [2019-10-02 12:39:26,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26489 states to 26489 states and 45285 transitions. [2019-10-02 12:39:26,293 INFO L78 Accepts]: Start accepts. Automaton has 26489 states and 45285 transitions. Word has length 144 [2019-10-02 12:39:26,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:26,294 INFO L475 AbstractCegarLoop]: Abstraction has 26489 states and 45285 transitions. [2019-10-02 12:39:26,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:39:26,295 INFO L276 IsEmpty]: Start isEmpty. Operand 26489 states and 45285 transitions. [2019-10-02 12:39:26,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-02 12:39:26,302 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:26,302 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, 1, 1, 1, 1, 1] [2019-10-02 12:39:26,303 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:26,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:26,303 INFO L82 PathProgramCache]: Analyzing trace with hash -906991434, now seen corresponding path program 1 times [2019-10-02 12:39:26,303 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:26,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:26,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:26,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:26,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:26,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:26,438 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:39:26,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:26,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:39:26,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:39:26,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:39:26,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:39:26,440 INFO L87 Difference]: Start difference. First operand 26489 states and 45285 transitions. Second operand 7 states. [2019-10-02 12:39:28,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:28,738 INFO L93 Difference]: Finished difference Result 53585 states and 91575 transitions. [2019-10-02 12:39:28,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:39:28,738 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 150 [2019-10-02 12:39:28,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:28,902 INFO L225 Difference]: With dead ends: 53585 [2019-10-02 12:39:28,902 INFO L226 Difference]: Without dead ends: 27177 [2019-10-02 12:39:29,006 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:39:29,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27177 states. [2019-10-02 12:39:30,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27177 to 26825. [2019-10-02 12:39:30,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26825 states. [2019-10-02 12:39:31,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26825 states to 26825 states and 45765 transitions. [2019-10-02 12:39:31,387 INFO L78 Accepts]: Start accepts. Automaton has 26825 states and 45765 transitions. Word has length 150 [2019-10-02 12:39:31,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:31,388 INFO L475 AbstractCegarLoop]: Abstraction has 26825 states and 45765 transitions. [2019-10-02 12:39:31,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:39:31,388 INFO L276 IsEmpty]: Start isEmpty. Operand 26825 states and 45765 transitions. [2019-10-02 12:39:31,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-02 12:39:31,394 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:31,394 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, 1, 1, 1, 1, 1] [2019-10-02 12:39:31,394 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:31,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:31,395 INFO L82 PathProgramCache]: Analyzing trace with hash -2139747080, now seen corresponding path program 1 times [2019-10-02 12:39:31,395 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:31,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:31,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:31,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:31,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:31,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:31,517 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:39:31,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:31,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:39:31,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:39:31,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:39:31,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:39:31,520 INFO L87 Difference]: Start difference. First operand 26825 states and 45765 transitions. Second operand 5 states. [2019-10-02 12:39:32,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:32,464 INFO L93 Difference]: Finished difference Result 53752 states and 91687 transitions. [2019-10-02 12:39:32,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:39:32,465 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-02 12:39:32,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:32,653 INFO L225 Difference]: With dead ends: 53752 [2019-10-02 12:39:32,654 INFO L226 Difference]: Without dead ends: 27008 [2019-10-02 12:39:32,789 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-02 12:39:32,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27008 states. [2019-10-02 12:39:34,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27008 to 26840. [2019-10-02 12:39:34,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26840 states. [2019-10-02 12:39:34,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26840 states to 26840 states and 45783 transitions. [2019-10-02 12:39:34,463 INFO L78 Accepts]: Start accepts. Automaton has 26840 states and 45783 transitions. Word has length 150 [2019-10-02 12:39:34,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:34,463 INFO L475 AbstractCegarLoop]: Abstraction has 26840 states and 45783 transitions. [2019-10-02 12:39:34,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:39:34,463 INFO L276 IsEmpty]: Start isEmpty. Operand 26840 states and 45783 transitions. [2019-10-02 12:39:34,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-02 12:39:34,469 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:34,469 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, 1, 1, 1, 1] [2019-10-02 12:39:34,469 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:34,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:34,470 INFO L82 PathProgramCache]: Analyzing trace with hash -535561698, now seen corresponding path program 1 times [2019-10-02 12:39:34,470 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:34,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:34,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:34,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:34,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:34,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:34,593 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:39:34,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:34,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:39:34,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:39:34,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:39:34,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:39:34,595 INFO L87 Difference]: Start difference. First operand 26840 states and 45783 transitions. Second operand 7 states. [2019-10-02 12:39:36,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:36,112 INFO L93 Difference]: Finished difference Result 54191 states and 92379 transitions. [2019-10-02 12:39:36,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:39:36,112 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 149 [2019-10-02 12:39:36,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:36,305 INFO L225 Difference]: With dead ends: 54191 [2019-10-02 12:39:36,305 INFO L226 Difference]: Without dead ends: 27432 [2019-10-02 12:39:36,414 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:39:36,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27432 states. [2019-10-02 12:39:37,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27432 to 26888. [2019-10-02 12:39:37,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26888 states. [2019-10-02 12:39:38,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26888 states to 26888 states and 45831 transitions. [2019-10-02 12:39:38,058 INFO L78 Accepts]: Start accepts. Automaton has 26888 states and 45831 transitions. Word has length 149 [2019-10-02 12:39:38,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:38,059 INFO L475 AbstractCegarLoop]: Abstraction has 26888 states and 45831 transitions. [2019-10-02 12:39:38,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:39:38,059 INFO L276 IsEmpty]: Start isEmpty. Operand 26888 states and 45831 transitions. [2019-10-02 12:39:38,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-02 12:39:38,065 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:38,066 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, 1, 1, 1, 1, 1] [2019-10-02 12:39:38,066 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:38,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:38,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1874870327, now seen corresponding path program 1 times [2019-10-02 12:39:38,067 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:38,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:38,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:38,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:38,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:38,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:38,194 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:39:38,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:38,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:39:38,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:39:38,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:39:38,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:39:38,196 INFO L87 Difference]: Start difference. First operand 26888 states and 45831 transitions. Second operand 6 states. [2019-10-02 12:39:45,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:45,887 INFO L93 Difference]: Finished difference Result 98808 states and 178391 transitions. [2019-10-02 12:39:45,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:39:45,888 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 150 [2019-10-02 12:39:45,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:46,313 INFO L225 Difference]: With dead ends: 98808 [2019-10-02 12:39:46,313 INFO L226 Difference]: Without dead ends: 72001 [2019-10-02 12:39:46,424 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:39:46,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72001 states. [2019-10-02 12:39:49,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72001 to 63334. [2019-10-02 12:39:49,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63334 states. [2019-10-02 12:39:49,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63334 states to 63334 states and 112630 transitions. [2019-10-02 12:39:49,842 INFO L78 Accepts]: Start accepts. Automaton has 63334 states and 112630 transitions. Word has length 150 [2019-10-02 12:39:49,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:49,843 INFO L475 AbstractCegarLoop]: Abstraction has 63334 states and 112630 transitions. [2019-10-02 12:39:49,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:39:49,843 INFO L276 IsEmpty]: Start isEmpty. Operand 63334 states and 112630 transitions. [2019-10-02 12:39:49,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-02 12:39:49,848 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:49,848 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:39:49,848 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:49,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:49,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1841660252, now seen corresponding path program 1 times [2019-10-02 12:39:49,849 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:49,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:49,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:49,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:49,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:49,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:50,056 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:39:50,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:50,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:39:50,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:39:50,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:39:50,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:39:50,059 INFO L87 Difference]: Start difference. First operand 63334 states and 112630 transitions. Second operand 8 states. [2019-10-02 12:40:04,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:40:04,556 INFO L93 Difference]: Finished difference Result 213831 states and 385073 transitions. [2019-10-02 12:40:04,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:40:04,557 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 158 [2019-10-02 12:40:04,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:40:05,470 INFO L225 Difference]: With dead ends: 213831 [2019-10-02 12:40:05,470 INFO L226 Difference]: Without dead ends: 150594 [2019-10-02 12:40:05,711 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:40:05,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150594 states. [2019-10-02 12:40:15,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150594 to 150464. [2019-10-02 12:40:15,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150464 states. [2019-10-02 12:40:17,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150464 states to 150464 states and 269251 transitions. [2019-10-02 12:40:17,101 INFO L78 Accepts]: Start accepts. Automaton has 150464 states and 269251 transitions. Word has length 158 [2019-10-02 12:40:17,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:40:17,102 INFO L475 AbstractCegarLoop]: Abstraction has 150464 states and 269251 transitions. [2019-10-02 12:40:17,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:40:17,102 INFO L276 IsEmpty]: Start isEmpty. Operand 150464 states and 269251 transitions. [2019-10-02 12:40:17,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-02 12:40:17,106 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:40:17,106 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:40:17,106 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:40:17,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:40:17,107 INFO L82 PathProgramCache]: Analyzing trace with hash -937157415, now seen corresponding path program 1 times [2019-10-02 12:40:17,107 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:40:17,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:40:17,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:40:17,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:40:17,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:40:17,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:40:17,247 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:40:17,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:40:17,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:40:17,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:40:17,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:40:17,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:40:17,249 INFO L87 Difference]: Start difference. First operand 150464 states and 269251 transitions. Second operand 7 states. [2019-10-02 12:40:29,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:40:29,918 INFO L93 Difference]: Finished difference Result 301662 states and 545471 transitions. [2019-10-02 12:40:29,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:40:29,919 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 160 [2019-10-02 12:40:29,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:40:30,815 INFO L225 Difference]: With dead ends: 301662 [2019-10-02 12:40:30,815 INFO L226 Difference]: Without dead ends: 151232 [2019-10-02 12:40:31,296 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-02 12:40:31,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151232 states. [2019-10-02 12:40:44,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151232 to 151232. [2019-10-02 12:40:44,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151232 states. [2019-10-02 12:40:47,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151232 states to 151232 states and 269955 transitions. [2019-10-02 12:40:47,436 INFO L78 Accepts]: Start accepts. Automaton has 151232 states and 269955 transitions. Word has length 160 [2019-10-02 12:40:47,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:40:47,437 INFO L475 AbstractCegarLoop]: Abstraction has 151232 states and 269955 transitions. [2019-10-02 12:40:47,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:40:47,437 INFO L276 IsEmpty]: Start isEmpty. Operand 151232 states and 269955 transitions. [2019-10-02 12:40:47,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-02 12:40:47,444 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:40:47,444 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:40:47,444 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:40:47,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:40:47,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1389543235, now seen corresponding path program 1 times [2019-10-02 12:40:47,445 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:40:47,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:40:47,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:40:47,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:40:47,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:40:47,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:40:47,611 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:40:47,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:40:47,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:40:47,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:40:47,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:40:47,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:40:47,612 INFO L87 Difference]: Start difference. First operand 151232 states and 269955 transitions. Second operand 7 states. [2019-10-02 12:41:03,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:41:03,943 INFO L93 Difference]: Finished difference Result 280740 states and 502064 transitions. [2019-10-02 12:41:03,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 12:41:03,944 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 161 [2019-10-02 12:41:03,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:41:05,043 INFO L225 Difference]: With dead ends: 280740 [2019-10-02 12:41:05,044 INFO L226 Difference]: Without dead ends: 156499 [2019-10-02 12:41:06,170 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:41:06,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156499 states. [2019-10-02 12:41:16,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156499 to 154944. [2019-10-02 12:41:16,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154944 states. [2019-10-02 12:41:17,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154944 states to 154944 states and 274978 transitions. [2019-10-02 12:41:17,718 INFO L78 Accepts]: Start accepts. Automaton has 154944 states and 274978 transitions. Word has length 161 [2019-10-02 12:41:17,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:41:17,719 INFO L475 AbstractCegarLoop]: Abstraction has 154944 states and 274978 transitions. [2019-10-02 12:41:17,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:41:17,719 INFO L276 IsEmpty]: Start isEmpty. Operand 154944 states and 274978 transitions. [2019-10-02 12:41:17,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-02 12:41:17,726 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:41:17,726 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:41:17,727 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:41:17,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:41:17,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1433367631, now seen corresponding path program 1 times [2019-10-02 12:41:17,727 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:41:17,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:41:17,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:17,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:41:17,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:17,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:41:17,865 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-02 12:41:17,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:41:17,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:41:17,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:41:17,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:41:17,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:41:17,867 INFO L87 Difference]: Start difference. First operand 154944 states and 274978 transitions. Second operand 6 states. [2019-10-02 12:41:36,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:41:36,643 INFO L93 Difference]: Finished difference Result 323355 states and 572938 transitions. [2019-10-02 12:41:36,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:41:36,644 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 166 [2019-10-02 12:41:36,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:41:38,091 INFO L225 Difference]: With dead ends: 323355 [2019-10-02 12:41:38,091 INFO L226 Difference]: Without dead ends: 195402 [2019-10-02 12:41:38,570 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-02 12:41:38,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195402 states. [2019-10-02 12:41:48,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195402 to 187204. [2019-10-02 12:41:48,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187204 states. [2019-10-02 12:41:51,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187204 states to 187204 states and 332082 transitions. [2019-10-02 12:41:51,595 INFO L78 Accepts]: Start accepts. Automaton has 187204 states and 332082 transitions. Word has length 166 [2019-10-02 12:41:51,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:41:51,596 INFO L475 AbstractCegarLoop]: Abstraction has 187204 states and 332082 transitions. [2019-10-02 12:41:51,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:41:51,596 INFO L276 IsEmpty]: Start isEmpty. Operand 187204 states and 332082 transitions. [2019-10-02 12:41:51,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-02 12:41:51,601 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:41:51,602 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:41:51,602 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:41:51,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:41:51,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1360981073, now seen corresponding path program 1 times [2019-10-02 12:41:51,602 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:41:51,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:41:51,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:51,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:41:51,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:51,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:41:51,798 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-02 12:41:51,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:41:51,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 12:41:51,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 12:41:51,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 12:41:51,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:41:51,800 INFO L87 Difference]: Start difference. First operand 187204 states and 332082 transitions. Second operand 10 states. [2019-10-02 12:42:44,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:42:44,195 INFO L93 Difference]: Finished difference Result 677558 states and 1326324 transitions. [2019-10-02 12:42:44,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:42:44,195 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 166 [2019-10-02 12:42:44,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:42:48,538 INFO L225 Difference]: With dead ends: 677558 [2019-10-02 12:42:48,538 INFO L226 Difference]: Without dead ends: 490420 [2019-10-02 12:42:49,620 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:42:49,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490420 states. [2019-10-02 12:43:36,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490420 to 488289. [2019-10-02 12:43:36,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488289 states. [2019-10-02 12:43:57,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488289 states to 488289 states and 919975 transitions. [2019-10-02 12:43:57,713 INFO L78 Accepts]: Start accepts. Automaton has 488289 states and 919975 transitions. Word has length 166 [2019-10-02 12:43:57,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:43:57,713 INFO L475 AbstractCegarLoop]: Abstraction has 488289 states and 919975 transitions. [2019-10-02 12:43:57,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 12:43:57,713 INFO L276 IsEmpty]: Start isEmpty. Operand 488289 states and 919975 transitions. [2019-10-02 12:43:57,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-02 12:43:57,722 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:43:57,723 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:43:57,723 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:43:57,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:43:57,723 INFO L82 PathProgramCache]: Analyzing trace with hash 93934821, now seen corresponding path program 1 times [2019-10-02 12:43:57,723 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:43:57,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:43:57,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:43:57,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:43:57,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:43:57,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:43:57,898 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-02 12:43:57,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:43:57,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 12:43:57,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 12:43:57,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 12:43:57,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:43:57,900 INFO L87 Difference]: Start difference. First operand 488289 states and 919975 transitions. Second operand 10 states.