java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/product-lines/elevator_spec2_product27.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 04:07:05,629 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 04:07:05,631 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 04:07:05,643 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 04:07:05,644 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 04:07:05,645 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 04:07:05,646 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 04:07:05,648 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 04:07:05,650 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 04:07:05,651 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 04:07:05,652 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 04:07:05,653 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 04:07:05,653 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 04:07:05,654 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 04:07:05,655 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 04:07:05,656 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 04:07:05,657 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 04:07:05,658 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 04:07:05,659 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 04:07:05,661 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 04:07:05,662 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 04:07:05,663 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 04:07:05,664 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 04:07:05,665 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 04:07:05,667 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 04:07:05,667 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 04:07:05,668 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 04:07:05,668 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 04:07:05,669 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 04:07:05,670 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 04:07:05,670 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 04:07:05,671 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 04:07:05,671 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 04:07:05,672 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 04:07:05,673 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 04:07:05,673 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 04:07:05,674 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 04:07:05,674 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 04:07:05,674 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 04:07:05,675 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 04:07:05,676 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 04:07:05,677 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 04:07:05,691 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 04:07:05,691 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 04:07:05,692 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 04:07:05,692 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 04:07:05,692 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 04:07:05,693 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 04:07:05,693 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 04:07:05,693 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 04:07:05,693 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 04:07:05,693 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 04:07:05,694 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 04:07:05,694 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 04:07:05,694 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 04:07:05,694 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 04:07:05,694 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 04:07:05,695 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 04:07:05,695 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 04:07:05,695 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 04:07:05,695 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 04:07:05,696 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 04:07:05,696 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 04:07:05,696 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 04:07:05,696 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 04:07:05,696 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 04:07:05,697 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 04:07:05,697 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 04:07:05,697 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 04:07:05,697 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 04:07:05,697 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 04:07:05,725 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 04:07:05,738 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 04:07:05,741 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 04:07:05,743 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 04:07:05,743 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 04:07:05,744 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product27.cil.c [2019-09-08 04:07:05,820 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/245b4468c/d4fad70a320e498c8d45cf3acc5ab447/FLAG4198e5ebf [2019-09-08 04:07:06,430 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 04:07:06,431 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product27.cil.c [2019-09-08 04:07:06,458 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/245b4468c/d4fad70a320e498c8d45cf3acc5ab447/FLAG4198e5ebf [2019-09-08 04:07:06,617 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/245b4468c/d4fad70a320e498c8d45cf3acc5ab447 [2019-09-08 04:07:06,630 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 04:07:06,632 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 04:07:06,635 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 04:07:06,635 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 04:07:06,639 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 04:07:06,640 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:07:06" (1/1) ... [2019-09-08 04:07:06,643 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@335c662c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:07:06, skipping insertion in model container [2019-09-08 04:07:06,643 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:07:06" (1/1) ... [2019-09-08 04:07:06,651 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 04:07:06,730 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 04:07:07,387 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:07:07,417 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 04:07:07,671 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:07:07,752 INFO L192 MainTranslator]: Completed translation [2019-09-08 04:07:07,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:07:07 WrapperNode [2019-09-08 04:07:07,753 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 04:07:07,754 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 04:07:07,754 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 04:07:07,755 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 04:07:07,765 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:07:07" (1/1) ... [2019-09-08 04:07:07,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:07:07" (1/1) ... [2019-09-08 04:07:07,795 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:07:07" (1/1) ... [2019-09-08 04:07:07,796 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:07:07" (1/1) ... [2019-09-08 04:07:07,855 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:07:07" (1/1) ... [2019-09-08 04:07:07,887 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:07:07" (1/1) ... [2019-09-08 04:07:07,900 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:07:07" (1/1) ... [2019-09-08 04:07:07,938 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 04:07:07,938 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 04:07:07,939 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 04:07:07,939 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 04:07:07,942 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:07:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 04:07:08,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 04:07:08,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 04:07:08,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 04:07:08,015 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 04:07:08,016 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 04:07:08,017 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 04:07:08,017 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 04:07:08,017 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 04:07:08,017 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 04:07:08,018 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-09-08 04:07:08,018 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-09-08 04:07:08,018 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-09-08 04:07:08,019 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-09-08 04:07:08,019 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 04:07:08,020 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-09-08 04:07:08,020 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-09-08 04:07:08,022 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 04:07:08,022 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-09-08 04:07:08,022 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-09-08 04:07:08,023 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-09-08 04:07:08,023 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-09-08 04:07:08,024 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-09-08 04:07:08,024 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-09-08 04:07:08,024 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-09-08 04:07:08,024 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-09-08 04:07:08,024 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-09-08 04:07:08,025 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-09-08 04:07:08,025 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-09-08 04:07:08,025 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-09-08 04:07:08,025 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-09-08 04:07:08,025 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-09-08 04:07:08,026 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-09-08 04:07:08,026 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-09-08 04:07:08,026 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-09-08 04:07:08,027 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-09-08 04:07:08,027 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-09-08 04:07:08,027 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-09-08 04:07:08,027 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-09-08 04:07:08,027 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-09-08 04:07:08,027 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-09-08 04:07:08,028 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-09-08 04:07:08,028 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-09-08 04:07:08,028 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-09-08 04:07:08,029 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-09-08 04:07:08,029 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-09-08 04:07:08,029 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-09-08 04:07:08,029 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-09-08 04:07:08,029 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-09-08 04:07:08,029 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-09-08 04:07:08,030 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-09-08 04:07:08,030 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-09-08 04:07:08,030 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-09-08 04:07:08,030 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-09-08 04:07:08,030 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-09-08 04:07:08,030 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-09-08 04:07:08,031 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-09-08 04:07:08,031 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-09-08 04:07:08,031 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-09-08 04:07:08,031 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-09-08 04:07:08,031 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-09-08 04:07:08,031 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-09-08 04:07:08,032 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 04:07:08,032 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-09-08 04:07:08,032 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 04:07:08,032 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-09-08 04:07:08,033 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-09-08 04:07:08,033 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-09-08 04:07:08,033 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-09-08 04:07:08,033 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-09-08 04:07:08,034 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-09-08 04:07:08,034 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-09-08 04:07:08,034 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-09-08 04:07:08,034 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-09-08 04:07:08,034 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-09-08 04:07:08,035 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-09-08 04:07:08,035 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 04:07:08,036 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 04:07:08,036 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 04:07:08,036 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 04:07:08,036 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 04:07:08,036 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 04:07:08,036 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 04:07:08,037 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 04:07:08,037 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 04:07:08,038 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 04:07:08,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 04:07:08,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 04:07:08,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 04:07:08,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 04:07:08,039 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 04:07:08,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 04:07:08,040 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 04:07:08,040 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 04:07:08,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 04:07:08,041 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 04:07:08,041 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 04:07:08,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 04:07:08,041 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 04:07:08,041 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 04:07:08,041 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-09-08 04:07:08,042 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-09-08 04:07:08,042 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-09-08 04:07:08,042 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-09-08 04:07:08,042 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-09-08 04:07:08,042 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-09-08 04:07:08,042 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-09-08 04:07:08,042 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-09-08 04:07:08,043 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 04:07:08,043 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-09-08 04:07:08,043 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-09-08 04:07:08,043 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-09-08 04:07:08,043 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-09-08 04:07:08,043 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-09-08 04:07:08,043 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-09-08 04:07:08,043 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-09-08 04:07:08,044 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-09-08 04:07:08,044 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-09-08 04:07:08,044 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 04:07:08,044 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-09-08 04:07:08,044 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-09-08 04:07:08,045 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-09-08 04:07:08,045 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-09-08 04:07:08,045 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-09-08 04:07:08,045 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-09-08 04:07:08,046 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-09-08 04:07:08,046 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-09-08 04:07:08,046 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-09-08 04:07:08,047 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-09-08 04:07:08,047 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-09-08 04:07:08,047 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-09-08 04:07:08,047 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-09-08 04:07:08,047 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-09-08 04:07:08,048 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-09-08 04:07:08,048 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-09-08 04:07:08,048 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-09-08 04:07:08,048 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-09-08 04:07:08,049 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-09-08 04:07:08,049 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-09-08 04:07:08,049 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-09-08 04:07:08,050 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-09-08 04:07:08,055 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-09-08 04:07:08,056 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-09-08 04:07:08,056 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-09-08 04:07:08,057 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-09-08 04:07:08,062 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-09-08 04:07:08,062 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-09-08 04:07:08,062 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-09-08 04:07:08,062 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-09-08 04:07:08,062 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-09-08 04:07:08,063 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-08 04:07:08,063 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-09-08 04:07:08,063 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-09-08 04:07:08,063 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-09-08 04:07:08,063 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-09-08 04:07:08,063 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-09-08 04:07:08,063 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-09-08 04:07:08,063 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-09-08 04:07:08,064 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-09-08 04:07:08,064 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-09-08 04:07:08,064 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-09-08 04:07:08,064 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-09-08 04:07:08,065 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-09-08 04:07:08,065 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 04:07:08,065 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-09-08 04:07:08,065 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 04:07:08,065 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 04:07:08,066 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 04:07:08,066 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 04:07:08,066 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-09-08 04:07:08,066 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 04:07:08,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 04:07:08,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 04:07:08,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 04:07:10,484 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 04:07:10,485 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-09-08 04:07:10,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:07:10 BoogieIcfgContainer [2019-09-08 04:07:10,487 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 04:07:10,488 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 04:07:10,488 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 04:07:10,492 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 04:07:10,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 04:07:06" (1/3) ... [2019-09-08 04:07:10,493 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62a2e407 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:07:10, skipping insertion in model container [2019-09-08 04:07:10,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:07:07" (2/3) ... [2019-09-08 04:07:10,493 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62a2e407 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:07:10, skipping insertion in model container [2019-09-08 04:07:10,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:07:10" (3/3) ... [2019-09-08 04:07:10,495 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product27.cil.c [2019-09-08 04:07:10,506 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 04:07:10,516 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 04:07:10,534 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 04:07:10,581 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 04:07:10,581 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 04:07:10,582 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 04:07:10,582 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 04:07:10,582 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 04:07:10,582 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 04:07:10,582 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 04:07:10,582 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 04:07:10,582 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 04:07:10,624 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states. [2019-09-08 04:07:10,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-08 04:07:10,657 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:07:10,658 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:07:10,661 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:07:10,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:07:10,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1054134663, now seen corresponding path program 1 times [2019-09-08 04:07:10,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:07:10,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:07:10,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:10,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:07:10,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:10,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:07:11,209 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 04:07:11,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:07:11,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:07:11,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:07:11,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:07:11,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:07:11,231 INFO L87 Difference]: Start difference. First operand 786 states. Second operand 4 states. [2019-09-08 04:07:11,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:07:11,416 INFO L93 Difference]: Finished difference Result 1235 states and 1989 transitions. [2019-09-08 04:07:11,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:07:11,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-09-08 04:07:11,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:07:11,487 INFO L225 Difference]: With dead ends: 1235 [2019-09-08 04:07:11,487 INFO L226 Difference]: Without dead ends: 626 [2019-09-08 04:07:11,497 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:07:11,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-09-08 04:07:11,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-09-08 04:07:11,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-09-08 04:07:11,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 996 transitions. [2019-09-08 04:07:11,628 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 996 transitions. Word has length 133 [2019-09-08 04:07:11,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:07:11,629 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 996 transitions. [2019-09-08 04:07:11,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:07:11,629 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 996 transitions. [2019-09-08 04:07:11,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 04:07:11,645 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:07:11,645 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:07:11,646 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:07:11,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:07:11,647 INFO L82 PathProgramCache]: Analyzing trace with hash 545110777, now seen corresponding path program 1 times [2019-09-08 04:07:11,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:07:11,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:07:11,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:11,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:07:11,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:11,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:07:11,876 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 04:07:11,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:07:11,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:07:11,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:07:11,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:07:11,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:07:11,879 INFO L87 Difference]: Start difference. First operand 626 states and 996 transitions. Second operand 4 states. [2019-09-08 04:07:11,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:07:11,950 INFO L93 Difference]: Finished difference Result 1215 states and 1950 transitions. [2019-09-08 04:07:11,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:07:11,951 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-09-08 04:07:11,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:07:11,956 INFO L225 Difference]: With dead ends: 1215 [2019-09-08 04:07:11,956 INFO L226 Difference]: Without dead ends: 626 [2019-09-08 04:07:11,959 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:07:11,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-09-08 04:07:11,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-09-08 04:07:11,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-09-08 04:07:11,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 995 transitions. [2019-09-08 04:07:11,992 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 995 transitions. Word has length 136 [2019-09-08 04:07:11,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:07:11,997 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 995 transitions. [2019-09-08 04:07:11,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:07:11,997 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 995 transitions. [2019-09-08 04:07:12,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 04:07:12,003 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:07:12,003 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:07:12,003 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:07:12,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:07:12,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1596840266, now seen corresponding path program 1 times [2019-09-08 04:07:12,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:07:12,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:07:12,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:12,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:07:12,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:12,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:07:12,189 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 04:07:12,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:07:12,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:07:12,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:07:12,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:07:12,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:07:12,191 INFO L87 Difference]: Start difference. First operand 626 states and 995 transitions. Second operand 4 states. [2019-09-08 04:07:12,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:07:12,256 INFO L93 Difference]: Finished difference Result 1215 states and 1949 transitions. [2019-09-08 04:07:12,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:07:12,257 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-09-08 04:07:12,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:07:12,263 INFO L225 Difference]: With dead ends: 1215 [2019-09-08 04:07:12,263 INFO L226 Difference]: Without dead ends: 626 [2019-09-08 04:07:12,266 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:07:12,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-09-08 04:07:12,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-09-08 04:07:12,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-09-08 04:07:12,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 994 transitions. [2019-09-08 04:07:12,305 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 994 transitions. Word has length 137 [2019-09-08 04:07:12,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:07:12,306 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 994 transitions. [2019-09-08 04:07:12,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:07:12,306 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 994 transitions. [2019-09-08 04:07:12,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 04:07:12,311 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:07:12,311 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:07:12,312 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:07:12,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:07:12,312 INFO L82 PathProgramCache]: Analyzing trace with hash -794225131, now seen corresponding path program 1 times [2019-09-08 04:07:12,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:07:12,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:07:12,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:12,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:07:12,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:12,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:07:12,483 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 04:07:12,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:07:12,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:07:12,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:07:12,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:07:12,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:07:12,485 INFO L87 Difference]: Start difference. First operand 626 states and 994 transitions. Second operand 4 states. [2019-09-08 04:07:12,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:07:12,544 INFO L93 Difference]: Finished difference Result 1215 states and 1948 transitions. [2019-09-08 04:07:12,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:07:12,545 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-09-08 04:07:12,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:07:12,550 INFO L225 Difference]: With dead ends: 1215 [2019-09-08 04:07:12,550 INFO L226 Difference]: Without dead ends: 626 [2019-09-08 04:07:12,553 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:07:12,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-09-08 04:07:12,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-09-08 04:07:12,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-09-08 04:07:12,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 993 transitions. [2019-09-08 04:07:12,574 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 993 transitions. Word has length 138 [2019-09-08 04:07:12,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:07:12,574 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 993 transitions. [2019-09-08 04:07:12,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:07:12,574 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 993 transitions. [2019-09-08 04:07:12,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-08 04:07:12,578 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:07:12,578 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:07:12,579 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:07:12,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:07:12,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1095628306, now seen corresponding path program 1 times [2019-09-08 04:07:12,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:07:12,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:07:12,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:12,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:07:12,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:12,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:07:12,683 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 04:07:12,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:07:12,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:07:12,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:07:12,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:07:12,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:07:12,685 INFO L87 Difference]: Start difference. First operand 626 states and 993 transitions. Second operand 4 states. [2019-09-08 04:07:12,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:07:12,753 INFO L93 Difference]: Finished difference Result 1215 states and 1947 transitions. [2019-09-08 04:07:12,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:07:12,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-09-08 04:07:12,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:07:12,765 INFO L225 Difference]: With dead ends: 1215 [2019-09-08 04:07:12,765 INFO L226 Difference]: Without dead ends: 626 [2019-09-08 04:07:12,770 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:07:12,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-09-08 04:07:12,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-09-08 04:07:12,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-09-08 04:07:12,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 992 transitions. [2019-09-08 04:07:12,793 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 992 transitions. Word has length 139 [2019-09-08 04:07:12,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:07:12,794 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 992 transitions. [2019-09-08 04:07:12,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:07:12,794 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 992 transitions. [2019-09-08 04:07:12,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-08 04:07:12,800 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:07:12,800 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:07:12,800 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:07:12,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:07:12,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1964836559, now seen corresponding path program 1 times [2019-09-08 04:07:12,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:07:12,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:07:12,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:12,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:07:12,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:12,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:07:12,969 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 04:07:12,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:07:12,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 04:07:12,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 04:07:12,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 04:07:12,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 04:07:12,971 INFO L87 Difference]: Start difference. First operand 626 states and 992 transitions. Second operand 10 states. [2019-09-08 04:07:13,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:07:13,144 INFO L93 Difference]: Finished difference Result 1173 states and 1867 transitions. [2019-09-08 04:07:13,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:07:13,148 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2019-09-08 04:07:13,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:07:13,156 INFO L225 Difference]: With dead ends: 1173 [2019-09-08 04:07:13,156 INFO L226 Difference]: Without dead ends: 635 [2019-09-08 04:07:13,162 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-08 04:07:13,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2019-09-08 04:07:13,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 633. [2019-09-08 04:07:13,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2019-09-08 04:07:13,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 1001 transitions. [2019-09-08 04:07:13,199 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 1001 transitions. Word has length 140 [2019-09-08 04:07:13,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:07:13,200 INFO L475 AbstractCegarLoop]: Abstraction has 633 states and 1001 transitions. [2019-09-08 04:07:13,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 04:07:13,201 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 1001 transitions. [2019-09-08 04:07:13,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-08 04:07:13,206 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:07:13,206 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:07:13,207 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:07:13,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:07:13,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1270189552, now seen corresponding path program 1 times [2019-09-08 04:07:13,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:07:13,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:07:13,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:13,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:07:13,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:13,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:07:13,370 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 04:07:13,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:07:13,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:07:13,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:07:13,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:07:13,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:07:13,372 INFO L87 Difference]: Start difference. First operand 633 states and 1001 transitions. Second operand 4 states. [2019-09-08 04:07:13,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:07:13,427 INFO L93 Difference]: Finished difference Result 1221 states and 1953 transitions. [2019-09-08 04:07:13,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:07:13,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-09-08 04:07:13,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:07:13,433 INFO L225 Difference]: With dead ends: 1221 [2019-09-08 04:07:13,433 INFO L226 Difference]: Without dead ends: 620 [2019-09-08 04:07:13,436 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:07:13,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-09-08 04:07:13,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-09-08 04:07:13,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-09-08 04:07:13,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 978 transitions. [2019-09-08 04:07:13,457 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 978 transitions. Word has length 140 [2019-09-08 04:07:13,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:07:13,457 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 978 transitions. [2019-09-08 04:07:13,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:07:13,457 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 978 transitions. [2019-09-08 04:07:13,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-08 04:07:13,461 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:07:13,461 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:07:13,462 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:07:13,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:07:13,462 INFO L82 PathProgramCache]: Analyzing trace with hash -730531008, now seen corresponding path program 1 times [2019-09-08 04:07:13,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:07:13,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:07:13,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:13,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:07:13,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:13,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:07:13,608 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 04:07:13,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:07:13,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:07:13,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:07:13,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:07:13,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:07:13,610 INFO L87 Difference]: Start difference. First operand 620 states and 978 transitions. Second operand 6 states. [2019-09-08 04:07:13,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:07:13,831 INFO L93 Difference]: Finished difference Result 1161 states and 1845 transitions. [2019-09-08 04:07:13,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:07:13,832 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-09-08 04:07:13,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:07:13,836 INFO L225 Difference]: With dead ends: 1161 [2019-09-08 04:07:13,836 INFO L226 Difference]: Without dead ends: 620 [2019-09-08 04:07:13,839 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:07:13,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-09-08 04:07:13,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-09-08 04:07:13,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-09-08 04:07:13,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 974 transitions. [2019-09-08 04:07:13,869 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 974 transitions. Word has length 141 [2019-09-08 04:07:13,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:07:13,871 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 974 transitions. [2019-09-08 04:07:13,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:07:13,871 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 974 transitions. [2019-09-08 04:07:13,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-08 04:07:13,876 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:07:13,876 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:07:13,876 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:07:13,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:07:13,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1761880204, now seen corresponding path program 1 times [2019-09-08 04:07:13,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:07:13,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:07:13,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:13,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:07:13,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:13,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:07:14,023 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 04:07:14,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:07:14,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:07:14,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:07:14,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:07:14,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:07:14,025 INFO L87 Difference]: Start difference. First operand 620 states and 974 transitions. Second operand 6 states. [2019-09-08 04:07:14,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:07:14,222 INFO L93 Difference]: Finished difference Result 1161 states and 1841 transitions. [2019-09-08 04:07:14,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:07:14,223 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-09-08 04:07:14,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:07:14,228 INFO L225 Difference]: With dead ends: 1161 [2019-09-08 04:07:14,231 INFO L226 Difference]: Without dead ends: 620 [2019-09-08 04:07:14,235 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:07:14,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-09-08 04:07:14,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-09-08 04:07:14,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-09-08 04:07:14,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 970 transitions. [2019-09-08 04:07:14,266 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 970 transitions. Word has length 142 [2019-09-08 04:07:14,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:07:14,266 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 970 transitions. [2019-09-08 04:07:14,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:07:14,266 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 970 transitions. [2019-09-08 04:07:14,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-08 04:07:14,271 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:07:14,271 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:07:14,271 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:07:14,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:07:14,272 INFO L82 PathProgramCache]: Analyzing trace with hash 333743557, now seen corresponding path program 1 times [2019-09-08 04:07:14,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:07:14,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:07:14,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:14,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:07:14,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:14,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:07:14,446 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 04:07:14,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:07:14,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:07:14,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:07:14,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:07:14,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:07:14,447 INFO L87 Difference]: Start difference. First operand 620 states and 970 transitions. Second operand 6 states. [2019-09-08 04:07:14,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:07:14,643 INFO L93 Difference]: Finished difference Result 1161 states and 1837 transitions. [2019-09-08 04:07:14,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:07:14,644 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-09-08 04:07:14,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:07:14,649 INFO L225 Difference]: With dead ends: 1161 [2019-09-08 04:07:14,649 INFO L226 Difference]: Without dead ends: 620 [2019-09-08 04:07:14,652 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:07:14,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-09-08 04:07:14,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-09-08 04:07:14,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-09-08 04:07:14,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 966 transitions. [2019-09-08 04:07:14,676 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 966 transitions. Word has length 143 [2019-09-08 04:07:14,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:07:14,677 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 966 transitions. [2019-09-08 04:07:14,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:07:14,677 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 966 transitions. [2019-09-08 04:07:14,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-08 04:07:14,682 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:07:14,682 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:07:14,683 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:07:14,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:07:14,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1388216901, now seen corresponding path program 1 times [2019-09-08 04:07:14,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:07:14,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:07:14,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:14,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:07:14,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:14,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:07:14,808 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 04:07:14,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:07:14,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:07:14,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:07:14,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:07:14,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:07:14,810 INFO L87 Difference]: Start difference. First operand 620 states and 966 transitions. Second operand 7 states. [2019-09-08 04:07:14,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:07:14,892 INFO L93 Difference]: Finished difference Result 1161 states and 1833 transitions. [2019-09-08 04:07:14,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:07:14,893 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-09-08 04:07:14,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:07:14,897 INFO L225 Difference]: With dead ends: 1161 [2019-09-08 04:07:14,897 INFO L226 Difference]: Without dead ends: 599 [2019-09-08 04:07:14,901 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:07:14,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-09-08 04:07:14,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2019-09-08 04:07:14,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-09-08 04:07:14,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 932 transitions. [2019-09-08 04:07:14,925 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 932 transitions. Word has length 143 [2019-09-08 04:07:14,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:07:14,926 INFO L475 AbstractCegarLoop]: Abstraction has 599 states and 932 transitions. [2019-09-08 04:07:14,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:07:14,926 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 932 transitions. [2019-09-08 04:07:14,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 04:07:14,932 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:07:14,933 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:07:14,933 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:07:14,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:07:14,933 INFO L82 PathProgramCache]: Analyzing trace with hash 581281177, now seen corresponding path program 1 times [2019-09-08 04:07:14,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:07:14,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:07:14,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:14,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:07:14,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:14,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:07:15,058 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 04:07:15,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:07:15,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:07:15,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:07:15,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:07:15,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:07:15,061 INFO L87 Difference]: Start difference. First operand 599 states and 932 transitions. Second operand 6 states. [2019-09-08 04:07:15,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:07:15,148 INFO L93 Difference]: Finished difference Result 1140 states and 1799 transitions. [2019-09-08 04:07:15,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:07:15,148 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-09-08 04:07:15,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:07:15,153 INFO L225 Difference]: With dead ends: 1140 [2019-09-08 04:07:15,153 INFO L226 Difference]: Without dead ends: 599 [2019-09-08 04:07:15,155 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:07:15,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-09-08 04:07:15,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2019-09-08 04:07:15,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-09-08 04:07:15,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 931 transitions. [2019-09-08 04:07:15,174 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 931 transitions. Word has length 144 [2019-09-08 04:07:15,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:07:15,176 INFO L475 AbstractCegarLoop]: Abstraction has 599 states and 931 transitions. [2019-09-08 04:07:15,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:07:15,176 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 931 transitions. [2019-09-08 04:07:15,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-08 04:07:15,181 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:07:15,182 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:07:15,182 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:07:15,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:07:15,182 INFO L82 PathProgramCache]: Analyzing trace with hash -627276726, now seen corresponding path program 1 times [2019-09-08 04:07:15,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:07:15,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:07:15,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:15,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:07:15,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:15,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:07:15,306 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 04:07:15,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:07:15,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:07:15,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:07:15,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:07:15,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:07:15,308 INFO L87 Difference]: Start difference. First operand 599 states and 931 transitions. Second operand 6 states. [2019-09-08 04:07:15,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:07:15,453 INFO L93 Difference]: Finished difference Result 1140 states and 1798 transitions. [2019-09-08 04:07:15,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:07:15,454 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-09-08 04:07:15,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:07:15,461 INFO L225 Difference]: With dead ends: 1140 [2019-09-08 04:07:15,461 INFO L226 Difference]: Without dead ends: 599 [2019-09-08 04:07:15,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:07:15,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-09-08 04:07:15,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2019-09-08 04:07:15,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-09-08 04:07:15,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 930 transitions. [2019-09-08 04:07:15,502 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 930 transitions. Word has length 145 [2019-09-08 04:07:15,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:07:15,505 INFO L475 AbstractCegarLoop]: Abstraction has 599 states and 930 transitions. [2019-09-08 04:07:15,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:07:15,505 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 930 transitions. [2019-09-08 04:07:15,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 04:07:15,511 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:07:15,512 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:07:15,512 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:07:15,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:07:15,513 INFO L82 PathProgramCache]: Analyzing trace with hash 269844414, now seen corresponding path program 1 times [2019-09-08 04:07:15,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:07:15,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:07:15,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:15,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:07:15,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:15,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:07:15,777 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 04:07:15,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:07:15,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 04:07:15,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 04:07:15,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 04:07:15,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:07:15,780 INFO L87 Difference]: Start difference. First operand 599 states and 930 transitions. Second operand 12 states. [2019-09-08 04:07:16,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:07:16,026 INFO L93 Difference]: Finished difference Result 1141 states and 1797 transitions. [2019-09-08 04:07:16,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 04:07:16,026 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 146 [2019-09-08 04:07:16,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:07:16,031 INFO L225 Difference]: With dead ends: 1141 [2019-09-08 04:07:16,031 INFO L226 Difference]: Without dead ends: 599 [2019-09-08 04:07:16,034 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-08 04:07:16,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-09-08 04:07:16,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2019-09-08 04:07:16,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-09-08 04:07:16,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 929 transitions. [2019-09-08 04:07:16,059 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 929 transitions. Word has length 146 [2019-09-08 04:07:16,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:07:16,060 INFO L475 AbstractCegarLoop]: Abstraction has 599 states and 929 transitions. [2019-09-08 04:07:16,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 04:07:16,060 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 929 transitions. [2019-09-08 04:07:16,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-08 04:07:16,064 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:07:16,064 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:07:16,065 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:07:16,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:07:16,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1889822343, now seen corresponding path program 1 times [2019-09-08 04:07:16,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:07:16,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:07:16,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:16,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:07:16,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:16,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:07:16,203 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 04:07:16,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:07:16,204 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:07:16,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:07:16,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:07:16,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 2771 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 04:07:16,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:07:16,781 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream closed [2019-09-08 04:07:16,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:07:16,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-08 04:07:16,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:07:16,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:07:16,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:07:16,800 INFO L87 Difference]: Start difference. First operand 599 states and 929 transitions. Second operand 9 states. [2019-09-08 04:07:17,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:07:17,979 INFO L93 Difference]: Finished difference Result 1136 states and 1817 transitions. [2019-09-08 04:07:17,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:07:17,979 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 147 [2019-09-08 04:07:17,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:07:17,984 INFO L225 Difference]: With dead ends: 1136 [2019-09-08 04:07:17,984 INFO L226 Difference]: Without dead ends: 603 [2019-09-08 04:07:17,989 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 145 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:07:17,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-09-08 04:07:18,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 603. [2019-09-08 04:07:18,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-09-08 04:07:18,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 933 transitions. [2019-09-08 04:07:18,024 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 933 transitions. Word has length 147 [2019-09-08 04:07:18,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:07:18,024 INFO L475 AbstractCegarLoop]: Abstraction has 603 states and 933 transitions. [2019-09-08 04:07:18,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:07:18,024 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 933 transitions. [2019-09-08 04:07:18,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-08 04:07:18,028 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:07:18,028 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:07:18,028 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:07:18,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:07:18,029 INFO L82 PathProgramCache]: Analyzing trace with hash 2076963317, now seen corresponding path program 1 times [2019-09-08 04:07:18,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:07:18,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:07:18,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:18,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:07:18,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:18,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:07:18,163 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 04:07:18,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:07:18,164 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 04:07:18,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:07:18,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:07:18,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 2773 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 04:07:18,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:07:18,642 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 04:07:18,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:07:18,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-08 04:07:18,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:07:18,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:07:18,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:07:18,650 INFO L87 Difference]: Start difference. First operand 603 states and 933 transitions. Second operand 9 states. [2019-09-08 04:07:19,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:07:19,987 INFO L93 Difference]: Finished difference Result 1145 states and 1824 transitions. [2019-09-08 04:07:19,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 04:07:19,988 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 149 [2019-09-08 04:07:19,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:07:19,993 INFO L225 Difference]: With dead ends: 1145 [2019-09-08 04:07:19,993 INFO L226 Difference]: Without dead ends: 608 [2019-09-08 04:07:19,997 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 148 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-09-08 04:07:19,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-09-08 04:07:20,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2019-09-08 04:07:20,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2019-09-08 04:07:20,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 938 transitions. [2019-09-08 04:07:20,018 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 938 transitions. Word has length 149 [2019-09-08 04:07:20,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:07:20,018 INFO L475 AbstractCegarLoop]: Abstraction has 608 states and 938 transitions. [2019-09-08 04:07:20,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:07:20,019 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 938 transitions. [2019-09-08 04:07:20,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-08 04:07:20,022 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:07:20,023 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:07:20,023 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:07:20,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:07:20,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1312607033, now seen corresponding path program 1 times [2019-09-08 04:07:20,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:07:20,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:07:20,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:20,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:07:20,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:20,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:07:20,139 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 04:07:20,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:07:20,140 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 04:07:20,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:07:20,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:07:20,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 2775 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 04:07:20,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:07:20,614 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 04:07:20,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:07:20,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-08 04:07:20,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:07:20,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:07:20,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:07:20,623 INFO L87 Difference]: Start difference. First operand 608 states and 938 transitions. Second operand 9 states. [2019-09-08 04:07:21,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:07:21,866 INFO L93 Difference]: Finished difference Result 1156 states and 1833 transitions. [2019-09-08 04:07:21,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 04:07:21,868 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 151 [2019-09-08 04:07:21,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:07:21,875 INFO L225 Difference]: With dead ends: 1156 [2019-09-08 04:07:21,875 INFO L226 Difference]: Without dead ends: 614 [2019-09-08 04:07:21,878 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 150 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-09-08 04:07:21,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-09-08 04:07:21,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2019-09-08 04:07:21,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-09-08 04:07:21,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 944 transitions. [2019-09-08 04:07:21,899 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 944 transitions. Word has length 151 [2019-09-08 04:07:21,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:07:21,899 INFO L475 AbstractCegarLoop]: Abstraction has 614 states and 944 transitions. [2019-09-08 04:07:21,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:07:21,900 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 944 transitions. [2019-09-08 04:07:21,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-08 04:07:21,904 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:07:21,905 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:07:21,905 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:07:21,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:07:21,906 INFO L82 PathProgramCache]: Analyzing trace with hash -941872595, now seen corresponding path program 1 times [2019-09-08 04:07:21,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:07:21,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:07:21,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:21,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:07:21,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:21,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:07:22,025 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 04:07:22,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:07:22,026 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 04:07:22,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:07:22,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:07:22,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 2777 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 04:07:22,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:07:22,486 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 04:07:22,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:07:22,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-08 04:07:22,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:07:22,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:07:22,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:07:22,505 INFO L87 Difference]: Start difference. First operand 614 states and 944 transitions. Second operand 9 states. [2019-09-08 04:07:23,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:07:23,699 INFO L93 Difference]: Finished difference Result 1169 states and 1844 transitions. [2019-09-08 04:07:23,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 04:07:23,699 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 153 [2019-09-08 04:07:23,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:07:23,704 INFO L225 Difference]: With dead ends: 1169 [2019-09-08 04:07:23,704 INFO L226 Difference]: Without dead ends: 621 [2019-09-08 04:07:23,707 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 152 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-09-08 04:07:23,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2019-09-08 04:07:23,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 621. [2019-09-08 04:07:23,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2019-09-08 04:07:23,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 951 transitions. [2019-09-08 04:07:23,731 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 951 transitions. Word has length 153 [2019-09-08 04:07:23,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:07:23,732 INFO L475 AbstractCegarLoop]: Abstraction has 621 states and 951 transitions. [2019-09-08 04:07:23,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:07:23,732 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 951 transitions. [2019-09-08 04:07:23,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-08 04:07:23,736 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:07:23,737 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:07:23,737 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:07:23,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:07:23,738 INFO L82 PathProgramCache]: Analyzing trace with hash 807721721, now seen corresponding path program 1 times [2019-09-08 04:07:23,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:07:23,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:07:23,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:23,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:07:23,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:23,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:07:23,979 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-08 04:07:23,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:07:23,979 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 04:07:23,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:07:24,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:07:24,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 2779 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 04:07:24,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:07:24,456 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 04:07:24,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:07:24,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-09-08 04:07:24,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 04:07:24,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 04:07:24,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-09-08 04:07:24,467 INFO L87 Difference]: Start difference. First operand 621 states and 951 transitions. Second operand 14 states. [2019-09-08 04:07:34,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:07:34,147 INFO L93 Difference]: Finished difference Result 1859 states and 2923 transitions. [2019-09-08 04:07:34,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 04:07:34,149 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 155 [2019-09-08 04:07:34,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:07:34,157 INFO L225 Difference]: With dead ends: 1859 [2019-09-08 04:07:34,157 INFO L226 Difference]: Without dead ends: 1304 [2019-09-08 04:07:34,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 167 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=196, Invalid=994, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 04:07:34,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1304 states. [2019-09-08 04:07:34,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 1248. [2019-09-08 04:07:34,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1248 states. [2019-09-08 04:07:34,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1248 states and 1950 transitions. [2019-09-08 04:07:34,225 INFO L78 Accepts]: Start accepts. Automaton has 1248 states and 1950 transitions. Word has length 155 [2019-09-08 04:07:34,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:07:34,225 INFO L475 AbstractCegarLoop]: Abstraction has 1248 states and 1950 transitions. [2019-09-08 04:07:34,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 04:07:34,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 1950 transitions. [2019-09-08 04:07:34,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-08 04:07:34,232 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:07:34,232 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:07:34,232 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:07:34,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:07:34,233 INFO L82 PathProgramCache]: Analyzing trace with hash 749392654, now seen corresponding path program 1 times [2019-09-08 04:07:34,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:07:34,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:07:34,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:34,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:07:34,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:34,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:07:34,361 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 04:07:34,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:07:34,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 04:07:34,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:07:34,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:07:34,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:07:34,363 INFO L87 Difference]: Start difference. First operand 1248 states and 1950 transitions. Second operand 9 states. [2019-09-08 04:07:34,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:07:34,492 INFO L93 Difference]: Finished difference Result 1810 states and 2833 transitions. [2019-09-08 04:07:34,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 04:07:34,493 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 164 [2019-09-08 04:07:34,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:07:34,497 INFO L225 Difference]: With dead ends: 1810 [2019-09-08 04:07:34,497 INFO L226 Difference]: Without dead ends: 616 [2019-09-08 04:07:34,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-08 04:07:34,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2019-09-08 04:07:34,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 616. [2019-09-08 04:07:34,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2019-09-08 04:07:34,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 938 transitions. [2019-09-08 04:07:34,545 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 938 transitions. Word has length 164 [2019-09-08 04:07:34,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:07:34,547 INFO L475 AbstractCegarLoop]: Abstraction has 616 states and 938 transitions. [2019-09-08 04:07:34,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:07:34,547 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 938 transitions. [2019-09-08 04:07:34,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-08 04:07:34,552 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:07:34,553 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:07:34,553 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:07:34,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:07:34,554 INFO L82 PathProgramCache]: Analyzing trace with hash -120702457, now seen corresponding path program 1 times [2019-09-08 04:07:34,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:07:34,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:07:34,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:34,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:07:34,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:34,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:07:34,810 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-08 04:07:34,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:07:34,810 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:07:34,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:07:35,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:07:35,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 2814 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 04:07:35,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:07:35,335 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 04:07:35,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:07:35,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2019-09-08 04:07:35,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 04:07:35,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 04:07:35,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-08 04:07:35,344 INFO L87 Difference]: Start difference. First operand 616 states and 938 transitions. Second operand 14 states. [2019-09-08 04:07:40,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:07:40,970 INFO L93 Difference]: Finished difference Result 1217 states and 1897 transitions. [2019-09-08 04:07:40,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 04:07:40,971 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 167 [2019-09-08 04:07:40,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:07:40,976 INFO L225 Difference]: With dead ends: 1217 [2019-09-08 04:07:40,976 INFO L226 Difference]: Without dead ends: 664 [2019-09-08 04:07:40,978 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2019-09-08 04:07:40,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2019-09-08 04:07:41,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 627. [2019-09-08 04:07:41,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-09-08 04:07:41,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 953 transitions. [2019-09-08 04:07:41,004 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 953 transitions. Word has length 167 [2019-09-08 04:07:41,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:07:41,004 INFO L475 AbstractCegarLoop]: Abstraction has 627 states and 953 transitions. [2019-09-08 04:07:41,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 04:07:41,005 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 953 transitions. [2019-09-08 04:07:41,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-08 04:07:41,008 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:07:41,008 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:07:41,009 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:07:41,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:07:41,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1059386421, now seen corresponding path program 1 times [2019-09-08 04:07:41,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:07:41,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:07:41,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:41,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:07:41,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:41,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:07:41,211 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-08 04:07:41,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:07:41,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 04:07:41,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 04:07:41,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 04:07:41,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 04:07:41,212 INFO L87 Difference]: Start difference. First operand 627 states and 953 transitions. Second operand 11 states. [2019-09-08 04:07:45,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:07:45,798 INFO L93 Difference]: Finished difference Result 1189 states and 1842 transitions. [2019-09-08 04:07:45,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:07:45,800 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 174 [2019-09-08 04:07:45,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:07:45,804 INFO L225 Difference]: With dead ends: 1189 [2019-09-08 04:07:45,804 INFO L226 Difference]: Without dead ends: 625 [2019-09-08 04:07:45,807 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-09-08 04:07:45,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2019-09-08 04:07:45,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 625. [2019-09-08 04:07:45,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625 states. [2019-09-08 04:07:45,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 949 transitions. [2019-09-08 04:07:45,834 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 949 transitions. Word has length 174 [2019-09-08 04:07:45,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:07:45,835 INFO L475 AbstractCegarLoop]: Abstraction has 625 states and 949 transitions. [2019-09-08 04:07:45,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 04:07:45,835 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 949 transitions. [2019-09-08 04:07:45,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 04:07:45,840 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:07:45,840 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:07:45,841 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:07:45,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:07:45,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1174315462, now seen corresponding path program 1 times [2019-09-08 04:07:45,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:07:45,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:07:45,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:45,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:07:45,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:45,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:07:45,986 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 04:07:45,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:07:45,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 04:07:45,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:07:45,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:07:45,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:07:45,988 INFO L87 Difference]: Start difference. First operand 625 states and 949 transitions. Second operand 9 states. [2019-09-08 04:07:51,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:07:51,155 INFO L93 Difference]: Finished difference Result 1948 states and 3036 transitions. [2019-09-08 04:07:51,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 04:07:51,162 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 176 [2019-09-08 04:07:51,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:07:51,176 INFO L225 Difference]: With dead ends: 1948 [2019-09-08 04:07:51,177 INFO L226 Difference]: Without dead ends: 1386 [2019-09-08 04:07:51,179 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2019-09-08 04:07:51,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2019-09-08 04:07:51,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 1342. [2019-09-08 04:07:51,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2019-09-08 04:07:51,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 2078 transitions. [2019-09-08 04:07:51,246 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 2078 transitions. Word has length 176 [2019-09-08 04:07:51,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:07:51,247 INFO L475 AbstractCegarLoop]: Abstraction has 1342 states and 2078 transitions. [2019-09-08 04:07:51,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:07:51,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 2078 transitions. [2019-09-08 04:07:51,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 04:07:51,253 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:07:51,253 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:07:51,253 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:07:51,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:07:51,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1162452873, now seen corresponding path program 1 times [2019-09-08 04:07:51,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:07:51,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:07:51,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:51,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:07:51,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:51,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:07:51,398 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 04:07:51,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:07:51,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:07:51,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:07:51,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:07:51,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:07:51,400 INFO L87 Difference]: Start difference. First operand 1342 states and 2078 transitions. Second operand 7 states. [2019-09-08 04:07:51,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:07:51,487 INFO L93 Difference]: Finished difference Result 2664 states and 4153 transitions. [2019-09-08 04:07:51,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:07:51,488 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 181 [2019-09-08 04:07:51,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:07:51,497 INFO L225 Difference]: With dead ends: 2664 [2019-09-08 04:07:51,497 INFO L226 Difference]: Without dead ends: 1385 [2019-09-08 04:07:51,502 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:07:51,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2019-09-08 04:07:51,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 1363. [2019-09-08 04:07:51,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363 states. [2019-09-08 04:07:51,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 2102 transitions. [2019-09-08 04:07:51,565 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 2102 transitions. Word has length 181 [2019-09-08 04:07:51,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:07:51,566 INFO L475 AbstractCegarLoop]: Abstraction has 1363 states and 2102 transitions. [2019-09-08 04:07:51,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:07:51,566 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 2102 transitions. [2019-09-08 04:07:51,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-08 04:07:51,569 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:07:51,570 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:07:51,570 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:07:51,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:07:51,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1416241055, now seen corresponding path program 1 times [2019-09-08 04:07:51,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:07:51,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:07:51,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:51,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:07:51,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:51,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:07:51,786 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 04:07:51,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:07:51,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 04:07:51,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 04:07:51,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 04:07:51,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:07:51,788 INFO L87 Difference]: Start difference. First operand 1363 states and 2102 transitions. Second operand 8 states. [2019-09-08 04:07:57,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:07:57,090 INFO L93 Difference]: Finished difference Result 4364 states and 6849 transitions. [2019-09-08 04:07:57,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 04:07:57,091 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 185 [2019-09-08 04:07:57,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:07:57,120 INFO L225 Difference]: With dead ends: 4364 [2019-09-08 04:07:57,121 INFO L226 Difference]: Without dead ends: 3062 [2019-09-08 04:07:57,129 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 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-09-08 04:07:57,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3062 states. [2019-09-08 04:07:57,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3062 to 3025. [2019-09-08 04:07:57,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3025 states. [2019-09-08 04:07:57,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3025 states to 3025 states and 4684 transitions. [2019-09-08 04:07:57,347 INFO L78 Accepts]: Start accepts. Automaton has 3025 states and 4684 transitions. Word has length 185 [2019-09-08 04:07:57,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:07:57,348 INFO L475 AbstractCegarLoop]: Abstraction has 3025 states and 4684 transitions. [2019-09-08 04:07:57,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 04:07:57,348 INFO L276 IsEmpty]: Start isEmpty. Operand 3025 states and 4684 transitions. [2019-09-08 04:07:57,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-08 04:07:57,357 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:07:57,358 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:07:57,358 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:07:57,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:07:57,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1011361474, now seen corresponding path program 1 times [2019-09-08 04:07:57,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:07:57,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:07:57,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:57,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:07:57,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:57,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:07:57,605 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 04:07:57,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:07:57,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 04:07:57,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:07:57,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:07:57,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:07:57,610 INFO L87 Difference]: Start difference. First operand 3025 states and 4684 transitions. Second operand 9 states. [2019-09-08 04:07:58,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:07:58,165 INFO L93 Difference]: Finished difference Result 5886 states and 9278 transitions. [2019-09-08 04:07:58,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 04:07:58,166 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 188 [2019-09-08 04:07:58,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:07:58,195 INFO L225 Difference]: With dead ends: 5886 [2019-09-08 04:07:58,195 INFO L226 Difference]: Without dead ends: 3025 [2019-09-08 04:07:58,209 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-08 04:07:58,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3025 states. [2019-09-08 04:07:58,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3025 to 3025. [2019-09-08 04:07:58,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3025 states. [2019-09-08 04:07:58,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3025 states to 3025 states and 4638 transitions. [2019-09-08 04:07:58,385 INFO L78 Accepts]: Start accepts. Automaton has 3025 states and 4638 transitions. Word has length 188 [2019-09-08 04:07:58,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:07:58,385 INFO L475 AbstractCegarLoop]: Abstraction has 3025 states and 4638 transitions. [2019-09-08 04:07:58,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:07:58,385 INFO L276 IsEmpty]: Start isEmpty. Operand 3025 states and 4638 transitions. [2019-09-08 04:07:58,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-08 04:07:58,388 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:07:58,389 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:07:58,389 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:07:58,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:07:58,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1273079420, now seen corresponding path program 1 times [2019-09-08 04:07:58,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:07:58,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:07:58,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:58,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:07:58,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:58,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:07:58,526 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-08 04:07:58,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:07:58,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:07:58,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:07:58,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:07:58,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:07:58,527 INFO L87 Difference]: Start difference. First operand 3025 states and 4638 transitions. Second operand 7 states. [2019-09-08 04:08:02,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:08:02,510 INFO L93 Difference]: Finished difference Result 5682 states and 8757 transitions. [2019-09-08 04:08:02,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 04:08:02,516 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 193 [2019-09-08 04:08:02,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:08:02,545 INFO L225 Difference]: With dead ends: 5682 [2019-09-08 04:08:02,545 INFO L226 Difference]: Without dead ends: 3208 [2019-09-08 04:08:02,555 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-09-08 04:08:02,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3208 states. [2019-09-08 04:08:02,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3208 to 3141. [2019-09-08 04:08:02,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3141 states. [2019-09-08 04:08:02,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 4795 transitions. [2019-09-08 04:08:02,703 INFO L78 Accepts]: Start accepts. Automaton has 3141 states and 4795 transitions. Word has length 193 [2019-09-08 04:08:02,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:08:02,703 INFO L475 AbstractCegarLoop]: Abstraction has 3141 states and 4795 transitions. [2019-09-08 04:08:02,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:08:02,703 INFO L276 IsEmpty]: Start isEmpty. Operand 3141 states and 4795 transitions. [2019-09-08 04:08:02,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-08 04:08:02,707 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:08:02,707 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:08:02,707 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:08:02,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:08:02,708 INFO L82 PathProgramCache]: Analyzing trace with hash 81256379, now seen corresponding path program 1 times [2019-09-08 04:08:02,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:08:02,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:08:02,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:08:02,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:08:02,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:08:02,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:08:02,835 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 04:08:02,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:08:02,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:08:02,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:08:02,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:08:02,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:08:02,837 INFO L87 Difference]: Start difference. First operand 3141 states and 4795 transitions. Second operand 6 states. [2019-09-08 04:08:03,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:08:03,033 INFO L93 Difference]: Finished difference Result 6682 states and 10254 transitions. [2019-09-08 04:08:03,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:08:03,034 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 198 [2019-09-08 04:08:03,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:08:03,054 INFO L225 Difference]: With dead ends: 6682 [2019-09-08 04:08:03,055 INFO L226 Difference]: Without dead ends: 4092 [2019-09-08 04:08:03,064 INFO L628 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-09-08 04:08:03,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4092 states. [2019-09-08 04:08:03,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4092 to 3794. [2019-09-08 04:08:03,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3794 states. [2019-09-08 04:08:03,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3794 states to 3794 states and 5790 transitions. [2019-09-08 04:08:03,232 INFO L78 Accepts]: Start accepts. Automaton has 3794 states and 5790 transitions. Word has length 198 [2019-09-08 04:08:03,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:08:03,232 INFO L475 AbstractCegarLoop]: Abstraction has 3794 states and 5790 transitions. [2019-09-08 04:08:03,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:08:03,233 INFO L276 IsEmpty]: Start isEmpty. Operand 3794 states and 5790 transitions. [2019-09-08 04:08:03,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-08 04:08:03,236 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:08:03,236 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:08:03,236 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:08:03,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:08:03,237 INFO L82 PathProgramCache]: Analyzing trace with hash 740787901, now seen corresponding path program 1 times [2019-09-08 04:08:03,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:08:03,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:08:03,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:08:03,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:08:03,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:08:03,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:08:03,444 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 04:08:03,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:08:03,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 04:08:03,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 04:08:03,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 04:08:03,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:08:03,446 INFO L87 Difference]: Start difference. First operand 3794 states and 5790 transitions. Second operand 8 states. [2019-09-08 04:08:03,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:08:03,596 INFO L93 Difference]: Finished difference Result 3817 states and 5819 transitions. [2019-09-08 04:08:03,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 04:08:03,596 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 198 [2019-09-08 04:08:03,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:08:03,621 INFO L225 Difference]: With dead ends: 3817 [2019-09-08 04:08:03,621 INFO L226 Difference]: Without dead ends: 3800 [2019-09-08 04:08:03,625 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:08:03,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3800 states. [2019-09-08 04:08:03,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3800 to 3794. [2019-09-08 04:08:03,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3794 states. [2019-09-08 04:08:03,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3794 states to 3794 states and 5784 transitions. [2019-09-08 04:08:03,891 INFO L78 Accepts]: Start accepts. Automaton has 3794 states and 5784 transitions. Word has length 198 [2019-09-08 04:08:03,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:08:03,891 INFO L475 AbstractCegarLoop]: Abstraction has 3794 states and 5784 transitions. [2019-09-08 04:08:03,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 04:08:03,891 INFO L276 IsEmpty]: Start isEmpty. Operand 3794 states and 5784 transitions. [2019-09-08 04:08:03,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-09-08 04:08:03,895 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:08:03,895 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:08:03,895 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:08:03,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:08:03,896 INFO L82 PathProgramCache]: Analyzing trace with hash -563676293, now seen corresponding path program 1 times [2019-09-08 04:08:03,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:08:03,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:08:03,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:08:03,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:08:03,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:08:03,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:08:04,062 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-08 04:08:04,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:08:04,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 04:08:04,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:08:04,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:08:04,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:08:04,064 INFO L87 Difference]: Start difference. First operand 3794 states and 5784 transitions. Second operand 9 states. [2019-09-08 04:08:07,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:08:07,293 INFO L93 Difference]: Finished difference Result 7519 states and 11512 transitions. [2019-09-08 04:08:07,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 04:08:07,294 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 216 [2019-09-08 04:08:07,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:08:07,315 INFO L225 Difference]: With dead ends: 7519 [2019-09-08 04:08:07,316 INFO L226 Difference]: Without dead ends: 3800 [2019-09-08 04:08:07,327 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:08:07,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3800 states. [2019-09-08 04:08:07,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3800 to 3794. [2019-09-08 04:08:07,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3794 states. [2019-09-08 04:08:07,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3794 states to 3794 states and 5778 transitions. [2019-09-08 04:08:07,498 INFO L78 Accepts]: Start accepts. Automaton has 3794 states and 5778 transitions. Word has length 216 [2019-09-08 04:08:07,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:08:07,498 INFO L475 AbstractCegarLoop]: Abstraction has 3794 states and 5778 transitions. [2019-09-08 04:08:07,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:08:07,498 INFO L276 IsEmpty]: Start isEmpty. Operand 3794 states and 5778 transitions. [2019-09-08 04:08:07,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-08 04:08:07,502 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:08:07,502 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:08:07,503 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:08:07,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:08:07,503 INFO L82 PathProgramCache]: Analyzing trace with hash 651138481, now seen corresponding path program 1 times [2019-09-08 04:08:07,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:08:07,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:08:07,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:08:07,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:08:07,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:08:07,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:08:07,712 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-09-08 04:08:07,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:08:07,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:08:07,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:08:07,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:08:07,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:08:07,714 INFO L87 Difference]: Start difference. First operand 3794 states and 5778 transitions. Second operand 6 states. [2019-09-08 04:08:11,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:08:11,527 INFO L93 Difference]: Finished difference Result 12030 states and 18885 transitions. [2019-09-08 04:08:11,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 04:08:11,528 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 217 [2019-09-08 04:08:11,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:08:11,566 INFO L225 Difference]: With dead ends: 12030 [2019-09-08 04:08:11,566 INFO L226 Difference]: Without dead ends: 8311 [2019-09-08 04:08:11,577 INFO L628 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-09-08 04:08:11,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8311 states. [2019-09-08 04:08:11,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8311 to 7908. [2019-09-08 04:08:11,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7908 states. [2019-09-08 04:08:11,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7908 states to 7908 states and 12178 transitions. [2019-09-08 04:08:11,989 INFO L78 Accepts]: Start accepts. Automaton has 7908 states and 12178 transitions. Word has length 217 [2019-09-08 04:08:11,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:08:11,990 INFO L475 AbstractCegarLoop]: Abstraction has 7908 states and 12178 transitions. [2019-09-08 04:08:11,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:08:11,990 INFO L276 IsEmpty]: Start isEmpty. Operand 7908 states and 12178 transitions. [2019-09-08 04:08:11,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-08 04:08:11,995 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:08:11,996 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:08:11,996 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:08:11,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:08:11,997 INFO L82 PathProgramCache]: Analyzing trace with hash -247823010, now seen corresponding path program 1 times [2019-09-08 04:08:11,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:08:11,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:08:11,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:08:11,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:08:11,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:08:12,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:08:12,122 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-08 04:08:12,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:08:12,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:08:12,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:08:12,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:08:12,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:08:12,126 INFO L87 Difference]: Start difference. First operand 7908 states and 12178 transitions. Second operand 4 states. [2019-09-08 04:08:14,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:08:14,857 INFO L93 Difference]: Finished difference Result 24805 states and 39500 transitions. [2019-09-08 04:08:14,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:08:14,857 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 225 [2019-09-08 04:08:14,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:08:14,943 INFO L225 Difference]: With dead ends: 24805 [2019-09-08 04:08:14,944 INFO L226 Difference]: Without dead ends: 16960 [2019-09-08 04:08:14,971 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:08:14,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16960 states. [2019-09-08 04:08:15,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16960 to 16776. [2019-09-08 04:08:15,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16776 states. [2019-09-08 04:08:15,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16776 states to 16776 states and 26728 transitions. [2019-09-08 04:08:15,869 INFO L78 Accepts]: Start accepts. Automaton has 16776 states and 26728 transitions. Word has length 225 [2019-09-08 04:08:15,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:08:15,870 INFO L475 AbstractCegarLoop]: Abstraction has 16776 states and 26728 transitions. [2019-09-08 04:08:15,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:08:15,870 INFO L276 IsEmpty]: Start isEmpty. Operand 16776 states and 26728 transitions. [2019-09-08 04:08:15,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-09-08 04:08:15,880 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:08:15,880 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:08:15,880 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:08:15,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:08:15,881 INFO L82 PathProgramCache]: Analyzing trace with hash 906105755, now seen corresponding path program 1 times [2019-09-08 04:08:15,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:08:15,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:08:15,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:08:15,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:08:15,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:08:15,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:08:16,166 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-08 04:08:16,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:08:16,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:08:16,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:08:16,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:08:16,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:08:16,168 INFO L87 Difference]: Start difference. First operand 16776 states and 26728 transitions. Second operand 4 states. [2019-09-08 04:08:19,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:08:19,203 INFO L93 Difference]: Finished difference Result 53427 states and 90025 transitions. [2019-09-08 04:08:19,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:08:19,204 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 226 [2019-09-08 04:08:19,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:08:19,402 INFO L225 Difference]: With dead ends: 53427 [2019-09-08 04:08:19,402 INFO L226 Difference]: Without dead ends: 36714 [2019-09-08 04:08:19,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:08:19,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36714 states. [2019-09-08 04:08:22,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36714 to 36299. [2019-09-08 04:08:22,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36299 states. [2019-09-08 04:08:22,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36299 states to 36299 states and 61132 transitions. [2019-09-08 04:08:22,653 INFO L78 Accepts]: Start accepts. Automaton has 36299 states and 61132 transitions. Word has length 226 [2019-09-08 04:08:22,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:08:22,653 INFO L475 AbstractCegarLoop]: Abstraction has 36299 states and 61132 transitions. [2019-09-08 04:08:22,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:08:22,653 INFO L276 IsEmpty]: Start isEmpty. Operand 36299 states and 61132 transitions. [2019-09-08 04:08:22,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-09-08 04:08:22,665 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:08:22,665 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:08:22,665 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:08:22,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:08:22,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1976804288, now seen corresponding path program 1 times [2019-09-08 04:08:22,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:08:22,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:08:22,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:08:22,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:08:22,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:08:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:08:22,806 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-08 04:08:22,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:08:22,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:08:22,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:08:22,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:08:22,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:08:22,812 INFO L87 Difference]: Start difference. First operand 36299 states and 61132 transitions. Second operand 4 states. [2019-09-08 04:08:29,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:08:29,691 INFO L93 Difference]: Finished difference Result 117470 states and 216926 transitions. [2019-09-08 04:08:29,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:08:29,692 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 227 [2019-09-08 04:08:29,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:08:30,192 INFO L225 Difference]: With dead ends: 117470 [2019-09-08 04:08:30,192 INFO L226 Difference]: Without dead ends: 81234 [2019-09-08 04:08:30,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:08:30,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81234 states. [2019-09-08 04:08:33,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81234 to 80262. [2019-09-08 04:08:33,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80262 states. [2019-09-08 04:08:34,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80262 states to 80262 states and 147508 transitions. [2019-09-08 04:08:34,469 INFO L78 Accepts]: Start accepts. Automaton has 80262 states and 147508 transitions. Word has length 227 [2019-09-08 04:08:34,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:08:34,470 INFO L475 AbstractCegarLoop]: Abstraction has 80262 states and 147508 transitions. [2019-09-08 04:08:34,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:08:34,470 INFO L276 IsEmpty]: Start isEmpty. Operand 80262 states and 147508 transitions. [2019-09-08 04:08:34,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-08 04:08:34,486 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:08:34,486 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:08:34,486 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:08:34,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:08:34,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1152698499, now seen corresponding path program 1 times [2019-09-08 04:08:34,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:08:34,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:08:34,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:08:34,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:08:34,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:08:34,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:08:34,641 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-08 04:08:34,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:08:34,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:08:34,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:08:34,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:08:34,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:08:34,643 INFO L87 Difference]: Start difference. First operand 80262 states and 147508 transitions. Second operand 4 states. [2019-09-08 04:08:49,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:08:49,525 INFO L93 Difference]: Finished difference Result 264337 states and 562987 transitions. [2019-09-08 04:08:49,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:08:49,525 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 228 [2019-09-08 04:08:49,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:08:50,720 INFO L225 Difference]: With dead ends: 264337 [2019-09-08 04:08:50,720 INFO L226 Difference]: Without dead ends: 184138 [2019-09-08 04:08:51,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:08:51,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184138 states. [2019-09-08 04:09:04,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184138 to 181765. [2019-09-08 04:09:04,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181765 states. [2019-09-08 04:09:06,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181765 states to 181765 states and 381404 transitions. [2019-09-08 04:09:06,386 INFO L78 Accepts]: Start accepts. Automaton has 181765 states and 381404 transitions. Word has length 228 [2019-09-08 04:09:06,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:09:06,387 INFO L475 AbstractCegarLoop]: Abstraction has 181765 states and 381404 transitions. [2019-09-08 04:09:06,387 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:09:06,387 INFO L276 IsEmpty]: Start isEmpty. Operand 181765 states and 381404 transitions. [2019-09-08 04:09:06,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-08 04:09:06,402 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:09:06,403 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:09:06,403 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:09:06,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:09:06,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1375218910, now seen corresponding path program 1 times [2019-09-08 04:09:06,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:09:06,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:09:06,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:06,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:09:06,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:06,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:09:06,562 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-08 04:09:06,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:09:06,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:09:06,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:09:06,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:09:06,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:09:06,564 INFO L87 Difference]: Start difference. First operand 181765 states and 381404 transitions. Second operand 4 states. [2019-09-08 04:09:49,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:09:49,331 INFO L93 Difference]: Finished difference Result 609990 states and 1606035 transitions. [2019-09-08 04:09:49,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:09:49,331 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 229 [2019-09-08 04:09:49,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:09:52,962 INFO L225 Difference]: With dead ends: 609990 [2019-09-08 04:09:52,962 INFO L226 Difference]: Without dead ends: 428276 [2019-09-08 04:09:54,853 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:09:55,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428276 states. [2019-09-08 04:10:47,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428276 to 422228. [2019-09-08 04:10:47,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422228 states. [2019-09-08 04:11:07,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422228 states to 422228 states and 1075246 transitions. [2019-09-08 04:11:07,737 INFO L78 Accepts]: Start accepts. Automaton has 422228 states and 1075246 transitions. Word has length 229 [2019-09-08 04:11:07,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:11:07,738 INFO L475 AbstractCegarLoop]: Abstraction has 422228 states and 1075246 transitions. [2019-09-08 04:11:07,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:11:07,738 INFO L276 IsEmpty]: Start isEmpty. Operand 422228 states and 1075246 transitions. [2019-09-08 04:11:07,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-09-08 04:11:07,771 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:11:07,772 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:11:07,772 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:11:07,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:11:07,772 INFO L82 PathProgramCache]: Analyzing trace with hash 821468062, now seen corresponding path program 1 times [2019-09-08 04:11:07,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:11:07,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:11:07,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:11:07,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:11:07,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:11:07,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:11:07,944 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-09-08 04:11:07,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:11:07,944 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:11:07,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:11:08,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:11:08,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 3582 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-08 04:11:08,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:11:08,593 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 04:11:08,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 04:11:08,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-09-08 04:11:08,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 04:11:08,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 04:11:08,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-09-08 04:11:08,603 INFO L87 Difference]: Start difference. First operand 422228 states and 1075246 transitions. Second operand 14 states. [2019-09-08 04:11:28,068 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 9