java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/product-lines/elevator_spec2_product31.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 12:22:36,988 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 12:22:36,990 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 12:22:37,002 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 12:22:37,003 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 12:22:37,004 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 12:22:37,005 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 12:22:37,007 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 12:22:37,009 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 12:22:37,010 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 12:22:37,011 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 12:22:37,012 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 12:22:37,012 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 12:22:37,013 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 12:22:37,014 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 12:22:37,015 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 12:22:37,016 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 12:22:37,017 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 12:22:37,019 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 12:22:37,021 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 12:22:37,022 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 12:22:37,023 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 12:22:37,024 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 12:22:37,025 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 12:22:37,027 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 12:22:37,027 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 12:22:37,027 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 12:22:37,028 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 12:22:37,029 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 12:22:37,030 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 12:22:37,030 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 12:22:37,030 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 12:22:37,031 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 12:22:37,032 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 12:22:37,034 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 12:22:37,034 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 12:22:37,035 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 12:22:37,035 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 12:22:37,035 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 12:22:37,038 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 12:22:37,039 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 12:22:37,040 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 12:22:37,061 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 12:22:37,061 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 12:22:37,065 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 12:22:37,065 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 12:22:37,065 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 12:22:37,066 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 12:22:37,066 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 12:22:37,066 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 12:22:37,066 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 12:22:37,066 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 12:22:37,066 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 12:22:37,067 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 12:22:37,067 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 12:22:37,067 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 12:22:37,067 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 12:22:37,067 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 12:22:37,068 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 12:22:37,068 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 12:22:37,068 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 12:22:37,068 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 12:22:37,068 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 12:22:37,069 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:22:37,069 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 12:22:37,069 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 12:22:37,069 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 12:22:37,069 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 12:22:37,070 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 12:22:37,070 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 12:22:37,070 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 12:22:37,102 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 12:22:37,114 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 12:22:37,118 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 12:22:37,120 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 12:22:37,120 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 12:22:37,121 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product31.cil.c [2019-10-02 12:22:37,184 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e60b58a2/dab9feab04b146c0a0bf68718a740bca/FLAGf9fc2fe25 [2019-10-02 12:22:37,854 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 12:22:37,857 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product31.cil.c [2019-10-02 12:22:37,898 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e60b58a2/dab9feab04b146c0a0bf68718a740bca/FLAGf9fc2fe25 [2019-10-02 12:22:38,036 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e60b58a2/dab9feab04b146c0a0bf68718a740bca [2019-10-02 12:22:38,050 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 12:22:38,052 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 12:22:38,054 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 12:22:38,054 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 12:22:38,058 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 12:22:38,060 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:22:38" (1/1) ... [2019-10-02 12:22:38,063 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13fff8a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:22:38, skipping insertion in model container [2019-10-02 12:22:38,064 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:22:38" (1/1) ... [2019-10-02 12:22:38,072 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 12:22:38,168 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 12:22:38,828 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:22:38,854 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 12:22:39,032 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:22:39,112 INFO L192 MainTranslator]: Completed translation [2019-10-02 12:22:39,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:22:39 WrapperNode [2019-10-02 12:22:39,113 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 12:22:39,113 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 12:22:39,113 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 12:22:39,114 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 12:22:39,125 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:22:39" (1/1) ... [2019-10-02 12:22:39,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:22:39" (1/1) ... [2019-10-02 12:22:39,162 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:22:39" (1/1) ... [2019-10-02 12:22:39,162 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:22:39" (1/1) ... [2019-10-02 12:22:39,241 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:22:39" (1/1) ... [2019-10-02 12:22:39,286 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:22:39" (1/1) ... [2019-10-02 12:22:39,317 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:22:39" (1/1) ... [2019-10-02 12:22:39,347 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 12:22:39,349 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 12:22:39,349 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 12:22:39,350 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 12:22:39,351 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:22:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:22:39,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 12:22:39,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 12:22:39,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 12:22:39,436 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-02 12:22:39,437 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-02 12:22:39,437 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-02 12:22:39,437 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-02 12:22:39,437 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-02 12:22:39,438 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-02 12:22:39,438 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-02 12:22:39,438 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-02 12:22:39,439 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-02 12:22:39,439 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-02 12:22:39,439 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-02 12:22:39,440 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-10-02 12:22:39,440 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-10-02 12:22:39,442 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-10-02 12:22:39,443 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-10-02 12:22:39,443 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-02 12:22:39,444 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-02 12:22:39,444 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-02 12:22:39,444 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-02 12:22:39,444 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-02 12:22:39,445 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-02 12:22:39,445 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-02 12:22:39,445 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-02 12:22:39,445 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-02 12:22:39,445 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-02 12:22:39,445 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-02 12:22:39,446 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-02 12:22:39,446 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-02 12:22:39,446 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-02 12:22:39,447 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-02 12:22:39,447 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-02 12:22:39,447 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 12:22:39,447 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-02 12:22:39,447 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 12:22:39,447 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-02 12:22:39,448 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-02 12:22:39,448 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-02 12:22:39,448 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-02 12:22:39,448 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-02 12:22:39,448 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-02 12:22:39,448 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-10-02 12:22:39,449 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-02 12:22:39,449 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-02 12:22:39,450 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-02 12:22:39,450 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-02 12:22:39,450 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-02 12:22:39,450 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-02 12:22:39,450 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-02 12:22:39,451 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-02 12:22:39,451 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-02 12:22:39,451 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-02 12:22:39,451 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-10-02 12:22:39,451 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-02 12:22:39,451 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-02 12:22:39,452 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-02 12:22:39,452 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-02 12:22:39,452 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-02 12:22:39,452 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-02 12:22:39,452 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-02 12:22:39,453 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-02 12:22:39,453 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-02 12:22:39,453 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-02 12:22:39,454 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-02 12:22:39,454 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-02 12:22:39,454 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-02 12:22:39,454 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-02 12:22:39,455 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 12:22:39,455 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 12:22:39,455 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 12:22:39,455 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 12:22:39,455 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 12:22:39,456 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 12:22:39,456 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 12:22:39,457 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 12:22:39,457 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 12:22:39,457 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 12:22:39,457 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 12:22:39,457 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 12:22:39,457 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 12:22:39,458 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 12:22:39,458 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-02 12:22:39,459 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-02 12:22:39,459 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-02 12:22:39,460 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-02 12:22:39,460 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-02 12:22:39,460 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-02 12:22:39,460 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-02 12:22:39,460 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-02 12:22:39,461 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-02 12:22:39,461 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-02 12:22:39,461 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-02 12:22:39,461 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 12:22:39,462 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-02 12:22:39,462 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-02 12:22:39,462 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-10-02 12:22:39,462 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-10-02 12:22:39,462 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-10-02 12:22:39,462 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-10-02 12:22:39,462 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-02 12:22:39,463 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-02 12:22:39,463 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-02 12:22:39,463 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-02 12:22:39,463 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-02 12:22:39,463 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-02 12:22:39,463 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-02 12:22:39,463 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 12:22:39,464 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-02 12:22:39,464 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-02 12:22:39,464 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-02 12:22:39,464 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-02 12:22:39,464 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-02 12:22:39,464 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-02 12:22:39,464 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-02 12:22:39,465 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-02 12:22:39,465 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-02 12:22:39,465 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-02 12:22:39,465 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-02 12:22:39,466 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-02 12:22:39,466 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-02 12:22:39,466 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-02 12:22:39,466 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-02 12:22:39,468 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 12:22:39,468 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 12:22:39,468 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-02 12:22:39,468 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 12:22:39,468 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 12:22:39,468 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 12:22:39,468 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 12:22:39,469 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 12:22:39,469 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-02 12:22:39,469 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-02 12:22:39,469 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-02 12:22:39,470 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-02 12:22:39,470 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-02 12:22:39,470 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-02 12:22:39,470 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-02 12:22:39,471 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-02 12:22:39,474 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-10-02 12:22:39,475 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-02 12:22:39,475 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-02 12:22:39,476 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-02 12:22:39,483 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-02 12:22:39,483 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-02 12:22:39,483 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-10-02 12:22:39,484 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-02 12:22:39,484 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-02 12:22:39,484 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-02 12:22:39,484 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-02 12:22:39,485 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-02 12:22:39,485 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-02 12:22:39,485 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-02 12:22:39,485 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-02 12:22:39,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 12:22:39,485 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-02 12:22:39,486 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 12:22:39,486 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 12:22:39,486 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 12:22:39,486 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 12:22:39,486 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 12:22:39,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 12:22:39,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 12:22:39,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 12:22:39,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 12:22:39,487 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 12:22:39,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 12:22:39,487 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 12:22:39,487 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 12:22:39,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 12:22:39,487 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 12:22:39,488 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 12:22:39,488 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 12:22:39,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 12:22:39,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 12:22:39,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 12:22:41,968 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 12:22:41,969 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-02 12:22:41,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:22:41 BoogieIcfgContainer [2019-10-02 12:22:41,971 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 12:22:41,972 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 12:22:41,972 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 12:22:41,975 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 12:22:41,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:22:38" (1/3) ... [2019-10-02 12:22:41,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d690bec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:22:41, skipping insertion in model container [2019-10-02 12:22:41,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:22:39" (2/3) ... [2019-10-02 12:22:41,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d690bec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:22:41, skipping insertion in model container [2019-10-02 12:22:41,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:22:41" (3/3) ... [2019-10-02 12:22:41,979 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product31.cil.c [2019-10-02 12:22:41,989 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 12:22:42,002 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 12:22:42,020 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 12:22:42,076 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 12:22:42,077 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 12:22:42,077 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 12:22:42,077 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 12:22:42,077 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 12:22:42,077 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 12:22:42,077 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 12:22:42,077 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 12:22:42,078 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 12:22:42,119 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states. [2019-10-02 12:22:42,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-02 12:22:42,154 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:22:42,155 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:22:42,158 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:22:42,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:22:42,162 INFO L82 PathProgramCache]: Analyzing trace with hash 841338012, now seen corresponding path program 1 times [2019-10-02 12:22:42,163 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:22:42,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:22:42,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:22:42,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:22:42,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:22:42,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:22:42,803 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:22:42,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:22:42,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:22:42,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:22:42,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:22:42,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:22:42,830 INFO L87 Difference]: Start difference. First operand 817 states. Second operand 4 states. [2019-10-02 12:22:43,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:22:43,103 INFO L93 Difference]: Finished difference Result 1297 states and 2075 transitions. [2019-10-02 12:22:43,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:22:43,105 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-10-02 12:22:43,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:22:43,133 INFO L225 Difference]: With dead ends: 1297 [2019-10-02 12:22:43,133 INFO L226 Difference]: Without dead ends: 657 [2019-10-02 12:22:43,146 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:22:43,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-10-02 12:22:43,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2019-10-02 12:22:43,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-10-02 12:22:43,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1039 transitions. [2019-10-02 12:22:43,269 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1039 transitions. Word has length 133 [2019-10-02 12:22:43,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:22:43,269 INFO L475 AbstractCegarLoop]: Abstraction has 657 states and 1039 transitions. [2019-10-02 12:22:43,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:22:43,270 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1039 transitions. [2019-10-02 12:22:43,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-02 12:22:43,280 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:22:43,281 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:22:43,281 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:22:43,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:22:43,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1822294424, now seen corresponding path program 1 times [2019-10-02 12:22:43,282 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:22:43,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:22:43,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:22:43,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:22:43,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:22:43,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:22:43,506 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:22:43,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:22:43,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:22:43,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:22:43,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:22:43,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:22:43,510 INFO L87 Difference]: Start difference. First operand 657 states and 1039 transitions. Second operand 4 states. [2019-10-02 12:22:43,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:22:43,611 INFO L93 Difference]: Finished difference Result 1277 states and 2036 transitions. [2019-10-02 12:22:43,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:22:43,612 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-10-02 12:22:43,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:22:43,621 INFO L225 Difference]: With dead ends: 1277 [2019-10-02 12:22:43,622 INFO L226 Difference]: Without dead ends: 657 [2019-10-02 12:22:43,627 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:22:43,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-10-02 12:22:43,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2019-10-02 12:22:43,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-10-02 12:22:43,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1038 transitions. [2019-10-02 12:22:43,691 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1038 transitions. Word has length 136 [2019-10-02 12:22:43,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:22:43,696 INFO L475 AbstractCegarLoop]: Abstraction has 657 states and 1038 transitions. [2019-10-02 12:22:43,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:22:43,696 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1038 transitions. [2019-10-02 12:22:43,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-02 12:22:43,703 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:22:43,704 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:22:43,704 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:22:43,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:22:43,705 INFO L82 PathProgramCache]: Analyzing trace with hash -122460853, now seen corresponding path program 1 times [2019-10-02 12:22:43,705 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:22:43,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:22:43,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:22:43,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:22:43,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:22:43,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:22:43,876 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:22:43,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:22:43,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:22:43,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:22:43,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:22:43,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:22:43,878 INFO L87 Difference]: Start difference. First operand 657 states and 1038 transitions. Second operand 4 states. [2019-10-02 12:22:43,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:22:43,956 INFO L93 Difference]: Finished difference Result 1277 states and 2035 transitions. [2019-10-02 12:22:43,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:22:43,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-10-02 12:22:43,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:22:43,962 INFO L225 Difference]: With dead ends: 1277 [2019-10-02 12:22:43,962 INFO L226 Difference]: Without dead ends: 657 [2019-10-02 12:22:44,003 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:22:44,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-10-02 12:22:44,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2019-10-02 12:22:44,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-10-02 12:22:44,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1037 transitions. [2019-10-02 12:22:44,033 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1037 transitions. Word has length 137 [2019-10-02 12:22:44,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:22:44,033 INFO L475 AbstractCegarLoop]: Abstraction has 657 states and 1037 transitions. [2019-10-02 12:22:44,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:22:44,034 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1037 transitions. [2019-10-02 12:22:44,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-02 12:22:44,039 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:22:44,039 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:22:44,039 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:22:44,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:22:44,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1796711564, now seen corresponding path program 1 times [2019-10-02 12:22:44,040 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:22:44,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:22:44,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:22:44,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:22:44,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:22:44,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:22:44,167 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:22:44,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:22:44,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:22:44,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:22:44,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:22:44,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:22:44,169 INFO L87 Difference]: Start difference. First operand 657 states and 1037 transitions. Second operand 4 states. [2019-10-02 12:22:44,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:22:44,242 INFO L93 Difference]: Finished difference Result 1277 states and 2034 transitions. [2019-10-02 12:22:44,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:22:44,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-10-02 12:22:44,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:22:44,248 INFO L225 Difference]: With dead ends: 1277 [2019-10-02 12:22:44,248 INFO L226 Difference]: Without dead ends: 657 [2019-10-02 12:22:44,251 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:22:44,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-10-02 12:22:44,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2019-10-02 12:22:44,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-10-02 12:22:44,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1036 transitions. [2019-10-02 12:22:44,284 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1036 transitions. Word has length 138 [2019-10-02 12:22:44,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:22:44,286 INFO L475 AbstractCegarLoop]: Abstraction has 657 states and 1036 transitions. [2019-10-02 12:22:44,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:22:44,287 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1036 transitions. [2019-10-02 12:22:44,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-02 12:22:44,292 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:22:44,293 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:22:44,293 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:22:44,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:22:44,293 INFO L82 PathProgramCache]: Analyzing trace with hash 619711975, now seen corresponding path program 1 times [2019-10-02 12:22:44,293 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:22:44,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:22:44,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:22:44,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:22:44,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:22:44,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:22:44,449 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:22:44,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:22:44,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:22:44,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:22:44,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:22:44,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:22:44,452 INFO L87 Difference]: Start difference. First operand 657 states and 1036 transitions. Second operand 4 states. [2019-10-02 12:22:44,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:22:44,524 INFO L93 Difference]: Finished difference Result 1277 states and 2033 transitions. [2019-10-02 12:22:44,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:22:44,525 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-10-02 12:22:44,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:22:44,530 INFO L225 Difference]: With dead ends: 1277 [2019-10-02 12:22:44,530 INFO L226 Difference]: Without dead ends: 657 [2019-10-02 12:22:44,534 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:22:44,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-10-02 12:22:44,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2019-10-02 12:22:44,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-10-02 12:22:44,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1035 transitions. [2019-10-02 12:22:44,563 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1035 transitions. Word has length 139 [2019-10-02 12:22:44,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:22:44,564 INFO L475 AbstractCegarLoop]: Abstraction has 657 states and 1035 transitions. [2019-10-02 12:22:44,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:22:44,564 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1035 transitions. [2019-10-02 12:22:44,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-02 12:22:44,570 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:22:44,571 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:22:44,571 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:22:44,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:22:44,571 INFO L82 PathProgramCache]: Analyzing trace with hash 998018384, now seen corresponding path program 1 times [2019-10-02 12:22:44,571 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:22:44,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:22:44,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:22:44,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:22:44,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:22:44,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:22:44,779 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:22:44,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:22:44,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 12:22:44,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 12:22:44,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 12:22:44,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:22:44,781 INFO L87 Difference]: Start difference. First operand 657 states and 1035 transitions. Second operand 10 states. [2019-10-02 12:22:45,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:22:45,049 INFO L93 Difference]: Finished difference Result 1235 states and 1953 transitions. [2019-10-02 12:22:45,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:22:45,049 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2019-10-02 12:22:45,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:22:45,061 INFO L225 Difference]: With dead ends: 1235 [2019-10-02 12:22:45,061 INFO L226 Difference]: Without dead ends: 666 [2019-10-02 12:22:45,067 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:22:45,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2019-10-02 12:22:45,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 664. [2019-10-02 12:22:45,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2019-10-02 12:22:45,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 1044 transitions. [2019-10-02 12:22:45,121 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 1044 transitions. Word has length 140 [2019-10-02 12:22:45,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:22:45,122 INFO L475 AbstractCegarLoop]: Abstraction has 664 states and 1044 transitions. [2019-10-02 12:22:45,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 12:22:45,122 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 1044 transitions. [2019-10-02 12:22:45,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-02 12:22:45,129 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:22:45,129 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:22:45,129 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:22:45,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:22:45,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1692665391, now seen corresponding path program 1 times [2019-10-02 12:22:45,130 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:22:45,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:22:45,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:22:45,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:22:45,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:22:45,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:22:45,256 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:22:45,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:22:45,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:22:45,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:22:45,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:22:45,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:22:45,259 INFO L87 Difference]: Start difference. First operand 664 states and 1044 transitions. Second operand 4 states. [2019-10-02 12:22:45,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:22:45,332 INFO L93 Difference]: Finished difference Result 1283 states and 2039 transitions. [2019-10-02 12:22:45,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:22:45,333 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-10-02 12:22:45,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:22:45,340 INFO L225 Difference]: With dead ends: 1283 [2019-10-02 12:22:45,340 INFO L226 Difference]: Without dead ends: 651 [2019-10-02 12:22:45,344 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:22:45,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-10-02 12:22:45,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2019-10-02 12:22:45,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-10-02 12:22:45,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1021 transitions. [2019-10-02 12:22:45,373 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1021 transitions. Word has length 140 [2019-10-02 12:22:45,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:22:45,374 INFO L475 AbstractCegarLoop]: Abstraction has 651 states and 1021 transitions. [2019-10-02 12:22:45,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:22:45,374 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1021 transitions. [2019-10-02 12:22:45,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-02 12:22:45,381 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:22:45,382 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:22:45,382 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:22:45,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:22:45,383 INFO L82 PathProgramCache]: Analyzing trace with hash 677141201, now seen corresponding path program 1 times [2019-10-02 12:22:45,383 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:22:45,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:22:45,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:22:45,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:22:45,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:22:45,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:22:45,537 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:22:45,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:22:45,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:22:45,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:22:45,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:22:45,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:22:45,540 INFO L87 Difference]: Start difference. First operand 651 states and 1021 transitions. Second operand 6 states. [2019-10-02 12:22:45,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:22:45,809 INFO L93 Difference]: Finished difference Result 1223 states and 1931 transitions. [2019-10-02 12:22:45,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:22:45,809 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-10-02 12:22:45,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:22:45,815 INFO L225 Difference]: With dead ends: 1223 [2019-10-02 12:22:45,815 INFO L226 Difference]: Without dead ends: 651 [2019-10-02 12:22:45,819 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:22:45,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-10-02 12:22:45,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2019-10-02 12:22:45,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-10-02 12:22:45,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1017 transitions. [2019-10-02 12:22:45,847 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1017 transitions. Word has length 141 [2019-10-02 12:22:45,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:22:45,849 INFO L475 AbstractCegarLoop]: Abstraction has 651 states and 1017 transitions. [2019-10-02 12:22:45,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:22:45,849 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1017 transitions. [2019-10-02 12:22:45,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-02 12:22:45,854 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:22:45,855 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:22:45,855 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:22:45,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:22:45,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1320232493, now seen corresponding path program 1 times [2019-10-02 12:22:45,855 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:22:45,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:22:45,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:22:45,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:22:45,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:22:45,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:22:46,067 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:22:46,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:22:46,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:22:46,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:22:46,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:22:46,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:22:46,069 INFO L87 Difference]: Start difference. First operand 651 states and 1017 transitions. Second operand 6 states. [2019-10-02 12:22:46,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:22:46,301 INFO L93 Difference]: Finished difference Result 1223 states and 1927 transitions. [2019-10-02 12:22:46,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:22:46,302 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-10-02 12:22:46,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:22:46,308 INFO L225 Difference]: With dead ends: 1223 [2019-10-02 12:22:46,308 INFO L226 Difference]: Without dead ends: 651 [2019-10-02 12:22:46,312 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:22:46,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-10-02 12:22:46,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2019-10-02 12:22:46,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-10-02 12:22:46,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1013 transitions. [2019-10-02 12:22:46,339 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1013 transitions. Word has length 142 [2019-10-02 12:22:46,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:22:46,340 INFO L475 AbstractCegarLoop]: Abstraction has 651 states and 1013 transitions. [2019-10-02 12:22:46,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:22:46,340 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1013 transitions. [2019-10-02 12:22:46,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-02 12:22:46,345 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:22:46,346 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:22:46,346 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:22:46,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:22:46,346 INFO L82 PathProgramCache]: Analyzing trace with hash 893402902, now seen corresponding path program 1 times [2019-10-02 12:22:46,346 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:22:46,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:22:46,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:22:46,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:22:46,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:22:46,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:22:46,478 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:22:46,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:22:46,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:22:46,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:22:46,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:22:46,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:22:46,480 INFO L87 Difference]: Start difference. First operand 651 states and 1013 transitions. Second operand 6 states. [2019-10-02 12:22:46,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:22:46,681 INFO L93 Difference]: Finished difference Result 1223 states and 1923 transitions. [2019-10-02 12:22:46,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:22:46,682 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-10-02 12:22:46,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:22:46,687 INFO L225 Difference]: With dead ends: 1223 [2019-10-02 12:22:46,688 INFO L226 Difference]: Without dead ends: 651 [2019-10-02 12:22:46,691 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:22:46,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-10-02 12:22:46,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2019-10-02 12:22:46,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-10-02 12:22:46,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1009 transitions. [2019-10-02 12:22:46,712 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1009 transitions. Word has length 143 [2019-10-02 12:22:46,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:22:46,712 INFO L475 AbstractCegarLoop]: Abstraction has 651 states and 1009 transitions. [2019-10-02 12:22:46,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:22:46,712 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1009 transitions. [2019-10-02 12:22:46,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-02 12:22:46,717 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:22:46,717 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:22:46,718 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:22:46,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:22:46,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1947876246, now seen corresponding path program 1 times [2019-10-02 12:22:46,718 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:22:46,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:22:46,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:22:46,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:22:46,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:22:46,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:22:46,876 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:22:46,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:22:46,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:22:46,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:22:46,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:22:46,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:22:46,878 INFO L87 Difference]: Start difference. First operand 651 states and 1009 transitions. Second operand 7 states. [2019-10-02 12:22:47,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:22:47,004 INFO L93 Difference]: Finished difference Result 1223 states and 1919 transitions. [2019-10-02 12:22:47,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:22:47,005 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-10-02 12:22:47,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:22:47,012 INFO L225 Difference]: With dead ends: 1223 [2019-10-02 12:22:47,013 INFO L226 Difference]: Without dead ends: 630 [2019-10-02 12:22:47,017 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:22:47,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-10-02 12:22:47,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2019-10-02 12:22:47,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-10-02 12:22:47,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 975 transitions. [2019-10-02 12:22:47,044 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 975 transitions. Word has length 143 [2019-10-02 12:22:47,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:22:47,044 INFO L475 AbstractCegarLoop]: Abstraction has 630 states and 975 transitions. [2019-10-02 12:22:47,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:22:47,045 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 975 transitions. [2019-10-02 12:22:47,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-02 12:22:47,052 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:22:47,052 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:22:47,053 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:22:47,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:22:47,053 INFO L82 PathProgramCache]: Analyzing trace with hash 504333880, now seen corresponding path program 1 times [2019-10-02 12:22:47,053 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:22:47,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:22:47,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:22:47,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:22:47,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:22:47,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:22:47,197 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:22:47,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:22:47,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:22:47,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:22:47,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:22:47,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:22:47,200 INFO L87 Difference]: Start difference. First operand 630 states and 975 transitions. Second operand 6 states. [2019-10-02 12:22:47,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:22:47,358 INFO L93 Difference]: Finished difference Result 1202 states and 1885 transitions. [2019-10-02 12:22:47,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:22:47,359 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-10-02 12:22:47,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:22:47,363 INFO L225 Difference]: With dead ends: 1202 [2019-10-02 12:22:47,364 INFO L226 Difference]: Without dead ends: 630 [2019-10-02 12:22:47,367 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:22:47,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-10-02 12:22:47,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2019-10-02 12:22:47,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-10-02 12:22:47,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 974 transitions. [2019-10-02 12:22:47,393 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 974 transitions. Word has length 144 [2019-10-02 12:22:47,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:22:47,395 INFO L475 AbstractCegarLoop]: Abstraction has 630 states and 974 transitions. [2019-10-02 12:22:47,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:22:47,395 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 974 transitions. [2019-10-02 12:22:47,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-02 12:22:47,399 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:22:47,400 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:22:47,400 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:22:47,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:22:47,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1035806555, now seen corresponding path program 1 times [2019-10-02 12:22:47,401 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:22:47,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:22:47,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:22:47,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:22:47,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:22:47,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:22:47,523 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:22:47,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:22:47,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:22:47,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:22:47,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:22:47,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:22:47,526 INFO L87 Difference]: Start difference. First operand 630 states and 974 transitions. Second operand 6 states. [2019-10-02 12:22:47,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:22:47,627 INFO L93 Difference]: Finished difference Result 1202 states and 1884 transitions. [2019-10-02 12:22:47,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:22:47,628 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-10-02 12:22:47,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:22:47,632 INFO L225 Difference]: With dead ends: 1202 [2019-10-02 12:22:47,633 INFO L226 Difference]: Without dead ends: 630 [2019-10-02 12:22:47,636 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:22:47,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-10-02 12:22:47,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2019-10-02 12:22:47,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-10-02 12:22:47,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 973 transitions. [2019-10-02 12:22:47,660 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 973 transitions. Word has length 145 [2019-10-02 12:22:47,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:22:47,662 INFO L475 AbstractCegarLoop]: Abstraction has 630 states and 973 transitions. [2019-10-02 12:22:47,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:22:47,662 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 973 transitions. [2019-10-02 12:22:47,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-02 12:22:47,666 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:22:47,667 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:22:47,667 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:22:47,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:22:47,667 INFO L82 PathProgramCache]: Analyzing trace with hash 39300765, now seen corresponding path program 1 times [2019-10-02 12:22:47,668 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:22:47,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:22:47,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:22:47,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:22:47,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:22:47,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:22:47,881 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:22:47,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:22:47,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 12:22:47,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:22:47,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:22:47,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:22:47,883 INFO L87 Difference]: Start difference. First operand 630 states and 973 transitions. Second operand 12 states. [2019-10-02 12:22:48,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:22:48,084 INFO L93 Difference]: Finished difference Result 1203 states and 1883 transitions. [2019-10-02 12:22:48,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:22:48,085 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 146 [2019-10-02 12:22:48,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:22:48,089 INFO L225 Difference]: With dead ends: 1203 [2019-10-02 12:22:48,090 INFO L226 Difference]: Without dead ends: 630 [2019-10-02 12:22:48,094 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:22:48,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-10-02 12:22:48,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2019-10-02 12:22:48,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-10-02 12:22:48,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 972 transitions. [2019-10-02 12:22:48,119 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 972 transitions. Word has length 146 [2019-10-02 12:22:48,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:22:48,120 INFO L475 AbstractCegarLoop]: Abstraction has 630 states and 972 transitions. [2019-10-02 12:22:48,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:22:48,120 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 972 transitions. [2019-10-02 12:22:48,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-02 12:22:48,124 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:22:48,125 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:22:48,125 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:22:48,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:22:48,125 INFO L82 PathProgramCache]: Analyzing trace with hash -733497836, now seen corresponding path program 1 times [2019-10-02 12:22:48,125 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:22:48,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:22:48,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:22:48,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:22:48,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:22:48,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:22:48,383 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-02 12:22:48,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:22:48,384 INFO L224 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-10-02 12:22:48,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:22:49,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:22:49,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 2771 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:22:49,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:22:49,270 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:22:49,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:22:49,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-10-02 12:22:49,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:22:49,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:22:49,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:22:49,282 INFO L87 Difference]: Start difference. First operand 630 states and 972 transitions. Second operand 14 states. [2019-10-02 12:22:57,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:22:57,064 INFO L93 Difference]: Finished difference Result 1213 states and 1939 transitions. [2019-10-02 12:22:57,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 12:22:57,070 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 147 [2019-10-02 12:22:57,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:22:57,074 INFO L225 Difference]: With dead ends: 1213 [2019-10-02 12:22:57,074 INFO L226 Difference]: Without dead ends: 649 [2019-10-02 12:22:57,078 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 161 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2019-10-02 12:22:57,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-10-02 12:22:57,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 647. [2019-10-02 12:22:57,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2019-10-02 12:22:57,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 1010 transitions. [2019-10-02 12:22:57,111 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 1010 transitions. Word has length 147 [2019-10-02 12:22:57,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:22:57,112 INFO L475 AbstractCegarLoop]: Abstraction has 647 states and 1010 transitions. [2019-10-02 12:22:57,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 12:22:57,112 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 1010 transitions. [2019-10-02 12:22:57,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-02 12:22:57,117 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:22:57,117 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:22:57,117 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:22:57,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:22:57,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1966079276, now seen corresponding path program 1 times [2019-10-02 12:22:57,118 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:22:57,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:22:57,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:22:57,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:22:57,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:22:57,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:22:57,297 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 12:22:57,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:22:57,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:22:57,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:22:57,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:22:57,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:22:57,301 INFO L87 Difference]: Start difference. First operand 647 states and 1010 transitions. Second operand 6 states. [2019-10-02 12:22:58,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:22:58,030 INFO L93 Difference]: Finished difference Result 1235 states and 1985 transitions. [2019-10-02 12:22:58,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:22:58,030 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 149 [2019-10-02 12:22:58,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:22:58,037 INFO L225 Difference]: With dead ends: 1235 [2019-10-02 12:22:58,037 INFO L226 Difference]: Without dead ends: 652 [2019-10-02 12:22:58,041 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:22:58,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2019-10-02 12:22:58,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 652. [2019-10-02 12:22:58,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2019-10-02 12:22:58,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 1011 transitions. [2019-10-02 12:22:58,071 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 1011 transitions. Word has length 149 [2019-10-02 12:22:58,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:22:58,072 INFO L475 AbstractCegarLoop]: Abstraction has 652 states and 1011 transitions. [2019-10-02 12:22:58,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:22:58,072 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 1011 transitions. [2019-10-02 12:22:58,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-02 12:22:58,077 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:22:58,077 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:22:58,078 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:22:58,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:22:58,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1163052, now seen corresponding path program 1 times [2019-10-02 12:22:58,078 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:22:58,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:22:58,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:22:58,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:22:58,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:22:58,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:22:58,355 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 12:22:58,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:22:58,356 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:22:58,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:22:58,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:22:58,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 2775 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:22:58,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:22:59,080 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 12:22:59,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:22:59,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-10-02 12:22:59,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:22:59,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:22:59,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:22:59,092 INFO L87 Difference]: Start difference. First operand 652 states and 1011 transitions. Second operand 14 states. [2019-10-02 12:23:13,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:23:13,427 INFO L93 Difference]: Finished difference Result 1936 states and 3112 transitions. [2019-10-02 12:23:13,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-02 12:23:13,428 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 151 [2019-10-02 12:23:13,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:23:13,438 INFO L225 Difference]: With dead ends: 1936 [2019-10-02 12:23:13,438 INFO L226 Difference]: Without dead ends: 1350 [2019-10-02 12:23:13,443 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=181, Invalid=811, Unknown=0, NotChecked=0, Total=992 [2019-10-02 12:23:13,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2019-10-02 12:23:13,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1319. [2019-10-02 12:23:13,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1319 states. [2019-10-02 12:23:13,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 2086 transitions. [2019-10-02 12:23:13,521 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 2086 transitions. Word has length 151 [2019-10-02 12:23:13,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:23:13,521 INFO L475 AbstractCegarLoop]: Abstraction has 1319 states and 2086 transitions. [2019-10-02 12:23:13,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 12:23:13,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 2086 transitions. [2019-10-02 12:23:13,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-02 12:23:13,532 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:23:13,533 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:23:13,533 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:23:13,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:23:13,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1998068, now seen corresponding path program 1 times [2019-10-02 12:23:13,534 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:23:13,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:23:13,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:13,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:23:13,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:13,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:23:13,723 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:23:13,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:23:13,724 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:23:13,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:23:14,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:23:14,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 2777 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:23:14,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:23:14,416 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 12:23:14,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:23:14,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-10-02 12:23:14,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:23:14,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:23:14,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:23:14,428 INFO L87 Difference]: Start difference. First operand 1319 states and 2086 transitions. Second operand 14 states. [2019-10-02 12:23:28,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:23:28,643 INFO L93 Difference]: Finished difference Result 3293 states and 5316 transitions. [2019-10-02 12:23:28,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-02 12:23:28,645 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 153 [2019-10-02 12:23:28,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:23:28,659 INFO L225 Difference]: With dead ends: 3293 [2019-10-02 12:23:28,659 INFO L226 Difference]: Without dead ends: 2049 [2019-10-02 12:23:28,666 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 170 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=181, Invalid=811, Unknown=0, NotChecked=0, Total=992 [2019-10-02 12:23:28,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2049 states. [2019-10-02 12:23:28,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2049 to 672. [2019-10-02 12:23:28,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 672 states. [2019-10-02 12:23:28,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 1039 transitions. [2019-10-02 12:23:28,722 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 1039 transitions. Word has length 153 [2019-10-02 12:23:28,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:23:28,722 INFO L475 AbstractCegarLoop]: Abstraction has 672 states and 1039 transitions. [2019-10-02 12:23:28,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 12:23:28,723 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 1039 transitions. [2019-10-02 12:23:28,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-02 12:23:28,728 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:23:28,728 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:23:28,728 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:23:28,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:23:28,729 INFO L82 PathProgramCache]: Analyzing trace with hash 722854899, now seen corresponding path program 1 times [2019-10-02 12:23:28,729 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:23:28,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:23:28,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:28,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:23:28,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:28,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:23:28,913 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-02 12:23:28,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:23:28,914 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:23:29,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:23:29,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:23:29,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 2778 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:23:29,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:23:29,977 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:23:29,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:23:29,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-10-02 12:23:29,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:23:29,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:23:29,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:23:29,989 INFO L87 Difference]: Start difference. First operand 672 states and 1039 transitions. Second operand 14 states. [2019-10-02 12:23:43,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:23:43,524 INFO L93 Difference]: Finished difference Result 2010 states and 3186 transitions. [2019-10-02 12:23:43,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 12:23:43,525 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 155 [2019-10-02 12:23:43,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:23:43,534 INFO L225 Difference]: With dead ends: 2010 [2019-10-02 12:23:43,535 INFO L226 Difference]: Without dead ends: 1404 [2019-10-02 12:23:43,539 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=196, Invalid=994, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 12:23:43,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2019-10-02 12:23:43,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 1336. [2019-10-02 12:23:43,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1336 states. [2019-10-02 12:23:43,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 2101 transitions. [2019-10-02 12:23:43,619 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 2101 transitions. Word has length 155 [2019-10-02 12:23:43,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:23:43,619 INFO L475 AbstractCegarLoop]: Abstraction has 1336 states and 2101 transitions. [2019-10-02 12:23:43,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 12:23:43,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 2101 transitions. [2019-10-02 12:23:43,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-02 12:23:43,628 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:23:43,628 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:23:43,628 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:23:43,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:23:43,628 INFO L82 PathProgramCache]: Analyzing trace with hash -521183986, now seen corresponding path program 1 times [2019-10-02 12:23:43,629 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:23:43,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:23:43,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:43,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:23:43,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:43,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:23:43,774 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-02 12:23:43,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:23:43,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:23:43,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:23:43,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:23:43,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:23:43,777 INFO L87 Difference]: Start difference. First operand 1336 states and 2101 transitions. Second operand 9 states. [2019-10-02 12:23:43,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:23:43,978 INFO L93 Difference]: Finished difference Result 1942 states and 3060 transitions. [2019-10-02 12:23:43,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:23:43,979 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 164 [2019-10-02 12:23:43,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:23:43,983 INFO L225 Difference]: With dead ends: 1942 [2019-10-02 12:23:43,983 INFO L226 Difference]: Without dead ends: 660 [2019-10-02 12:23:43,990 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:23:43,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2019-10-02 12:23:44,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2019-10-02 12:23:44,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2019-10-02 12:23:44,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 1014 transitions. [2019-10-02 12:23:44,034 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 1014 transitions. Word has length 164 [2019-10-02 12:23:44,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:23:44,037 INFO L475 AbstractCegarLoop]: Abstraction has 660 states and 1014 transitions. [2019-10-02 12:23:44,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:23:44,038 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 1014 transitions. [2019-10-02 12:23:44,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-02 12:23:44,043 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:23:44,043 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:23:44,043 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:23:44,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:23:44,044 INFO L82 PathProgramCache]: Analyzing trace with hash -49773905, now seen corresponding path program 1 times [2019-10-02 12:23:44,044 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:23:44,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:23:44,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:44,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:23:44,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:44,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:23:44,388 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-02 12:23:44,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:23:44,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:23:44,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:23:44,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:23:44,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:23:44,392 INFO L87 Difference]: Start difference. First operand 660 states and 1014 transitions. Second operand 11 states. [2019-10-02 12:23:50,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:23:50,619 INFO L93 Difference]: Finished difference Result 1259 states and 1972 transitions. [2019-10-02 12:23:50,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:23:50,620 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 172 [2019-10-02 12:23:50,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:23:50,652 INFO L225 Difference]: With dead ends: 1259 [2019-10-02 12:23:50,653 INFO L226 Difference]: Without dead ends: 662 [2019-10-02 12:23:50,656 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:23:50,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2019-10-02 12:23:50,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 658. [2019-10-02 12:23:50,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-10-02 12:23:50,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 1010 transitions. [2019-10-02 12:23:50,693 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 1010 transitions. Word has length 172 [2019-10-02 12:23:50,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:23:50,694 INFO L475 AbstractCegarLoop]: Abstraction has 658 states and 1010 transitions. [2019-10-02 12:23:50,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:23:50,694 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 1010 transitions. [2019-10-02 12:23:50,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-10-02 12:23:50,701 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:23:50,701 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:23:50,702 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:23:50,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:23:50,702 INFO L82 PathProgramCache]: Analyzing trace with hash 652575252, now seen corresponding path program 1 times [2019-10-02 12:23:50,702 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:23:50,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:23:50,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:50,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:23:50,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:50,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:23:50,909 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:23:50,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:23:50,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:23:50,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:23:50,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:23:50,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:23:50,915 INFO L87 Difference]: Start difference. First operand 658 states and 1010 transitions. Second operand 6 states. [2019-10-02 12:23:55,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:23:55,943 INFO L93 Difference]: Finished difference Result 1978 states and 3165 transitions. [2019-10-02 12:23:55,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:23:55,946 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 186 [2019-10-02 12:23:55,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:23:55,953 INFO L225 Difference]: With dead ends: 1978 [2019-10-02 12:23:55,954 INFO L226 Difference]: Without dead ends: 1383 [2019-10-02 12:23:55,957 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:23:55,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2019-10-02 12:23:56,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1300. [2019-10-02 12:23:56,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1300 states. [2019-10-02 12:23:56,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 2043 transitions. [2019-10-02 12:23:56,037 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 2043 transitions. Word has length 186 [2019-10-02 12:23:56,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:23:56,037 INFO L475 AbstractCegarLoop]: Abstraction has 1300 states and 2043 transitions. [2019-10-02 12:23:56,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:23:56,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 2043 transitions. [2019-10-02 12:23:56,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-10-02 12:23:56,044 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:23:56,044 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:23:56,044 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:23:56,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:23:56,045 INFO L82 PathProgramCache]: Analyzing trace with hash 452684674, now seen corresponding path program 1 times [2019-10-02 12:23:56,045 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:23:56,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:23:56,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:56,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:23:56,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:56,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:23:56,234 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:23:56,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:23:56,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:23:56,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:23:56,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:23:56,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:23:56,237 INFO L87 Difference]: Start difference. First operand 1300 states and 2043 transitions. Second operand 6 states. [2019-10-02 12:24:01,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:24:01,155 INFO L93 Difference]: Finished difference Result 4126 states and 6722 transitions. [2019-10-02 12:24:01,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:24:01,156 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 187 [2019-10-02 12:24:01,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:24:01,173 INFO L225 Difference]: With dead ends: 4126 [2019-10-02 12:24:01,174 INFO L226 Difference]: Without dead ends: 2893 [2019-10-02 12:24:01,180 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:24:01,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2893 states. [2019-10-02 12:24:01,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2893 to 2697. [2019-10-02 12:24:01,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2697 states. [2019-10-02 12:24:01,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2697 states to 2697 states and 4322 transitions. [2019-10-02 12:24:01,369 INFO L78 Accepts]: Start accepts. Automaton has 2697 states and 4322 transitions. Word has length 187 [2019-10-02 12:24:01,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:24:01,369 INFO L475 AbstractCegarLoop]: Abstraction has 2697 states and 4322 transitions. [2019-10-02 12:24:01,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:24:01,369 INFO L276 IsEmpty]: Start isEmpty. Operand 2697 states and 4322 transitions. [2019-10-02 12:24:01,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-10-02 12:24:01,377 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:24:01,378 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:24:01,379 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:24:01,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:24:01,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1045308080, now seen corresponding path program 1 times [2019-10-02 12:24:01,379 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:24:01,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:24:01,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:24:01,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:24:01,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:24:01,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:24:01,538 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:24:01,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:24:01,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:24:01,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:24:01,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:24:01,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:24:01,539 INFO L87 Difference]: Start difference. First operand 2697 states and 4322 transitions. Second operand 6 states. [2019-10-02 12:24:06,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:24:06,520 INFO L93 Difference]: Finished difference Result 8967 states and 14935 transitions. [2019-10-02 12:24:06,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:24:06,520 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 188 [2019-10-02 12:24:06,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:24:06,574 INFO L225 Difference]: With dead ends: 8967 [2019-10-02 12:24:06,574 INFO L226 Difference]: Without dead ends: 6345 [2019-10-02 12:24:06,590 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:24:06,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6345 states. [2019-10-02 12:24:07,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6345 to 5824. [2019-10-02 12:24:07,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5824 states. [2019-10-02 12:24:07,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5824 states to 5824 states and 9546 transitions. [2019-10-02 12:24:07,067 INFO L78 Accepts]: Start accepts. Automaton has 5824 states and 9546 transitions. Word has length 188 [2019-10-02 12:24:07,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:24:07,068 INFO L475 AbstractCegarLoop]: Abstraction has 5824 states and 9546 transitions. [2019-10-02 12:24:07,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:24:07,068 INFO L276 IsEmpty]: Start isEmpty. Operand 5824 states and 9546 transitions. [2019-10-02 12:24:07,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-10-02 12:24:07,077 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:24:07,077 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:24:07,077 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:24:07,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:24:07,078 INFO L82 PathProgramCache]: Analyzing trace with hash 165204670, now seen corresponding path program 1 times [2019-10-02 12:24:07,078 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:24:07,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:24:07,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:24:07,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:24:07,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:24:07,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:24:07,244 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:24:07,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:24:07,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:24:07,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:24:07,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:24:07,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:24:07,246 INFO L87 Difference]: Start difference. First operand 5824 states and 9546 transitions. Second operand 6 states. [2019-10-02 12:24:12,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:24:12,800 INFO L93 Difference]: Finished difference Result 20316 states and 34891 transitions. [2019-10-02 12:24:12,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:24:12,801 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 189 [2019-10-02 12:24:12,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:24:12,917 INFO L225 Difference]: With dead ends: 20316 [2019-10-02 12:24:12,917 INFO L226 Difference]: Without dead ends: 14583 [2019-10-02 12:24:12,954 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:24:12,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14583 states. [2019-10-02 12:24:14,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14583 to 13107. [2019-10-02 12:24:14,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13107 states. [2019-10-02 12:24:14,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13107 states to 13107 states and 22174 transitions. [2019-10-02 12:24:14,708 INFO L78 Accepts]: Start accepts. Automaton has 13107 states and 22174 transitions. Word has length 189 [2019-10-02 12:24:14,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:24:14,708 INFO L475 AbstractCegarLoop]: Abstraction has 13107 states and 22174 transitions. [2019-10-02 12:24:14,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:24:14,708 INFO L276 IsEmpty]: Start isEmpty. Operand 13107 states and 22174 transitions. [2019-10-02 12:24:14,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-10-02 12:24:14,719 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:24:14,719 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:24:14,719 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:24:14,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:24:14,720 INFO L82 PathProgramCache]: Analyzing trace with hash -559957876, now seen corresponding path program 1 times [2019-10-02 12:24:14,720 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:24:14,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:24:14,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:24:14,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:24:14,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:24:14,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:24:14,856 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:24:14,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:24:14,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:24:14,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:24:14,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:24:14,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:24:14,858 INFO L87 Difference]: Start difference. First operand 13107 states and 22174 transitions. Second operand 6 states. [2019-10-02 12:24:22,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:24:22,035 INFO L93 Difference]: Finished difference Result 48301 states and 86570 transitions. [2019-10-02 12:24:22,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:24:22,035 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 190 [2019-10-02 12:24:22,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:24:22,311 INFO L225 Difference]: With dead ends: 48301 [2019-10-02 12:24:22,311 INFO L226 Difference]: Without dead ends: 35317 [2019-10-02 12:24:22,393 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:24:22,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35317 states. [2019-10-02 12:24:26,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35317 to 30974. [2019-10-02 12:24:26,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30974 states. [2019-10-02 12:24:26,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30974 states to 30974 states and 54855 transitions. [2019-10-02 12:24:26,374 INFO L78 Accepts]: Start accepts. Automaton has 30974 states and 54855 transitions. Word has length 190 [2019-10-02 12:24:26,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:24:26,375 INFO L475 AbstractCegarLoop]: Abstraction has 30974 states and 54855 transitions. [2019-10-02 12:24:26,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:24:26,375 INFO L276 IsEmpty]: Start isEmpty. Operand 30974 states and 54855 transitions. [2019-10-02 12:24:26,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-10-02 12:24:26,383 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:24:26,383 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:24:26,383 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:24:26,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:24:26,384 INFO L82 PathProgramCache]: Analyzing trace with hash -459045909, now seen corresponding path program 1 times [2019-10-02 12:24:26,384 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:24:26,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:24:26,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:24:26,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:24:26,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:24:26,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:24:26,577 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:24:26,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:24:26,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:24:26,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:24:26,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:24:26,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:24:26,578 INFO L87 Difference]: Start difference. First operand 30974 states and 54855 transitions. Second operand 11 states. [2019-10-02 12:24:39,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:24:39,837 INFO L93 Difference]: Finished difference Result 100260 states and 177087 transitions. [2019-10-02 12:24:39,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 12:24:39,838 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 190 [2019-10-02 12:24:39,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:24:40,401 INFO L225 Difference]: With dead ends: 100260 [2019-10-02 12:24:40,401 INFO L226 Difference]: Without dead ends: 69473 [2019-10-02 12:24:40,590 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=829, Unknown=0, NotChecked=0, Total=992 [2019-10-02 12:24:40,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69473 states. [2019-10-02 12:24:47,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69473 to 68366. [2019-10-02 12:24:47,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68366 states. [2019-10-02 12:24:48,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68366 states to 68366 states and 119421 transitions. [2019-10-02 12:24:48,155 INFO L78 Accepts]: Start accepts. Automaton has 68366 states and 119421 transitions. Word has length 190 [2019-10-02 12:24:48,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:24:48,155 INFO L475 AbstractCegarLoop]: Abstraction has 68366 states and 119421 transitions. [2019-10-02 12:24:48,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:24:48,156 INFO L276 IsEmpty]: Start isEmpty. Operand 68366 states and 119421 transitions. [2019-10-02 12:24:48,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-10-02 12:24:48,163 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:24:48,163 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:24:48,163 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:24:48,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:24:48,164 INFO L82 PathProgramCache]: Analyzing trace with hash -2048245456, now seen corresponding path program 1 times [2019-10-02 12:24:48,164 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:24:48,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:24:48,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:24:48,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:24:48,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:24:48,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:24:48,338 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:24:48,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:24:48,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:24:48,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:24:48,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:24:48,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:24:48,340 INFO L87 Difference]: Start difference. First operand 68366 states and 119421 transitions. Second operand 9 states. [2019-10-02 12:24:55,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:24:55,056 INFO L93 Difference]: Finished difference Result 138401 states and 241313 transitions. [2019-10-02 12:24:55,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:24:55,057 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 196 [2019-10-02 12:24:55,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:24:55,496 INFO L225 Difference]: With dead ends: 138401 [2019-10-02 12:24:55,496 INFO L226 Difference]: Without dead ends: 70222 [2019-10-02 12:24:55,717 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:24:55,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70222 states. [2019-10-02 12:25:02,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70222 to 69326. [2019-10-02 12:25:02,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69326 states. [2019-10-02 12:25:03,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69326 states to 69326 states and 120669 transitions. [2019-10-02 12:25:03,391 INFO L78 Accepts]: Start accepts. Automaton has 69326 states and 120669 transitions. Word has length 196 [2019-10-02 12:25:03,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:25:03,391 INFO L475 AbstractCegarLoop]: Abstraction has 69326 states and 120669 transitions. [2019-10-02 12:25:03,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:25:03,392 INFO L276 IsEmpty]: Start isEmpty. Operand 69326 states and 120669 transitions. [2019-10-02 12:25:03,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-10-02 12:25:03,397 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:25:03,397 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:25:03,397 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:25:03,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:25:03,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1754377902, now seen corresponding path program 1 times [2019-10-02 12:25:03,398 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:25:03,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:25:03,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:25:03,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:25:03,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:25:03,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:25:03,523 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:25:03,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:25:03,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:25:03,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:25:03,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:25:03,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:25:03,526 INFO L87 Difference]: Start difference. First operand 69326 states and 120669 transitions. Second operand 5 states. [2019-10-02 12:25:08,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:25:08,536 INFO L93 Difference]: Finished difference Result 138767 states and 241431 transitions. [2019-10-02 12:25:08,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:25:08,536 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 196 [2019-10-02 12:25:08,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:25:12,000 INFO L225 Difference]: With dead ends: 138767 [2019-10-02 12:25:12,000 INFO L226 Difference]: Without dead ends: 69628 [2019-10-02 12:25:12,176 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:25:12,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69628 states. [2019-10-02 12:25:16,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69628 to 69318. [2019-10-02 12:25:16,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69318 states. [2019-10-02 12:25:17,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69318 states to 69318 states and 120650 transitions. [2019-10-02 12:25:17,144 INFO L78 Accepts]: Start accepts. Automaton has 69318 states and 120650 transitions. Word has length 196 [2019-10-02 12:25:17,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:25:17,145 INFO L475 AbstractCegarLoop]: Abstraction has 69318 states and 120650 transitions. [2019-10-02 12:25:17,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:25:17,145 INFO L276 IsEmpty]: Start isEmpty. Operand 69318 states and 120650 transitions. [2019-10-02 12:25:17,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-10-02 12:25:17,150 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:25:17,150 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:25:17,150 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:25:17,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:25:17,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1903777194, now seen corresponding path program 1 times [2019-10-02 12:25:17,151 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:25:17,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:25:17,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:25:17,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:25:17,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:25:17,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:25:17,314 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:25:17,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:25:17,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:25:17,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:25:17,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:25:17,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:25:17,316 INFO L87 Difference]: Start difference. First operand 69318 states and 120650 transitions. Second operand 9 states. [2019-10-02 12:25:22,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:25:22,219 INFO L93 Difference]: Finished difference Result 140113 states and 243385 transitions. [2019-10-02 12:25:22,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:25:22,220 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 195 [2019-10-02 12:25:22,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:25:22,603 INFO L225 Difference]: With dead ends: 140113 [2019-10-02 12:25:22,603 INFO L226 Difference]: Without dead ends: 70982 [2019-10-02 12:25:26,136 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:25:26,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70982 states. [2019-10-02 12:25:30,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70982 to 69414. [2019-10-02 12:25:30,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69414 states. [2019-10-02 12:25:30,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69414 states to 69414 states and 120746 transitions. [2019-10-02 12:25:30,647 INFO L78 Accepts]: Start accepts. Automaton has 69414 states and 120746 transitions. Word has length 195 [2019-10-02 12:25:30,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:25:30,647 INFO L475 AbstractCegarLoop]: Abstraction has 69414 states and 120746 transitions. [2019-10-02 12:25:30,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:25:30,648 INFO L276 IsEmpty]: Start isEmpty. Operand 69414 states and 120746 transitions. [2019-10-02 12:25:30,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-10-02 12:25:30,656 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:25:30,656 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:25:30,657 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:25:30,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:25:30,657 INFO L82 PathProgramCache]: Analyzing trace with hash 991261923, now seen corresponding path program 1 times [2019-10-02 12:25:30,657 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:25:30,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:25:30,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:25:30,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:25:30,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:25:30,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:25:30,870 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 12:25:30,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:25:30,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:25:30,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:25:30,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:25:30,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:25:30,872 INFO L87 Difference]: Start difference. First operand 69414 states and 120746 transitions. Second operand 8 states. [2019-10-02 12:25:51,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:25:51,663 INFO L93 Difference]: Finished difference Result 233869 states and 412070 transitions. [2019-10-02 12:25:51,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:25:51,664 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 204 [2019-10-02 12:25:51,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:25:52,571 INFO L225 Difference]: With dead ends: 233869 [2019-10-02 12:25:52,572 INFO L226 Difference]: Without dead ends: 164578 [2019-10-02 12:25:52,812 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:25:52,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164578 states. [2019-10-02 12:26:08,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164578 to 164448. [2019-10-02 12:26:08,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164448 states. [2019-10-02 12:26:10,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164448 states to 164448 states and 287835 transitions. [2019-10-02 12:26:10,163 INFO L78 Accepts]: Start accepts. Automaton has 164448 states and 287835 transitions. Word has length 204 [2019-10-02 12:26:10,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:26:10,164 INFO L475 AbstractCegarLoop]: Abstraction has 164448 states and 287835 transitions. [2019-10-02 12:26:10,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:26:10,164 INFO L276 IsEmpty]: Start isEmpty. Operand 164448 states and 287835 transitions. [2019-10-02 12:26:10,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-10-02 12:26:10,171 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:26:10,171 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:26:10,172 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:26:10,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:26:10,172 INFO L82 PathProgramCache]: Analyzing trace with hash 63419083, now seen corresponding path program 1 times [2019-10-02 12:26:10,173 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:26:10,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:26:10,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:26:10,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:26:10,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:26:10,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:26:10,365 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 12:26:10,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:26:10,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:26:10,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:26:10,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:26:10,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:26:10,368 INFO L87 Difference]: Start difference. First operand 164448 states and 287835 transitions. Second operand 7 states. [2019-10-02 12:26:31,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:26:31,560 INFO L93 Difference]: Finished difference Result 305028 states and 534968 transitions. [2019-10-02 12:26:31,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 12:26:31,561 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 208 [2019-10-02 12:26:31,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:26:32,474 INFO L225 Difference]: With dead ends: 305028 [2019-10-02 12:26:32,475 INFO L226 Difference]: Without dead ends: 169715 [2019-10-02 12:26:32,858 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:26:32,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169715 states. [2019-10-02 12:26:51,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169715 to 168160. [2019-10-02 12:26:51,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168160 states. [2019-10-02 12:26:53,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168160 states to 168160 states and 292890 transitions. [2019-10-02 12:26:53,763 INFO L78 Accepts]: Start accepts. Automaton has 168160 states and 292890 transitions. Word has length 208 [2019-10-02 12:26:53,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:26:53,764 INFO L475 AbstractCegarLoop]: Abstraction has 168160 states and 292890 transitions. [2019-10-02 12:26:53,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:26:53,764 INFO L276 IsEmpty]: Start isEmpty. Operand 168160 states and 292890 transitions. [2019-10-02 12:26:53,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-10-02 12:26:53,771 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:26:53,772 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:26:53,772 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:26:53,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:26:53,772 INFO L82 PathProgramCache]: Analyzing trace with hash -79184407, now seen corresponding path program 1 times [2019-10-02 12:26:53,772 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:26:53,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:26:53,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:26:53,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:26:53,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:26:53,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:26:53,901 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-02 12:26:53,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:26:53,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:26:53,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:26:53,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:26:53,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:26:53,903 INFO L87 Difference]: Start difference. First operand 168160 states and 292890 transitions. Second operand 6 states. [2019-10-02 12:27:14,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:27:14,047 INFO L93 Difference]: Finished difference Result 353880 states and 614011 transitions. [2019-10-02 12:27:14,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:27:14,047 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 213 [2019-10-02 12:27:14,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:27:15,099 INFO L225 Difference]: With dead ends: 353880 [2019-10-02 12:27:15,100 INFO L226 Difference]: Without dead ends: 214855 [2019-10-02 12:27:15,510 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:27:15,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214855 states. [2019-10-02 12:27:37,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214855 to 204161. [2019-10-02 12:27:37,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204161 states. [2019-10-02 12:27:39,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204161 states to 204161 states and 354963 transitions. [2019-10-02 12:27:39,424 INFO L78 Accepts]: Start accepts. Automaton has 204161 states and 354963 transitions. Word has length 213 [2019-10-02 12:27:39,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:27:39,424 INFO L475 AbstractCegarLoop]: Abstraction has 204161 states and 354963 transitions. [2019-10-02 12:27:39,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:27:39,424 INFO L276 IsEmpty]: Start isEmpty. Operand 204161 states and 354963 transitions. [2019-10-02 12:27:39,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-10-02 12:27:39,429 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:27:39,429 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:27:39,429 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:27:39,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:27:39,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1815395579, now seen corresponding path program 1 times [2019-10-02 12:27:39,430 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:27:39,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:27:39,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:27:39,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:27:39,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:27:39,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:27:39,569 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-02 12:27:39,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:27:39,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:27:39,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:27:39,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:27:39,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:27:39,570 INFO L87 Difference]: Start difference. First operand 204161 states and 354963 transitions. Second operand 8 states. [2019-10-02 12:27:58,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:27:58,358 INFO L93 Difference]: Finished difference Result 204246 states and 355085 transitions. [2019-10-02 12:27:58,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:27:58,358 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 212 [2019-10-02 12:27:58,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:27:59,396 INFO L225 Difference]: With dead ends: 204246 [2019-10-02 12:27:59,396 INFO L226 Difference]: Without dead ends: 204229 [2019-10-02 12:27:59,488 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:27:59,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204229 states. [2019-10-02 12:28:15,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204229 to 204161. [2019-10-02 12:28:15,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204161 states. [2019-10-02 12:28:17,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204161 states to 204161 states and 354771 transitions. [2019-10-02 12:28:17,691 INFO L78 Accepts]: Start accepts. Automaton has 204161 states and 354771 transitions. Word has length 212 [2019-10-02 12:28:17,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:28:17,692 INFO L475 AbstractCegarLoop]: Abstraction has 204161 states and 354771 transitions. [2019-10-02 12:28:17,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:28:17,692 INFO L276 IsEmpty]: Start isEmpty. Operand 204161 states and 354771 transitions. [2019-10-02 12:28:17,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-02 12:28:17,698 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:28:17,699 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:28:17,699 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:28:17,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:28:17,699 INFO L82 PathProgramCache]: Analyzing trace with hash 738829895, now seen corresponding path program 1 times [2019-10-02 12:28:17,699 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:28:17,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:28:17,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:17,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:28:17,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:17,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:28:17,887 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 12:28:17,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:28:17,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:28:17,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:28:17,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:28:17,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:28:17,894 INFO L87 Difference]: Start difference. First operand 204161 states and 354771 transitions. Second operand 9 states. [2019-10-02 12:28:48,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:28:48,609 INFO L93 Difference]: Finished difference Result 411131 states and 714032 transitions. [2019-10-02 12:28:48,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:28:48,610 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 230 [2019-10-02 12:28:48,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:28:49,831 INFO L225 Difference]: With dead ends: 411131 [2019-10-02 12:28:49,831 INFO L226 Difference]: Without dead ends: 207169 [2019-10-02 12:28:50,761 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:28:50,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207169 states. [2019-10-02 12:29:05,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207169 to 204929. [2019-10-02 12:29:05,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204929 states. [2019-10-02 12:29:07,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204929 states to 204929 states and 355667 transitions. [2019-10-02 12:29:07,978 INFO L78 Accepts]: Start accepts. Automaton has 204929 states and 355667 transitions. Word has length 230 [2019-10-02 12:29:07,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:29:07,979 INFO L475 AbstractCegarLoop]: Abstraction has 204929 states and 355667 transitions. [2019-10-02 12:29:07,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:29:07,979 INFO L276 IsEmpty]: Start isEmpty. Operand 204929 states and 355667 transitions. [2019-10-02 12:29:07,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-10-02 12:29:07,987 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:29:07,987 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:29:07,987 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:29:07,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:29:07,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1726378973, now seen corresponding path program 1 times [2019-10-02 12:29:07,988 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:29:07,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:29:07,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:29:07,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:29:07,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:29:08,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:29:08,121 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 12:29:08,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:29:08,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:29:08,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:29:08,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:29:08,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:29:08,122 INFO L87 Difference]: Start difference. First operand 204929 states and 355667 transitions. Second operand 4 states. [2019-10-02 12:29:29,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:29:29,851 INFO L93 Difference]: Finished difference Result 409979 states and 716773 transitions. [2019-10-02 12:29:30,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:29:30,370 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 232 [2019-10-02 12:29:30,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:29:31,635 INFO L225 Difference]: With dead ends: 409979 [2019-10-02 12:29:31,636 INFO L226 Difference]: Without dead ends: 203329 [2019-10-02 12:29:32,221 INFO L640 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-10-02 12:29:32,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203329 states. [2019-10-02 12:29:54,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203329 to 203265. [2019-10-02 12:29:54,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203265 states. [2019-10-02 12:29:56,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203265 states to 203265 states and 352019 transitions. [2019-10-02 12:29:56,724 INFO L78 Accepts]: Start accepts. Automaton has 203265 states and 352019 transitions. Word has length 232 [2019-10-02 12:29:56,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:29:56,725 INFO L475 AbstractCegarLoop]: Abstraction has 203265 states and 352019 transitions. [2019-10-02 12:29:56,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:29:56,725 INFO L276 IsEmpty]: Start isEmpty. Operand 203265 states and 352019 transitions. [2019-10-02 12:29:56,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-10-02 12:29:56,733 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:29:56,734 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:29:56,734 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:29:56,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:29:56,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1065193338, now seen corresponding path program 1 times [2019-10-02 12:29:56,734 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:29:56,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:29:56,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:29:56,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:29:56,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:29:56,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:29:56,865 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-02 12:29:56,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:29:56,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:29:56,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:29:56,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:29:56,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:29:56,866 INFO L87 Difference]: Start difference. First operand 203265 states and 352019 transitions. Second operand 4 states. [2019-10-02 12:30:57,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:30:57,388 INFO L93 Difference]: Finished difference Result 706702 states and 1383905 transitions. [2019-10-02 12:30:57,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:30:57,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 239 [2019-10-02 12:30:57,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:31:01,362 INFO L225 Difference]: With dead ends: 706702 [2019-10-02 12:31:01,362 INFO L226 Difference]: Without dead ends: 503500 [2019-10-02 12:31:02,206 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:31:02,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503500 states. [2019-10-02 12:31:59,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503500 to 489096. [2019-10-02 12:31:59,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489096 states. [2019-10-02 12:32:21,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489096 states to 489096 states and 969642 transitions. [2019-10-02 12:32:21,730 INFO L78 Accepts]: Start accepts. Automaton has 489096 states and 969642 transitions. Word has length 239 [2019-10-02 12:32:21,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:32:21,731 INFO L475 AbstractCegarLoop]: Abstraction has 489096 states and 969642 transitions. [2019-10-02 12:32:21,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:32:21,731 INFO L276 IsEmpty]: Start isEmpty. Operand 489096 states and 969642 transitions. [2019-10-02 12:32:21,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-10-02 12:32:21,754 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:32:21,754 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:32:21,754 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:32:21,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:32:21,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1337416373, now seen corresponding path program 1 times [2019-10-02 12:32:21,755 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:32:21,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:32:21,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:32:21,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:32:21,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:32:21,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:32:21,868 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-02 12:32:21,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:32:21,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:32:21,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:32:21,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:32:21,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:32:21,869 INFO L87 Difference]: Start difference. First operand 489096 states and 969642 transitions. Second operand 4 states.