java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/product-lines/elevator_spec2_product27.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 12:20:53,895 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 12:20:53,897 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 12:20:53,909 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 12:20:53,909 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 12:20:53,911 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 12:20:53,912 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 12:20:53,914 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 12:20:53,916 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 12:20:53,917 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 12:20:53,918 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 12:20:53,919 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 12:20:53,919 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 12:20:53,920 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 12:20:53,921 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 12:20:53,923 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 12:20:53,923 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 12:20:53,924 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 12:20:53,926 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 12:20:53,929 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 12:20:53,931 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 12:20:53,932 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 12:20:53,933 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 12:20:53,934 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 12:20:53,936 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 12:20:53,937 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 12:20:53,937 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 12:20:53,938 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 12:20:53,938 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 12:20:53,939 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 12:20:53,940 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 12:20:53,940 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 12:20:53,941 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 12:20:53,942 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 12:20:53,943 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 12:20:53,943 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 12:20:53,944 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 12:20:53,944 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 12:20:53,945 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 12:20:53,945 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 12:20:53,946 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 12:20:53,947 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:53,962 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 12:20:53,962 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 12:20:53,964 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 12:20:53,964 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 12:20:53,964 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 12:20:53,964 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 12:20:53,965 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 12:20:53,965 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 12:20:53,965 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 12:20:53,965 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 12:20:53,965 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 12:20:53,965 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 12:20:53,966 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 12:20:53,966 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 12:20:53,966 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 12:20:53,966 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 12:20:53,966 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 12:20:53,967 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 12:20:53,967 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 12:20:53,967 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 12:20:53,967 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 12:20:53,967 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:20:53,968 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 12:20:53,968 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 12:20:53,969 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 12:20:53,970 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 12:20:53,970 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 12:20:53,970 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 12:20:53,970 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 12:20:54,011 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 12:20:54,025 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 12:20:54,029 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 12:20:54,030 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 12:20:54,031 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 12:20:54,031 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product27.cil.c [2019-10-02 12:20:54,094 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdc3a1722/4464748fc28c4488877d09d996a753ff/FLAGf56cb753f [2019-10-02 12:20:54,726 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 12:20:54,726 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product27.cil.c [2019-10-02 12:20:54,749 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdc3a1722/4464748fc28c4488877d09d996a753ff/FLAGf56cb753f [2019-10-02 12:20:54,944 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdc3a1722/4464748fc28c4488877d09d996a753ff [2019-10-02 12:20:54,954 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 12:20:54,956 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 12:20:54,957 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 12:20:54,957 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 12:20:54,961 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 12:20:54,963 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:20:54" (1/1) ... [2019-10-02 12:20:54,965 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@103d845f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:20:54, skipping insertion in model container [2019-10-02 12:20:54,965 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:20:54" (1/1) ... [2019-10-02 12:20:54,973 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 12:20:55,063 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 12:20:55,873 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:20:55,890 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 12:20:56,063 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:20:56,135 INFO L192 MainTranslator]: Completed translation [2019-10-02 12:20:56,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:20:56 WrapperNode [2019-10-02 12:20:56,136 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 12:20:56,136 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 12:20:56,137 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 12:20:56,137 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 12:20:56,151 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:56" (1/1) ... [2019-10-02 12:20:56,151 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:56" (1/1) ... [2019-10-02 12:20:56,184 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:56" (1/1) ... [2019-10-02 12:20:56,185 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:56" (1/1) ... [2019-10-02 12:20:56,270 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:56" (1/1) ... [2019-10-02 12:20:56,309 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:56" (1/1) ... [2019-10-02 12:20:56,319 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:56" (1/1) ... [2019-10-02 12:20:56,350 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 12:20:56,351 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 12:20:56,351 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 12:20:56,351 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 12:20:56,354 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:20:56" (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:56,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 12:20:56,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 12:20:56,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 12:20:56,425 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 12:20:56,426 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 12:20:56,426 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 12:20:56,427 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 12:20:56,427 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 12:20:56,427 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 12:20:56,427 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-10-02 12:20:56,427 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-10-02 12:20:56,428 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-10-02 12:20:56,428 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-10-02 12:20:56,428 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 12:20:56,429 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-02 12:20:56,430 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-02 12:20:56,432 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 12:20:56,433 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-02 12:20:56,433 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-02 12:20:56,433 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-02 12:20:56,433 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-02 12:20:56,433 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-02 12:20:56,434 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-02 12:20:56,434 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-10-02 12:20:56,434 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-02 12:20:56,434 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-02 12:20:56,434 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-02 12:20:56,435 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-02 12:20:56,435 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-02 12:20:56,435 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-02 12:20:56,435 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-02 12:20:56,435 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-02 12:20:56,436 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-02 12:20:56,436 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-02 12:20:56,436 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-10-02 12:20:56,436 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-02 12:20:56,436 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-02 12:20:56,436 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-02 12:20:56,437 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-02 12:20:56,437 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-02 12:20:56,437 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-02 12:20:56,437 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-02 12:20:56,438 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-02 12:20:56,438 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-02 12:20:56,438 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-02 12:20:56,438 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-02 12:20:56,439 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-02 12:20:56,439 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-02 12:20:56,439 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-02 12:20:56,439 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-02 12:20:56,439 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-02 12:20:56,440 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-02 12:20:56,440 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-02 12:20:56,440 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-02 12:20:56,440 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-02 12:20:56,440 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-02 12:20:56,441 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-02 12:20:56,441 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-02 12:20:56,441 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-02 12:20:56,441 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-02 12:20:56,441 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-02 12:20:56,441 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 12:20:56,442 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-02 12:20:56,442 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 12:20:56,442 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-02 12:20:56,442 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-02 12:20:56,442 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-02 12:20:56,443 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-02 12:20:56,443 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-02 12:20:56,443 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-02 12:20:56,443 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-02 12:20:56,444 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-02 12:20:56,444 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-02 12:20:56,444 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-02 12:20:56,445 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-02 12:20:56,445 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 12:20:56,445 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 12:20:56,445 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 12:20:56,446 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 12:20:56,446 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 12:20:56,446 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 12:20:56,446 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 12:20:56,447 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 12:20:56,447 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 12:20:56,448 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 12:20:56,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 12:20:56,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 12:20:56,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 12:20:56,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 12:20:56,449 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 12:20:56,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 12:20:56,450 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 12:20:56,451 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 12:20:56,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 12:20:56,451 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 12:20:56,451 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 12:20:56,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 12:20:56,451 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 12:20:56,452 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 12:20:56,452 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-02 12:20:56,452 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-02 12:20:56,452 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-10-02 12:20:56,452 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-10-02 12:20:56,453 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-10-02 12:20:56,453 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-10-02 12:20:56,453 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-02 12:20:56,453 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-02 12:20:56,453 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 12:20:56,453 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-02 12:20:56,454 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-02 12:20:56,454 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-02 12:20:56,454 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-02 12:20:56,454 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-02 12:20:56,454 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-02 12:20:56,455 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-02 12:20:56,455 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-02 12:20:56,455 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-02 12:20:56,456 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 12:20:56,456 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-02 12:20:56,456 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-02 12:20:56,457 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-02 12:20:56,457 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-02 12:20:56,457 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-02 12:20:56,457 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-02 12:20:56,459 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-02 12:20:56,459 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-02 12:20:56,459 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-02 12:20:56,459 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-02 12:20:56,460 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-02 12:20:56,460 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-02 12:20:56,460 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-02 12:20:56,460 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-02 12:20:56,461 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-02 12:20:56,461 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-02 12:20:56,461 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-02 12:20:56,461 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-10-02 12:20:56,461 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-02 12:20:56,461 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-02 12:20:56,462 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-02 12:20:56,463 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-02 12:20:56,467 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-02 12:20:56,467 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-10-02 12:20:56,467 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-02 12:20:56,467 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-02 12:20:56,468 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-02 12:20:56,468 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-02 12:20:56,468 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-02 12:20:56,468 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-02 12:20:56,468 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-02 12:20:56,468 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 12:20:56,469 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-02 12:20:56,469 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-02 12:20:56,469 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-02 12:20:56,469 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-02 12:20:56,469 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-02 12:20:56,469 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-02 12:20:56,469 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-02 12:20:56,469 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-02 12:20:56,470 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-02 12:20:56,470 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-02 12:20:56,470 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-02 12:20:56,470 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-02 12:20:56,470 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 12:20:56,470 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-02 12:20:56,470 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 12:20:56,471 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 12:20:56,471 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 12:20:56,471 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 12:20:56,471 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-02 12:20:56,471 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 12:20:56,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 12:20:56,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 12:20:56,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 12:20:58,982 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 12:20:58,982 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-02 12:20:58,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:20:58 BoogieIcfgContainer [2019-10-02 12:20:58,984 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 12:20:58,986 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 12:20:58,986 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 12:20:58,990 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 12:20:58,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:20:54" (1/3) ... [2019-10-02 12:20:58,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cb7eb9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:20:58, skipping insertion in model container [2019-10-02 12:20:58,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:20:56" (2/3) ... [2019-10-02 12:20:58,992 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cb7eb9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:20:58, skipping insertion in model container [2019-10-02 12:20:58,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:20:58" (3/3) ... [2019-10-02 12:20:58,994 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product27.cil.c [2019-10-02 12:20:59,004 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 12:20:59,014 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 12:20:59,031 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 12:20:59,070 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 12:20:59,071 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 12:20:59,071 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 12:20:59,071 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 12:20:59,071 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 12:20:59,072 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 12:20:59,072 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 12:20:59,072 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 12:20:59,072 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 12:20:59,117 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states. [2019-10-02 12:20:59,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-02 12:20:59,151 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:20:59,154 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:20:59,157 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:20:59,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:20:59,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1054134663, now seen corresponding path program 1 times [2019-10-02 12:20:59,166 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:20:59,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:20:59,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:59,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:20:59,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:59,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:20:59,874 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:20:59,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:20:59,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:20:59,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:20:59,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:20:59,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:20:59,899 INFO L87 Difference]: Start difference. First operand 786 states. Second operand 4 states. [2019-10-02 12:21:00,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:21:00,105 INFO L93 Difference]: Finished difference Result 1235 states and 1989 transitions. [2019-10-02 12:21:00,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:21:00,108 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-10-02 12:21:00,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:21:00,150 INFO L225 Difference]: With dead ends: 1235 [2019-10-02 12:21:00,151 INFO L226 Difference]: Without dead ends: 626 [2019-10-02 12:21:00,167 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:21:00,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-02 12:21:00,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-02 12:21:00,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 12:21:00,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 996 transitions. [2019-10-02 12:21:00,312 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 996 transitions. Word has length 133 [2019-10-02 12:21:00,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:21:00,313 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 996 transitions. [2019-10-02 12:21:00,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:21:00,314 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 996 transitions. [2019-10-02 12:21:00,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-02 12:21:00,327 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:21:00,327 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:21:00,327 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:21:00,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:21:00,328 INFO L82 PathProgramCache]: Analyzing trace with hash 545110777, now seen corresponding path program 1 times [2019-10-02 12:21:00,329 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:21:00,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:21:00,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:00,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:21:00,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:00,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:21:00,596 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:21:00,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:21:00,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:21:00,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:21:00,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:21:00,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:21:00,600 INFO L87 Difference]: Start difference. First operand 626 states and 996 transitions. Second operand 4 states. [2019-10-02 12:21:00,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:21:00,689 INFO L93 Difference]: Finished difference Result 1215 states and 1950 transitions. [2019-10-02 12:21:00,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:21:00,689 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-10-02 12:21:00,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:21:00,695 INFO L225 Difference]: With dead ends: 1215 [2019-10-02 12:21:00,695 INFO L226 Difference]: Without dead ends: 626 [2019-10-02 12:21:00,699 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:21:00,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-02 12:21:00,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-02 12:21:00,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 12:21:00,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 995 transitions. [2019-10-02 12:21:00,727 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 995 transitions. Word has length 136 [2019-10-02 12:21:00,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:21:00,728 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 995 transitions. [2019-10-02 12:21:00,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:21:00,728 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 995 transitions. [2019-10-02 12:21:00,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-02 12:21:00,733 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:21:00,733 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:21:00,733 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:21:00,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:21:00,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1596840266, now seen corresponding path program 1 times [2019-10-02 12:21:00,734 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:21:00,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:21:00,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:00,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:21:00,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:00,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:21:00,956 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:21:00,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:21:00,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:21:00,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:21:00,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:21:00,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:21:00,958 INFO L87 Difference]: Start difference. First operand 626 states and 995 transitions. Second operand 4 states. [2019-10-02 12:21:01,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:21:01,027 INFO L93 Difference]: Finished difference Result 1215 states and 1949 transitions. [2019-10-02 12:21:01,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:21:01,028 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-10-02 12:21:01,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:21:01,033 INFO L225 Difference]: With dead ends: 1215 [2019-10-02 12:21:01,033 INFO L226 Difference]: Without dead ends: 626 [2019-10-02 12:21:01,036 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:21:01,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-02 12:21:01,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-02 12:21:01,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 12:21:01,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 994 transitions. [2019-10-02 12:21:01,060 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 994 transitions. Word has length 137 [2019-10-02 12:21:01,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:21:01,061 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 994 transitions. [2019-10-02 12:21:01,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:21:01,061 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 994 transitions. [2019-10-02 12:21:01,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-02 12:21:01,065 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:21:01,066 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:21:01,066 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:21:01,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:21:01,066 INFO L82 PathProgramCache]: Analyzing trace with hash -794225131, now seen corresponding path program 1 times [2019-10-02 12:21:01,067 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:21:01,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:21:01,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:01,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:21:01,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:01,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:21:01,218 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:21:01,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:21:01,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:21:01,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:21:01,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:21:01,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:21:01,221 INFO L87 Difference]: Start difference. First operand 626 states and 994 transitions. Second operand 4 states. [2019-10-02 12:21:01,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:21:01,293 INFO L93 Difference]: Finished difference Result 1215 states and 1948 transitions. [2019-10-02 12:21:01,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:21:01,294 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-10-02 12:21:01,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:21:01,303 INFO L225 Difference]: With dead ends: 1215 [2019-10-02 12:21:01,304 INFO L226 Difference]: Without dead ends: 626 [2019-10-02 12:21:01,307 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:21:01,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-02 12:21:01,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-02 12:21:01,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 12:21:01,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 993 transitions. [2019-10-02 12:21:01,329 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 993 transitions. Word has length 138 [2019-10-02 12:21:01,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:21:01,330 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 993 transitions. [2019-10-02 12:21:01,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:21:01,330 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 993 transitions. [2019-10-02 12:21:01,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-02 12:21:01,334 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:21:01,334 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:21:01,335 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:21:01,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:21:01,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1095628306, now seen corresponding path program 1 times [2019-10-02 12:21:01,335 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:21:01,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:21:01,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:01,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:21:01,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:01,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:21:01,455 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:21:01,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:21:01,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:21:01,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:21:01,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:21:01,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:21:01,457 INFO L87 Difference]: Start difference. First operand 626 states and 993 transitions. Second operand 4 states. [2019-10-02 12:21:01,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:21:01,515 INFO L93 Difference]: Finished difference Result 1215 states and 1947 transitions. [2019-10-02 12:21:01,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:21:01,516 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-10-02 12:21:01,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:21:01,521 INFO L225 Difference]: With dead ends: 1215 [2019-10-02 12:21:01,522 INFO L226 Difference]: Without dead ends: 626 [2019-10-02 12:21:01,525 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:21:01,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-02 12:21:01,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-02 12:21:01,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 12:21:01,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 992 transitions. [2019-10-02 12:21:01,550 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 992 transitions. Word has length 139 [2019-10-02 12:21:01,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:21:01,551 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 992 transitions. [2019-10-02 12:21:01,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:21:01,551 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 992 transitions. [2019-10-02 12:21:01,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-02 12:21:01,556 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:21:01,556 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:21:01,556 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:21:01,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:21:01,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1964836559, now seen corresponding path program 1 times [2019-10-02 12:21:01,557 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:21:01,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:21:01,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:01,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:21:01,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:01,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:21:01,805 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:21:01,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:21:01,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 12:21:01,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 12:21:01,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 12:21:01,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:21:01,807 INFO L87 Difference]: Start difference. First operand 626 states and 992 transitions. Second operand 10 states. [2019-10-02 12:21:01,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:21:01,968 INFO L93 Difference]: Finished difference Result 1173 states and 1867 transitions. [2019-10-02 12:21:01,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:21:01,969 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2019-10-02 12:21:01,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:21:01,974 INFO L225 Difference]: With dead ends: 1173 [2019-10-02 12:21:01,974 INFO L226 Difference]: Without dead ends: 635 [2019-10-02 12:21:01,977 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:21:01,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2019-10-02 12:21:02,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 633. [2019-10-02 12:21:02,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2019-10-02 12:21:02,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 1001 transitions. [2019-10-02 12:21:02,010 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 1001 transitions. Word has length 140 [2019-10-02 12:21:02,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:21:02,012 INFO L475 AbstractCegarLoop]: Abstraction has 633 states and 1001 transitions. [2019-10-02 12:21:02,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 12:21:02,013 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 1001 transitions. [2019-10-02 12:21:02,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-02 12:21:02,017 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:21:02,017 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:21:02,017 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:21:02,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:21:02,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1270189552, now seen corresponding path program 1 times [2019-10-02 12:21:02,018 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:21:02,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:21:02,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:02,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:21:02,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:02,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:21:02,145 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:21:02,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:21:02,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:21:02,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:21:02,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:21:02,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:21:02,148 INFO L87 Difference]: Start difference. First operand 633 states and 1001 transitions. Second operand 4 states. [2019-10-02 12:21:02,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:21:02,206 INFO L93 Difference]: Finished difference Result 1221 states and 1953 transitions. [2019-10-02 12:21:02,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:21:02,207 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-10-02 12:21:02,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:21:02,213 INFO L225 Difference]: With dead ends: 1221 [2019-10-02 12:21:02,214 INFO L226 Difference]: Without dead ends: 620 [2019-10-02 12:21:02,218 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:21:02,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-10-02 12:21:02,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-10-02 12:21:02,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-10-02 12:21:02,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 978 transitions. [2019-10-02 12:21:02,246 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 978 transitions. Word has length 140 [2019-10-02 12:21:02,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:21:02,248 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 978 transitions. [2019-10-02 12:21:02,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:21:02,249 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 978 transitions. [2019-10-02 12:21:02,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-02 12:21:02,254 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:21:02,254 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:21:02,254 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:21:02,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:21:02,255 INFO L82 PathProgramCache]: Analyzing trace with hash -730531008, now seen corresponding path program 1 times [2019-10-02 12:21:02,255 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:21:02,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:21:02,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:02,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:21:02,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:02,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:21:02,505 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:21:02,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:21:02,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:21:02,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:21:02,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:21:02,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:21:02,507 INFO L87 Difference]: Start difference. First operand 620 states and 978 transitions. Second operand 6 states. [2019-10-02 12:21:02,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:21:02,737 INFO L93 Difference]: Finished difference Result 1161 states and 1845 transitions. [2019-10-02 12:21:02,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:21:02,737 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-10-02 12:21:02,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:21:02,744 INFO L225 Difference]: With dead ends: 1161 [2019-10-02 12:21:02,744 INFO L226 Difference]: Without dead ends: 620 [2019-10-02 12:21:02,748 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:21:02,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-10-02 12:21:02,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-10-02 12:21:02,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-10-02 12:21:02,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 974 transitions. [2019-10-02 12:21:02,784 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 974 transitions. Word has length 141 [2019-10-02 12:21:02,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:21:02,785 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 974 transitions. [2019-10-02 12:21:02,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:21:02,785 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 974 transitions. [2019-10-02 12:21:02,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-02 12:21:02,789 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:21:02,790 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:21:02,790 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:21:02,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:21:02,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1761880204, now seen corresponding path program 1 times [2019-10-02 12:21:02,791 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:21:02,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:21:02,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:02,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:21:02,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:02,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:21:02,958 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:21:02,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:21:02,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:21:02,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:21:02,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:21:02,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:21:02,960 INFO L87 Difference]: Start difference. First operand 620 states and 974 transitions. Second operand 6 states. [2019-10-02 12:21:03,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:21:03,182 INFO L93 Difference]: Finished difference Result 1161 states and 1841 transitions. [2019-10-02 12:21:03,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:21:03,182 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-10-02 12:21:03,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:21:03,187 INFO L225 Difference]: With dead ends: 1161 [2019-10-02 12:21:03,188 INFO L226 Difference]: Without dead ends: 620 [2019-10-02 12:21:03,191 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:21:03,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-10-02 12:21:03,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-10-02 12:21:03,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-10-02 12:21:03,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 970 transitions. [2019-10-02 12:21:03,213 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 970 transitions. Word has length 142 [2019-10-02 12:21:03,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:21:03,214 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 970 transitions. [2019-10-02 12:21:03,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:21:03,214 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 970 transitions. [2019-10-02 12:21:03,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-02 12:21:03,218 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:21:03,219 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:21:03,219 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:21:03,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:21:03,219 INFO L82 PathProgramCache]: Analyzing trace with hash 333743557, now seen corresponding path program 1 times [2019-10-02 12:21:03,219 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:21:03,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:21:03,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:03,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:21:03,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:03,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:21:03,363 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:21:03,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:21:03,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:21:03,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:21:03,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:21:03,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:21:03,365 INFO L87 Difference]: Start difference. First operand 620 states and 970 transitions. Second operand 6 states. [2019-10-02 12:21:03,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:21:03,565 INFO L93 Difference]: Finished difference Result 1161 states and 1837 transitions. [2019-10-02 12:21:03,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:21:03,566 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-10-02 12:21:03,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:21:03,570 INFO L225 Difference]: With dead ends: 1161 [2019-10-02 12:21:03,571 INFO L226 Difference]: Without dead ends: 620 [2019-10-02 12:21:03,574 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:21:03,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-10-02 12:21:03,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-10-02 12:21:03,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-10-02 12:21:03,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 966 transitions. [2019-10-02 12:21:03,593 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 966 transitions. Word has length 143 [2019-10-02 12:21:03,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:21:03,594 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 966 transitions. [2019-10-02 12:21:03,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:21:03,594 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 966 transitions. [2019-10-02 12:21:03,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-02 12:21:03,598 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:21:03,598 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:21:03,599 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:21:03,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:21:03,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1388216901, now seen corresponding path program 1 times [2019-10-02 12:21:03,600 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:21:03,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:21:03,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:03,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:21:03,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:03,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:21:03,831 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:21:03,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:21:03,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:21:03,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:21:03,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:21:03,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:21:03,833 INFO L87 Difference]: Start difference. First operand 620 states and 966 transitions. Second operand 7 states. [2019-10-02 12:21:03,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:21:03,910 INFO L93 Difference]: Finished difference Result 1161 states and 1833 transitions. [2019-10-02 12:21:03,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:21:03,910 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-10-02 12:21:03,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:21:03,915 INFO L225 Difference]: With dead ends: 1161 [2019-10-02 12:21:03,916 INFO L226 Difference]: Without dead ends: 599 [2019-10-02 12:21:03,919 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:21:03,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-10-02 12:21:03,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2019-10-02 12:21:03,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-10-02 12:21:03,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 932 transitions. [2019-10-02 12:21:03,939 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 932 transitions. Word has length 143 [2019-10-02 12:21:03,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:21:03,939 INFO L475 AbstractCegarLoop]: Abstraction has 599 states and 932 transitions. [2019-10-02 12:21:03,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:21:03,940 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 932 transitions. [2019-10-02 12:21:03,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-02 12:21:03,943 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:21:03,944 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:21:03,944 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:21:03,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:21:03,944 INFO L82 PathProgramCache]: Analyzing trace with hash 581281177, now seen corresponding path program 1 times [2019-10-02 12:21:03,945 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:21:03,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:21:03,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:03,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:21:03,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:03,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:21:04,082 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:21:04,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:21:04,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:21:04,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:21:04,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:21:04,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:21:04,084 INFO L87 Difference]: Start difference. First operand 599 states and 932 transitions. Second operand 6 states. [2019-10-02 12:21:04,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:21:04,204 INFO L93 Difference]: Finished difference Result 1140 states and 1799 transitions. [2019-10-02 12:21:04,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:21:04,205 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-10-02 12:21:04,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:21:04,212 INFO L225 Difference]: With dead ends: 1140 [2019-10-02 12:21:04,212 INFO L226 Difference]: Without dead ends: 599 [2019-10-02 12:21:04,216 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:21:04,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-10-02 12:21:04,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2019-10-02 12:21:04,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-10-02 12:21:04,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 931 transitions. [2019-10-02 12:21:04,241 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 931 transitions. Word has length 144 [2019-10-02 12:21:04,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:21:04,242 INFO L475 AbstractCegarLoop]: Abstraction has 599 states and 931 transitions. [2019-10-02 12:21:04,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:21:04,242 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 931 transitions. [2019-10-02 12:21:04,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-02 12:21:04,247 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:21:04,247 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:21:04,248 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:21:04,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:21:04,248 INFO L82 PathProgramCache]: Analyzing trace with hash -627276726, now seen corresponding path program 1 times [2019-10-02 12:21:04,248 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:21:04,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:21:04,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:04,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:21:04,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:04,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:21:04,392 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:21:04,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:21:04,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:21:04,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:21:04,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:21:04,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:21:04,394 INFO L87 Difference]: Start difference. First operand 599 states and 931 transitions. Second operand 6 states. [2019-10-02 12:21:04,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:21:04,485 INFO L93 Difference]: Finished difference Result 1140 states and 1798 transitions. [2019-10-02 12:21:04,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:21:04,486 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-10-02 12:21:04,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:21:04,490 INFO L225 Difference]: With dead ends: 1140 [2019-10-02 12:21:04,491 INFO L226 Difference]: Without dead ends: 599 [2019-10-02 12:21:04,494 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:21:04,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-10-02 12:21:04,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2019-10-02 12:21:04,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-10-02 12:21:04,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 930 transitions. [2019-10-02 12:21:04,514 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 930 transitions. Word has length 145 [2019-10-02 12:21:04,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:21:04,514 INFO L475 AbstractCegarLoop]: Abstraction has 599 states and 930 transitions. [2019-10-02 12:21:04,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:21:04,515 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 930 transitions. [2019-10-02 12:21:04,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-02 12:21:04,519 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:21:04,519 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:21:04,519 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:21:04,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:21:04,520 INFO L82 PathProgramCache]: Analyzing trace with hash 269844414, now seen corresponding path program 1 times [2019-10-02 12:21:04,520 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:21:04,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:21:04,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:04,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:21:04,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:04,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:21:04,802 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:21:04,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:21:04,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 12:21:04,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:21:04,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:21:04,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:21:04,804 INFO L87 Difference]: Start difference. First operand 599 states and 930 transitions. Second operand 12 states. [2019-10-02 12:21:05,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:21:05,053 INFO L93 Difference]: Finished difference Result 1141 states and 1797 transitions. [2019-10-02 12:21:05,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:21:05,054 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 146 [2019-10-02 12:21:05,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:21:05,061 INFO L225 Difference]: With dead ends: 1141 [2019-10-02 12:21:05,062 INFO L226 Difference]: Without dead ends: 599 [2019-10-02 12:21:05,066 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:21:05,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-10-02 12:21:05,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2019-10-02 12:21:05,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-10-02 12:21:05,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 929 transitions. [2019-10-02 12:21:05,094 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 929 transitions. Word has length 146 [2019-10-02 12:21:05,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:21:05,094 INFO L475 AbstractCegarLoop]: Abstraction has 599 states and 929 transitions. [2019-10-02 12:21:05,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:21:05,095 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 929 transitions. [2019-10-02 12:21:05,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-02 12:21:05,101 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:21:05,101 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:21:05,102 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:21:05,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:21:05,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1889822343, now seen corresponding path program 1 times [2019-10-02 12:21:05,102 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:21:05,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:21:05,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:05,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:21:05,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:05,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:21:05,318 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:21:05,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:21:05,319 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:21:05,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:21:05,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:21:05,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 2771 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:21:05,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:21:05,974 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 12:21:05,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:21:05,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-10-02 12:21:05,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:21:05,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:21:05,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:21:05,994 INFO L87 Difference]: Start difference. First operand 599 states and 929 transitions. Second operand 9 states. [2019-10-02 12:21:07,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:21:07,436 INFO L93 Difference]: Finished difference Result 1136 states and 1817 transitions. [2019-10-02 12:21:07,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:21:07,437 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 147 [2019-10-02 12:21:07,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:21:07,442 INFO L225 Difference]: With dead ends: 1136 [2019-10-02 12:21:07,442 INFO L226 Difference]: Without dead ends: 603 [2019-10-02 12:21:07,445 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 145 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:21:07,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-10-02 12:21:07,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 603. [2019-10-02 12:21:07,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-10-02 12:21:07,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 933 transitions. [2019-10-02 12:21:07,470 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 933 transitions. Word has length 147 [2019-10-02 12:21:07,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:21:07,470 INFO L475 AbstractCegarLoop]: Abstraction has 603 states and 933 transitions. [2019-10-02 12:21:07,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:21:07,471 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 933 transitions. [2019-10-02 12:21:07,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-02 12:21:07,474 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:21:07,475 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:21:07,475 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:21:07,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:21:07,476 INFO L82 PathProgramCache]: Analyzing trace with hash 2076963317, now seen corresponding path program 1 times [2019-10-02 12:21:07,476 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:21:07,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:21:07,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:07,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:21:07,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:07,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:21:07,643 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:21:07,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:21:07,643 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:21:07,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:21:08,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:21:08,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 2773 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:21:08,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:21:08,262 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Stream Closed [2019-10-02 12:21:08,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:21:08,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-10-02 12:21:08,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:21:08,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:21:08,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:21:08,272 INFO L87 Difference]: Start difference. First operand 603 states and 933 transitions. Second operand 9 states. [2019-10-02 12:21:09,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:21:09,498 INFO L93 Difference]: Finished difference Result 1145 states and 1824 transitions. [2019-10-02 12:21:09,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:21:09,499 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 149 [2019-10-02 12:21:09,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:21:09,506 INFO L225 Difference]: With dead ends: 1145 [2019-10-02 12:21:09,506 INFO L226 Difference]: Without dead ends: 608 [2019-10-02 12:21:09,510 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 148 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:21:09,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-10-02 12:21:09,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2019-10-02 12:21:09,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2019-10-02 12:21:09,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 938 transitions. [2019-10-02 12:21:09,533 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 938 transitions. Word has length 149 [2019-10-02 12:21:09,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:21:09,533 INFO L475 AbstractCegarLoop]: Abstraction has 608 states and 938 transitions. [2019-10-02 12:21:09,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:21:09,534 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 938 transitions. [2019-10-02 12:21:09,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-02 12:21:09,538 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:21:09,538 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:21:09,538 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:21:09,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:21:09,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1312607033, now seen corresponding path program 1 times [2019-10-02 12:21:09,539 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:21:09,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:21:09,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:09,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:21:09,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:09,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:21:09,680 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:21:09,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:21:09,680 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:21:09,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:21:10,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:21:10,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 2775 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:21:10,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:21:10,327 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:21:10,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:21:10,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-10-02 12:21:10,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:21:10,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:21:10,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:21:10,340 INFO L87 Difference]: Start difference. First operand 608 states and 938 transitions. Second operand 9 states. [2019-10-02 12:21:11,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:21:11,542 INFO L93 Difference]: Finished difference Result 1156 states and 1833 transitions. [2019-10-02 12:21:11,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:21:11,543 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 151 [2019-10-02 12:21:11,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:21:11,549 INFO L225 Difference]: With dead ends: 1156 [2019-10-02 12:21:11,550 INFO L226 Difference]: Without dead ends: 614 [2019-10-02 12:21:11,554 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 150 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:21:11,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-10-02 12:21:11,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2019-10-02 12:21:11,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-10-02 12:21:11,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 944 transitions. [2019-10-02 12:21:11,578 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 944 transitions. Word has length 151 [2019-10-02 12:21:11,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:21:11,579 INFO L475 AbstractCegarLoop]: Abstraction has 614 states and 944 transitions. [2019-10-02 12:21:11,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:21:11,579 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 944 transitions. [2019-10-02 12:21:11,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-02 12:21:11,584 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:21:11,584 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:21:11,584 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:21:11,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:21:11,585 INFO L82 PathProgramCache]: Analyzing trace with hash -941872595, now seen corresponding path program 1 times [2019-10-02 12:21:11,585 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:21:11,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:21:11,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:11,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:21:11,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:11,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:21:11,727 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:21:11,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:21:11,727 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:21:11,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:21:12,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:21:12,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 2777 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:21:12,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:21:12,503 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 12:21:12,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:21:12,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-10-02 12:21:12,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:21:12,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:21:12,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:21:12,523 INFO L87 Difference]: Start difference. First operand 614 states and 944 transitions. Second operand 9 states. [2019-10-02 12:21:13,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:21:13,849 INFO L93 Difference]: Finished difference Result 1169 states and 1844 transitions. [2019-10-02 12:21:13,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:21:13,849 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 153 [2019-10-02 12:21:13,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:21:13,853 INFO L225 Difference]: With dead ends: 1169 [2019-10-02 12:21:13,853 INFO L226 Difference]: Without dead ends: 621 [2019-10-02 12:21:13,856 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 152 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:21:13,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2019-10-02 12:21:13,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 621. [2019-10-02 12:21:13,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2019-10-02 12:21:13,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 951 transitions. [2019-10-02 12:21:13,885 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 951 transitions. Word has length 153 [2019-10-02 12:21:13,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:21:13,887 INFO L475 AbstractCegarLoop]: Abstraction has 621 states and 951 transitions. [2019-10-02 12:21:13,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:21:13,887 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 951 transitions. [2019-10-02 12:21:13,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-02 12:21:13,891 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:21:13,891 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] [2019-10-02 12:21:13,891 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:21:13,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:21:13,892 INFO L82 PathProgramCache]: Analyzing trace with hash 807721721, now seen corresponding path program 1 times [2019-10-02 12:21:13,892 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:21:13,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:21:13,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:13,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:21:13,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:13,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:21:14,075 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:21:14,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:21:14,075 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:21:14,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:21:14,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:21:14,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 2779 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:21:14,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:21:14,761 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:21:14,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:21:14,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-10-02 12:21:14,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:21:14,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:21:14,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:21:14,781 INFO L87 Difference]: Start difference. First operand 621 states and 951 transitions. Second operand 14 states. [2019-10-02 12:21:25,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:21:25,791 INFO L93 Difference]: Finished difference Result 1859 states and 2923 transitions. [2019-10-02 12:21:25,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 12:21:25,791 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 155 [2019-10-02 12:21:25,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:21:25,800 INFO L225 Difference]: With dead ends: 1859 [2019-10-02 12:21:25,801 INFO L226 Difference]: Without dead ends: 1304 [2019-10-02 12:21:25,804 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 167 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=196, Invalid=994, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 12:21:25,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1304 states. [2019-10-02 12:21:25,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 1248. [2019-10-02 12:21:25,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1248 states. [2019-10-02 12:21:25,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1248 states and 1950 transitions. [2019-10-02 12:21:25,872 INFO L78 Accepts]: Start accepts. Automaton has 1248 states and 1950 transitions. Word has length 155 [2019-10-02 12:21:25,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:21:25,872 INFO L475 AbstractCegarLoop]: Abstraction has 1248 states and 1950 transitions. [2019-10-02 12:21:25,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 12:21:25,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 1950 transitions. [2019-10-02 12:21:25,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-02 12:21:25,879 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:21:25,880 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:21:25,880 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:21:25,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:21:25,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1614955537, now seen corresponding path program 1 times [2019-10-02 12:21:25,880 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:21:25,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:21:25,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:25,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:21:25,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:25,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:21:26,024 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:21:26,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:21:26,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:21:26,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:21:26,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:21:26,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:21:26,026 INFO L87 Difference]: Start difference. First operand 1248 states and 1950 transitions. Second operand 9 states. [2019-10-02 12:21:26,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:21:26,162 INFO L93 Difference]: Finished difference Result 1810 states and 2833 transitions. [2019-10-02 12:21:26,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:21:26,163 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 164 [2019-10-02 12:21:26,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:21:26,167 INFO L225 Difference]: With dead ends: 1810 [2019-10-02 12:21:26,167 INFO L226 Difference]: Without dead ends: 616 [2019-10-02 12:21:26,174 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:21:26,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2019-10-02 12:21:26,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 616. [2019-10-02 12:21:26,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2019-10-02 12:21:26,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 938 transitions. [2019-10-02 12:21:26,209 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 938 transitions. Word has length 164 [2019-10-02 12:21:26,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:21:26,211 INFO L475 AbstractCegarLoop]: Abstraction has 616 states and 938 transitions. [2019-10-02 12:21:26,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:21:26,211 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 938 transitions. [2019-10-02 12:21:26,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-02 12:21:26,214 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:21:26,215 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] [2019-10-02 12:21:26,215 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:21:26,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:21:26,216 INFO L82 PathProgramCache]: Analyzing trace with hash -120702457, now seen corresponding path program 1 times [2019-10-02 12:21:26,216 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:21:26,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:21:26,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:26,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:21:26,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:26,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:21:26,452 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-02 12:21:26,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:21:26,452 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:21:26,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:21:26,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:21:26,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 2814 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 12:21:26,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:21:27,051 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-02 12:21:27,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:21:27,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2019-10-02 12:21:27,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:21:27,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:21:27,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:21:27,073 INFO L87 Difference]: Start difference. First operand 616 states and 938 transitions. Second operand 14 states. [2019-10-02 12:21:32,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:21:32,640 INFO L93 Difference]: Finished difference Result 1217 states and 1897 transitions. [2019-10-02 12:21:32,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 12:21:32,641 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 167 [2019-10-02 12:21:32,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:21:32,646 INFO L225 Difference]: With dead ends: 1217 [2019-10-02 12:21:32,646 INFO L226 Difference]: Without dead ends: 664 [2019-10-02 12:21:32,649 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2019-10-02 12:21:32,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2019-10-02 12:21:32,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 627. [2019-10-02 12:21:32,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-10-02 12:21:32,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 953 transitions. [2019-10-02 12:21:32,680 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 953 transitions. Word has length 167 [2019-10-02 12:21:32,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:21:32,680 INFO L475 AbstractCegarLoop]: Abstraction has 627 states and 953 transitions. [2019-10-02 12:21:32,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 12:21:32,681 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 953 transitions. [2019-10-02 12:21:32,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-02 12:21:32,686 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:21:32,688 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] [2019-10-02 12:21:32,688 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:21:32,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:21:32,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1059386421, now seen corresponding path program 1 times [2019-10-02 12:21:32,688 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:21:32,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:21:32,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:32,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:21:32,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:32,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:21:32,911 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-02 12:21:32,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:21:32,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:21:32,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:21:32,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:21:32,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:21:32,913 INFO L87 Difference]: Start difference. First operand 627 states and 953 transitions. Second operand 11 states. [2019-10-02 12:21:37,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:21:37,764 INFO L93 Difference]: Finished difference Result 1189 states and 1842 transitions. [2019-10-02 12:21:37,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:21:37,767 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 174 [2019-10-02 12:21:37,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:21:37,771 INFO L225 Difference]: With dead ends: 1189 [2019-10-02 12:21:37,771 INFO L226 Difference]: Without dead ends: 625 [2019-10-02 12:21:37,774 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:21:37,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2019-10-02 12:21:37,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 625. [2019-10-02 12:21:37,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625 states. [2019-10-02 12:21:37,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 949 transitions. [2019-10-02 12:21:37,801 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 949 transitions. Word has length 174 [2019-10-02 12:21:37,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:21:37,802 INFO L475 AbstractCegarLoop]: Abstraction has 625 states and 949 transitions. [2019-10-02 12:21:37,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:21:37,802 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 949 transitions. [2019-10-02 12:21:37,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-02 12:21:37,806 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:21:37,806 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:21:37,806 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:21:37,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:21:37,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1174315462, now seen corresponding path program 1 times [2019-10-02 12:21:37,807 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:21:37,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:21:37,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:37,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:21:37,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:37,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:21:37,997 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 12:21:37,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:21:37,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:21:37,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:21:37,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:21:37,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:21:37,999 INFO L87 Difference]: Start difference. First operand 625 states and 949 transitions. Second operand 9 states. [2019-10-02 12:21:43,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:21:43,613 INFO L93 Difference]: Finished difference Result 1948 states and 3036 transitions. [2019-10-02 12:21:43,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 12:21:43,613 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 176 [2019-10-02 12:21:43,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:21:43,627 INFO L225 Difference]: With dead ends: 1948 [2019-10-02 12:21:43,627 INFO L226 Difference]: Without dead ends: 1386 [2019-10-02 12:21:43,630 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2019-10-02 12:21:43,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2019-10-02 12:21:43,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 1342. [2019-10-02 12:21:43,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2019-10-02 12:21:43,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 2078 transitions. [2019-10-02 12:21:43,696 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 2078 transitions. Word has length 176 [2019-10-02 12:21:43,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:21:43,696 INFO L475 AbstractCegarLoop]: Abstraction has 1342 states and 2078 transitions. [2019-10-02 12:21:43,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:21:43,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 2078 transitions. [2019-10-02 12:21:43,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-10-02 12:21:43,700 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:21:43,700 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:21:43,701 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:21:43,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:21:43,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1162452873, now seen corresponding path program 1 times [2019-10-02 12:21:43,701 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:21:43,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:21:43,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:43,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:21:43,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:43,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:21:43,830 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 12:21:43,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:21:43,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:21:43,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:21:43,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:21:43,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:21:43,832 INFO L87 Difference]: Start difference. First operand 1342 states and 2078 transitions. Second operand 7 states. [2019-10-02 12:21:43,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:21:43,947 INFO L93 Difference]: Finished difference Result 2664 states and 4153 transitions. [2019-10-02 12:21:43,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:21:43,948 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 181 [2019-10-02 12:21:43,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:21:43,957 INFO L225 Difference]: With dead ends: 2664 [2019-10-02 12:21:43,957 INFO L226 Difference]: Without dead ends: 1385 [2019-10-02 12:21:43,962 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:21:43,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2019-10-02 12:21:44,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 1363. [2019-10-02 12:21:44,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363 states. [2019-10-02 12:21:44,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 2102 transitions. [2019-10-02 12:21:44,026 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 2102 transitions. Word has length 181 [2019-10-02 12:21:44,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:21:44,026 INFO L475 AbstractCegarLoop]: Abstraction has 1363 states and 2102 transitions. [2019-10-02 12:21:44,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:21:44,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 2102 transitions. [2019-10-02 12:21:44,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-10-02 12:21:44,030 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:21:44,031 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, 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:44,031 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:21:44,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:21:44,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1416241055, now seen corresponding path program 1 times [2019-10-02 12:21:44,032 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:21:44,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:21:44,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:44,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:21:44,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:44,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:21:44,290 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 12:21:44,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:21:44,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:21:44,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:21:44,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:21:44,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:21:44,293 INFO L87 Difference]: Start difference. First operand 1363 states and 2102 transitions. Second operand 8 states. [2019-10-02 12:21:49,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:21:49,959 INFO L93 Difference]: Finished difference Result 4364 states and 6849 transitions. [2019-10-02 12:21:49,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:21:49,960 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 185 [2019-10-02 12:21:49,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:21:49,994 INFO L225 Difference]: With dead ends: 4364 [2019-10-02 12:21:49,994 INFO L226 Difference]: Without dead ends: 3062 [2019-10-02 12:21:50,003 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:21:50,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3062 states. [2019-10-02 12:21:50,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3062 to 3025. [2019-10-02 12:21:50,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3025 states. [2019-10-02 12:21:50,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3025 states to 3025 states and 4684 transitions. [2019-10-02 12:21:50,251 INFO L78 Accepts]: Start accepts. Automaton has 3025 states and 4684 transitions. Word has length 185 [2019-10-02 12:21:50,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:21:50,252 INFO L475 AbstractCegarLoop]: Abstraction has 3025 states and 4684 transitions. [2019-10-02 12:21:50,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:21:50,252 INFO L276 IsEmpty]: Start isEmpty. Operand 3025 states and 4684 transitions. [2019-10-02 12:21:50,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-10-02 12:21:50,257 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:21:50,258 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, 1, 1, 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:50,258 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:21:50,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:21:50,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1011361474, now seen corresponding path program 1 times [2019-10-02 12:21:50,259 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:21:50,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:21:50,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:50,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:21:50,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:50,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:21:50,629 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 12:21:50,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:21:50,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:21:50,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:21:50,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:21:50,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:21:50,633 INFO L87 Difference]: Start difference. First operand 3025 states and 4684 transitions. Second operand 9 states. [2019-10-02 12:21:51,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:21:51,089 INFO L93 Difference]: Finished difference Result 5886 states and 9278 transitions. [2019-10-02 12:21:51,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:21:51,090 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 188 [2019-10-02 12:21:51,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:21:51,123 INFO L225 Difference]: With dead ends: 5886 [2019-10-02 12:21:51,123 INFO L226 Difference]: Without dead ends: 3025 [2019-10-02 12:21:51,139 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:21:51,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3025 states. [2019-10-02 12:21:51,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3025 to 3025. [2019-10-02 12:21:51,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3025 states. [2019-10-02 12:21:51,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3025 states to 3025 states and 4638 transitions. [2019-10-02 12:21:51,365 INFO L78 Accepts]: Start accepts. Automaton has 3025 states and 4638 transitions. Word has length 188 [2019-10-02 12:21:51,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:21:51,366 INFO L475 AbstractCegarLoop]: Abstraction has 3025 states and 4638 transitions. [2019-10-02 12:21:51,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:21:51,367 INFO L276 IsEmpty]: Start isEmpty. Operand 3025 states and 4638 transitions. [2019-10-02 12:21:51,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-10-02 12:21:51,372 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:21:51,372 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:21:51,373 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:21:51,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:21:51,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1273079420, now seen corresponding path program 1 times [2019-10-02 12:21:51,374 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:21:51,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:21:51,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:51,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:21:51,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:51,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:21:51,628 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 12:21:51,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:21:51,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:21:51,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:21:51,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:21:51,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:21:51,631 INFO L87 Difference]: Start difference. First operand 3025 states and 4638 transitions. Second operand 7 states. [2019-10-02 12:21:56,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:21:56,001 INFO L93 Difference]: Finished difference Result 5682 states and 8757 transitions. [2019-10-02 12:21:56,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 12:21:56,002 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 193 [2019-10-02 12:21:56,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:21:56,039 INFO L225 Difference]: With dead ends: 5682 [2019-10-02 12:21:56,040 INFO L226 Difference]: Without dead ends: 3208 [2019-10-02 12:21:56,049 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:21:56,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3208 states. [2019-10-02 12:21:56,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3208 to 3141. [2019-10-02 12:21:56,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3141 states. [2019-10-02 12:21:56,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 4795 transitions. [2019-10-02 12:21:56,207 INFO L78 Accepts]: Start accepts. Automaton has 3141 states and 4795 transitions. Word has length 193 [2019-10-02 12:21:56,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:21:56,208 INFO L475 AbstractCegarLoop]: Abstraction has 3141 states and 4795 transitions. [2019-10-02 12:21:56,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:21:56,208 INFO L276 IsEmpty]: Start isEmpty. Operand 3141 states and 4795 transitions. [2019-10-02 12:21:56,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-10-02 12:21:56,212 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:21:56,212 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:21:56,212 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:21:56,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:21:56,213 INFO L82 PathProgramCache]: Analyzing trace with hash 81256379, now seen corresponding path program 1 times [2019-10-02 12:21:56,213 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:21:56,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:21:56,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:56,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:21:56,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:56,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:21:56,359 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:21:56,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:21:56,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:21:56,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:21:56,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:21:56,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:21:56,360 INFO L87 Difference]: Start difference. First operand 3141 states and 4795 transitions. Second operand 6 states. [2019-10-02 12:21:56,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:21:56,570 INFO L93 Difference]: Finished difference Result 6682 states and 10254 transitions. [2019-10-02 12:21:56,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:21:56,570 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 198 [2019-10-02 12:21:56,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:21:56,607 INFO L225 Difference]: With dead ends: 6682 [2019-10-02 12:21:56,607 INFO L226 Difference]: Without dead ends: 4092 [2019-10-02 12:21:56,619 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:21:56,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4092 states. [2019-10-02 12:21:56,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4092 to 3794. [2019-10-02 12:21:56,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3794 states. [2019-10-02 12:21:56,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3794 states to 3794 states and 5790 transitions. [2019-10-02 12:21:56,796 INFO L78 Accepts]: Start accepts. Automaton has 3794 states and 5790 transitions. Word has length 198 [2019-10-02 12:21:56,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:21:56,797 INFO L475 AbstractCegarLoop]: Abstraction has 3794 states and 5790 transitions. [2019-10-02 12:21:56,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:21:56,797 INFO L276 IsEmpty]: Start isEmpty. Operand 3794 states and 5790 transitions. [2019-10-02 12:21:56,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-10-02 12:21:56,800 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:21:56,801 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:21:56,801 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:21:56,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:21:56,802 INFO L82 PathProgramCache]: Analyzing trace with hash 740787901, now seen corresponding path program 1 times [2019-10-02 12:21:56,802 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:21:56,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:21:56,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:56,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:21:56,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:56,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:21:57,006 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:21:57,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:21:57,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:21:57,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:21:57,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:21:57,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:21:57,008 INFO L87 Difference]: Start difference. First operand 3794 states and 5790 transitions. Second operand 8 states. [2019-10-02 12:21:57,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:21:57,175 INFO L93 Difference]: Finished difference Result 3817 states and 5819 transitions. [2019-10-02 12:21:57,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:21:57,175 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 198 [2019-10-02 12:21:57,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:21:57,195 INFO L225 Difference]: With dead ends: 3817 [2019-10-02 12:21:57,195 INFO L226 Difference]: Without dead ends: 3800 [2019-10-02 12:21:57,199 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:21:57,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3800 states. [2019-10-02 12:21:57,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3800 to 3794. [2019-10-02 12:21:57,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3794 states. [2019-10-02 12:21:57,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3794 states to 3794 states and 5784 transitions. [2019-10-02 12:21:57,455 INFO L78 Accepts]: Start accepts. Automaton has 3794 states and 5784 transitions. Word has length 198 [2019-10-02 12:21:57,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:21:57,456 INFO L475 AbstractCegarLoop]: Abstraction has 3794 states and 5784 transitions. [2019-10-02 12:21:57,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:21:57,456 INFO L276 IsEmpty]: Start isEmpty. Operand 3794 states and 5784 transitions. [2019-10-02 12:21:57,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-10-02 12:21:57,460 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:21:57,460 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:21:57,460 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:21:57,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:21:57,461 INFO L82 PathProgramCache]: Analyzing trace with hash -563676293, now seen corresponding path program 1 times [2019-10-02 12:21:57,461 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:21:57,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:21:57,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:57,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:21:57,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:57,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:21:57,693 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-02 12:21:57,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:21:57,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:21:57,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:21:57,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:21:57,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:21:57,696 INFO L87 Difference]: Start difference. First operand 3794 states and 5784 transitions. Second operand 9 states. [2019-10-02 12:22:01,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:22:01,256 INFO L93 Difference]: Finished difference Result 7519 states and 11512 transitions. [2019-10-02 12:22:01,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:22:01,257 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 216 [2019-10-02 12:22:01,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:22:01,278 INFO L225 Difference]: With dead ends: 7519 [2019-10-02 12:22:01,278 INFO L226 Difference]: Without dead ends: 3800 [2019-10-02 12:22:01,290 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:22:01,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3800 states. [2019-10-02 12:22:01,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3800 to 3794. [2019-10-02 12:22:01,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3794 states. [2019-10-02 12:22:01,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3794 states to 3794 states and 5778 transitions. [2019-10-02 12:22:01,482 INFO L78 Accepts]: Start accepts. Automaton has 3794 states and 5778 transitions. Word has length 216 [2019-10-02 12:22:01,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:22:01,483 INFO L475 AbstractCegarLoop]: Abstraction has 3794 states and 5778 transitions. [2019-10-02 12:22:01,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:22:01,483 INFO L276 IsEmpty]: Start isEmpty. Operand 3794 states and 5778 transitions. [2019-10-02 12:22:01,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-10-02 12:22:01,487 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:22:01,487 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:22:01,488 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:22:01,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:22:01,489 INFO L82 PathProgramCache]: Analyzing trace with hash 651138481, now seen corresponding path program 1 times [2019-10-02 12:22:01,489 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:22:01,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:22:01,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:22:01,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:22:01,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:22:01,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:22:01,719 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-10-02 12:22:01,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:22:01,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:22:01,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:22:01,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:22:01,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:22:01,721 INFO L87 Difference]: Start difference. First operand 3794 states and 5778 transitions. Second operand 6 states. [2019-10-02 12:22:05,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:22:05,879 INFO L93 Difference]: Finished difference Result 12030 states and 18885 transitions. [2019-10-02 12:22:05,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:22:05,880 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 217 [2019-10-02 12:22:05,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:22:05,938 INFO L225 Difference]: With dead ends: 12030 [2019-10-02 12:22:05,938 INFO L226 Difference]: Without dead ends: 8311 [2019-10-02 12:22:05,954 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:22:05,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8311 states. [2019-10-02 12:22:06,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8311 to 7908. [2019-10-02 12:22:06,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7908 states. [2019-10-02 12:22:06,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7908 states to 7908 states and 12178 transitions. [2019-10-02 12:22:06,467 INFO L78 Accepts]: Start accepts. Automaton has 7908 states and 12178 transitions. Word has length 217 [2019-10-02 12:22:06,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:22:06,467 INFO L475 AbstractCegarLoop]: Abstraction has 7908 states and 12178 transitions. [2019-10-02 12:22:06,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:22:06,468 INFO L276 IsEmpty]: Start isEmpty. Operand 7908 states and 12178 transitions. [2019-10-02 12:22:06,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-10-02 12:22:06,473 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:22:06,474 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:22:06,475 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:22:06,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:22:06,475 INFO L82 PathProgramCache]: Analyzing trace with hash -247823010, now seen corresponding path program 1 times [2019-10-02 12:22:06,475 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:22:06,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:22:06,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:22:06,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:22:06,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:22:06,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:22:06,625 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-10-02 12:22:06,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:22:06,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:22:06,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:22:06,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:22:06,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:22:06,628 INFO L87 Difference]: Start difference. First operand 7908 states and 12178 transitions. Second operand 4 states. [2019-10-02 12:22:09,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:22:09,734 INFO L93 Difference]: Finished difference Result 24805 states and 39500 transitions. [2019-10-02 12:22:09,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:22:09,734 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 225 [2019-10-02 12:22:09,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:22:09,862 INFO L225 Difference]: With dead ends: 24805 [2019-10-02 12:22:09,863 INFO L226 Difference]: Without dead ends: 16960 [2019-10-02 12:22:09,898 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:22:09,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16960 states. [2019-10-02 12:22:10,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16960 to 16776. [2019-10-02 12:22:10,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16776 states. [2019-10-02 12:22:10,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16776 states to 16776 states and 26728 transitions. [2019-10-02 12:22:10,893 INFO L78 Accepts]: Start accepts. Automaton has 16776 states and 26728 transitions. Word has length 225 [2019-10-02 12:22:10,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:22:10,894 INFO L475 AbstractCegarLoop]: Abstraction has 16776 states and 26728 transitions. [2019-10-02 12:22:10,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:22:10,894 INFO L276 IsEmpty]: Start isEmpty. Operand 16776 states and 26728 transitions. [2019-10-02 12:22:10,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-10-02 12:22:10,903 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:22:10,904 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:22:10,904 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:22:10,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:22:10,904 INFO L82 PathProgramCache]: Analyzing trace with hash 906105755, now seen corresponding path program 1 times [2019-10-02 12:22:10,905 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:22:10,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:22:10,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:22:10,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:22:10,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:22:10,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:22:11,041 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-10-02 12:22:11,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:22:11,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:22:11,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:22:11,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:22:11,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:22:11,043 INFO L87 Difference]: Start difference. First operand 16776 states and 26728 transitions. Second operand 4 states. [2019-10-02 12:22:14,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:22:14,365 INFO L93 Difference]: Finished difference Result 53427 states and 90025 transitions. [2019-10-02 12:22:14,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:22:14,368 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 226 [2019-10-02 12:22:14,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:22:14,632 INFO L225 Difference]: With dead ends: 53427 [2019-10-02 12:22:14,632 INFO L226 Difference]: Without dead ends: 36714 [2019-10-02 12:22:14,699 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:22:14,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36714 states. [2019-10-02 12:22:17,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36714 to 36299. [2019-10-02 12:22:17,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36299 states. [2019-10-02 12:22:18,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36299 states to 36299 states and 61132 transitions. [2019-10-02 12:22:18,059 INFO L78 Accepts]: Start accepts. Automaton has 36299 states and 61132 transitions. Word has length 226 [2019-10-02 12:22:18,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:22:18,060 INFO L475 AbstractCegarLoop]: Abstraction has 36299 states and 61132 transitions. [2019-10-02 12:22:18,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:22:18,060 INFO L276 IsEmpty]: Start isEmpty. Operand 36299 states and 61132 transitions. [2019-10-02 12:22:18,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-10-02 12:22:18,076 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:22:18,077 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:22:18,077 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:22:18,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:22:18,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1976804288, now seen corresponding path program 1 times [2019-10-02 12:22:18,078 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:22:18,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:22:18,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:22:18,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:22:18,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:22:18,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:22:18,218 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-10-02 12:22:18,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:22:18,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:22:18,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:22:18,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:22:18,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:22:18,220 INFO L87 Difference]: Start difference. First operand 36299 states and 61132 transitions. Second operand 4 states. [2019-10-02 12:22:23,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:22:23,740 INFO L93 Difference]: Finished difference Result 117470 states and 216926 transitions. [2019-10-02 12:22:23,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:22:23,740 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 227 [2019-10-02 12:22:23,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:22:24,388 INFO L225 Difference]: With dead ends: 117470 [2019-10-02 12:22:24,388 INFO L226 Difference]: Without dead ends: 81234 [2019-10-02 12:22:24,524 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:22:24,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81234 states. [2019-10-02 12:22:31,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81234 to 80262. [2019-10-02 12:22:31,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80262 states. [2019-10-02 12:22:31,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80262 states to 80262 states and 147508 transitions. [2019-10-02 12:22:31,748 INFO L78 Accepts]: Start accepts. Automaton has 80262 states and 147508 transitions. Word has length 227 [2019-10-02 12:22:31,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:22:31,749 INFO L475 AbstractCegarLoop]: Abstraction has 80262 states and 147508 transitions. [2019-10-02 12:22:31,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:22:31,750 INFO L276 IsEmpty]: Start isEmpty. Operand 80262 states and 147508 transitions. [2019-10-02 12:22:31,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-10-02 12:22:31,772 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:22:31,773 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:22:31,773 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:22:31,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:22:31,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1152698499, now seen corresponding path program 1 times [2019-10-02 12:22:31,774 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:22:31,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:22:31,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:22:31,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:22:31,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:22:31,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:22:31,915 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-10-02 12:22:31,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:22:31,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:22:31,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:22:31,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:22:31,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:22:31,917 INFO L87 Difference]: Start difference. First operand 80262 states and 147508 transitions. Second operand 4 states. [2019-10-02 12:22:45,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:22:45,356 INFO L93 Difference]: Finished difference Result 264337 states and 562987 transitions. [2019-10-02 12:22:45,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:22:45,357 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 228 [2019-10-02 12:22:45,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:22:46,926 INFO L225 Difference]: With dead ends: 264337 [2019-10-02 12:22:46,926 INFO L226 Difference]: Without dead ends: 184138 [2019-10-02 12:22:47,260 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:22:47,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184138 states. [2019-10-02 12:23:04,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184138 to 181765. [2019-10-02 12:23:04,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181765 states. [2019-10-02 12:23:06,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181765 states to 181765 states and 381404 transitions. [2019-10-02 12:23:06,330 INFO L78 Accepts]: Start accepts. Automaton has 181765 states and 381404 transitions. Word has length 228 [2019-10-02 12:23:06,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:23:06,331 INFO L475 AbstractCegarLoop]: Abstraction has 181765 states and 381404 transitions. [2019-10-02 12:23:06,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:23:06,331 INFO L276 IsEmpty]: Start isEmpty. Operand 181765 states and 381404 transitions. [2019-10-02 12:23:06,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-10-02 12:23:06,342 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:23:06,342 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:23:06,343 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:23:06,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:23:06,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1375218910, now seen corresponding path program 1 times [2019-10-02 12:23:06,343 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:23:06,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:23:06,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:06,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:23:06,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:12,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:23:12,422 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-10-02 12:23:12,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:23:12,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:23:12,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:23:12,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:23:12,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:23:12,425 INFO L87 Difference]: Start difference. First operand 181765 states and 381404 transitions. Second operand 4 states. [2019-10-02 12:23:57,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:23:57,675 INFO L93 Difference]: Finished difference Result 609990 states and 1606035 transitions. [2019-10-02 12:23:57,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:23:57,676 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 229 [2019-10-02 12:23:57,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:24:03,269 INFO L225 Difference]: With dead ends: 609990 [2019-10-02 12:24:03,269 INFO L226 Difference]: Without dead ends: 428276 [2019-10-02 12:24:04,191 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:24:04,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428276 states. [2019-10-02 12:25:03,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428276 to 422228. [2019-10-02 12:25:03,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422228 states. [2019-10-02 12:25:23,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422228 states to 422228 states and 1075246 transitions. [2019-10-02 12:25:23,206 INFO L78 Accepts]: Start accepts. Automaton has 422228 states and 1075246 transitions. Word has length 229 [2019-10-02 12:25:23,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:25:23,207 INFO L475 AbstractCegarLoop]: Abstraction has 422228 states and 1075246 transitions. [2019-10-02 12:25:23,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:25:23,208 INFO L276 IsEmpty]: Start isEmpty. Operand 422228 states and 1075246 transitions. [2019-10-02 12:25:23,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-10-02 12:25:23,243 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:25:23,244 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:25:23,244 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:25:23,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:25:23,246 INFO L82 PathProgramCache]: Analyzing trace with hash 821468062, now seen corresponding path program 1 times [2019-10-02 12:25:23,246 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:25:23,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:25:23,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:25:23,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:25:23,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:25:23,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:25:23,461 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-10-02 12:25:23,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:25:23,461 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:25:23,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:25:24,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:25:24,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 3582 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-02 12:25:24,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:25:24,271 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-10-02 12:25:24,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:25:24,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-10-02 12:25:24,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:25:24,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:25:24,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:25:24,281 INFO L87 Difference]: Start difference. First operand 422228 states and 1075246 transitions. Second operand 14 states.