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_spec3_product09.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 04:12:02,636 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 04:12:02,638 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 04:12:02,651 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 04:12:02,651 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 04:12:02,652 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 04:12:02,654 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 04:12:02,656 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 04:12:02,658 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 04:12:02,659 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 04:12:02,659 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 04:12:02,661 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 04:12:02,661 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 04:12:02,662 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 04:12:02,663 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 04:12:02,664 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 04:12:02,665 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 04:12:02,666 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 04:12:02,667 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 04:12:02,669 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 04:12:02,671 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 04:12:02,672 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 04:12:02,673 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 04:12:02,674 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 04:12:02,679 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 04:12:02,679 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 04:12:02,680 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 04:12:02,680 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 04:12:02,681 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 04:12:02,683 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 04:12:02,683 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 04:12:02,684 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 04:12:02,684 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 04:12:02,685 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 04:12:02,686 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 04:12:02,686 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 04:12:02,687 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 04:12:02,687 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 04:12:02,687 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 04:12:02,688 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 04:12:02,689 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 04:12:02,690 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:12:02,704 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 04:12:02,705 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 04:12:02,706 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 04:12:02,706 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 04:12:02,706 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 04:12:02,707 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 04:12:02,707 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 04:12:02,707 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 04:12:02,707 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 04:12:02,707 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 04:12:02,708 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 04:12:02,708 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 04:12:02,708 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 04:12:02,708 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 04:12:02,708 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 04:12:02,708 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 04:12:02,709 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 04:12:02,709 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 04:12:02,709 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 04:12:02,709 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 04:12:02,709 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 04:12:02,710 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 04:12:02,710 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 04:12:02,710 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 04:12:02,710 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 04:12:02,710 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 04:12:02,711 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 04:12:02,711 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 04:12:02,711 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 04:12:02,740 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 04:12:02,753 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 04:12:02,757 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 04:12:02,758 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 04:12:02,758 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 04:12:02,759 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec3_product09.cil.c [2019-09-08 04:12:02,823 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60a6e1945/13815006b37b40669a399849c36a94ef/FLAG14e9c17db [2019-09-08 04:12:03,410 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 04:12:03,411 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec3_product09.cil.c [2019-09-08 04:12:03,430 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60a6e1945/13815006b37b40669a399849c36a94ef/FLAG14e9c17db [2019-09-08 04:12:03,667 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60a6e1945/13815006b37b40669a399849c36a94ef [2019-09-08 04:12:03,676 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 04:12:03,678 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 04:12:03,680 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 04:12:03,680 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 04:12:03,683 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 04:12:03,685 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:12:03" (1/1) ... [2019-09-08 04:12:03,687 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@709aa003 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:12:03, skipping insertion in model container [2019-09-08 04:12:03,688 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:12:03" (1/1) ... [2019-09-08 04:12:03,695 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 04:12:03,776 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 04:12:04,483 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:12:04,508 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 04:12:04,625 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:12:04,694 INFO L192 MainTranslator]: Completed translation [2019-09-08 04:12:04,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:12:04 WrapperNode [2019-09-08 04:12:04,696 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 04:12:04,697 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 04:12:04,697 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 04:12:04,697 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 04:12:04,713 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:12:04" (1/1) ... [2019-09-08 04:12:04,714 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:12:04" (1/1) ... [2019-09-08 04:12:04,766 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:12:04" (1/1) ... [2019-09-08 04:12:04,767 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:12:04" (1/1) ... [2019-09-08 04:12:04,849 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:12:04" (1/1) ... [2019-09-08 04:12:04,875 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:12:04" (1/1) ... [2019-09-08 04:12:04,884 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:12:04" (1/1) ... [2019-09-08 04:12:04,901 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 04:12:04,901 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 04:12:04,902 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 04:12:04,902 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 04:12:04,903 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:12:04" (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:12:04,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 04:12:04,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 04:12:04,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 04:12:04,995 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-09-08 04:12:04,996 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-09-08 04:12:04,996 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 04:12:04,996 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-09-08 04:12:04,997 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-09-08 04:12:04,998 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-09-08 04:12:04,998 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-09-08 04:12:04,998 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-09-08 04:12:04,999 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-09-08 04:12:04,999 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-09-08 04:12:05,000 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-09-08 04:12:05,001 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-09-08 04:12:05,001 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-09-08 04:12:05,004 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-09-08 04:12:05,004 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 04:12:05,004 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-09-08 04:12:05,004 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-09-08 04:12:05,005 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-09-08 04:12:05,005 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-09-08 04:12:05,005 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-09-08 04:12:05,005 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-09-08 04:12:05,005 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-09-08 04:12:05,006 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-09-08 04:12:05,006 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-09-08 04:12:05,006 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-09-08 04:12:05,006 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-09-08 04:12:05,006 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-09-08 04:12:05,006 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-09-08 04:12:05,007 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-09-08 04:12:05,007 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-09-08 04:12:05,007 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-09-08 04:12:05,007 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-09-08 04:12:05,007 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-09-08 04:12:05,007 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-09-08 04:12:05,008 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-09-08 04:12:05,008 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-09-08 04:12:05,008 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-09-08 04:12:05,008 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-09-08 04:12:05,008 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-09-08 04:12:05,008 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 04:12:05,008 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 04:12:05,009 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 04:12:05,009 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 04:12:05,009 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-09-08 04:12:05,010 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-09-08 04:12:05,010 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-09-08 04:12:05,010 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-09-08 04:12:05,010 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-09-08 04:12:05,010 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-09-08 04:12:05,011 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-09-08 04:12:05,011 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-09-08 04:12:05,011 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-09-08 04:12:05,011 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-09-08 04:12:05,011 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-09-08 04:12:05,011 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-09-08 04:12:05,012 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-09-08 04:12:05,012 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-09-08 04:12:05,012 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 04:12:05,013 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-09-08 04:12:05,013 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 04:12:05,013 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__1 [2019-09-08 04:12:05,013 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__2 [2019-09-08 04:12:05,013 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 04:12:05,014 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 04:12:05,014 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 04:12:05,015 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 04:12:05,015 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 04:12:05,015 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 04:12:05,015 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 04:12:05,016 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 04:12:05,016 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-09-08 04:12:05,017 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-09-08 04:12:05,017 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-09-08 04:12:05,018 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-09-08 04:12:05,018 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-09-08 04:12:05,018 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-09-08 04:12:05,018 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-09-08 04:12:05,019 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-09-08 04:12:05,019 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-09-08 04:12:05,020 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-09-08 04:12:05,020 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-09-08 04:12:05,020 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-09-08 04:12:05,020 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 04:12:05,021 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-09-08 04:12:05,022 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-09-08 04:12:05,022 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-09-08 04:12:05,022 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-09-08 04:12:05,023 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-09-08 04:12:05,023 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-09-08 04:12:05,023 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-09-08 04:12:05,023 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-09-08 04:12:05,023 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-09-08 04:12:05,024 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 04:12:05,024 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 04:12:05,024 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-09-08 04:12:05,024 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-09-08 04:12:05,024 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-09-08 04:12:05,024 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-09-08 04:12:05,025 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-09-08 04:12:05,025 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-09-08 04:12:05,025 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-09-08 04:12:05,025 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-09-08 04:12:05,025 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-09-08 04:12:05,026 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-09-08 04:12:05,026 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-09-08 04:12:05,026 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-09-08 04:12:05,026 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-09-08 04:12:05,026 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-09-08 04:12:05,026 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-09-08 04:12:05,027 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-09-08 04:12:05,027 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-09-08 04:12:05,027 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-09-08 04:12:05,028 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__1 [2019-09-08 04:12:05,028 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__2 [2019-09-08 04:12:05,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 04:12:05,029 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-09-08 04:12:05,029 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 04:12:05,030 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 04:12:05,030 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 04:12:05,030 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 04:12:05,030 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-08 04:12:05,032 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-09-08 04:12:05,032 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-09-08 04:12:05,032 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-09-08 04:12:05,033 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-09-08 04:12:05,033 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-09-08 04:12:05,033 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-09-08 04:12:05,033 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-09-08 04:12:05,034 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-09-08 04:12:05,034 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-09-08 04:12:05,034 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-09-08 04:12:05,035 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-09-08 04:12:05,035 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 04:12:05,035 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-09-08 04:12:05,035 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 04:12:05,035 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 04:12:05,036 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 04:12:05,039 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 04:12:05,040 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 04:12:05,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 04:12:05,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 04:12:05,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 04:12:05,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 04:12:05,047 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 04:12:05,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 04:12:05,047 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 04:12:05,048 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 04:12:05,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 04:12:05,049 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 04:12:05,049 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 04:12:05,049 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 04:12:05,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 04:12:05,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 04:12:05,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 04:12:07,865 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 04:12:07,865 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-09-08 04:12:07,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:12:07 BoogieIcfgContainer [2019-09-08 04:12:07,868 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 04:12:07,869 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 04:12:07,869 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 04:12:07,873 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 04:12:07,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 04:12:03" (1/3) ... [2019-09-08 04:12:07,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fafba23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:12:07, skipping insertion in model container [2019-09-08 04:12:07,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:12:04" (2/3) ... [2019-09-08 04:12:07,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fafba23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:12:07, skipping insertion in model container [2019-09-08 04:12:07,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:12:07" (3/3) ... [2019-09-08 04:12:07,878 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product09.cil.c [2019-09-08 04:12:07,890 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 04:12:07,901 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 04:12:07,918 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 04:12:07,975 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 04:12:07,976 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 04:12:07,976 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 04:12:07,976 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 04:12:07,976 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 04:12:07,976 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 04:12:07,976 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 04:12:07,977 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 04:12:07,977 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 04:12:08,024 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states. [2019-09-08 04:12:08,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 04:12:08,058 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:12:08,059 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:12:08,064 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:12:08,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:12:08,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1161933342, now seen corresponding path program 1 times [2019-09-08 04:12:08,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:12:08,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:12:08,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:08,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:12:08,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:08,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:12:08,783 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:12:08,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:12:08,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:12:08,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:12:08,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:12:08,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:12:08,808 INFO L87 Difference]: Start difference. First operand 757 states. Second operand 7 states. [2019-09-08 04:12:09,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:12:09,191 INFO L93 Difference]: Finished difference Result 1193 states and 1952 transitions. [2019-09-08 04:12:09,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:12:09,194 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2019-09-08 04:12:09,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:12:09,232 INFO L225 Difference]: With dead ends: 1193 [2019-09-08 04:12:09,233 INFO L226 Difference]: Without dead ends: 605 [2019-09-08 04:12:09,248 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:12:09,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-09-08 04:12:09,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 603. [2019-09-08 04:12:09,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-09-08 04:12:09,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 971 transitions. [2019-09-08 04:12:09,413 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 971 transitions. Word has length 115 [2019-09-08 04:12:09,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:12:09,414 INFO L475 AbstractCegarLoop]: Abstraction has 603 states and 971 transitions. [2019-09-08 04:12:09,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:12:09,415 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 971 transitions. [2019-09-08 04:12:09,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 04:12:09,424 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:12:09,425 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:12:09,425 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:12:09,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:12:09,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1514671527, now seen corresponding path program 1 times [2019-09-08 04:12:09,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:12:09,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:12:09,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:09,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:12:09,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:09,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:12:09,700 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:12:09,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:12:09,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:12:09,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:12:09,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:12:09,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:12:09,704 INFO L87 Difference]: Start difference. First operand 603 states and 971 transitions. Second operand 4 states. [2019-09-08 04:12:09,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:12:09,799 INFO L93 Difference]: Finished difference Result 1172 states and 1907 transitions. [2019-09-08 04:12:09,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:12:09,800 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-09-08 04:12:09,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:12:09,807 INFO L225 Difference]: With dead ends: 1172 [2019-09-08 04:12:09,807 INFO L226 Difference]: Without dead ends: 585 [2019-09-08 04:12:09,812 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:12:09,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2019-09-08 04:12:09,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 585. [2019-09-08 04:12:09,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2019-09-08 04:12:09,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 938 transitions. [2019-09-08 04:12:09,856 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 938 transitions. Word has length 116 [2019-09-08 04:12:09,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:12:09,860 INFO L475 AbstractCegarLoop]: Abstraction has 585 states and 938 transitions. [2019-09-08 04:12:09,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:12:09,860 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 938 transitions. [2019-09-08 04:12:09,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 04:12:09,872 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:12:09,872 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:12:09,873 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:12:09,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:12:09,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1422688811, now seen corresponding path program 1 times [2019-09-08 04:12:09,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:12:09,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:12:09,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:09,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:12:09,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:09,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:12:10,159 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:12:10,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:12:10,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:12:10,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:12:10,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:12:10,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:12:10,161 INFO L87 Difference]: Start difference. First operand 585 states and 938 transitions. Second operand 7 states. [2019-09-08 04:12:10,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:12:10,278 INFO L93 Difference]: Finished difference Result 1141 states and 1849 transitions. [2019-09-08 04:12:10,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:12:10,279 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 116 [2019-09-08 04:12:10,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:12:10,285 INFO L225 Difference]: With dead ends: 1141 [2019-09-08 04:12:10,285 INFO L226 Difference]: Without dead ends: 579 [2019-09-08 04:12:10,288 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:12:10,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-09-08 04:12:10,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 579. [2019-09-08 04:12:10,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-09-08 04:12:10,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 925 transitions. [2019-09-08 04:12:10,327 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 925 transitions. Word has length 116 [2019-09-08 04:12:10,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:12:10,328 INFO L475 AbstractCegarLoop]: Abstraction has 579 states and 925 transitions. [2019-09-08 04:12:10,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:12:10,328 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 925 transitions. [2019-09-08 04:12:10,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 04:12:10,337 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:12:10,337 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:12:10,337 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:12:10,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:12:10,338 INFO L82 PathProgramCache]: Analyzing trace with hash 877146082, now seen corresponding path program 1 times [2019-09-08 04:12:10,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:12:10,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:12:10,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:10,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:12:10,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:10,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:12:10,525 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:12:10,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:12:10,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:12:10,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:12:10,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:12:10,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:12:10,527 INFO L87 Difference]: Start difference. First operand 579 states and 925 transitions. Second operand 7 states. [2019-09-08 04:12:10,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:12:10,642 INFO L93 Difference]: Finished difference Result 1129 states and 1823 transitions. [2019-09-08 04:12:10,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:12:10,643 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 117 [2019-09-08 04:12:10,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:12:10,653 INFO L225 Difference]: With dead ends: 1129 [2019-09-08 04:12:10,653 INFO L226 Difference]: Without dead ends: 573 [2019-09-08 04:12:10,659 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:12:10,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2019-09-08 04:12:10,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 573. [2019-09-08 04:12:10,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2019-09-08 04:12:10,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 912 transitions. [2019-09-08 04:12:10,690 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 912 transitions. Word has length 117 [2019-09-08 04:12:10,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:12:10,691 INFO L475 AbstractCegarLoop]: Abstraction has 573 states and 912 transitions. [2019-09-08 04:12:10,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:12:10,691 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 912 transitions. [2019-09-08 04:12:10,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 04:12:10,696 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:12:10,696 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:12:10,697 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:12:10,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:12:10,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1106162991, now seen corresponding path program 1 times [2019-09-08 04:12:10,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:12:10,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:12:10,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:10,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:12:10,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:10,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:12:10,893 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:12:10,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:12:10,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:12:10,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:12:10,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:12:10,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:12:10,897 INFO L87 Difference]: Start difference. First operand 573 states and 912 transitions. Second operand 7 states. [2019-09-08 04:12:11,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:12:11,019 INFO L93 Difference]: Finished difference Result 1117 states and 1797 transitions. [2019-09-08 04:12:11,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:12:11,020 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 118 [2019-09-08 04:12:11,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:12:11,034 INFO L225 Difference]: With dead ends: 1117 [2019-09-08 04:12:11,034 INFO L226 Difference]: Without dead ends: 567 [2019-09-08 04:12:11,041 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:12:11,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2019-09-08 04:12:11,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 567. [2019-09-08 04:12:11,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2019-09-08 04:12:11,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 899 transitions. [2019-09-08 04:12:11,067 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 899 transitions. Word has length 118 [2019-09-08 04:12:11,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:12:11,068 INFO L475 AbstractCegarLoop]: Abstraction has 567 states and 899 transitions. [2019-09-08 04:12:11,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:12:11,068 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 899 transitions. [2019-09-08 04:12:11,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 04:12:11,073 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:12:11,073 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:12:11,073 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:12:11,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:12:11,074 INFO L82 PathProgramCache]: Analyzing trace with hash -74424208, now seen corresponding path program 1 times [2019-09-08 04:12:11,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:12:11,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:12:11,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:11,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:12:11,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:11,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:12:11,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:12:11,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:12:11,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:12:11,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:12:11,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:12:11,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:12:11,377 INFO L87 Difference]: Start difference. First operand 567 states and 899 transitions. Second operand 7 states. [2019-09-08 04:12:11,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:12:11,470 INFO L93 Difference]: Finished difference Result 1105 states and 1771 transitions. [2019-09-08 04:12:11,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:12:11,472 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 118 [2019-09-08 04:12:11,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:12:11,482 INFO L225 Difference]: With dead ends: 1105 [2019-09-08 04:12:11,482 INFO L226 Difference]: Without dead ends: 567 [2019-09-08 04:12:11,486 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:12:11,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2019-09-08 04:12:11,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 567. [2019-09-08 04:12:11,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2019-09-08 04:12:11,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 898 transitions. [2019-09-08 04:12:11,512 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 898 transitions. Word has length 118 [2019-09-08 04:12:11,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:12:11,514 INFO L475 AbstractCegarLoop]: Abstraction has 567 states and 898 transitions. [2019-09-08 04:12:11,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:12:11,515 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 898 transitions. [2019-09-08 04:12:11,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 04:12:11,520 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:12:11,520 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:12:11,520 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:12:11,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:12:11,521 INFO L82 PathProgramCache]: Analyzing trace with hash -423275098, now seen corresponding path program 1 times [2019-09-08 04:12:11,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:12:11,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:12:11,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:11,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:12:11,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:11,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:12:11,679 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:12:11,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:12:11,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:12:11,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:12:11,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:12:11,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:12:11,681 INFO L87 Difference]: Start difference. First operand 567 states and 898 transitions. Second operand 5 states. [2019-09-08 04:12:11,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:12:11,756 INFO L93 Difference]: Finished difference Result 1104 states and 1768 transitions. [2019-09-08 04:12:11,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:12:11,756 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 119 [2019-09-08 04:12:11,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:12:11,761 INFO L225 Difference]: With dead ends: 1104 [2019-09-08 04:12:11,761 INFO L226 Difference]: Without dead ends: 567 [2019-09-08 04:12:11,765 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:12:11,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2019-09-08 04:12:11,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 567. [2019-09-08 04:12:11,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2019-09-08 04:12:11,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 897 transitions. [2019-09-08 04:12:11,791 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 897 transitions. Word has length 119 [2019-09-08 04:12:11,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:12:11,791 INFO L475 AbstractCegarLoop]: Abstraction has 567 states and 897 transitions. [2019-09-08 04:12:11,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:12:11,792 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 897 transitions. [2019-09-08 04:12:11,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 04:12:11,798 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:12:11,798 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:12:11,798 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:12:11,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:12:11,799 INFO L82 PathProgramCache]: Analyzing trace with hash -161455577, now seen corresponding path program 1 times [2019-09-08 04:12:11,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:12:11,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:12:11,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:11,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:12:11,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:11,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:12:11,955 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:12:11,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:12:11,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:12:11,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:12:11,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:12:11,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:12:11,957 INFO L87 Difference]: Start difference. First operand 567 states and 897 transitions. Second operand 5 states. [2019-09-08 04:12:12,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:12:12,026 INFO L93 Difference]: Finished difference Result 1104 states and 1766 transitions. [2019-09-08 04:12:12,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:12:12,027 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-09-08 04:12:12,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:12:12,032 INFO L225 Difference]: With dead ends: 1104 [2019-09-08 04:12:12,032 INFO L226 Difference]: Without dead ends: 567 [2019-09-08 04:12:12,036 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:12:12,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2019-09-08 04:12:12,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 567. [2019-09-08 04:12:12,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2019-09-08 04:12:12,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 896 transitions. [2019-09-08 04:12:12,058 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 896 transitions. Word has length 120 [2019-09-08 04:12:12,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:12:12,058 INFO L475 AbstractCegarLoop]: Abstraction has 567 states and 896 transitions. [2019-09-08 04:12:12,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:12:12,059 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 896 transitions. [2019-09-08 04:12:12,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 04:12:12,061 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:12:12,062 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:12:12,062 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:12:12,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:12:12,062 INFO L82 PathProgramCache]: Analyzing trace with hash -158807839, now seen corresponding path program 1 times [2019-09-08 04:12:12,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:12:12,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:12:12,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:12,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:12:12,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:12,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:12:12,251 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:12:12,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:12:12,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:12:12,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:12:12,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:12:12,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:12:12,253 INFO L87 Difference]: Start difference. First operand 567 states and 896 transitions. Second operand 5 states. [2019-09-08 04:12:12,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:12:12,322 INFO L93 Difference]: Finished difference Result 1104 states and 1764 transitions. [2019-09-08 04:12:12,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:12:12,323 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2019-09-08 04:12:12,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:12:12,328 INFO L225 Difference]: With dead ends: 1104 [2019-09-08 04:12:12,328 INFO L226 Difference]: Without dead ends: 567 [2019-09-08 04:12:12,332 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:12:12,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2019-09-08 04:12:12,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 567. [2019-09-08 04:12:12,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2019-09-08 04:12:12,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 895 transitions. [2019-09-08 04:12:12,353 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 895 transitions. Word has length 121 [2019-09-08 04:12:12,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:12:12,353 INFO L475 AbstractCegarLoop]: Abstraction has 567 states and 895 transitions. [2019-09-08 04:12:12,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:12:12,353 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 895 transitions. [2019-09-08 04:12:12,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 04:12:12,356 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:12:12,356 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:12:12,357 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:12:12,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:12:12,357 INFO L82 PathProgramCache]: Analyzing trace with hash 399449218, now seen corresponding path program 1 times [2019-09-08 04:12:12,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:12:12,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:12:12,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:12,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:12:12,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:12,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:12:12,479 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:12:12,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:12:12,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:12:12,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:12:12,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:12:12,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:12:12,481 INFO L87 Difference]: Start difference. First operand 567 states and 895 transitions. Second operand 5 states. [2019-09-08 04:12:12,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:12:12,553 INFO L93 Difference]: Finished difference Result 1104 states and 1762 transitions. [2019-09-08 04:12:12,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:12:12,554 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 122 [2019-09-08 04:12:12,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:12:12,560 INFO L225 Difference]: With dead ends: 1104 [2019-09-08 04:12:12,560 INFO L226 Difference]: Without dead ends: 567 [2019-09-08 04:12:12,565 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:12:12,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2019-09-08 04:12:12,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 567. [2019-09-08 04:12:12,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2019-09-08 04:12:12,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 894 transitions. [2019-09-08 04:12:12,588 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 894 transitions. Word has length 122 [2019-09-08 04:12:12,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:12:12,588 INFO L475 AbstractCegarLoop]: Abstraction has 567 states and 894 transitions. [2019-09-08 04:12:12,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:12:12,589 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 894 transitions. [2019-09-08 04:12:12,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 04:12:12,592 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:12:12,592 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:12:12,592 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:12:12,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:12:12,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1001725980, now seen corresponding path program 1 times [2019-09-08 04:12:12,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:12:12,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:12:12,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:12,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:12:12,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:12,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:12:12,780 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-08 04:12:12,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:12:12,780 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:12:12,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:12:13,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:12:13,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 2956 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 04:12:13,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:12:13,392 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 04:12:13,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:12:13,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2019-09-08 04:12:13,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 04:12:13,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 04:12:13,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:12:13,409 INFO L87 Difference]: Start difference. First operand 567 states and 894 transitions. Second operand 12 states. [2019-09-08 04:12:19,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:12:19,076 INFO L93 Difference]: Finished difference Result 3159 states and 5198 transitions. [2019-09-08 04:12:19,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 04:12:19,076 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 123 [2019-09-08 04:12:19,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:12:19,097 INFO L225 Difference]: With dead ends: 3159 [2019-09-08 04:12:19,097 INFO L226 Difference]: Without dead ends: 2626 [2019-09-08 04:12:19,104 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=844, Unknown=0, NotChecked=0, Total=992 [2019-09-08 04:12:19,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2626 states. [2019-09-08 04:12:19,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2626 to 2492. [2019-09-08 04:12:19,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2492 states. [2019-09-08 04:12:19,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2492 states to 2492 states and 4044 transitions. [2019-09-08 04:12:19,259 INFO L78 Accepts]: Start accepts. Automaton has 2492 states and 4044 transitions. Word has length 123 [2019-09-08 04:12:19,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:12:19,262 INFO L475 AbstractCegarLoop]: Abstraction has 2492 states and 4044 transitions. [2019-09-08 04:12:19,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 04:12:19,262 INFO L276 IsEmpty]: Start isEmpty. Operand 2492 states and 4044 transitions. [2019-09-08 04:12:19,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 04:12:19,266 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:12:19,267 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:12:19,267 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:12:19,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:12:19,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1688103194, now seen corresponding path program 1 times [2019-09-08 04:12:19,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:12:19,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:12:19,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:19,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:12:19,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:19,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:12:19,521 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:12:19,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:12:19,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 04:12:19,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 04:12:19,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 04:12:19,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:12:19,523 INFO L87 Difference]: Start difference. First operand 2492 states and 4044 transitions. Second operand 8 states. [2019-09-08 04:12:22,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:12:22,978 INFO L93 Difference]: Finished difference Result 8112 states and 13240 transitions. [2019-09-08 04:12:22,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 04:12:22,979 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 124 [2019-09-08 04:12:22,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:12:23,040 INFO L225 Difference]: With dead ends: 8112 [2019-09-08 04:12:23,041 INFO L226 Difference]: Without dead ends: 5654 [2019-09-08 04:12:23,060 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:12:23,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5654 states. [2019-09-08 04:12:23,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5654 to 3794. [2019-09-08 04:12:23,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3794 states. [2019-09-08 04:12:23,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3794 states to 3794 states and 6076 transitions. [2019-09-08 04:12:23,336 INFO L78 Accepts]: Start accepts. Automaton has 3794 states and 6076 transitions. Word has length 124 [2019-09-08 04:12:23,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:12:23,337 INFO L475 AbstractCegarLoop]: Abstraction has 3794 states and 6076 transitions. [2019-09-08 04:12:23,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 04:12:23,337 INFO L276 IsEmpty]: Start isEmpty. Operand 3794 states and 6076 transitions. [2019-09-08 04:12:23,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-08 04:12:23,341 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:12:23,341 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:12:23,341 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:12:23,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:12:23,342 INFO L82 PathProgramCache]: Analyzing trace with hash 2088481012, now seen corresponding path program 1 times [2019-09-08 04:12:23,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:12:23,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:12:23,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:23,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:12:23,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:23,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:12:23,607 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:12:23,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:12:23,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:12:23,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:12:23,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:12:23,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:12:23,611 INFO L87 Difference]: Start difference. First operand 3794 states and 6076 transitions. Second operand 7 states. [2019-09-08 04:12:26,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:12:26,094 INFO L93 Difference]: Finished difference Result 11224 states and 18398 transitions. [2019-09-08 04:12:26,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:12:26,095 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 131 [2019-09-08 04:12:26,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:12:26,166 INFO L225 Difference]: With dead ends: 11224 [2019-09-08 04:12:26,166 INFO L226 Difference]: Without dead ends: 7464 [2019-09-08 04:12:26,199 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:12:26,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7464 states. [2019-09-08 04:12:26,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7464 to 7376. [2019-09-08 04:12:26,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7376 states. [2019-09-08 04:12:26,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7376 states to 7376 states and 11954 transitions. [2019-09-08 04:12:26,633 INFO L78 Accepts]: Start accepts. Automaton has 7376 states and 11954 transitions. Word has length 131 [2019-09-08 04:12:26,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:12:26,634 INFO L475 AbstractCegarLoop]: Abstraction has 7376 states and 11954 transitions. [2019-09-08 04:12:26,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:12:26,634 INFO L276 IsEmpty]: Start isEmpty. Operand 7376 states and 11954 transitions. [2019-09-08 04:12:26,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-08 04:12:26,640 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:12:26,640 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:12:26,641 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:12:26,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:12:26,641 INFO L82 PathProgramCache]: Analyzing trace with hash 757651711, now seen corresponding path program 1 times [2019-09-08 04:12:26,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:12:26,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:12:26,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:26,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:12:26,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:26,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:12:26,785 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:12:26,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:12:26,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:12:26,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:12:26,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:12:26,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:12:26,789 INFO L87 Difference]: Start difference. First operand 7376 states and 11954 transitions. Second operand 4 states. [2019-09-08 04:12:27,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:12:27,148 INFO L93 Difference]: Finished difference Result 14405 states and 23608 transitions. [2019-09-08 04:12:27,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:12:27,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2019-09-08 04:12:27,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:12:27,249 INFO L225 Difference]: With dead ends: 14405 [2019-09-08 04:12:27,250 INFO L226 Difference]: Without dead ends: 7051 [2019-09-08 04:12:27,303 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:12:27,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7051 states. [2019-09-08 04:12:27,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7051 to 7029. [2019-09-08 04:12:27,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7029 states. [2019-09-08 04:12:27,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7029 states to 7029 states and 11360 transitions. [2019-09-08 04:12:27,637 INFO L78 Accepts]: Start accepts. Automaton has 7029 states and 11360 transitions. Word has length 132 [2019-09-08 04:12:27,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:12:27,638 INFO L475 AbstractCegarLoop]: Abstraction has 7029 states and 11360 transitions. [2019-09-08 04:12:27,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:12:27,638 INFO L276 IsEmpty]: Start isEmpty. Operand 7029 states and 11360 transitions. [2019-09-08 04:12:27,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-08 04:12:27,641 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:12:27,641 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:12:27,642 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:12:27,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:12:27,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1934499299, now seen corresponding path program 1 times [2019-09-08 04:12:27,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:12:27,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:12:27,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:27,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:12:27,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:27,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:12:27,821 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-08 04:12:27,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:12:27,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:12:27,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:12:27,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:12:27,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:12:27,823 INFO L87 Difference]: Start difference. First operand 7029 states and 11360 transitions. Second operand 7 states. [2019-09-08 04:12:31,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:12:31,045 INFO L93 Difference]: Finished difference Result 21011 states and 34853 transitions. [2019-09-08 04:12:31,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:12:31,046 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 140 [2019-09-08 04:12:31,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:12:31,177 INFO L225 Difference]: With dead ends: 21011 [2019-09-08 04:12:31,177 INFO L226 Difference]: Without dead ends: 14016 [2019-09-08 04:12:31,227 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:12:31,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14016 states. [2019-09-08 04:12:32,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14016 to 13892. [2019-09-08 04:12:32,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13892 states. [2019-09-08 04:12:32,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13892 states to 13892 states and 22824 transitions. [2019-09-08 04:12:32,618 INFO L78 Accepts]: Start accepts. Automaton has 13892 states and 22824 transitions. Word has length 140 [2019-09-08 04:12:32,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:12:32,618 INFO L475 AbstractCegarLoop]: Abstraction has 13892 states and 22824 transitions. [2019-09-08 04:12:32,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:12:32,619 INFO L276 IsEmpty]: Start isEmpty. Operand 13892 states and 22824 transitions. [2019-09-08 04:12:32,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-08 04:12:32,622 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:12:32,622 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:12:32,623 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:12:32,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:12:32,623 INFO L82 PathProgramCache]: Analyzing trace with hash 690359214, now seen corresponding path program 1 times [2019-09-08 04:12:32,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:12:32,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:12:32,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:32,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:12:32,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:32,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:12:32,751 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 04:12:32,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:12:32,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:12:32,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:12:32,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:12:32,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:12:32,753 INFO L87 Difference]: Start difference. First operand 13892 states and 22824 transitions. Second operand 4 states. [2019-09-08 04:12:33,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:12:33,257 INFO L93 Difference]: Finished difference Result 27487 states and 45726 transitions. [2019-09-08 04:12:33,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:12:33,258 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-09-08 04:12:33,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:12:33,388 INFO L225 Difference]: With dead ends: 27487 [2019-09-08 04:12:33,389 INFO L226 Difference]: Without dead ends: 13617 [2019-09-08 04:12:33,468 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:12:33,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13617 states. [2019-09-08 04:12:34,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13617 to 13577. [2019-09-08 04:12:34,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13577 states. [2019-09-08 04:12:34,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13577 states to 13577 states and 22257 transitions. [2019-09-08 04:12:34,330 INFO L78 Accepts]: Start accepts. Automaton has 13577 states and 22257 transitions. Word has length 141 [2019-09-08 04:12:34,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:12:34,331 INFO L475 AbstractCegarLoop]: Abstraction has 13577 states and 22257 transitions. [2019-09-08 04:12:34,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:12:34,331 INFO L276 IsEmpty]: Start isEmpty. Operand 13577 states and 22257 transitions. [2019-09-08 04:12:34,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-08 04:12:34,340 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:12:34,340 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:12:34,340 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:12:34,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:12:34,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1557703711, now seen corresponding path program 1 times [2019-09-08 04:12:34,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:12:34,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:12:34,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:34,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:12:34,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:34,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:12:34,515 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 04:12:34,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:12:34,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:12:34,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:12:34,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:12:34,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:12:34,517 INFO L87 Difference]: Start difference. First operand 13577 states and 22257 transitions. Second operand 7 states. [2019-09-08 04:12:38,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:12:38,690 INFO L93 Difference]: Finished difference Result 40771 states and 69122 transitions. [2019-09-08 04:12:38,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:12:38,691 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 150 [2019-09-08 04:12:38,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:12:38,949 INFO L225 Difference]: With dead ends: 40771 [2019-09-08 04:12:38,950 INFO L226 Difference]: Without dead ends: 27228 [2019-09-08 04:12:39,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:12:39,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27228 states. [2019-09-08 04:12:40,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27228 to 27044. [2019-09-08 04:12:40,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27044 states. [2019-09-08 04:12:40,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27044 states to 27044 states and 45514 transitions. [2019-09-08 04:12:40,480 INFO L78 Accepts]: Start accepts. Automaton has 27044 states and 45514 transitions. Word has length 150 [2019-09-08 04:12:40,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:12:40,482 INFO L475 AbstractCegarLoop]: Abstraction has 27044 states and 45514 transitions. [2019-09-08 04:12:40,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:12:40,483 INFO L276 IsEmpty]: Start isEmpty. Operand 27044 states and 45514 transitions. [2019-09-08 04:12:40,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-08 04:12:40,488 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:12:40,488 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:12:40,489 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:12:40,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:12:40,489 INFO L82 PathProgramCache]: Analyzing trace with hash -422833886, now seen corresponding path program 1 times [2019-09-08 04:12:40,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:12:40,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:12:40,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:40,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:12:40,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:40,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:12:40,843 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-08 04:12:40,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:12:40,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:12:40,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:12:40,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:12:40,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:12:40,845 INFO L87 Difference]: Start difference. First operand 27044 states and 45514 transitions. Second operand 4 states. [2019-09-08 04:12:41,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:12:41,689 INFO L93 Difference]: Finished difference Result 53841 states and 92141 transitions. [2019-09-08 04:12:41,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:12:41,690 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-09-08 04:12:41,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:12:41,992 INFO L225 Difference]: With dead ends: 53841 [2019-09-08 04:12:41,992 INFO L226 Difference]: Without dead ends: 26819 [2019-09-08 04:12:42,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:12:42,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26819 states. [2019-09-08 04:12:44,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26819 to 26743. [2019-09-08 04:12:44,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26743 states. [2019-09-08 04:12:44,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26743 states to 26743 states and 44930 transitions. [2019-09-08 04:12:44,809 INFO L78 Accepts]: Start accepts. Automaton has 26743 states and 44930 transitions. Word has length 151 [2019-09-08 04:12:44,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:12:44,810 INFO L475 AbstractCegarLoop]: Abstraction has 26743 states and 44930 transitions. [2019-09-08 04:12:44,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:12:44,810 INFO L276 IsEmpty]: Start isEmpty. Operand 26743 states and 44930 transitions. [2019-09-08 04:12:44,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 04:12:44,815 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:12:44,815 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:12:44,815 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:12:44,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:12:44,816 INFO L82 PathProgramCache]: Analyzing trace with hash -112818928, now seen corresponding path program 1 times [2019-09-08 04:12:44,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:12:44,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:12:44,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:44,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:12:44,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:44,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:12:44,970 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-08 04:12:44,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:12:44,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:12:44,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:12:44,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:12:44,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:12:44,972 INFO L87 Difference]: Start difference. First operand 26743 states and 44930 transitions. Second operand 7 states. [2019-09-08 04:12:48,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:12:48,799 INFO L93 Difference]: Finished difference Result 80441 states and 142035 transitions. [2019-09-08 04:12:48,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:12:48,800 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 161 [2019-09-08 04:12:48,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:12:49,262 INFO L225 Difference]: With dead ends: 80441 [2019-09-08 04:12:49,262 INFO L226 Difference]: Without dead ends: 53732 [2019-09-08 04:12:49,460 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:12:49,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53732 states. [2019-09-08 04:12:52,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53732 to 53448. [2019-09-08 04:12:52,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53448 states. [2019-09-08 04:12:53,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53448 states to 53448 states and 94002 transitions. [2019-09-08 04:12:53,234 INFO L78 Accepts]: Start accepts. Automaton has 53448 states and 94002 transitions. Word has length 161 [2019-09-08 04:12:53,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:12:53,235 INFO L475 AbstractCegarLoop]: Abstraction has 53448 states and 94002 transitions. [2019-09-08 04:12:53,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:12:53,235 INFO L276 IsEmpty]: Start isEmpty. Operand 53448 states and 94002 transitions. [2019-09-08 04:12:53,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-08 04:12:53,240 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:12:53,240 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:12:53,240 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:12:53,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:12:53,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1509966987, now seen corresponding path program 1 times [2019-09-08 04:12:53,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:12:53,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:12:53,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:53,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:12:53,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:53,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:12:53,376 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 04:12:53,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:12:53,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:12:53,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:12:53,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:12:53,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:12:53,377 INFO L87 Difference]: Start difference. First operand 53448 states and 94002 transitions. Second operand 4 states. [2019-09-08 04:12:55,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:12:55,341 INFO L93 Difference]: Finished difference Result 106498 states and 192101 transitions. [2019-09-08 04:12:55,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:12:55,341 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-09-08 04:12:55,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:12:55,646 INFO L225 Difference]: With dead ends: 106498 [2019-09-08 04:12:55,646 INFO L226 Difference]: Without dead ends: 53066 [2019-09-08 04:12:55,948 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:12:56,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53066 states. [2019-09-08 04:12:59,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53066 to 52922. [2019-09-08 04:12:59,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52922 states. [2019-09-08 04:13:00,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52922 states to 52922 states and 92866 transitions. [2019-09-08 04:13:00,205 INFO L78 Accepts]: Start accepts. Automaton has 52922 states and 92866 transitions. Word has length 162 [2019-09-08 04:13:00,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:13:00,206 INFO L475 AbstractCegarLoop]: Abstraction has 52922 states and 92866 transitions. [2019-09-08 04:13:00,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:13:00,207 INFO L276 IsEmpty]: Start isEmpty. Operand 52922 states and 92866 transitions. [2019-09-08 04:13:00,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-08 04:13:00,209 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:13:00,210 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:13:00,210 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:13:00,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:13:00,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1583523325, now seen corresponding path program 1 times [2019-09-08 04:13:00,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:13:00,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:13:00,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:13:00,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:13:00,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:13:00,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:13:00,423 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-08 04:13:00,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:13:00,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 04:13:00,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 04:13:00,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 04:13:00,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:13:00,425 INFO L87 Difference]: Start difference. First operand 52922 states and 92866 transitions. Second operand 12 states. [2019-09-08 04:13:07,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:13:07,707 INFO L93 Difference]: Finished difference Result 180294 states and 334798 transitions. [2019-09-08 04:13:07,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-08 04:13:07,708 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 163 [2019-09-08 04:13:07,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:13:12,100 INFO L225 Difference]: With dead ends: 180294 [2019-09-08 04:13:12,101 INFO L226 Difference]: Without dead ends: 127406 [2019-09-08 04:13:12,381 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=1240, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 04:13:12,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127406 states. [2019-09-08 04:13:15,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127406 to 127074. [2019-09-08 04:13:15,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127074 states. [2019-09-08 04:13:17,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127074 states to 127074 states and 224810 transitions. [2019-09-08 04:13:17,535 INFO L78 Accepts]: Start accepts. Automaton has 127074 states and 224810 transitions. Word has length 163 [2019-09-08 04:13:17,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:13:17,536 INFO L475 AbstractCegarLoop]: Abstraction has 127074 states and 224810 transitions. [2019-09-08 04:13:17,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 04:13:17,537 INFO L276 IsEmpty]: Start isEmpty. Operand 127074 states and 224810 transitions. [2019-09-08 04:13:17,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-08 04:13:17,539 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:13:17,539 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:13:17,539 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:13:17,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:13:17,540 INFO L82 PathProgramCache]: Analyzing trace with hash 315714966, now seen corresponding path program 1 times [2019-09-08 04:13:17,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:13:17,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:13:17,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:13:17,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:13:17,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:13:17,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:13:17,726 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-08 04:13:17,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:13:17,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 04:13:17,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 04:13:17,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 04:13:17,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:13:17,728 INFO L87 Difference]: Start difference. First operand 127074 states and 224810 transitions. Second operand 12 states. [2019-09-08 04:13:35,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:13:35,861 INFO L93 Difference]: Finished difference Result 415971 states and 763113 transitions. [2019-09-08 04:13:35,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-08 04:13:35,864 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 164 [2019-09-08 04:13:35,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:13:37,694 INFO L225 Difference]: With dead ends: 415971 [2019-09-08 04:13:37,694 INFO L226 Difference]: Without dead ends: 288899 [2019-09-08 04:13:46,132 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=1240, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 04:13:46,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288899 states. [2019-09-08 04:13:55,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288899 to 284095. [2019-09-08 04:13:55,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284095 states. [2019-09-08 04:14:07,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284095 states to 284095 states and 500261 transitions. [2019-09-08 04:14:07,721 INFO L78 Accepts]: Start accepts. Automaton has 284095 states and 500261 transitions. Word has length 164 [2019-09-08 04:14:07,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:14:07,722 INFO L475 AbstractCegarLoop]: Abstraction has 284095 states and 500261 transitions. [2019-09-08 04:14:07,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 04:14:07,722 INFO L276 IsEmpty]: Start isEmpty. Operand 284095 states and 500261 transitions. [2019-09-08 04:14:07,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-08 04:14:07,725 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:14:07,725 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:07,725 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:14:07,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:14:07,726 INFO L82 PathProgramCache]: Analyzing trace with hash -441147169, now seen corresponding path program 1 times [2019-09-08 04:14:07,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:14:07,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:14:07,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:14:07,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:14:07,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:14:07,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:14:07,926 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-08 04:14:07,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:14:07,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 04:14:07,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 04:14:07,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 04:14:07,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:14:07,928 INFO L87 Difference]: Start difference. First operand 284095 states and 500261 transitions. Second operand 12 states. [2019-09-08 04:14:42,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:14:42,150 INFO L93 Difference]: Finished difference Result 795596 states and 1443118 transitions. [2019-09-08 04:14:42,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-08 04:14:42,151 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 165 [2019-09-08 04:14:42,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:14:57,609 INFO L225 Difference]: With dead ends: 795596 [2019-09-08 04:14:57,610 INFO L226 Difference]: Without dead ends: 510791 [2019-09-08 04:15:09,413 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=1240, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 04:15:09,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510791 states. [2019-09-08 04:15:39,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510791 to 500031. [2019-09-08 04:15:39,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500031 states. [2019-09-08 04:15:59,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500031 states to 500031 states and 875383 transitions. [2019-09-08 04:15:59,952 INFO L78 Accepts]: Start accepts. Automaton has 500031 states and 875383 transitions. Word has length 165 [2019-09-08 04:15:59,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:15:59,952 INFO L475 AbstractCegarLoop]: Abstraction has 500031 states and 875383 transitions. [2019-09-08 04:15:59,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 04:15:59,952 INFO L276 IsEmpty]: Start isEmpty. Operand 500031 states and 875383 transitions. [2019-09-08 04:15:59,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-08 04:15:59,954 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:15:59,954 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:59,954 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:15:59,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:15:59,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1932743886, now seen corresponding path program 1 times [2019-09-08 04:15:59,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:15:59,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:15:59,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:15:59,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:15:59,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:15:59,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:16:00,154 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-08 04:16:00,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:16:00,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 04:16:00,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 04:16:00,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 04:16:00,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:16:00,161 INFO L87 Difference]: Start difference. First operand 500031 states and 875383 transitions. Second operand 12 states. [2019-09-08 04:17:38,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:17:38,827 INFO L93 Difference]: Finished difference Result 1486118 states and 2683931 transitions. [2019-09-08 04:17:38,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-08 04:17:38,828 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 166 [2019-09-08 04:17:38,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:18:05,799 INFO L225 Difference]: With dead ends: 1486118 [2019-09-08 04:18:05,799 INFO L226 Difference]: Without dead ends: 985277