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_product24.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 12:20:03,441 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 12:20:03,444 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 12:20:03,455 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 12:20:03,456 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 12:20:03,457 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 12:20:03,458 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 12:20:03,460 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 12:20:03,462 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 12:20:03,463 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 12:20:03,464 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 12:20:03,465 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 12:20:03,465 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 12:20:03,466 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 12:20:03,467 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 12:20:03,468 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 12:20:03,469 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 12:20:03,470 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 12:20:03,472 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 12:20:03,474 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 12:20:03,476 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 12:20:03,477 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 12:20:03,478 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 12:20:03,479 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 12:20:03,482 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 12:20:03,482 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 12:20:03,482 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 12:20:03,483 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 12:20:03,484 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 12:20:03,485 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 12:20:03,485 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 12:20:03,486 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 12:20:03,487 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 12:20:03,487 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 12:20:03,489 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 12:20:03,489 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 12:20:03,490 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 12:20:03,490 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 12:20:03,490 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 12:20:03,491 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 12:20:03,492 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 12:20:03,492 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:20:03,508 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 12:20:03,508 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 12:20:03,510 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 12:20:03,510 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 12:20:03,510 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 12:20:03,511 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 12:20:03,512 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 12:20:03,512 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 12:20:03,512 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 12:20:03,512 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 12:20:03,512 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 12:20:03,513 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 12:20:03,513 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 12:20:03,513 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 12:20:03,514 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 12:20:03,515 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 12:20:03,515 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 12:20:03,515 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 12:20:03,515 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 12:20:03,515 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 12:20:03,516 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 12:20:03,516 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:20:03,516 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 12:20:03,516 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 12:20:03,517 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 12:20:03,517 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 12:20:03,517 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 12:20:03,517 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 12:20:03,517 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 12:20:03,563 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 12:20:03,575 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 12:20:03,581 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 12:20:03,582 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 12:20:03,583 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 12:20:03,583 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product24.cil.c [2019-10-02 12:20:03,656 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a2642331/e571a1c3378b4c67b7aab24c89097a95/FLAG65ed0667e [2019-10-02 12:20:04,313 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 12:20:04,316 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product24.cil.c [2019-10-02 12:20:04,355 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a2642331/e571a1c3378b4c67b7aab24c89097a95/FLAG65ed0667e [2019-10-02 12:20:04,484 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a2642331/e571a1c3378b4c67b7aab24c89097a95 [2019-10-02 12:20:04,497 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 12:20:04,499 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 12:20:04,503 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 12:20:04,503 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 12:20:04,507 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 12:20:04,508 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:20:04" (1/1) ... [2019-10-02 12:20:04,512 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@335d4cc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:20:04, skipping insertion in model container [2019-10-02 12:20:04,512 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:20:04" (1/1) ... [2019-10-02 12:20:04,520 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 12:20:04,618 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 12:20:05,319 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:20:05,353 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 12:20:05,561 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:20:05,626 INFO L192 MainTranslator]: Completed translation [2019-10-02 12:20:05,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:20:05 WrapperNode [2019-10-02 12:20:05,627 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 12:20:05,628 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 12:20:05,628 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 12:20:05,628 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 12:20:05,641 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:20:05" (1/1) ... [2019-10-02 12:20:05,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:20:05" (1/1) ... [2019-10-02 12:20:05,677 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:20:05" (1/1) ... [2019-10-02 12:20:05,677 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:20:05" (1/1) ... [2019-10-02 12:20:05,743 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:20:05" (1/1) ... [2019-10-02 12:20:05,777 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:20:05" (1/1) ... [2019-10-02 12:20:05,801 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:20:05" (1/1) ... [2019-10-02 12:20:05,842 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 12:20:05,843 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 12:20:05,843 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 12:20:05,843 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 12:20:05,847 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:20:05" (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:20:05,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 12:20:05,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 12:20:05,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 12:20:05,952 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-02 12:20:05,953 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-02 12:20:05,953 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-02 12:20:05,953 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-02 12:20:05,953 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-02 12:20:05,954 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-02 12:20:05,954 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-02 12:20:05,954 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-02 12:20:05,954 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-02 12:20:05,955 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-02 12:20:05,955 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-02 12:20:05,956 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-02 12:20:05,956 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-02 12:20:05,959 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-02 12:20:05,959 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-02 12:20:05,960 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-02 12:20:05,960 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-02 12:20:05,960 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-02 12:20:05,960 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-02 12:20:05,960 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-02 12:20:05,961 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-02 12:20:05,961 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-02 12:20:05,961 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-02 12:20:05,961 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-02 12:20:05,961 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2019-10-02 12:20:05,961 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-02 12:20:05,961 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-02 12:20:05,962 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-02 12:20:05,962 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-02 12:20:05,962 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-02 12:20:05,962 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-02 12:20:05,962 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-02 12:20:05,962 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-02 12:20:05,962 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-02 12:20:05,963 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2019-10-02 12:20:05,963 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-02 12:20:05,963 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__executivefloor [2019-10-02 12:20:05,963 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-02 12:20:05,964 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-02 12:20:05,964 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-02 12:20:05,964 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-02 12:20:05,964 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-10-02 12:20:05,964 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-10-02 12:20:05,964 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-10-02 12:20:05,965 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-10-02 12:20:05,965 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-02 12:20:05,965 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-02 12:20:05,965 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-02 12:20:05,966 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-02 12:20:05,966 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-02 12:20:05,966 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-02 12:20:05,966 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-02 12:20:05,966 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-02 12:20:05,966 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-02 12:20:05,967 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-02 12:20:05,967 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-02 12:20:05,967 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-02 12:20:05,967 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-02 12:20:05,967 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-02 12:20:05,967 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 12:20:05,968 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-02 12:20:05,968 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 12:20:05,969 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-02 12:20:05,969 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-02 12:20:05,969 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-02 12:20:05,969 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 12:20:05,970 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 12:20:05,970 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 12:20:05,970 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 12:20:05,970 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 12:20:05,970 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 12:20:05,971 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-02 12:20:05,972 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-02 12:20:05,972 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 12:20:05,972 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 12:20:05,972 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 12:20:05,972 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 12:20:05,973 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 12:20:05,973 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 12:20:05,974 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 12:20:05,974 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 12:20:05,974 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-02 12:20:05,974 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-02 12:20:05,976 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-02 12:20:05,976 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-02 12:20:05,976 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-02 12:20:05,976 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-02 12:20:05,976 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-02 12:20:05,977 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-02 12:20:05,978 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 12:20:05,978 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-02 12:20:05,978 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-02 12:20:05,978 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-02 12:20:05,978 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-02 12:20:05,979 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-02 12:20:05,979 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-02 12:20:05,979 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-02 12:20:05,979 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-02 12:20:05,979 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-02 12:20:05,980 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-02 12:20:05,980 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-02 12:20:05,980 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-02 12:20:05,980 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-02 12:20:05,980 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-02 12:20:05,981 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-02 12:20:05,981 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-02 12:20:05,981 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-02 12:20:05,981 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-02 12:20:05,981 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-02 12:20:05,981 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-10-02 12:20:05,982 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-02 12:20:05,982 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-02 12:20:05,982 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-02 12:20:05,982 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-02 12:20:05,982 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2019-10-02 12:20:05,983 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-02 12:20:05,983 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-02 12:20:05,984 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-02 12:20:05,984 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-02 12:20:05,984 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-02 12:20:05,984 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-02 12:20:05,985 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-02 12:20:05,985 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-02 12:20:05,986 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2019-10-02 12:20:05,986 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-10-02 12:20:05,986 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__executivefloor [2019-10-02 12:20:05,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 12:20:05,986 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-02 12:20:05,987 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 12:20:05,987 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-10-02 12:20:05,987 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-10-02 12:20:05,988 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 12:20:05,988 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-02 12:20:05,989 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-02 12:20:05,989 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-02 12:20:05,993 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-02 12:20:05,994 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-02 12:20:05,997 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-02 12:20:05,999 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-02 12:20:05,999 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-02 12:20:06,000 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-02 12:20:06,008 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-02 12:20:06,008 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-02 12:20:06,008 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-02 12:20:06,008 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-02 12:20:06,008 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-02 12:20:06,009 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-02 12:20:06,009 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 12:20:06,009 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 12:20:06,009 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-02 12:20:06,009 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 12:20:06,009 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 12:20:06,009 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 12:20:06,009 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 12:20:06,010 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 12:20:06,010 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-02 12:20:06,010 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-02 12:20:06,010 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 12:20:06,010 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 12:20:06,010 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 12:20:06,010 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 12:20:06,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 12:20:06,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 12:20:06,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 12:20:06,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 12:20:06,011 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 12:20:06,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 12:20:06,012 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 12:20:06,012 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 12:20:06,012 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 12:20:06,012 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 12:20:06,013 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 12:20:06,013 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 12:20:06,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 12:20:06,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 12:20:06,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 12:20:08,575 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 12:20:08,576 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-02 12:20:08,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:20:08 BoogieIcfgContainer [2019-10-02 12:20:08,578 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 12:20:08,582 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 12:20:08,582 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 12:20:08,585 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 12:20:08,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:20:04" (1/3) ... [2019-10-02 12:20:08,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c743fbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:20:08, skipping insertion in model container [2019-10-02 12:20:08,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:20:05" (2/3) ... [2019-10-02 12:20:08,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c743fbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:20:08, skipping insertion in model container [2019-10-02 12:20:08,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:20:08" (3/3) ... [2019-10-02 12:20:08,589 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product24.cil.c [2019-10-02 12:20:08,600 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 12:20:08,616 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 12:20:08,636 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 12:20:08,699 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 12:20:08,700 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 12:20:08,700 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 12:20:08,700 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 12:20:08,700 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 12:20:08,700 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 12:20:08,700 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 12:20:08,700 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 12:20:08,701 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 12:20:08,752 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states. [2019-10-02 12:20:08,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-02 12:20:08,781 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:20:08,782 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:20:08,786 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:20:08,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:20:08,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1311658421, now seen corresponding path program 1 times [2019-10-02 12:20:08,794 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:20:08,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:20:08,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:08,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:20:08,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:09,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:20:09,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:20:09,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:20:09,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:20:09,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:20:09,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:20:09,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:20:09,580 INFO L87 Difference]: Start difference. First operand 817 states. Second operand 4 states. [2019-10-02 12:20:09,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:20:09,771 INFO L93 Difference]: Finished difference Result 1283 states and 2055 transitions. [2019-10-02 12:20:09,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:20:09,773 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-10-02 12:20:09,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:20:09,803 INFO L225 Difference]: With dead ends: 1283 [2019-10-02 12:20:09,803 INFO L226 Difference]: Without dead ends: 650 [2019-10-02 12:20:09,817 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:20:09,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-10-02 12:20:09,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2019-10-02 12:20:09,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2019-10-02 12:20:09,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 1029 transitions. [2019-10-02 12:20:09,935 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 1029 transitions. Word has length 85 [2019-10-02 12:20:09,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:20:09,936 INFO L475 AbstractCegarLoop]: Abstraction has 650 states and 1029 transitions. [2019-10-02 12:20:09,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:20:09,936 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 1029 transitions. [2019-10-02 12:20:09,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-02 12:20:09,941 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:20:09,941 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:20:09,942 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:20:09,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:20:09,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1025593736, now seen corresponding path program 1 times [2019-10-02 12:20:09,943 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:20:09,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:20:09,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:09,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:20:09,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:10,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:20:10,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:20:10,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:20:10,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:20:10,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:20:10,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:20:10,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:20:10,129 INFO L87 Difference]: Start difference. First operand 650 states and 1029 transitions. Second operand 4 states. [2019-10-02 12:20:10,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:20:10,213 INFO L93 Difference]: Finished difference Result 1263 states and 2016 transitions. [2019-10-02 12:20:10,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:20:10,214 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-10-02 12:20:10,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:20:10,222 INFO L225 Difference]: With dead ends: 1263 [2019-10-02 12:20:10,222 INFO L226 Difference]: Without dead ends: 650 [2019-10-02 12:20:10,226 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:20:10,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-10-02 12:20:10,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2019-10-02 12:20:10,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2019-10-02 12:20:10,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 1028 transitions. [2019-10-02 12:20:10,290 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 1028 transitions. Word has length 88 [2019-10-02 12:20:10,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:20:10,291 INFO L475 AbstractCegarLoop]: Abstraction has 650 states and 1028 transitions. [2019-10-02 12:20:10,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:20:10,291 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 1028 transitions. [2019-10-02 12:20:10,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-02 12:20:10,294 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:20:10,295 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:20:10,295 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:20:10,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:20:10,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1118647296, now seen corresponding path program 1 times [2019-10-02 12:20:10,296 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:20:10,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:20:10,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:10,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:20:10,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:10,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:20:10,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:20:10,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:20:10,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:20:10,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:20:10,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:20:10,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:20:10,483 INFO L87 Difference]: Start difference. First operand 650 states and 1028 transitions. Second operand 4 states. [2019-10-02 12:20:10,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:20:10,550 INFO L93 Difference]: Finished difference Result 1263 states and 2015 transitions. [2019-10-02 12:20:10,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:20:10,551 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-10-02 12:20:10,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:20:10,559 INFO L225 Difference]: With dead ends: 1263 [2019-10-02 12:20:10,560 INFO L226 Difference]: Without dead ends: 650 [2019-10-02 12:20:10,565 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:20:10,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-10-02 12:20:10,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2019-10-02 12:20:10,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2019-10-02 12:20:10,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 1027 transitions. [2019-10-02 12:20:10,672 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 1027 transitions. Word has length 89 [2019-10-02 12:20:10,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:20:10,672 INFO L475 AbstractCegarLoop]: Abstraction has 650 states and 1027 transitions. [2019-10-02 12:20:10,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:20:10,673 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 1027 transitions. [2019-10-02 12:20:10,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-02 12:20:10,675 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:20:10,675 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:20:10,676 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:20:10,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:20:10,676 INFO L82 PathProgramCache]: Analyzing trace with hash -210310140, now seen corresponding path program 1 times [2019-10-02 12:20:10,676 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:20:10,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:20:10,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:10,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:20:10,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:10,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:20:10,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:20:10,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:20:10,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:20:10,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:20:10,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:20:10,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:20:10,839 INFO L87 Difference]: Start difference. First operand 650 states and 1027 transitions. Second operand 4 states. [2019-10-02 12:20:10,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:20:10,925 INFO L93 Difference]: Finished difference Result 1263 states and 2014 transitions. [2019-10-02 12:20:10,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:20:10,925 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-10-02 12:20:10,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:20:10,934 INFO L225 Difference]: With dead ends: 1263 [2019-10-02 12:20:10,934 INFO L226 Difference]: Without dead ends: 650 [2019-10-02 12:20:10,938 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:20:10,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-10-02 12:20:10,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2019-10-02 12:20:10,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2019-10-02 12:20:10,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 1026 transitions. [2019-10-02 12:20:10,970 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 1026 transitions. Word has length 90 [2019-10-02 12:20:10,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:20:10,972 INFO L475 AbstractCegarLoop]: Abstraction has 650 states and 1026 transitions. [2019-10-02 12:20:10,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:20:10,972 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 1026 transitions. [2019-10-02 12:20:10,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-02 12:20:10,974 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:20:10,974 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:20:10,974 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:20:10,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:20:10,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1623031804, now seen corresponding path program 1 times [2019-10-02 12:20:10,975 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:20:10,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:20:10,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:10,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:20:10,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:11,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:20:11,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:20:11,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:20:11,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:20:11,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:20:11,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:20:11,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:20:11,139 INFO L87 Difference]: Start difference. First operand 650 states and 1026 transitions. Second operand 4 states. [2019-10-02 12:20:11,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:20:11,207 INFO L93 Difference]: Finished difference Result 1263 states and 2013 transitions. [2019-10-02 12:20:11,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:20:11,207 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-10-02 12:20:11,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:20:11,213 INFO L225 Difference]: With dead ends: 1263 [2019-10-02 12:20:11,213 INFO L226 Difference]: Without dead ends: 650 [2019-10-02 12:20:11,217 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:20:11,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-10-02 12:20:11,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2019-10-02 12:20:11,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2019-10-02 12:20:11,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 1025 transitions. [2019-10-02 12:20:11,245 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 1025 transitions. Word has length 91 [2019-10-02 12:20:11,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:20:11,246 INFO L475 AbstractCegarLoop]: Abstraction has 650 states and 1025 transitions. [2019-10-02 12:20:11,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:20:11,246 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 1025 transitions. [2019-10-02 12:20:11,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-02 12:20:11,248 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:20:11,248 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:20:11,249 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:20:11,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:20:11,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1591560576, now seen corresponding path program 1 times [2019-10-02 12:20:11,249 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:20:11,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:20:11,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:11,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:20:11,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:11,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:20:11,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:20:11,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:20:11,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 12:20:11,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 12:20:11,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 12:20:11,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:20:11,455 INFO L87 Difference]: Start difference. First operand 650 states and 1025 transitions. Second operand 10 states. [2019-10-02 12:20:11,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:20:11,647 INFO L93 Difference]: Finished difference Result 1221 states and 1933 transitions. [2019-10-02 12:20:11,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:20:11,648 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2019-10-02 12:20:11,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:20:11,657 INFO L225 Difference]: With dead ends: 1221 [2019-10-02 12:20:11,657 INFO L226 Difference]: Without dead ends: 659 [2019-10-02 12:20:11,662 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:20:11,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-10-02 12:20:11,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 657. [2019-10-02 12:20:11,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-10-02 12:20:11,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1034 transitions. [2019-10-02 12:20:11,709 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1034 transitions. Word has length 92 [2019-10-02 12:20:11,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:20:11,712 INFO L475 AbstractCegarLoop]: Abstraction has 657 states and 1034 transitions. [2019-10-02 12:20:11,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 12:20:11,712 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1034 transitions. [2019-10-02 12:20:11,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-02 12:20:11,715 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:20:11,716 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:20:11,716 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:20:11,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:20:11,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1571223201, now seen corresponding path program 1 times [2019-10-02 12:20:11,761 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:20:11,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:20:11,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:11,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:20:11,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:11,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:20:11,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:20:11,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:20:11,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:20:11,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:20:11,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:20:11,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:20:11,866 INFO L87 Difference]: Start difference. First operand 657 states and 1034 transitions. Second operand 4 states. [2019-10-02 12:20:11,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:20:11,920 INFO L93 Difference]: Finished difference Result 1269 states and 2019 transitions. [2019-10-02 12:20:11,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:20:11,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-10-02 12:20:11,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:20:11,926 INFO L225 Difference]: With dead ends: 1269 [2019-10-02 12:20:11,926 INFO L226 Difference]: Without dead ends: 644 [2019-10-02 12:20:11,930 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:20:11,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2019-10-02 12:20:11,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 644. [2019-10-02 12:20:11,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2019-10-02 12:20:11,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1011 transitions. [2019-10-02 12:20:11,956 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 1011 transitions. Word has length 92 [2019-10-02 12:20:11,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:20:11,956 INFO L475 AbstractCegarLoop]: Abstraction has 644 states and 1011 transitions. [2019-10-02 12:20:11,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:20:11,957 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 1011 transitions. [2019-10-02 12:20:11,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-02 12:20:11,960 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:20:11,961 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:20:11,961 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:20:11,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:20:11,961 INFO L82 PathProgramCache]: Analyzing trace with hash -120264268, now seen corresponding path program 1 times [2019-10-02 12:20:11,962 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:20:11,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:20:11,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:11,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:20:11,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:12,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:20:12,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:20:12,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:20:12,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:20:12,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:20:12,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:20:12,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:20:12,120 INFO L87 Difference]: Start difference. First operand 644 states and 1011 transitions. Second operand 6 states. [2019-10-02 12:20:12,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:20:12,349 INFO L93 Difference]: Finished difference Result 1209 states and 1911 transitions. [2019-10-02 12:20:12,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:20:12,350 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-10-02 12:20:12,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:20:12,355 INFO L225 Difference]: With dead ends: 1209 [2019-10-02 12:20:12,356 INFO L226 Difference]: Without dead ends: 644 [2019-10-02 12:20:12,360 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:20:12,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2019-10-02 12:20:12,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 644. [2019-10-02 12:20:12,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2019-10-02 12:20:12,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1007 transitions. [2019-10-02 12:20:12,382 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 1007 transitions. Word has length 93 [2019-10-02 12:20:12,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:20:12,383 INFO L475 AbstractCegarLoop]: Abstraction has 644 states and 1007 transitions. [2019-10-02 12:20:12,383 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:20:12,383 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 1007 transitions. [2019-10-02 12:20:12,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-02 12:20:12,385 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:20:12,385 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:20:12,385 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:20:12,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:20:12,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1667290269, now seen corresponding path program 1 times [2019-10-02 12:20:12,386 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:20:12,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:20:12,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:12,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:20:12,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:12,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:20:12,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:20:12,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:20:12,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:20:12,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:20:12,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:20:12,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:20:12,527 INFO L87 Difference]: Start difference. First operand 644 states and 1007 transitions. Second operand 6 states. [2019-10-02 12:20:12,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:20:12,819 INFO L93 Difference]: Finished difference Result 1209 states and 1907 transitions. [2019-10-02 12:20:12,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:20:12,819 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-10-02 12:20:12,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:20:12,824 INFO L225 Difference]: With dead ends: 1209 [2019-10-02 12:20:12,825 INFO L226 Difference]: Without dead ends: 644 [2019-10-02 12:20:12,828 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:20:12,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2019-10-02 12:20:12,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 644. [2019-10-02 12:20:12,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2019-10-02 12:20:12,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1003 transitions. [2019-10-02 12:20:12,851 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 1003 transitions. Word has length 94 [2019-10-02 12:20:12,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:20:12,852 INFO L475 AbstractCegarLoop]: Abstraction has 644 states and 1003 transitions. [2019-10-02 12:20:12,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:20:12,852 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 1003 transitions. [2019-10-02 12:20:12,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-02 12:20:12,854 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:20:12,854 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:20:12,854 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:20:12,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:20:12,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1875714457, now seen corresponding path program 1 times [2019-10-02 12:20:12,855 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:20:12,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:20:12,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:12,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:20:12,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:12,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:20:12,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:20:12,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:20:12,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:20:12,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:20:12,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:20:12,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:20:12,974 INFO L87 Difference]: Start difference. First operand 644 states and 1003 transitions. Second operand 6 states. [2019-10-02 12:20:13,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:20:13,217 INFO L93 Difference]: Finished difference Result 1209 states and 1903 transitions. [2019-10-02 12:20:13,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:20:13,217 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-10-02 12:20:13,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:20:13,224 INFO L225 Difference]: With dead ends: 1209 [2019-10-02 12:20:13,224 INFO L226 Difference]: Without dead ends: 644 [2019-10-02 12:20:13,228 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:20:13,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2019-10-02 12:20:13,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 644. [2019-10-02 12:20:13,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2019-10-02 12:20:13,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 999 transitions. [2019-10-02 12:20:13,252 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 999 transitions. Word has length 95 [2019-10-02 12:20:13,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:20:13,252 INFO L475 AbstractCegarLoop]: Abstraction has 644 states and 999 transitions. [2019-10-02 12:20:13,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:20:13,253 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 999 transitions. [2019-10-02 12:20:13,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-02 12:20:13,254 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:20:13,254 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:20:13,255 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:20:13,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:20:13,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1371398631, now seen corresponding path program 1 times [2019-10-02 12:20:13,255 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:20:13,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:20:13,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:13,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:20:13,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:13,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:20:13,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:20:13,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:20:13,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:20:13,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:20:13,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:20:13,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:20:13,451 INFO L87 Difference]: Start difference. First operand 644 states and 999 transitions. Second operand 7 states. [2019-10-02 12:20:13,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:20:13,573 INFO L93 Difference]: Finished difference Result 1209 states and 1899 transitions. [2019-10-02 12:20:13,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:20:13,574 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-10-02 12:20:13,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:20:13,580 INFO L225 Difference]: With dead ends: 1209 [2019-10-02 12:20:13,580 INFO L226 Difference]: Without dead ends: 623 [2019-10-02 12:20:13,586 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:20:13,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-10-02 12:20:13,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2019-10-02 12:20:13,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-10-02 12:20:13,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 965 transitions. [2019-10-02 12:20:13,620 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 965 transitions. Word has length 95 [2019-10-02 12:20:13,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:20:13,620 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 965 transitions. [2019-10-02 12:20:13,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:20:13,620 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 965 transitions. [2019-10-02 12:20:13,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-02 12:20:13,622 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:20:13,622 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:20:13,622 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:20:13,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:20:13,623 INFO L82 PathProgramCache]: Analyzing trace with hash 914472, now seen corresponding path program 1 times [2019-10-02 12:20:13,623 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:20:13,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:20:13,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:13,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:20:13,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:13,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:20:13,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:20:13,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:20:13,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:20:13,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:20:13,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:20:13,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:20:13,783 INFO L87 Difference]: Start difference. First operand 623 states and 965 transitions. Second operand 6 states. [2019-10-02 12:20:13,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:20:13,920 INFO L93 Difference]: Finished difference Result 1188 states and 1865 transitions. [2019-10-02 12:20:13,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:20:13,920 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-10-02 12:20:13,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:20:13,926 INFO L225 Difference]: With dead ends: 1188 [2019-10-02 12:20:13,926 INFO L226 Difference]: Without dead ends: 623 [2019-10-02 12:20:13,929 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:20:13,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-10-02 12:20:13,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2019-10-02 12:20:13,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-10-02 12:20:13,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 964 transitions. [2019-10-02 12:20:13,951 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 964 transitions. Word has length 96 [2019-10-02 12:20:13,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:20:13,952 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 964 transitions. [2019-10-02 12:20:13,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:20:13,952 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 964 transitions. [2019-10-02 12:20:13,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-02 12:20:13,954 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:20:13,954 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:20:13,954 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:20:13,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:20:13,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1972860286, now seen corresponding path program 1 times [2019-10-02 12:20:13,955 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:20:13,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:20:13,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:13,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:20:13,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:14,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:20:14,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:20:14,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:20:14,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:20:14,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:20:14,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:20:14,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:20:14,161 INFO L87 Difference]: Start difference. First operand 623 states and 964 transitions. Second operand 6 states. [2019-10-02 12:20:14,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:20:14,257 INFO L93 Difference]: Finished difference Result 1188 states and 1864 transitions. [2019-10-02 12:20:14,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:20:14,258 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-10-02 12:20:14,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:20:14,263 INFO L225 Difference]: With dead ends: 1188 [2019-10-02 12:20:14,263 INFO L226 Difference]: Without dead ends: 623 [2019-10-02 12:20:14,267 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:20:14,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-10-02 12:20:14,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2019-10-02 12:20:14,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-10-02 12:20:14,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 963 transitions. [2019-10-02 12:20:14,299 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 963 transitions. Word has length 97 [2019-10-02 12:20:14,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:20:14,301 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 963 transitions. [2019-10-02 12:20:14,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:20:14,301 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 963 transitions. [2019-10-02 12:20:14,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-02 12:20:14,303 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:20:14,303 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:20:14,303 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:20:14,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:20:14,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1360125715, now seen corresponding path program 1 times [2019-10-02 12:20:14,304 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:20:14,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:20:14,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:14,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:20:14,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:14,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:20:14,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:20:14,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:20:14,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 12:20:14,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:20:14,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:20:14,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:20:14,528 INFO L87 Difference]: Start difference. First operand 623 states and 963 transitions. Second operand 12 states. [2019-10-02 12:20:14,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:20:14,755 INFO L93 Difference]: Finished difference Result 1189 states and 1863 transitions. [2019-10-02 12:20:14,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:20:14,756 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 98 [2019-10-02 12:20:14,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:20:14,761 INFO L225 Difference]: With dead ends: 1189 [2019-10-02 12:20:14,761 INFO L226 Difference]: Without dead ends: 623 [2019-10-02 12:20:14,766 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:20:14,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-10-02 12:20:14,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2019-10-02 12:20:14,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-10-02 12:20:14,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 962 transitions. [2019-10-02 12:20:14,791 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 962 transitions. Word has length 98 [2019-10-02 12:20:14,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:20:14,792 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 962 transitions. [2019-10-02 12:20:14,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:20:14,792 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 962 transitions. [2019-10-02 12:20:14,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-02 12:20:14,793 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:20:14,794 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:20:14,794 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:20:14,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:20:14,794 INFO L82 PathProgramCache]: Analyzing trace with hash 372702175, now seen corresponding path program 1 times [2019-10-02 12:20:14,795 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:20:14,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:20:14,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:14,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:20:14,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:14,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:20:15,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:20:15,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:20:15,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:20:15,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:20:15,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:20:15,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:20:15,011 INFO L87 Difference]: Start difference. First operand 623 states and 962 transitions. Second operand 6 states. [2019-10-02 12:20:18,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:20:18,969 INFO L93 Difference]: Finished difference Result 1847 states and 2936 transitions. [2019-10-02 12:20:18,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:20:18,970 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-10-02 12:20:18,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:20:18,981 INFO L225 Difference]: With dead ends: 1847 [2019-10-02 12:20:18,981 INFO L226 Difference]: Without dead ends: 1290 [2019-10-02 12:20:18,987 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:20:18,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2019-10-02 12:20:19,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1165. [2019-10-02 12:20:19,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1165 states. [2019-10-02 12:20:19,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 1844 transitions. [2019-10-02 12:20:19,045 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 1844 transitions. Word has length 99 [2019-10-02 12:20:19,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:20:19,046 INFO L475 AbstractCegarLoop]: Abstraction has 1165 states and 1844 transitions. [2019-10-02 12:20:19,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:20:19,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1844 transitions. [2019-10-02 12:20:19,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-02 12:20:19,052 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:20:19,053 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:20:19,053 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:20:19,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:20:19,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1417866634, now seen corresponding path program 1 times [2019-10-02 12:20:19,053 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:20:19,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:20:19,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:19,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:20:19,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:19,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:20:19,276 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 12:20:19,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:20:19,279 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:20:19,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:20:19,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:20:19,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 3053 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:20:19,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:20:20,075 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:20:20,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:20:20,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-10-02 12:20:20,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:20:20,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:20:20,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:20:20,096 INFO L87 Difference]: Start difference. First operand 1165 states and 1844 transitions. Second operand 9 states. [2019-10-02 12:20:21,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:20:21,461 INFO L93 Difference]: Finished difference Result 2272 states and 3693 transitions. [2019-10-02 12:20:21,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:20:21,461 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 158 [2019-10-02 12:20:21,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:20:21,474 INFO L225 Difference]: With dead ends: 2272 [2019-10-02 12:20:21,474 INFO L226 Difference]: Without dead ends: 1173 [2019-10-02 12:20:21,482 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:20:21,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2019-10-02 12:20:21,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 1173. [2019-10-02 12:20:21,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1173 states. [2019-10-02 12:20:21,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1852 transitions. [2019-10-02 12:20:21,560 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1852 transitions. Word has length 158 [2019-10-02 12:20:21,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:20:21,561 INFO L475 AbstractCegarLoop]: Abstraction has 1173 states and 1852 transitions. [2019-10-02 12:20:21,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:20:21,561 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1852 transitions. [2019-10-02 12:20:21,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-02 12:20:21,571 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:20:21,571 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:20:21,571 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:20:21,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:20:21,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1476873735, now seen corresponding path program 1 times [2019-10-02 12:20:21,572 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:20:21,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:20:21,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:21,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:20:21,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:21,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:20:21,891 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-02 12:20:21,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:20:21,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 12:20:21,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:20:21,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:20:21,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:20:21,893 INFO L87 Difference]: Start difference. First operand 1173 states and 1852 transitions. Second operand 12 states. [2019-10-02 12:20:33,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:20:33,484 INFO L93 Difference]: Finished difference Result 3874 states and 6114 transitions. [2019-10-02 12:20:33,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 12:20:33,485 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 159 [2019-10-02 12:20:33,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:20:33,505 INFO L225 Difference]: With dead ends: 3874 [2019-10-02 12:20:33,505 INFO L226 Difference]: Without dead ends: 2767 [2019-10-02 12:20:33,515 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2019-10-02 12:20:33,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2767 states. [2019-10-02 12:20:33,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2767 to 2709. [2019-10-02 12:20:33,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2709 states. [2019-10-02 12:20:33,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2709 states to 2709 states and 4227 transitions. [2019-10-02 12:20:33,670 INFO L78 Accepts]: Start accepts. Automaton has 2709 states and 4227 transitions. Word has length 159 [2019-10-02 12:20:33,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:20:33,671 INFO L475 AbstractCegarLoop]: Abstraction has 2709 states and 4227 transitions. [2019-10-02 12:20:33,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:20:33,671 INFO L276 IsEmpty]: Start isEmpty. Operand 2709 states and 4227 transitions. [2019-10-02 12:20:33,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-02 12:20:33,678 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:20:33,679 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:20:33,679 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:20:33,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:20:33,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1813348040, now seen corresponding path program 1 times [2019-10-02 12:20:33,680 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:20:33,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:20:33,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:33,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:20:33,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:33,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:20:33,854 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 12:20:33,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:20:33,854 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:20:33,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:20:34,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:20:34,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 3055 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:20:34,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:20:34,479 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:20:34,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:20:34,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-10-02 12:20:34,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:20:34,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:20:34,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:20:34,492 INFO L87 Difference]: Start difference. First operand 2709 states and 4227 transitions. Second operand 9 states. [2019-10-02 12:20:35,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:20:35,955 INFO L93 Difference]: Finished difference Result 5392 states and 8631 transitions. [2019-10-02 12:20:35,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:20:35,956 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 160 [2019-10-02 12:20:35,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:20:35,976 INFO L225 Difference]: With dead ends: 5392 [2019-10-02 12:20:35,976 INFO L226 Difference]: Without dead ends: 2749 [2019-10-02 12:20:35,996 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 159 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:20:36,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2749 states. [2019-10-02 12:20:36,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2749 to 2749. [2019-10-02 12:20:36,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2749 states. [2019-10-02 12:20:36,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2749 states to 2749 states and 4265 transitions. [2019-10-02 12:20:36,133 INFO L78 Accepts]: Start accepts. Automaton has 2749 states and 4265 transitions. Word has length 160 [2019-10-02 12:20:36,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:20:36,134 INFO L475 AbstractCegarLoop]: Abstraction has 2749 states and 4265 transitions. [2019-10-02 12:20:36,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:20:36,134 INFO L276 IsEmpty]: Start isEmpty. Operand 2749 states and 4265 transitions. [2019-10-02 12:20:36,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-02 12:20:36,140 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:20:36,141 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:20:36,141 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:20:36,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:20:36,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1353207926, now seen corresponding path program 1 times [2019-10-02 12:20:36,142 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:20:36,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:20:36,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:36,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:20:36,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:36,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:20:36,291 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 12:20:36,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:20:36,292 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:20:36,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:20:37,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:20:37,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 3057 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:20:37,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:20:37,135 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:20:37,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:20:37,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-10-02 12:20:37,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:20:37,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:20:37,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:20:37,155 INFO L87 Difference]: Start difference. First operand 2749 states and 4265 transitions. Second operand 9 states. [2019-10-02 12:20:38,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:20:38,858 INFO L93 Difference]: Finished difference Result 5480 states and 8705 transitions. [2019-10-02 12:20:38,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:20:38,859 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 162 [2019-10-02 12:20:38,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:20:38,883 INFO L225 Difference]: With dead ends: 5480 [2019-10-02 12:20:38,883 INFO L226 Difference]: Without dead ends: 2797 [2019-10-02 12:20:38,907 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 161 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:20:38,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2797 states. [2019-10-02 12:20:39,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2797 to 2797. [2019-10-02 12:20:39,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2797 states. [2019-10-02 12:20:39,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2797 states to 2797 states and 4311 transitions. [2019-10-02 12:20:39,052 INFO L78 Accepts]: Start accepts. Automaton has 2797 states and 4311 transitions. Word has length 162 [2019-10-02 12:20:39,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:20:39,053 INFO L475 AbstractCegarLoop]: Abstraction has 2797 states and 4311 transitions. [2019-10-02 12:20:39,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:20:39,054 INFO L276 IsEmpty]: Start isEmpty. Operand 2797 states and 4311 transitions. [2019-10-02 12:20:39,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-02 12:20:39,063 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:20:39,064 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:20:39,064 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:20:39,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:20:39,065 INFO L82 PathProgramCache]: Analyzing trace with hash 476346304, now seen corresponding path program 1 times [2019-10-02 12:20:39,065 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:20:39,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:20:39,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:39,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:20:39,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:39,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:20:39,210 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 12:20:39,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:20:39,210 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:20:39,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:20:39,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:20:39,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 3059 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:20:39,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:20:39,988 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:20:39,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:20:39,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-10-02 12:20:39,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:20:39,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:20:40,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:20:40,000 INFO L87 Difference]: Start difference. First operand 2797 states and 4311 transitions. Second operand 9 states. [2019-10-02 12:20:41,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:20:41,597 INFO L93 Difference]: Finished difference Result 5584 states and 8795 transitions. [2019-10-02 12:20:41,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:20:41,598 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 164 [2019-10-02 12:20:41,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:20:41,615 INFO L225 Difference]: With dead ends: 5584 [2019-10-02 12:20:41,616 INFO L226 Difference]: Without dead ends: 2853 [2019-10-02 12:20:41,629 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 163 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:20:41,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2853 states. [2019-10-02 12:20:41,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2853 to 2853. [2019-10-02 12:20:41,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2853 states. [2019-10-02 12:20:41,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2853 states to 2853 states and 4365 transitions. [2019-10-02 12:20:41,815 INFO L78 Accepts]: Start accepts. Automaton has 2853 states and 4365 transitions. Word has length 164 [2019-10-02 12:20:41,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:20:41,815 INFO L475 AbstractCegarLoop]: Abstraction has 2853 states and 4365 transitions. [2019-10-02 12:20:41,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:20:41,815 INFO L276 IsEmpty]: Start isEmpty. Operand 2853 states and 4365 transitions. [2019-10-02 12:20:41,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-02 12:20:41,821 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:20:41,822 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] [2019-10-02 12:20:41,822 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:20:41,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:20:41,822 INFO L82 PathProgramCache]: Analyzing trace with hash -2101576586, now seen corresponding path program 1 times [2019-10-02 12:20:41,823 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:20:41,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:20:41,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:41,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:20:41,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:41,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:20:42,009 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:20:42,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:20:42,009 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:20:42,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:20:42,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:20:42,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 3061 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:20:42,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:20:42,723 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:20:42,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:20:42,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-10-02 12:20:42,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:20:42,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:20:42,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:20:42,745 INFO L87 Difference]: Start difference. First operand 2853 states and 4365 transitions. Second operand 14 states. [2019-10-02 12:20:54,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:20:54,316 INFO L93 Difference]: Finished difference Result 8791 states and 13759 transitions. [2019-10-02 12:20:54,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 12:20:54,320 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 166 [2019-10-02 12:20:54,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:20:54,357 INFO L225 Difference]: With dead ends: 8791 [2019-10-02 12:20:54,357 INFO L226 Difference]: Without dead ends: 6004 [2019-10-02 12:20:54,367 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 180 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=196, Invalid=994, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 12:20:54,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6004 states. [2019-10-02 12:20:54,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6004 to 5857. [2019-10-02 12:20:54,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5857 states. [2019-10-02 12:20:54,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5857 states to 5857 states and 9027 transitions. [2019-10-02 12:20:54,717 INFO L78 Accepts]: Start accepts. Automaton has 5857 states and 9027 transitions. Word has length 166 [2019-10-02 12:20:54,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:20:54,717 INFO L475 AbstractCegarLoop]: Abstraction has 5857 states and 9027 transitions. [2019-10-02 12:20:54,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 12:20:54,718 INFO L276 IsEmpty]: Start isEmpty. Operand 5857 states and 9027 transitions. [2019-10-02 12:20:54,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-02 12:20:54,730 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:20:54,730 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] [2019-10-02 12:20:54,730 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:20:54,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:20:54,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1370076819, now seen corresponding path program 1 times [2019-10-02 12:20:54,731 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:20:54,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:20:54,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:54,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:20:54,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:54,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:20:54,888 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:20:54,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:20:54,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:20:54,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:20:54,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:20:54,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:20:54,890 INFO L87 Difference]: Start difference. First operand 5857 states and 9027 transitions. Second operand 9 states. [2019-10-02 12:20:55,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:20:55,081 INFO L93 Difference]: Finished difference Result 8632 states and 13285 transitions. [2019-10-02 12:20:55,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:20:55,082 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 175 [2019-10-02 12:20:55,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:20:55,096 INFO L225 Difference]: With dead ends: 8632 [2019-10-02 12:20:55,096 INFO L226 Difference]: Without dead ends: 2829 [2019-10-02 12:20:55,111 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:20:55,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2829 states. [2019-10-02 12:20:55,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2829 to 2829. [2019-10-02 12:20:55,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2829 states. [2019-10-02 12:20:55,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2829 states to 2829 states and 4313 transitions. [2019-10-02 12:20:55,220 INFO L78 Accepts]: Start accepts. Automaton has 2829 states and 4313 transitions. Word has length 175 [2019-10-02 12:20:55,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:20:55,221 INFO L475 AbstractCegarLoop]: Abstraction has 2829 states and 4313 transitions. [2019-10-02 12:20:55,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:20:55,221 INFO L276 IsEmpty]: Start isEmpty. Operand 2829 states and 4313 transitions. [2019-10-02 12:20:55,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-10-02 12:20:55,227 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:20:55,228 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] [2019-10-02 12:20:55,228 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:20:55,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:20:55,228 INFO L82 PathProgramCache]: Analyzing trace with hash 26812321, now seen corresponding path program 1 times [2019-10-02 12:20:55,229 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:20:55,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:20:55,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:55,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:20:55,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:55,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:20:55,470 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:20:55,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:20:55,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:20:55,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:20:55,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:20:55,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:20:55,472 INFO L87 Difference]: Start difference. First operand 2829 states and 4313 transitions. Second operand 11 states. [2019-10-02 12:21:00,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:21:00,566 INFO L93 Difference]: Finished difference Result 5575 states and 8566 transitions. [2019-10-02 12:21:00,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:21:00,566 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 183 [2019-10-02 12:21:00,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:21:00,577 INFO L225 Difference]: With dead ends: 5575 [2019-10-02 12:21:00,577 INFO L226 Difference]: Without dead ends: 2817 [2019-10-02 12:21:00,586 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 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:21:00,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2817 states. [2019-10-02 12:21:00,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2817 to 2817. [2019-10-02 12:21:00,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2817 states. [2019-10-02 12:21:00,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2817 states to 2817 states and 4289 transitions. [2019-10-02 12:21:00,692 INFO L78 Accepts]: Start accepts. Automaton has 2817 states and 4289 transitions. Word has length 183 [2019-10-02 12:21:00,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:21:00,693 INFO L475 AbstractCegarLoop]: Abstraction has 2817 states and 4289 transitions. [2019-10-02 12:21:00,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:21:00,693 INFO L276 IsEmpty]: Start isEmpty. Operand 2817 states and 4289 transitions. [2019-10-02 12:21:00,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-10-02 12:21:00,700 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:21:00,700 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, 1] [2019-10-02 12:21:00,701 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:21:00,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:21:00,701 INFO L82 PathProgramCache]: Analyzing trace with hash -2070796733, now seen corresponding path program 1 times [2019-10-02 12:21:00,701 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:21:00,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:21:00,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:00,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:21:00,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:00,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:21:00,866 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:21:00,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:21:00,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:21:00,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:21:00,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:21:00,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:21:00,868 INFO L87 Difference]: Start difference. First operand 2817 states and 4289 transitions. Second operand 6 states. [2019-10-02 12:21:05,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:21:05,062 INFO L93 Difference]: Finished difference Result 7208 states and 11209 transitions. [2019-10-02 12:21:05,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:21:05,063 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 197 [2019-10-02 12:21:05,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:21:05,087 INFO L225 Difference]: With dead ends: 7208 [2019-10-02 12:21:05,087 INFO L226 Difference]: Without dead ends: 4462 [2019-10-02 12:21:05,097 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 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:21:05,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4462 states. [2019-10-02 12:21:05,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4462 to 4222. [2019-10-02 12:21:05,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4222 states. [2019-10-02 12:21:05,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4222 states to 4222 states and 6419 transitions. [2019-10-02 12:21:05,296 INFO L78 Accepts]: Start accepts. Automaton has 4222 states and 6419 transitions. Word has length 197 [2019-10-02 12:21:05,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:21:05,296 INFO L475 AbstractCegarLoop]: Abstraction has 4222 states and 6419 transitions. [2019-10-02 12:21:05,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:21:05,297 INFO L276 IsEmpty]: Start isEmpty. Operand 4222 states and 6419 transitions. [2019-10-02 12:21:05,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-10-02 12:21:05,306 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:21:05,306 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, 1, 1] [2019-10-02 12:21:05,306 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:21:05,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:21:05,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1989382276, now seen corresponding path program 1 times [2019-10-02 12:21:05,307 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:21:05,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:21:05,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:05,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:21:05,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:05,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:21:05,503 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:21:05,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:21:05,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:21:05,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:21:05,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:21:05,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:21:05,505 INFO L87 Difference]: Start difference. First operand 4222 states and 6419 transitions. Second operand 6 states. [2019-10-02 12:21:09,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:21:09,714 INFO L93 Difference]: Finished difference Result 11780 states and 18340 transitions. [2019-10-02 12:21:09,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:21:09,715 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 198 [2019-10-02 12:21:09,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:21:09,752 INFO L225 Difference]: With dead ends: 11780 [2019-10-02 12:21:09,752 INFO L226 Difference]: Without dead ends: 7633 [2019-10-02 12:21:09,768 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 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:21:09,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7633 states. [2019-10-02 12:21:10,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7633 to 7217. [2019-10-02 12:21:10,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7217 states. [2019-10-02 12:21:10,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7217 states to 7217 states and 10996 transitions. [2019-10-02 12:21:10,107 INFO L78 Accepts]: Start accepts. Automaton has 7217 states and 10996 transitions. Word has length 198 [2019-10-02 12:21:10,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:21:10,108 INFO L475 AbstractCegarLoop]: Abstraction has 7217 states and 10996 transitions. [2019-10-02 12:21:10,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:21:10,108 INFO L276 IsEmpty]: Start isEmpty. Operand 7217 states and 10996 transitions. [2019-10-02 12:21:10,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-10-02 12:21:10,118 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:21:10,118 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, 1, 1, 1] [2019-10-02 12:21:10,119 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:21:10,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:21:10,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1893010399, now seen corresponding path program 1 times [2019-10-02 12:21:10,119 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:21:10,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:21:10,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:10,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:21:10,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:10,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:21:10,389 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:21:10,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:21:10,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:21:10,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:21:10,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:21:10,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:21:10,391 INFO L87 Difference]: Start difference. First operand 7217 states and 10996 transitions. Second operand 6 states. [2019-10-02 12:21:14,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:21:14,413 INFO L93 Difference]: Finished difference Result 21794 states and 34156 transitions. [2019-10-02 12:21:14,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:21:14,413 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 199 [2019-10-02 12:21:14,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:21:14,461 INFO L225 Difference]: With dead ends: 21794 [2019-10-02 12:21:14,461 INFO L226 Difference]: Without dead ends: 14660 [2019-10-02 12:21:14,480 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 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:21:14,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14660 states. [2019-10-02 12:21:15,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14660 to 13733. [2019-10-02 12:21:15,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13733 states. [2019-10-02 12:21:15,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13733 states to 13733 states and 21052 transitions. [2019-10-02 12:21:15,349 INFO L78 Accepts]: Start accepts. Automaton has 13733 states and 21052 transitions. Word has length 199 [2019-10-02 12:21:15,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:21:15,350 INFO L475 AbstractCegarLoop]: Abstraction has 13733 states and 21052 transitions. [2019-10-02 12:21:15,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:21:15,350 INFO L276 IsEmpty]: Start isEmpty. Operand 13733 states and 21052 transitions. [2019-10-02 12:21:15,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-10-02 12:21:15,365 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:21:15,365 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, 1, 1, 1, 1] [2019-10-02 12:21:15,365 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:21:15,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:21:15,366 INFO L82 PathProgramCache]: Analyzing trace with hash -948323752, now seen corresponding path program 1 times [2019-10-02 12:21:15,366 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:21:15,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:21:15,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:15,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:21:15,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:15,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:21:15,520 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:21:15,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:21:15,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:21:15,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:21:15,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:21:15,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:21:15,523 INFO L87 Difference]: Start difference. First operand 13733 states and 21052 transitions. Second operand 6 states. [2019-10-02 12:21:21,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:21:21,419 INFO L93 Difference]: Finished difference Result 44406 states and 70444 transitions. [2019-10-02 12:21:21,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:21:21,420 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 200 [2019-10-02 12:21:21,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:21:21,592 INFO L225 Difference]: With dead ends: 44406 [2019-10-02 12:21:21,592 INFO L226 Difference]: Without dead ends: 30772 [2019-10-02 12:21:21,646 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 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:21:21,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30772 states. [2019-10-02 12:21:22,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30772 to 28334. [2019-10-02 12:21:22,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28334 states. [2019-10-02 12:21:23,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28334 states to 28334 states and 43879 transitions. [2019-10-02 12:21:23,138 INFO L78 Accepts]: Start accepts. Automaton has 28334 states and 43879 transitions. Word has length 200 [2019-10-02 12:21:23,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:21:23,139 INFO L475 AbstractCegarLoop]: Abstraction has 28334 states and 43879 transitions. [2019-10-02 12:21:23,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:21:23,139 INFO L276 IsEmpty]: Start isEmpty. Operand 28334 states and 43879 transitions. [2019-10-02 12:21:23,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-10-02 12:21:23,154 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:21:23,154 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, 1, 1, 1, 1, 1] [2019-10-02 12:21:23,154 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:21:23,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:21:23,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1771792005, now seen corresponding path program 1 times [2019-10-02 12:21:23,155 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:21:23,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:21:23,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:23,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:21:23,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:23,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:21:23,310 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:21:23,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:21:23,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:21:23,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:21:23,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:21:23,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:21:23,312 INFO L87 Difference]: Start difference. First operand 28334 states and 43879 transitions. Second operand 6 states. [2019-10-02 12:21:30,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:21:30,469 INFO L93 Difference]: Finished difference Result 97468 states and 157264 transitions. [2019-10-02 12:21:30,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:21:30,469 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 201 [2019-10-02 12:21:30,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:21:30,860 INFO L225 Difference]: With dead ends: 97468 [2019-10-02 12:21:30,860 INFO L226 Difference]: Without dead ends: 69265 [2019-10-02 12:21:32,801 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 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:21:32,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69265 states. [2019-10-02 12:21:35,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69265 to 62308. [2019-10-02 12:21:35,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62308 states. [2019-10-02 12:21:36,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62308 states to 62308 states and 97853 transitions. [2019-10-02 12:21:36,081 INFO L78 Accepts]: Start accepts. Automaton has 62308 states and 97853 transitions. Word has length 201 [2019-10-02 12:21:36,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:21:36,081 INFO L475 AbstractCegarLoop]: Abstraction has 62308 states and 97853 transitions. [2019-10-02 12:21:36,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:21:36,082 INFO L276 IsEmpty]: Start isEmpty. Operand 62308 states and 97853 transitions. [2019-10-02 12:21:36,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-10-02 12:21:36,096 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:21:36,097 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, 1, 1, 1, 1, 1] [2019-10-02 12:21:36,097 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:21:36,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:21:36,097 INFO L82 PathProgramCache]: Analyzing trace with hash 715327770, now seen corresponding path program 1 times [2019-10-02 12:21:36,098 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:21:36,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:21:36,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:36,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:21:36,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:36,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:21:36,305 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:21:36,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:21:36,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:21:36,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:21:36,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:21:36,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:21:36,307 INFO L87 Difference]: Start difference. First operand 62308 states and 97853 transitions. Second operand 11 states. [2019-10-02 12:21:53,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:21:53,043 INFO L93 Difference]: Finished difference Result 209472 states and 331570 transitions. [2019-10-02 12:21:53,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 12:21:53,044 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 201 [2019-10-02 12:21:53,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:21:53,673 INFO L225 Difference]: With dead ends: 209472 [2019-10-02 12:21:53,673 INFO L226 Difference]: Without dead ends: 147359 [2019-10-02 12:21:53,861 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=829, Unknown=0, NotChecked=0, Total=992 [2019-10-02 12:21:53,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147359 states. [2019-10-02 12:22:00,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147359 to 144603. [2019-10-02 12:22:00,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144603 states. [2019-10-02 12:22:01,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144603 states to 144603 states and 225061 transitions. [2019-10-02 12:22:01,755 INFO L78 Accepts]: Start accepts. Automaton has 144603 states and 225061 transitions. Word has length 201 [2019-10-02 12:22:01,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:22:01,755 INFO L475 AbstractCegarLoop]: Abstraction has 144603 states and 225061 transitions. [2019-10-02 12:22:01,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:22:01,755 INFO L276 IsEmpty]: Start isEmpty. Operand 144603 states and 225061 transitions. [2019-10-02 12:22:01,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-10-02 12:22:01,768 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:22:01,769 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:22:01,769 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:22:01,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:22:01,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1584856726, now seen corresponding path program 1 times [2019-10-02 12:22:01,769 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:22:01,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:22:01,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:22:01,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:22:01,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:22:01,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:22:01,947 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:22:01,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:22:01,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:22:01,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:22:01,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:22:01,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:22:01,949 INFO L87 Difference]: Start difference. First operand 144603 states and 225061 transitions. Second operand 9 states. [2019-10-02 12:22:11,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:22:11,906 INFO L93 Difference]: Finished difference Result 294357 states and 458737 transitions. [2019-10-02 12:22:11,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:22:11,906 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 207 [2019-10-02 12:22:11,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:22:12,765 INFO L225 Difference]: With dead ends: 294357 [2019-10-02 12:22:12,765 INFO L226 Difference]: Without dead ends: 149949 [2019-10-02 12:22:17,284 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:22:17,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149949 states. [2019-10-02 12:22:26,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149949 to 147573. [2019-10-02 12:22:26,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147573 states. [2019-10-02 12:22:27,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147573 states to 147573 states and 228922 transitions. [2019-10-02 12:22:27,638 INFO L78 Accepts]: Start accepts. Automaton has 147573 states and 228922 transitions. Word has length 207 [2019-10-02 12:22:27,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:22:27,639 INFO L475 AbstractCegarLoop]: Abstraction has 147573 states and 228922 transitions. [2019-10-02 12:22:27,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:22:27,640 INFO L276 IsEmpty]: Start isEmpty. Operand 147573 states and 228922 transitions. [2019-10-02 12:22:27,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-10-02 12:22:27,650 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:22:27,651 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:22:27,651 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:22:27,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:22:27,652 INFO L82 PathProgramCache]: Analyzing trace with hash -957155190, now seen corresponding path program 1 times [2019-10-02 12:22:27,652 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:22:27,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:22:27,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:22:27,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:22:27,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:22:27,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:22:27,833 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:22:27,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:22:27,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:22:27,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:22:27,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:22:27,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:22:27,835 INFO L87 Difference]: Start difference. First operand 147573 states and 228922 transitions. Second operand 9 states. [2019-10-02 12:22:39,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:22:39,243 INFO L93 Difference]: Finished difference Result 299703 states and 465271 transitions. [2019-10-02 12:22:39,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:22:39,244 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 206 [2019-10-02 12:22:39,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:22:39,942 INFO L225 Difference]: With dead ends: 299703 [2019-10-02 12:22:39,942 INFO L226 Difference]: Without dead ends: 152325 [2019-10-02 12:22:40,302 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:22:40,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152325 states. [2019-10-02 12:22:47,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152325 to 147870. [2019-10-02 12:22:47,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147870 states. [2019-10-02 12:22:49,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147870 states to 147870 states and 229219 transitions. [2019-10-02 12:22:49,511 INFO L78 Accepts]: Start accepts. Automaton has 147870 states and 229219 transitions. Word has length 206 [2019-10-02 12:22:49,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:22:49,512 INFO L475 AbstractCegarLoop]: Abstraction has 147870 states and 229219 transitions. [2019-10-02 12:22:49,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:22:49,512 INFO L276 IsEmpty]: Start isEmpty. Operand 147870 states and 229219 transitions. [2019-10-02 12:22:49,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-10-02 12:22:49,522 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:22:49,523 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:22:49,523 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:22:49,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:22:49,523 INFO L82 PathProgramCache]: Analyzing trace with hash 888734868, now seen corresponding path program 1 times [2019-10-02 12:22:49,523 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:22:49,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:22:49,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:22:49,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:22:49,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:22:49,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:22:49,661 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:22:49,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:22:49,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:22:49,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:22:49,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:22:49,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:22:49,663 INFO L87 Difference]: Start difference. First operand 147870 states and 229219 transitions. Second operand 5 states. [2019-10-02 12:23:00,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:23:00,458 INFO L93 Difference]: Finished difference Result 296985 states and 459779 transitions. [2019-10-02 12:23:00,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:23:00,458 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 207 [2019-10-02 12:23:00,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:23:01,247 INFO L225 Difference]: With dead ends: 296985 [2019-10-02 12:23:01,247 INFO L226 Difference]: Without dead ends: 149310 [2019-10-02 12:23:02,145 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:23:02,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149310 states. [2019-10-02 12:23:14,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149310 to 147822. [2019-10-02 12:23:14,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147822 states. [2019-10-02 12:23:15,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147822 states to 147822 states and 229105 transitions. [2019-10-02 12:23:15,218 INFO L78 Accepts]: Start accepts. Automaton has 147822 states and 229105 transitions. Word has length 207 [2019-10-02 12:23:15,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:23:15,219 INFO L475 AbstractCegarLoop]: Abstraction has 147822 states and 229105 transitions. [2019-10-02 12:23:15,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:23:15,219 INFO L276 IsEmpty]: Start isEmpty. Operand 147822 states and 229105 transitions. [2019-10-02 12:23:15,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-10-02 12:23:15,225 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:23:15,225 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:23:15,225 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:23:15,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:23:15,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1548968383, now seen corresponding path program 1 times [2019-10-02 12:23:15,226 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:23:15,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:23:15,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:15,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:23:15,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:15,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:23:15,500 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:23:15,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:23:15,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:23:15,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:23:15,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:23:15,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:23:15,502 INFO L87 Difference]: Start difference. First operand 147822 states and 229105 transitions. Second operand 8 states. [2019-10-02 12:23:40,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:23:40,020 INFO L93 Difference]: Finished difference Result 462946 states and 733532 transitions. [2019-10-02 12:23:40,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:23:40,021 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 216 [2019-10-02 12:23:40,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:23:41,550 INFO L225 Difference]: With dead ends: 462946 [2019-10-02 12:23:41,550 INFO L226 Difference]: Without dead ends: 315055 [2019-10-02 12:23:42,005 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 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:23:42,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315055 states. [2019-10-02 12:24:14,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315055 to 314957. [2019-10-02 12:24:14,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314957 states. [2019-10-02 12:24:16,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314957 states to 314957 states and 493459 transitions. [2019-10-02 12:24:16,135 INFO L78 Accepts]: Start accepts. Automaton has 314957 states and 493459 transitions. Word has length 216 [2019-10-02 12:24:16,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:24:16,136 INFO L475 AbstractCegarLoop]: Abstraction has 314957 states and 493459 transitions. [2019-10-02 12:24:16,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:24:16,136 INFO L276 IsEmpty]: Start isEmpty. Operand 314957 states and 493459 transitions. [2019-10-02 12:24:16,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-10-02 12:24:16,142 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:24:16,143 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 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] [2019-10-02 12:24:16,143 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:24:16,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:24:16,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1762891276, now seen corresponding path program 1 times [2019-10-02 12:24:16,143 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:24:16,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:24:16,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:24:16,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:24:16,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:24:16,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:24:17,068 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-10-02 12:24:17,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:24:17,069 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:24:17,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:24:17,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:24:17,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 3452 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:24:17,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:24:17,725 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-02 12:24:17,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:24:17,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2019-10-02 12:24:17,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:24:17,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:24:17,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:24:17,735 INFO L87 Difference]: Start difference. First operand 314957 states and 493459 transitions. Second operand 9 states. [2019-10-02 12:24:43,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:24:43,216 INFO L93 Difference]: Finished difference Result 632153 states and 1020449 transitions. [2019-10-02 12:24:43,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:24:43,216 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 216 [2019-10-02 12:24:43,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:24:44,654 INFO L225 Difference]: With dead ends: 632153 [2019-10-02 12:24:44,655 INFO L226 Difference]: Without dead ends: 317267 [2019-10-02 12:24:45,420 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:24:45,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317267 states. [2019-10-02 12:25:21,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317267 to 317267. [2019-10-02 12:25:21,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317267 states. [2019-10-02 12:25:24,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317267 states to 317267 states and 496429 transitions. [2019-10-02 12:25:24,046 INFO L78 Accepts]: Start accepts. Automaton has 317267 states and 496429 transitions. Word has length 216 [2019-10-02 12:25:24,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:25:24,046 INFO L475 AbstractCegarLoop]: Abstraction has 317267 states and 496429 transitions. [2019-10-02 12:25:24,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:25:24,046 INFO L276 IsEmpty]: Start isEmpty. Operand 317267 states and 496429 transitions. [2019-10-02 12:25:24,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-10-02 12:25:24,052 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:25:24,052 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:25:24,053 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:25:24,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:25:24,053 INFO L82 PathProgramCache]: Analyzing trace with hash -288284091, now seen corresponding path program 1 times [2019-10-02 12:25:24,053 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:25:24,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:25:24,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:25:24,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:25:24,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:25:24,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:25:24,225 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:25:24,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:25:24,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:25:24,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:25:24,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:25:24,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:25:24,226 INFO L87 Difference]: Start difference. First operand 317267 states and 496429 transitions. Second operand 7 states. [2019-10-02 12:25:57,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:25:57,564 INFO L93 Difference]: Finished difference Result 622291 states and 983154 transitions. [2019-10-02 12:25:57,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 12:25:57,564 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 218 [2019-10-02 12:25:57,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:26:00,228 INFO L225 Difference]: With dead ends: 622291 [2019-10-02 12:26:00,228 INFO L226 Difference]: Without dead ends: 334710 [2019-10-02 12:26:00,867 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:26:01,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334710 states. [2019-10-02 12:26:32,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334710 to 328949. [2019-10-02 12:26:32,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328949 states. [2019-10-02 12:26:35,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328949 states to 328949 states and 512362 transitions. [2019-10-02 12:26:35,369 INFO L78 Accepts]: Start accepts. Automaton has 328949 states and 512362 transitions. Word has length 218 [2019-10-02 12:26:35,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:26:35,369 INFO L475 AbstractCegarLoop]: Abstraction has 328949 states and 512362 transitions. [2019-10-02 12:26:35,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:26:35,369 INFO L276 IsEmpty]: Start isEmpty. Operand 328949 states and 512362 transitions. [2019-10-02 12:26:35,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-10-02 12:26:35,375 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:26:35,375 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 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] [2019-10-02 12:26:35,375 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:26:35,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:26:35,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1462756653, now seen corresponding path program 1 times [2019-10-02 12:26:35,375 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:26:35,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:26:35,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:26:35,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:26:35,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:26:35,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:26:35,510 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-02 12:26:35,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:26:35,510 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:26:35,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:26:36,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:26:36,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 3457 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:26:36,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:26:36,147 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:26:36,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:26:36,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:26:36,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:26:36,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:26:36,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:26:36,164 INFO L87 Difference]: Start difference. First operand 328949 states and 512362 transitions. Second operand 6 states. [2019-10-02 12:27:04,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:27:04,234 INFO L93 Difference]: Finished difference Result 660962 states and 1059740 transitions. [2019-10-02 12:27:04,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:27:04,235 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 221 [2019-10-02 12:27:04,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:27:06,574 INFO L225 Difference]: With dead ends: 660962 [2019-10-02 12:27:06,574 INFO L226 Difference]: Without dead ends: 332084 [2019-10-02 12:27:07,433 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:27:07,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332084 states. [2019-10-02 12:27:38,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332084 to 332084. [2019-10-02 12:27:38,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332084 states. [2019-10-02 12:27:41,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332084 states to 332084 states and 516157 transitions. [2019-10-02 12:27:41,277 INFO L78 Accepts]: Start accepts. Automaton has 332084 states and 516157 transitions. Word has length 221 [2019-10-02 12:27:41,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:27:41,277 INFO L475 AbstractCegarLoop]: Abstraction has 332084 states and 516157 transitions. [2019-10-02 12:27:41,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:27:41,278 INFO L276 IsEmpty]: Start isEmpty. Operand 332084 states and 516157 transitions. [2019-10-02 12:27:41,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-10-02 12:27:41,285 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:27:41,285 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:27:41,285 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:27:41,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:27:41,285 INFO L82 PathProgramCache]: Analyzing trace with hash 995151202, now seen corresponding path program 1 times [2019-10-02 12:27:41,285 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:27:41,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:27:41,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:27:41,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:27:41,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:27:41,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:27:41,437 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:41,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:27:41,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:27:41,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:27:41,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:27:41,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:27:41,439 INFO L87 Difference]: Start difference. First operand 332084 states and 516157 transitions. Second operand 6 states. [2019-10-02 12:28:14,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:28:14,459 INFO L93 Difference]: Finished difference Result 743878 states and 1160500 transitions. [2019-10-02 12:28:14,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:28:14,460 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 224 [2019-10-02 12:28:14,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:28:16,707 INFO L225 Difference]: With dead ends: 743878 [2019-10-02 12:28:16,707 INFO L226 Difference]: Without dead ends: 442107 [2019-10-02 12:28:18,643 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:28:18,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442107 states. [2019-10-02 12:28:53,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442107 to 410644. [2019-10-02 12:28:53,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410644 states. [2019-10-02 12:28:55,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410644 states to 410644 states and 639847 transitions. [2019-10-02 12:28:55,957 INFO L78 Accepts]: Start accepts. Automaton has 410644 states and 639847 transitions. Word has length 224 [2019-10-02 12:28:55,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:28:55,958 INFO L475 AbstractCegarLoop]: Abstraction has 410644 states and 639847 transitions. [2019-10-02 12:28:55,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:28:55,958 INFO L276 IsEmpty]: Start isEmpty. Operand 410644 states and 639847 transitions. [2019-10-02 12:28:55,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-10-02 12:28:55,967 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:28:55,968 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:28:55,968 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:28:55,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:28:55,968 INFO L82 PathProgramCache]: Analyzing trace with hash -850215964, now seen corresponding path program 1 times [2019-10-02 12:28:55,968 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:28:55,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:28:55,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:55,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:28:55,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:56,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:28:56,140 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:28:56,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:28:56,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:28:56,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:28:56,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:28:56,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:28:56,142 INFO L87 Difference]: Start difference. First operand 410644 states and 639847 transitions. Second operand 9 states. [2019-10-02 12:29:25,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:29:25,617 INFO L93 Difference]: Finished difference Result 432908 states and 676995 transitions. [2019-10-02 12:29:25,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:29:25,618 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 224 [2019-10-02 12:29:25,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:29:28,451 INFO L225 Difference]: With dead ends: 432908 [2019-10-02 12:29:28,452 INFO L226 Difference]: Without dead ends: 432891 [2019-10-02 12:29:28,634 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:29:28,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432891 states. [2019-10-02 12:30:05,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432891 to 426624. [2019-10-02 12:30:05,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426624 states. [2019-10-02 12:30:09,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426624 states to 426624 states and 668094 transitions. [2019-10-02 12:30:09,078 INFO L78 Accepts]: Start accepts. Automaton has 426624 states and 668094 transitions. Word has length 224 [2019-10-02 12:30:09,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:30:09,078 INFO L475 AbstractCegarLoop]: Abstraction has 426624 states and 668094 transitions. [2019-10-02 12:30:09,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:30:09,078 INFO L276 IsEmpty]: Start isEmpty. Operand 426624 states and 668094 transitions. [2019-10-02 12:30:09,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-10-02 12:30:09,091 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:30:09,092 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:30:09,092 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:30:09,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:30:09,093 INFO L82 PathProgramCache]: Analyzing trace with hash 549618319, now seen corresponding path program 1 times [2019-10-02 12:30:09,093 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:30:09,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:30:09,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:30:09,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:30:09,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:30:09,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:30:09,286 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:30:09,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:30:09,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:30:09,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:30:09,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:30:09,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:30:09,288 INFO L87 Difference]: Start difference. First operand 426624 states and 668094 transitions. Second operand 9 states.