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_spec1_product26.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 12:06:39,503 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 12:06:39,506 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 12:06:39,523 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 12:06:39,523 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 12:06:39,524 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 12:06:39,525 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 12:06:39,527 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 12:06:39,529 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 12:06:39,529 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 12:06:39,530 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 12:06:39,531 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 12:06:39,532 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 12:06:39,533 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 12:06:39,533 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 12:06:39,535 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 12:06:39,535 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 12:06:39,536 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 12:06:39,538 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 12:06:39,540 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 12:06:39,542 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 12:06:39,543 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 12:06:39,544 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 12:06:39,545 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 12:06:39,547 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 12:06:39,548 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 12:06:39,548 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 12:06:39,549 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 12:06:39,549 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 12:06:39,550 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 12:06:39,550 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 12:06:39,551 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 12:06:39,552 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 12:06:39,553 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 12:06:39,554 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 12:06:39,554 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 12:06:39,555 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 12:06:39,555 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 12:06:39,555 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 12:06:39,556 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 12:06:39,556 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 12:06:39,557 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:06:39,572 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 12:06:39,572 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 12:06:39,573 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 12:06:39,574 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 12:06:39,574 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 12:06:39,574 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 12:06:39,574 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 12:06:39,574 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 12:06:39,575 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 12:06:39,575 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 12:06:39,575 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 12:06:39,575 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 12:06:39,575 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 12:06:39,576 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 12:06:39,576 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 12:06:39,576 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 12:06:39,576 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 12:06:39,576 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 12:06:39,577 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 12:06:39,577 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 12:06:39,577 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 12:06:39,577 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:06:39,577 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 12:06:39,578 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 12:06:39,578 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 12:06:39,578 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 12:06:39,578 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 12:06:39,578 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 12:06:39,579 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 12:06:39,615 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 12:06:39,631 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 12:06:39,634 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 12:06:39,635 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 12:06:39,636 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 12:06:39,636 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec1_product26.cil.c [2019-10-02 12:06:39,706 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b43b05c74/70af8551eb2e42b4bb8f464aabb505ce/FLAG97342c899 [2019-10-02 12:06:40,335 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 12:06:40,336 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec1_product26.cil.c [2019-10-02 12:06:40,363 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b43b05c74/70af8551eb2e42b4bb8f464aabb505ce/FLAG97342c899 [2019-10-02 12:06:40,554 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b43b05c74/70af8551eb2e42b4bb8f464aabb505ce [2019-10-02 12:06:40,564 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 12:06:40,566 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 12:06:40,567 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 12:06:40,567 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 12:06:40,570 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 12:06:40,571 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:06:40" (1/1) ... [2019-10-02 12:06:40,573 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b5cac2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:06:40, skipping insertion in model container [2019-10-02 12:06:40,573 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:06:40" (1/1) ... [2019-10-02 12:06:40,581 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 12:06:40,668 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 12:06:41,349 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:06:41,369 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 12:06:41,512 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:06:41,596 INFO L192 MainTranslator]: Completed translation [2019-10-02 12:06:41,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:06:41 WrapperNode [2019-10-02 12:06:41,597 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 12:06:41,598 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 12:06:41,598 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 12:06:41,599 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 12:06:41,613 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:06:41" (1/1) ... [2019-10-02 12:06:41,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:06:41" (1/1) ... [2019-10-02 12:06:41,649 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:06:41" (1/1) ... [2019-10-02 12:06:41,649 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:06:41" (1/1) ... [2019-10-02 12:06:41,751 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:06:41" (1/1) ... [2019-10-02 12:06:41,800 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:06:41" (1/1) ... [2019-10-02 12:06:41,810 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:06:41" (1/1) ... [2019-10-02 12:06:41,833 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 12:06:41,834 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 12:06:41,834 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 12:06:41,834 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 12:06:41,836 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:06:41" (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:06:41,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 12:06:41,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 12:06:41,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 12:06:41,933 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 12:06:41,934 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-02 12:06:41,935 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-02 12:06:41,935 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-02 12:06:41,935 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-02 12:06:41,936 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-02 12:06:41,936 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-02 12:06:41,936 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-10-02 12:06:41,937 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-02 12:06:41,937 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-02 12:06:41,937 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-02 12:06:41,938 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-02 12:06:41,939 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-02 12:06:41,941 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-02 12:06:41,941 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-02 12:06:41,942 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-02 12:06:41,942 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-02 12:06:41,942 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-02 12:06:41,943 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-02 12:06:41,943 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-02 12:06:41,943 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-02 12:06:41,943 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-02 12:06:41,944 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-02 12:06:41,944 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-02 12:06:41,944 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__empty [2019-10-02 12:06:41,944 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-02 12:06:41,944 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__empty [2019-10-02 12:06:41,944 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-02 12:06:41,945 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-02 12:06:41,945 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 12:06:41,945 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 12:06:41,945 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 12:06:41,946 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 12:06:41,946 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 12:06:41,946 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 12:06:41,946 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 12:06:41,947 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 12:06:41,947 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 12:06:41,948 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 12:06:41,948 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-02 12:06:41,948 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-02 12:06:41,948 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-02 12:06:41,949 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-02 12:06:41,949 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-02 12:06:41,949 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__1 [2019-10-02 12:06:41,949 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__2 [2019-10-02 12:06:41,949 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__3 [2019-10-02 12:06:41,950 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__4 [2019-10-02 12:06:41,950 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-02 12:06:41,951 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-02 12:06:41,951 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-02 12:06:41,951 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-02 12:06:41,951 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-02 12:06:41,951 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-02 12:06:41,951 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-02 12:06:41,952 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-02 12:06:41,952 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-02 12:06:41,952 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-02 12:06:41,952 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-02 12:06:41,952 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-02 12:06:41,953 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-02 12:06:41,953 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-02 12:06:41,953 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 12:06:41,953 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-02 12:06:41,953 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 12:06:41,954 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 12:06:41,954 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-02 12:06:41,954 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-02 12:06:41,955 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-02 12:06:41,955 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-02 12:06:41,955 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-02 12:06:41,956 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-02 12:06:41,956 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-02 12:06:41,956 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-02 12:06:41,957 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 12:06:41,957 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 12:06:41,957 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-02 12:06:41,957 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-02 12:06:41,958 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-02 12:06:41,958 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 12:06:41,959 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 12:06:41,959 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-02 12:06:41,959 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-02 12:06:41,959 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-02 12:06:41,960 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-02 12:06:41,960 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-02 12:06:41,961 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-02 12:06:41,961 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-02 12:06:41,962 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-02 12:06:41,962 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-02 12:06:41,962 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-02 12:06:41,962 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-02 12:06:41,962 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-02 12:06:41,963 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-02 12:06:41,963 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-02 12:06:41,963 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-02 12:06:41,963 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-02 12:06:41,963 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-02 12:06:41,963 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-02 12:06:41,964 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-02 12:06:41,964 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-02 12:06:41,964 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-02 12:06:41,964 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-02 12:06:41,964 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-10-02 12:06:41,965 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-02 12:06:41,965 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-02 12:06:41,965 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-02 12:06:41,965 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-02 12:06:41,966 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-02 12:06:41,966 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-02 12:06:41,966 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-02 12:06:41,967 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-02 12:06:41,967 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-02 12:06:41,968 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-02 12:06:41,968 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__empty [2019-10-02 12:06:41,968 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__3 [2019-10-02 12:06:41,968 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__empty [2019-10-02 12:06:41,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 12:06:41,969 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-02 12:06:41,969 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 12:06:41,970 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 12:06:41,971 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 12:06:41,971 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 12:06:41,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 12:06:41,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 12:06:41,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 12:06:41,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 12:06:41,972 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 12:06:41,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 12:06:41,973 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 12:06:41,973 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 12:06:41,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 12:06:41,974 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 12:06:41,974 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 12:06:41,974 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 12:06:41,974 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 12:06:41,975 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 12:06:41,978 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 12:06:41,979 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 12:06:41,979 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-02 12:06:41,980 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-02 12:06:41,988 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-02 12:06:41,988 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-02 12:06:41,988 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 12:06:41,989 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__1 [2019-10-02 12:06:41,989 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__2 [2019-10-02 12:06:41,989 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__4 [2019-10-02 12:06:41,989 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 12:06:41,990 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-02 12:06:41,990 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-02 12:06:41,990 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-02 12:06:41,990 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-02 12:06:41,991 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-02 12:06:41,991 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-02 12:06:41,991 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-02 12:06:41,991 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-02 12:06:41,991 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-02 12:06:41,991 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-02 12:06:41,992 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-02 12:06:41,992 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 12:06:41,992 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-02 12:06:41,992 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 12:06:41,992 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-02 12:06:41,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 12:06:41,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 12:06:41,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 12:06:44,701 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 12:06:44,701 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-02 12:06:44,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:06:44 BoogieIcfgContainer [2019-10-02 12:06:44,703 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 12:06:44,705 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 12:06:44,705 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 12:06:44,709 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 12:06:44,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:06:40" (1/3) ... [2019-10-02 12:06:44,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34abfc76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:06:44, skipping insertion in model container [2019-10-02 12:06:44,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:06:41" (2/3) ... [2019-10-02 12:06:44,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34abfc76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:06:44, skipping insertion in model container [2019-10-02 12:06:44,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:06:44" (3/3) ... [2019-10-02 12:06:44,715 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec1_product26.cil.c [2019-10-02 12:06:44,727 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 12:06:44,740 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 12:06:44,761 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 12:06:44,806 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 12:06:44,807 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 12:06:44,807 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 12:06:44,807 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 12:06:44,807 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 12:06:44,807 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 12:06:44,808 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 12:06:44,808 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 12:06:44,808 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 12:06:44,854 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states. [2019-10-02 12:06:44,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-02 12:06:44,889 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:44,891 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:06:44,893 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:44,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:44,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1704372100, now seen corresponding path program 1 times [2019-10-02 12:06:44,902 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:44,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:44,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:44,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:44,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:45,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:45,535 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:06:45,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:06:45,538 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:06:45,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:46,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:46,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 3170 conjuncts, 1 conjunts are in the unsatisfiable core [2019-10-02 12:06:46,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:06:46,341 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-02 12:06:46,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:06:46,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 4 [2019-10-02 12:06:46,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:06:46,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:06:46,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:06:46,377 INFO L87 Difference]: Start difference. First operand 775 states. Second operand 4 states. [2019-10-02 12:06:46,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:46,623 INFO L93 Difference]: Finished difference Result 1220 states and 1977 transitions. [2019-10-02 12:06:46,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:06:46,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-10-02 12:06:46,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:46,676 INFO L225 Difference]: With dead ends: 1220 [2019-10-02 12:06:46,677 INFO L226 Difference]: Without dead ends: 614 [2019-10-02 12:06:46,691 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 117 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:06:46,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-10-02 12:06:46,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2019-10-02 12:06:46,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-10-02 12:06:46,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 982 transitions. [2019-10-02 12:06:46,812 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 982 transitions. Word has length 116 [2019-10-02 12:06:46,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:46,812 INFO L475 AbstractCegarLoop]: Abstraction has 614 states and 982 transitions. [2019-10-02 12:06:46,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:06:46,813 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 982 transitions. [2019-10-02 12:06:46,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-02 12:06:46,818 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:46,818 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:06:46,818 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:46,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:46,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1224648271, now seen corresponding path program 1 times [2019-10-02 12:06:46,819 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:46,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:46,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:46,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:46,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:46,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:47,087 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:06:47,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:06:47,088 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:06:47,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:47,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:47,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 3175 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:06:47,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:06:47,809 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 12:06:47,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:06:47,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:06:47,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:06:47,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:06:47,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:06:47,829 INFO L87 Difference]: Start difference. First operand 614 states and 982 transitions. Second operand 6 states. [2019-10-02 12:06:47,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:47,984 INFO L93 Difference]: Finished difference Result 1200 states and 1937 transitions. [2019-10-02 12:06:47,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:06:47,985 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 120 [2019-10-02 12:06:47,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:47,992 INFO L225 Difference]: With dead ends: 1200 [2019-10-02 12:06:47,993 INFO L226 Difference]: Without dead ends: 614 [2019-10-02 12:06:47,997 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:06:48,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-10-02 12:06:48,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2019-10-02 12:06:48,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-10-02 12:06:48,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 981 transitions. [2019-10-02 12:06:48,067 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 981 transitions. Word has length 120 [2019-10-02 12:06:48,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:48,070 INFO L475 AbstractCegarLoop]: Abstraction has 614 states and 981 transitions. [2019-10-02 12:06:48,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:06:48,070 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 981 transitions. [2019-10-02 12:06:48,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-02 12:06:48,079 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:48,079 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:06:48,079 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:48,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:48,080 INFO L82 PathProgramCache]: Analyzing trace with hash -2135037313, now seen corresponding path program 1 times [2019-10-02 12:06:48,080 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:48,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:48,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:48,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:48,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:48,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:48,322 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:06:48,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:06:48,323 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:06:48,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:48,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:48,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 3177 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:06:48,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:06:48,968 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 12:06:48,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:06:48,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:06:48,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:06:48,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:06:48,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:06:48,989 INFO L87 Difference]: Start difference. First operand 614 states and 981 transitions. Second operand 6 states. [2019-10-02 12:06:49,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:49,082 INFO L93 Difference]: Finished difference Result 1204 states and 1940 transitions. [2019-10-02 12:06:49,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:06:49,083 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 122 [2019-10-02 12:06:49,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:49,088 INFO L225 Difference]: With dead ends: 1204 [2019-10-02 12:06:49,089 INFO L226 Difference]: Without dead ends: 620 [2019-10-02 12:06:49,092 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:06:49,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-10-02 12:06:49,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-10-02 12:06:49,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-10-02 12:06:49,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 986 transitions. [2019-10-02 12:06:49,122 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 986 transitions. Word has length 122 [2019-10-02 12:06:49,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:49,123 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 986 transitions. [2019-10-02 12:06:49,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:06:49,123 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 986 transitions. [2019-10-02 12:06:49,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-02 12:06:49,126 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:49,126 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:06:49,127 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:49,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:49,127 INFO L82 PathProgramCache]: Analyzing trace with hash 2064176466, now seen corresponding path program 1 times [2019-10-02 12:06:49,127 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:49,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:49,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:49,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:49,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:49,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:49,274 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:06:49,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:06:49,274 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:06:49,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:49,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:49,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 3178 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:06:49,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:06:49,860 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 12:06:49,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:06:49,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:06:49,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:06:49,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:06:49,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:06:49,871 INFO L87 Difference]: Start difference. First operand 620 states and 986 transitions. Second operand 6 states. [2019-10-02 12:06:49,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:49,976 INFO L93 Difference]: Finished difference Result 1203 states and 1931 transitions. [2019-10-02 12:06:49,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:06:49,976 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 123 [2019-10-02 12:06:49,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:49,985 INFO L225 Difference]: With dead ends: 1203 [2019-10-02 12:06:49,986 INFO L226 Difference]: Without dead ends: 620 [2019-10-02 12:06:49,992 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:06:50,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-10-02 12:06:50,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-10-02 12:06:50,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-10-02 12:06:50,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 985 transitions. [2019-10-02 12:06:50,078 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 985 transitions. Word has length 123 [2019-10-02 12:06:50,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:50,079 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 985 transitions. [2019-10-02 12:06:50,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:06:50,080 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 985 transitions. [2019-10-02 12:06:50,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-02 12:06:50,084 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:50,084 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:06:50,084 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:50,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:50,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1849317603, now seen corresponding path program 1 times [2019-10-02 12:06:50,085 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:50,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:50,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:50,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:50,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:50,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:50,276 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:06:50,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:06:50,279 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:06:50,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:50,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:50,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 3179 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:06:50,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:06:50,876 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 12:06:50,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:06:50,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:06:50,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:06:50,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:06:50,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:06:50,895 INFO L87 Difference]: Start difference. First operand 620 states and 985 transitions. Second operand 6 states. [2019-10-02 12:06:51,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:51,004 INFO L93 Difference]: Finished difference Result 1203 states and 1930 transitions. [2019-10-02 12:06:51,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:06:51,005 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 124 [2019-10-02 12:06:51,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:51,019 INFO L225 Difference]: With dead ends: 1203 [2019-10-02 12:06:51,021 INFO L226 Difference]: Without dead ends: 620 [2019-10-02 12:06:51,025 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:06:51,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-10-02 12:06:51,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-10-02 12:06:51,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-10-02 12:06:51,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 984 transitions. [2019-10-02 12:06:51,069 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 984 transitions. Word has length 124 [2019-10-02 12:06:51,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:51,070 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 984 transitions. [2019-10-02 12:06:51,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:06:51,070 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 984 transitions. [2019-10-02 12:06:51,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-02 12:06:51,077 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:51,078 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:06:51,078 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:51,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:51,078 INFO L82 PathProgramCache]: Analyzing trace with hash -2057806986, now seen corresponding path program 1 times [2019-10-02 12:06:51,079 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:51,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:51,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:51,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:51,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:51,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:51,440 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-02 12:06:51,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:06:51,441 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:06:51,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:52,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:52,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 3180 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:06:52,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:06:52,126 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:06:52,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:06:52,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2019-10-02 12:06:52,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:06:52,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:06:52,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:06:52,143 INFO L87 Difference]: Start difference. First operand 620 states and 984 transitions. Second operand 12 states. [2019-10-02 12:06:52,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:52,805 INFO L93 Difference]: Finished difference Result 1214 states and 1950 transitions. [2019-10-02 12:06:52,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:06:52,806 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 125 [2019-10-02 12:06:52,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:52,811 INFO L225 Difference]: With dead ends: 1214 [2019-10-02 12:06:52,811 INFO L226 Difference]: Without dead ends: 629 [2019-10-02 12:06:52,815 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:06:52,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-10-02 12:06:52,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 627. [2019-10-02 12:06:52,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-10-02 12:06:52,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 989 transitions. [2019-10-02 12:06:52,841 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 989 transitions. Word has length 125 [2019-10-02 12:06:52,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:52,841 INFO L475 AbstractCegarLoop]: Abstraction has 627 states and 989 transitions. [2019-10-02 12:06:52,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:06:52,841 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 989 transitions. [2019-10-02 12:06:52,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-02 12:06:52,844 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:52,844 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:06:52,845 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:52,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:52,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1904530473, now seen corresponding path program 1 times [2019-10-02 12:06:52,845 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:52,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:52,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:52,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:52,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:52,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:52,990 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-02 12:06:52,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:06:52,990 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:06:53,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:53,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:53,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 3183 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:06:53,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:06:53,678 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:06:53,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:06:53,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 12:06:53,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:06:53,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:06:53,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:06:53,700 INFO L87 Difference]: Start difference. First operand 627 states and 989 transitions. Second operand 8 states. [2019-10-02 12:06:54,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:54,008 INFO L93 Difference]: Finished difference Result 1215 states and 1940 transitions. [2019-10-02 12:06:54,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:06:54,008 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 128 [2019-10-02 12:06:54,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:54,021 INFO L225 Difference]: With dead ends: 1215 [2019-10-02 12:06:54,021 INFO L226 Difference]: Without dead ends: 627 [2019-10-02 12:06:54,025 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:06:54,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2019-10-02 12:06:54,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 627. [2019-10-02 12:06:54,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-10-02 12:06:54,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 984 transitions. [2019-10-02 12:06:54,061 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 984 transitions. Word has length 128 [2019-10-02 12:06:54,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:54,061 INFO L475 AbstractCegarLoop]: Abstraction has 627 states and 984 transitions. [2019-10-02 12:06:54,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:06:54,061 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 984 transitions. [2019-10-02 12:06:54,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-02 12:06:54,064 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:54,065 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:06:54,065 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:54,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:54,065 INFO L82 PathProgramCache]: Analyzing trace with hash 872861201, now seen corresponding path program 1 times [2019-10-02 12:06:54,065 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:54,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:54,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:54,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:54,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:54,266 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-02 12:06:54,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:06:54,267 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:06:54,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:54,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:54,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 3185 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:06:54,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:06:54,972 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:06:54,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:06:54,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 12:06:54,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:06:54,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:06:54,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:06:54,985 INFO L87 Difference]: Start difference. First operand 627 states and 984 transitions. Second operand 8 states. [2019-10-02 12:06:55,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:55,288 INFO L93 Difference]: Finished difference Result 1236 states and 1961 transitions. [2019-10-02 12:06:55,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:06:55,289 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 130 [2019-10-02 12:06:55,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:55,295 INFO L225 Difference]: With dead ends: 1236 [2019-10-02 12:06:55,295 INFO L226 Difference]: Without dead ends: 654 [2019-10-02 12:06:55,299 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:06:55,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2019-10-02 12:06:55,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 651. [2019-10-02 12:06:55,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-10-02 12:06:55,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1011 transitions. [2019-10-02 12:06:55,327 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1011 transitions. Word has length 130 [2019-10-02 12:06:55,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:55,328 INFO L475 AbstractCegarLoop]: Abstraction has 651 states and 1011 transitions. [2019-10-02 12:06:55,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:06:55,328 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1011 transitions. [2019-10-02 12:06:55,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-02 12:06:55,331 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:55,331 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:06:55,332 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:55,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:55,332 INFO L82 PathProgramCache]: Analyzing trace with hash 472678801, now seen corresponding path program 1 times [2019-10-02 12:06:55,332 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:55,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:55,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:55,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:55,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:55,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:55,488 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-02 12:06:55,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:06:55,489 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:06:55,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:55,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:56,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 3181 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 12:06:56,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:06:56,118 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:06:56,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:06:56,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2019-10-02 12:06:56,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:06:56,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:06:56,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:06:56,129 INFO L87 Difference]: Start difference. First operand 651 states and 1011 transitions. Second operand 14 states. [2019-10-02 12:06:56,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:56,492 INFO L93 Difference]: Finished difference Result 1237 states and 1942 transitions. [2019-10-02 12:06:56,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:06:56,492 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 130 [2019-10-02 12:06:56,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:56,499 INFO L225 Difference]: With dead ends: 1237 [2019-10-02 12:06:56,500 INFO L226 Difference]: Without dead ends: 673 [2019-10-02 12:06:56,504 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:06:56,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2019-10-02 12:06:56,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 662. [2019-10-02 12:06:56,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2019-10-02 12:06:56,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1032 transitions. [2019-10-02 12:06:56,534 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1032 transitions. Word has length 130 [2019-10-02 12:06:56,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:56,535 INFO L475 AbstractCegarLoop]: Abstraction has 662 states and 1032 transitions. [2019-10-02 12:06:56,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 12:06:56,535 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1032 transitions. [2019-10-02 12:06:56,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-02 12:06:56,537 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:56,537 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:06:56,538 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:56,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:56,538 INFO L82 PathProgramCache]: Analyzing trace with hash -2020002127, now seen corresponding path program 1 times [2019-10-02 12:06:56,538 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:56,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:56,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:56,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:56,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:56,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:56,667 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:06:56,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:06:56,668 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:06:56,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:57,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:57,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 3184 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:06:57,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:06:57,326 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:06:57,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:06:57,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:06:57,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:06:57,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:06:57,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:06:57,339 INFO L87 Difference]: Start difference. First operand 662 states and 1032 transitions. Second operand 6 states. [2019-10-02 12:06:57,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:57,625 INFO L93 Difference]: Finished difference Result 1286 states and 2026 transitions. [2019-10-02 12:06:57,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:06:57,626 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 130 [2019-10-02 12:06:57,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:57,632 INFO L225 Difference]: With dead ends: 1286 [2019-10-02 12:06:57,633 INFO L226 Difference]: Without dead ends: 627 [2019-10-02 12:06:57,636 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 130 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:06:57,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2019-10-02 12:06:57,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 627. [2019-10-02 12:06:57,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-10-02 12:06:57,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 969 transitions. [2019-10-02 12:06:57,664 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 969 transitions. Word has length 130 [2019-10-02 12:06:57,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:57,664 INFO L475 AbstractCegarLoop]: Abstraction has 627 states and 969 transitions. [2019-10-02 12:06:57,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:06:57,665 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 969 transitions. [2019-10-02 12:06:57,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-02 12:06:57,667 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:57,667 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:06:57,668 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:57,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:57,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1301374821, now seen corresponding path program 1 times [2019-10-02 12:06:57,668 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:57,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:57,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:57,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:57,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:57,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:57,807 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-02 12:06:57,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:06:57,808 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:06:57,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:58,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:58,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 3189 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:06:58,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:06:58,394 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:06:58,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:06:58,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 12:06:58,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:06:58,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:06:58,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:06:58,413 INFO L87 Difference]: Start difference. First operand 627 states and 969 transitions. Second operand 8 states. [2019-10-02 12:06:58,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:58,612 INFO L93 Difference]: Finished difference Result 1204 states and 1885 transitions. [2019-10-02 12:06:58,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:06:58,612 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 134 [2019-10-02 12:06:58,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:58,619 INFO L225 Difference]: With dead ends: 1204 [2019-10-02 12:06:58,619 INFO L226 Difference]: Without dead ends: 627 [2019-10-02 12:06:58,624 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:06:58,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2019-10-02 12:06:58,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 627. [2019-10-02 12:06:58,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-10-02 12:06:58,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 968 transitions. [2019-10-02 12:06:58,663 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 968 transitions. Word has length 134 [2019-10-02 12:06:58,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:58,665 INFO L475 AbstractCegarLoop]: Abstraction has 627 states and 968 transitions. [2019-10-02 12:06:58,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:06:58,665 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 968 transitions. [2019-10-02 12:06:58,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-02 12:06:58,668 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:58,669 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:06:58,669 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:58,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:58,670 INFO L82 PathProgramCache]: Analyzing trace with hash -97931237, now seen corresponding path program 1 times [2019-10-02 12:06:58,670 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:58,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:58,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:58,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:58,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:58,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:58,801 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:06:58,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:06:58,802 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:06:59,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:59,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:59,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 3187 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 12:06:59,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:06:59,723 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 12:06:59,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:06:59,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2019-10-02 12:06:59,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:06:59,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:06:59,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:06:59,746 INFO L87 Difference]: Start difference. First operand 627 states and 968 transitions. Second operand 8 states. [2019-10-02 12:07:00,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:07:00,062 INFO L93 Difference]: Finished difference Result 1222 states and 1921 transitions. [2019-10-02 12:07:00,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:07:00,063 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 135 [2019-10-02 12:07:00,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:07:00,069 INFO L225 Difference]: With dead ends: 1222 [2019-10-02 12:07:00,069 INFO L226 Difference]: Without dead ends: 643 [2019-10-02 12:07:00,074 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:07:00,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-10-02 12:07:00,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 641. [2019-10-02 12:07:00,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-10-02 12:07:00,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 984 transitions. [2019-10-02 12:07:00,104 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 984 transitions. Word has length 135 [2019-10-02 12:07:00,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:07:00,104 INFO L475 AbstractCegarLoop]: Abstraction has 641 states and 984 transitions. [2019-10-02 12:07:00,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:07:00,105 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 984 transitions. [2019-10-02 12:07:00,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-02 12:07:00,108 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:07:00,109 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:07:00,109 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:07:00,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:07:00,109 INFO L82 PathProgramCache]: Analyzing trace with hash 209811714, now seen corresponding path program 1 times [2019-10-02 12:07:00,109 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:07:00,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:07:00,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:00,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:00,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:00,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:00,277 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-02 12:07:00,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:07:00,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:07:00,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:07:00,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:07:00,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:07:00,279 INFO L87 Difference]: Start difference. First operand 641 states and 984 transitions. Second operand 9 states. [2019-10-02 12:07:00,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:07:00,442 INFO L93 Difference]: Finished difference Result 1154 states and 1815 transitions. [2019-10-02 12:07:00,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:07:00,443 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-10-02 12:07:00,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:07:00,450 INFO L225 Difference]: With dead ends: 1154 [2019-10-02 12:07:00,450 INFO L226 Difference]: Without dead ends: 638 [2019-10-02 12:07:00,453 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:07:00,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-10-02 12:07:00,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2019-10-02 12:07:00,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-10-02 12:07:00,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 979 transitions. [2019-10-02 12:07:00,477 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 979 transitions. Word has length 136 [2019-10-02 12:07:00,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:07:00,477 INFO L475 AbstractCegarLoop]: Abstraction has 638 states and 979 transitions. [2019-10-02 12:07:00,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:07:00,478 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 979 transitions. [2019-10-02 12:07:00,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-02 12:07:00,482 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:07:00,483 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:07:00,483 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:07:00,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:07:00,483 INFO L82 PathProgramCache]: Analyzing trace with hash -696975105, now seen corresponding path program 1 times [2019-10-02 12:07:00,483 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:07:00,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:07:00,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:00,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:00,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:00,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:00,619 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 12:07:00,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:07:00,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:07:00,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:07:00,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:07:00,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:07:00,622 INFO L87 Difference]: Start difference. First operand 638 states and 979 transitions. Second operand 7 states. [2019-10-02 12:07:00,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:07:00,775 INFO L93 Difference]: Finished difference Result 1151 states and 1810 transitions. [2019-10-02 12:07:00,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:07:00,776 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 137 [2019-10-02 12:07:00,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:07:00,782 INFO L225 Difference]: With dead ends: 1151 [2019-10-02 12:07:00,782 INFO L226 Difference]: Without dead ends: 612 [2019-10-02 12:07:00,787 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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:07:00,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-10-02 12:07:00,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2019-10-02 12:07:00,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-10-02 12:07:00,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 940 transitions. [2019-10-02 12:07:00,819 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 940 transitions. Word has length 137 [2019-10-02 12:07:00,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:07:00,820 INFO L475 AbstractCegarLoop]: Abstraction has 612 states and 940 transitions. [2019-10-02 12:07:00,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:07:00,820 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 940 transitions. [2019-10-02 12:07:00,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-02 12:07:00,824 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:07:00,825 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:07:00,825 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:07:00,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:07:00,826 INFO L82 PathProgramCache]: Analyzing trace with hash -161039434, now seen corresponding path program 1 times [2019-10-02 12:07:00,826 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:07:00,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:07:00,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:00,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:00,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:00,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:01,149 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 12:07:01,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:07:01,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 12:07:01,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 12:07:01,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 12:07:01,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:07:01,151 INFO L87 Difference]: Start difference. First operand 612 states and 940 transitions. Second operand 13 states. [2019-10-02 12:07:01,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:07:01,542 INFO L93 Difference]: Finished difference Result 1191 states and 1858 transitions. [2019-10-02 12:07:01,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 12:07:01,543 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 138 [2019-10-02 12:07:01,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:07:01,551 INFO L225 Difference]: With dead ends: 1191 [2019-10-02 12:07:01,551 INFO L226 Difference]: Without dead ends: 626 [2019-10-02 12:07:01,557 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-10-02 12:07:01,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-02 12:07:01,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 624. [2019-10-02 12:07:01,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2019-10-02 12:07:01,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 955 transitions. [2019-10-02 12:07:01,586 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 955 transitions. Word has length 138 [2019-10-02 12:07:01,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:07:01,587 INFO L475 AbstractCegarLoop]: Abstraction has 624 states and 955 transitions. [2019-10-02 12:07:01,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 12:07:01,587 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 955 transitions. [2019-10-02 12:07:01,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-02 12:07:01,589 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:07:01,590 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:07:01,590 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:07:01,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:07:01,590 INFO L82 PathProgramCache]: Analyzing trace with hash -94970133, now seen corresponding path program 1 times [2019-10-02 12:07:01,591 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:07:01,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:07:01,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:01,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:01,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:01,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:01,901 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 12:07:01,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:07:01,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 12:07:01,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 12:07:01,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 12:07:01,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:07:01,903 INFO L87 Difference]: Start difference. First operand 624 states and 955 transitions. Second operand 13 states. [2019-10-02 12:07:02,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:07:02,267 INFO L93 Difference]: Finished difference Result 1138 states and 1785 transitions. [2019-10-02 12:07:02,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 12:07:02,267 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 137 [2019-10-02 12:07:02,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:07:02,273 INFO L225 Difference]: With dead ends: 1138 [2019-10-02 12:07:02,273 INFO L226 Difference]: Without dead ends: 617 [2019-10-02 12:07:02,276 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-10-02 12:07:02,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-10-02 12:07:02,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2019-10-02 12:07:02,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2019-10-02 12:07:02,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 946 transitions. [2019-10-02 12:07:02,299 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 946 transitions. Word has length 137 [2019-10-02 12:07:02,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:07:02,299 INFO L475 AbstractCegarLoop]: Abstraction has 617 states and 946 transitions. [2019-10-02 12:07:02,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 12:07:02,300 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 946 transitions. [2019-10-02 12:07:02,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-02 12:07:02,302 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:07:02,302 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:07:02,303 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:07:02,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:07:02,303 INFO L82 PathProgramCache]: Analyzing trace with hash 2046982736, now seen corresponding path program 1 times [2019-10-02 12:07:02,303 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:07:02,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:07:02,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:02,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:02,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:02,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:02,540 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 12:07:02,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:07:02,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:07:02,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:07:02,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:07:02,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:07:02,543 INFO L87 Difference]: Start difference. First operand 617 states and 946 transitions. Second operand 11 states. [2019-10-02 12:07:02,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:07:02,834 INFO L93 Difference]: Finished difference Result 1131 states and 1776 transitions. [2019-10-02 12:07:02,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:07:02,834 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 139 [2019-10-02 12:07:02,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:07:02,839 INFO L225 Difference]: With dead ends: 1131 [2019-10-02 12:07:02,839 INFO L226 Difference]: Without dead ends: 617 [2019-10-02 12:07:02,847 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:07:02,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-10-02 12:07:02,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2019-10-02 12:07:02,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2019-10-02 12:07:02,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 945 transitions. [2019-10-02 12:07:02,879 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 945 transitions. Word has length 139 [2019-10-02 12:07:02,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:07:02,879 INFO L475 AbstractCegarLoop]: Abstraction has 617 states and 945 transitions. [2019-10-02 12:07:02,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:07:02,879 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 945 transitions. [2019-10-02 12:07:02,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-02 12:07:02,882 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:07:02,882 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:07:02,882 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:07:02,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:07:02,883 INFO L82 PathProgramCache]: Analyzing trace with hash -188434084, now seen corresponding path program 1 times [2019-10-02 12:07:02,883 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:07:02,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:07:02,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:02,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:02,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:02,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:03,077 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 12:07:03,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:07:03,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:07:03,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:07:03,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:07:03,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:07:03,079 INFO L87 Difference]: Start difference. First operand 617 states and 945 transitions. Second operand 11 states. [2019-10-02 12:07:03,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:07:03,384 INFO L93 Difference]: Finished difference Result 1177 states and 1829 transitions. [2019-10-02 12:07:03,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:07:03,384 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 140 [2019-10-02 12:07:03,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:07:03,392 INFO L225 Difference]: With dead ends: 1177 [2019-10-02 12:07:03,393 INFO L226 Difference]: Without dead ends: 614 [2019-10-02 12:07:03,397 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:07:03,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-10-02 12:07:03,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2019-10-02 12:07:03,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-10-02 12:07:03,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 937 transitions. [2019-10-02 12:07:03,423 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 937 transitions. Word has length 140 [2019-10-02 12:07:03,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:07:03,423 INFO L475 AbstractCegarLoop]: Abstraction has 614 states and 937 transitions. [2019-10-02 12:07:03,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:07:03,424 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 937 transitions. [2019-10-02 12:07:03,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-02 12:07:03,428 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:07:03,428 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:07:03,428 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:07:03,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:07:03,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1906319339, now seen corresponding path program 1 times [2019-10-02 12:07:03,429 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:07:03,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:07:03,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:03,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:03,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:03,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:03,670 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-02 12:07:03,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:07:03,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:07:03,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:07:03,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:07:03,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:07:03,673 INFO L87 Difference]: Start difference. First operand 614 states and 937 transitions. Second operand 6 states. [2019-10-02 12:07:07,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:07:07,269 INFO L93 Difference]: Finished difference Result 1720 states and 2751 transitions. [2019-10-02 12:07:07,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:07:07,269 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-10-02 12:07:07,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:07:07,280 INFO L225 Difference]: With dead ends: 1720 [2019-10-02 12:07:07,280 INFO L226 Difference]: Without dead ends: 1215 [2019-10-02 12:07:07,285 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:07:07,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2019-10-02 12:07:07,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 1097. [2019-10-02 12:07:07,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1097 states. [2019-10-02 12:07:07,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1740 transitions. [2019-10-02 12:07:07,364 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1740 transitions. Word has length 141 [2019-10-02 12:07:07,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:07:07,366 INFO L475 AbstractCegarLoop]: Abstraction has 1097 states and 1740 transitions. [2019-10-02 12:07:07,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:07:07,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1740 transitions. [2019-10-02 12:07:07,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-02 12:07:07,374 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:07:07,374 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:07:07,375 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:07:07,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:07:07,375 INFO L82 PathProgramCache]: Analyzing trace with hash 908454671, now seen corresponding path program 1 times [2019-10-02 12:07:07,375 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:07:07,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:07:07,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:07,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:07,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:07,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:07,700 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-02 12:07:07,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:07:07,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:07:07,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:07:07,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:07:07,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:07:07,702 INFO L87 Difference]: Start difference. First operand 1097 states and 1740 transitions. Second operand 9 states. [2019-10-02 12:07:11,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:07:11,461 INFO L93 Difference]: Finished difference Result 2097 states and 3422 transitions. [2019-10-02 12:07:11,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:07:11,462 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 174 [2019-10-02 12:07:11,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:07:11,472 INFO L225 Difference]: With dead ends: 2097 [2019-10-02 12:07:11,472 INFO L226 Difference]: Without dead ends: 1109 [2019-10-02 12:07:11,478 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 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:07:11,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2019-10-02 12:07:11,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1105. [2019-10-02 12:07:11,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1105 states. [2019-10-02 12:07:11,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1105 states to 1105 states and 1778 transitions. [2019-10-02 12:07:11,545 INFO L78 Accepts]: Start accepts. Automaton has 1105 states and 1778 transitions. Word has length 174 [2019-10-02 12:07:11,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:07:11,545 INFO L475 AbstractCegarLoop]: Abstraction has 1105 states and 1778 transitions. [2019-10-02 12:07:11,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:07:11,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1105 states and 1778 transitions. [2019-10-02 12:07:11,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-02 12:07:11,553 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:07:11,553 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:07:11,554 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:07:11,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:07:11,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1688453432, now seen corresponding path program 1 times [2019-10-02 12:07:11,554 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:07:11,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:07:11,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:11,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:11,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:11,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:11,756 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-02 12:07:11,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:07:11,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 12:07:11,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:07:11,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:07:11,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:07:11,758 INFO L87 Difference]: Start difference. First operand 1105 states and 1778 transitions. Second operand 12 states. [2019-10-02 12:07:21,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:07:21,929 INFO L93 Difference]: Finished difference Result 3445 states and 5651 transitions. [2019-10-02 12:07:21,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 12:07:21,930 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 174 [2019-10-02 12:07:21,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:07:21,948 INFO L225 Difference]: With dead ends: 3445 [2019-10-02 12:07:21,948 INFO L226 Difference]: Without dead ends: 2449 [2019-10-02 12:07:21,956 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2019-10-02 12:07:21,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2449 states. [2019-10-02 12:07:22,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2449 to 2387. [2019-10-02 12:07:22,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2387 states. [2019-10-02 12:07:22,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2387 states to 2387 states and 3851 transitions. [2019-10-02 12:07:22,092 INFO L78 Accepts]: Start accepts. Automaton has 2387 states and 3851 transitions. Word has length 174 [2019-10-02 12:07:22,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:07:22,092 INFO L475 AbstractCegarLoop]: Abstraction has 2387 states and 3851 transitions. [2019-10-02 12:07:22,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:07:22,093 INFO L276 IsEmpty]: Start isEmpty. Operand 2387 states and 3851 transitions. [2019-10-02 12:07:22,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-02 12:07:22,097 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:07:22,098 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:07:22,098 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:07:22,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:07:22,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1174448998, now seen corresponding path program 1 times [2019-10-02 12:07:22,098 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:07:22,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:07:22,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:22,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:22,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:22,298 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-02 12:07:22,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:07:22,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:07:22,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:07:22,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:07:22,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:07:22,300 INFO L87 Difference]: Start difference. First operand 2387 states and 3851 transitions. Second operand 8 states. [2019-10-02 12:07:28,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:07:28,635 INFO L93 Difference]: Finished difference Result 7990 states and 13371 transitions. [2019-10-02 12:07:28,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 12:07:28,636 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 175 [2019-10-02 12:07:28,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:07:28,676 INFO L225 Difference]: With dead ends: 7990 [2019-10-02 12:07:28,676 INFO L226 Difference]: Without dead ends: 5712 [2019-10-02 12:07:28,698 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-10-02 12:07:28,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5712 states. [2019-10-02 12:07:28,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5712 to 5664. [2019-10-02 12:07:28,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5664 states. [2019-10-02 12:07:29,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5664 states to 5664 states and 9065 transitions. [2019-10-02 12:07:29,010 INFO L78 Accepts]: Start accepts. Automaton has 5664 states and 9065 transitions. Word has length 175 [2019-10-02 12:07:29,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:07:29,011 INFO L475 AbstractCegarLoop]: Abstraction has 5664 states and 9065 transitions. [2019-10-02 12:07:29,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:07:29,013 INFO L276 IsEmpty]: Start isEmpty. Operand 5664 states and 9065 transitions. [2019-10-02 12:07:29,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-10-02 12:07:29,028 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:07:29,029 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:07:29,029 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:07:29,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:07:29,030 INFO L82 PathProgramCache]: Analyzing trace with hash -397088451, now seen corresponding path program 1 times [2019-10-02 12:07:29,030 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:07:29,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:07:29,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:29,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:29,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:29,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:29,299 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-02 12:07:29,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:07:29,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:07:29,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:07:29,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:07:29,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:07:29,301 INFO L87 Difference]: Start difference. First operand 5664 states and 9065 transitions. Second operand 9 states. [2019-10-02 12:07:37,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:07:37,923 INFO L93 Difference]: Finished difference Result 15096 states and 24883 transitions. [2019-10-02 12:07:37,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 12:07:37,928 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 181 [2019-10-02 12:07:37,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:07:37,992 INFO L225 Difference]: With dead ends: 15096 [2019-10-02 12:07:37,992 INFO L226 Difference]: Without dead ends: 9535 [2019-10-02 12:07:38,022 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-10-02 12:07:38,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9535 states. [2019-10-02 12:07:38,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9535 to 8925. [2019-10-02 12:07:38,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8925 states. [2019-10-02 12:07:38,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8925 states to 8925 states and 14314 transitions. [2019-10-02 12:07:38,490 INFO L78 Accepts]: Start accepts. Automaton has 8925 states and 14314 transitions. Word has length 181 [2019-10-02 12:07:38,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:07:38,490 INFO L475 AbstractCegarLoop]: Abstraction has 8925 states and 14314 transitions. [2019-10-02 12:07:38,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:07:38,491 INFO L276 IsEmpty]: Start isEmpty. Operand 8925 states and 14314 transitions. [2019-10-02 12:07:38,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-10-02 12:07:38,497 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:07:38,497 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:07:38,497 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:07:38,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:07:38,498 INFO L82 PathProgramCache]: Analyzing trace with hash 736102142, now seen corresponding path program 1 times [2019-10-02 12:07:38,498 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:07:38,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:07:38,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:38,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:38,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:38,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:38,655 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-02 12:07:38,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:07:38,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:07:38,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:07:38,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:07:38,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:07:38,657 INFO L87 Difference]: Start difference. First operand 8925 states and 14314 transitions. Second operand 7 states. [2019-10-02 12:07:43,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:07:43,788 INFO L93 Difference]: Finished difference Result 25636 states and 42432 transitions. [2019-10-02 12:07:43,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 12:07:43,789 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 181 [2019-10-02 12:07:43,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:07:43,897 INFO L225 Difference]: With dead ends: 25636 [2019-10-02 12:07:43,897 INFO L226 Difference]: Without dead ends: 18053 [2019-10-02 12:07:43,930 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:07:43,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18053 states. [2019-10-02 12:07:44,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18053 to 17671. [2019-10-02 12:07:44,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17671 states. [2019-10-02 12:07:44,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17671 states to 17671 states and 28743 transitions. [2019-10-02 12:07:44,901 INFO L78 Accepts]: Start accepts. Automaton has 17671 states and 28743 transitions. Word has length 181 [2019-10-02 12:07:44,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:07:44,901 INFO L475 AbstractCegarLoop]: Abstraction has 17671 states and 28743 transitions. [2019-10-02 12:07:44,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:07:44,901 INFO L276 IsEmpty]: Start isEmpty. Operand 17671 states and 28743 transitions. [2019-10-02 12:07:44,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-10-02 12:07:44,906 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:07:44,906 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:07:44,907 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:07:44,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:07:44,907 INFO L82 PathProgramCache]: Analyzing trace with hash -173829336, now seen corresponding path program 1 times [2019-10-02 12:07:44,907 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:07:44,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:07:44,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:44,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:44,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:44,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:45,040 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-02 12:07:45,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:07:45,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:07:45,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:07:45,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:07:45,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:07:45,042 INFO L87 Difference]: Start difference. First operand 17671 states and 28743 transitions. Second operand 5 states. [2019-10-02 12:07:45,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:07:45,572 INFO L93 Difference]: Finished difference Result 34240 states and 56304 transitions. [2019-10-02 12:07:45,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:07:45,573 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 186 [2019-10-02 12:07:45,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:07:45,669 INFO L225 Difference]: With dead ends: 34240 [2019-10-02 12:07:45,669 INFO L226 Difference]: Without dead ends: 18076 [2019-10-02 12:07:45,728 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:07:45,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18076 states. [2019-10-02 12:07:47,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18076 to 17860. [2019-10-02 12:07:47,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17860 states. [2019-10-02 12:07:47,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17860 states to 17860 states and 29007 transitions. [2019-10-02 12:07:47,659 INFO L78 Accepts]: Start accepts. Automaton has 17860 states and 29007 transitions. Word has length 186 [2019-10-02 12:07:47,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:07:47,659 INFO L475 AbstractCegarLoop]: Abstraction has 17860 states and 29007 transitions. [2019-10-02 12:07:47,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:07:47,659 INFO L276 IsEmpty]: Start isEmpty. Operand 17860 states and 29007 transitions. [2019-10-02 12:07:47,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-10-02 12:07:47,665 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:07:47,665 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:07:47,665 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:07:47,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:07:47,666 INFO L82 PathProgramCache]: Analyzing trace with hash -357076030, now seen corresponding path program 1 times [2019-10-02 12:07:47,666 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:07:47,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:07:47,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:47,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:47,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:47,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:47,814 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-02 12:07:47,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:07:47,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:07:47,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:07:47,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:07:47,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:07:47,816 INFO L87 Difference]: Start difference. First operand 17860 states and 29007 transitions. Second operand 7 states. [2019-10-02 12:07:48,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:07:48,536 INFO L93 Difference]: Finished difference Result 36406 states and 60702 transitions. [2019-10-02 12:07:48,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:07:48,537 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 193 [2019-10-02 12:07:48,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:07:48,654 INFO L225 Difference]: With dead ends: 36406 [2019-10-02 12:07:48,654 INFO L226 Difference]: Without dead ends: 17860 [2019-10-02 12:07:48,730 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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:07:48,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17860 states. [2019-10-02 12:07:49,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17860 to 17860. [2019-10-02 12:07:49,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17860 states. [2019-10-02 12:07:49,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17860 states to 17860 states and 28617 transitions. [2019-10-02 12:07:49,770 INFO L78 Accepts]: Start accepts. Automaton has 17860 states and 28617 transitions. Word has length 193 [2019-10-02 12:07:49,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:07:49,770 INFO L475 AbstractCegarLoop]: Abstraction has 17860 states and 28617 transitions. [2019-10-02 12:07:49,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:07:49,771 INFO L276 IsEmpty]: Start isEmpty. Operand 17860 states and 28617 transitions. [2019-10-02 12:07:49,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-10-02 12:07:49,780 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:07:49,780 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:07:49,780 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:07:49,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:07:49,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1417725667, now seen corresponding path program 1 times [2019-10-02 12:07:49,781 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:07:49,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:07:49,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:49,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:49,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:49,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:49,944 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 12:07:49,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:07:49,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:07:49,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:07:49,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:07:49,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:07:49,946 INFO L87 Difference]: Start difference. First operand 17860 states and 28617 transitions. Second operand 7 states. [2019-10-02 12:07:54,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:07:54,973 INFO L93 Difference]: Finished difference Result 35794 states and 57930 transitions. [2019-10-02 12:07:54,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 12:07:54,974 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 198 [2019-10-02 12:07:54,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:07:55,075 INFO L225 Difference]: With dead ends: 35794 [2019-10-02 12:07:55,075 INFO L226 Difference]: Without dead ends: 19463 [2019-10-02 12:07:55,134 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:07:55,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19463 states. [2019-10-02 12:07:55,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19463 to 18922. [2019-10-02 12:07:55,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18922 states. [2019-10-02 12:07:55,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18922 states to 18922 states and 30057 transitions. [2019-10-02 12:07:55,883 INFO L78 Accepts]: Start accepts. Automaton has 18922 states and 30057 transitions. Word has length 198 [2019-10-02 12:07:55,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:07:55,884 INFO L475 AbstractCegarLoop]: Abstraction has 18922 states and 30057 transitions. [2019-10-02 12:07:55,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:07:55,884 INFO L276 IsEmpty]: Start isEmpty. Operand 18922 states and 30057 transitions. [2019-10-02 12:07:55,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-10-02 12:07:55,889 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:07:55,889 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:07:55,890 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:07:55,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:07:55,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1870636041, now seen corresponding path program 1 times [2019-10-02 12:07:55,890 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:07:55,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:07:55,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:55,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:55,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:55,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:56,048 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:07:56,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:07:56,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:07:56,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:07:56,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:07:56,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:07:56,050 INFO L87 Difference]: Start difference. First operand 18922 states and 30057 transitions. Second operand 4 states. [2019-10-02 12:07:57,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:07:57,435 INFO L93 Difference]: Finished difference Result 37500 states and 60371 transitions. [2019-10-02 12:07:57,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:07:57,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 203 [2019-10-02 12:07:57,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:07:57,538 INFO L225 Difference]: With dead ends: 37500 [2019-10-02 12:07:57,538 INFO L226 Difference]: Without dead ends: 18687 [2019-10-02 12:07:57,602 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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:07:57,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18687 states. [2019-10-02 12:07:58,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18687 to 18687. [2019-10-02 12:07:58,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18687 states. [2019-10-02 12:07:58,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18687 states to 18687 states and 29587 transitions. [2019-10-02 12:07:58,315 INFO L78 Accepts]: Start accepts. Automaton has 18687 states and 29587 transitions. Word has length 203 [2019-10-02 12:07:58,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:07:58,316 INFO L475 AbstractCegarLoop]: Abstraction has 18687 states and 29587 transitions. [2019-10-02 12:07:58,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:07:58,316 INFO L276 IsEmpty]: Start isEmpty. Operand 18687 states and 29587 transitions. [2019-10-02 12:07:58,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-10-02 12:07:58,322 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:07:58,323 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:07:58,323 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:07:58,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:07:58,323 INFO L82 PathProgramCache]: Analyzing trace with hash 459555283, now seen corresponding path program 1 times [2019-10-02 12:07:58,323 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:07:58,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:07:58,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:58,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:58,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:58,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:58,480 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:07:58,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:07:58,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:07:58,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:07:58,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:07:58,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:07:58,482 INFO L87 Difference]: Start difference. First operand 18687 states and 29587 transitions. Second operand 6 states. [2019-10-02 12:07:59,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:07:59,717 INFO L93 Difference]: Finished difference Result 18774 states and 29742 transitions. [2019-10-02 12:07:59,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:07:59,718 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 206 [2019-10-02 12:07:59,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:07:59,783 INFO L225 Difference]: With dead ends: 18774 [2019-10-02 12:07:59,783 INFO L226 Difference]: Without dead ends: 18758 [2019-10-02 12:07:59,794 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:07:59,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18758 states. [2019-10-02 12:08:00,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18758 to 18702. [2019-10-02 12:08:00,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18702 states. [2019-10-02 12:08:00,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18702 states to 18702 states and 29602 transitions. [2019-10-02 12:08:00,445 INFO L78 Accepts]: Start accepts. Automaton has 18702 states and 29602 transitions. Word has length 206 [2019-10-02 12:08:00,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:08:00,445 INFO L475 AbstractCegarLoop]: Abstraction has 18702 states and 29602 transitions. [2019-10-02 12:08:00,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:08:00,446 INFO L276 IsEmpty]: Start isEmpty. Operand 18702 states and 29602 transitions. [2019-10-02 12:08:00,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-10-02 12:08:00,451 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:08:00,451 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:08:00,451 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:08:00,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:08:00,452 INFO L82 PathProgramCache]: Analyzing trace with hash -531775272, now seen corresponding path program 1 times [2019-10-02 12:08:00,452 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:08:00,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:08:00,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:00,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:08:00,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:00,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:08:00,646 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:08:00,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:08:00,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:08:00,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:08:00,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:08:00,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:08:00,648 INFO L87 Difference]: Start difference. First operand 18702 states and 29602 transitions. Second operand 9 states. [2019-10-02 12:08:02,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:08:02,075 INFO L93 Difference]: Finished difference Result 20012 states and 31492 transitions. [2019-10-02 12:08:02,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:08:02,075 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 212 [2019-10-02 12:08:02,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:08:02,159 INFO L225 Difference]: With dead ends: 20012 [2019-10-02 12:08:02,159 INFO L226 Difference]: Without dead ends: 19932 [2019-10-02 12:08:02,171 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:08:02,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19932 states. [2019-10-02 12:08:02,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19932 to 19572. [2019-10-02 12:08:02,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19572 states. [2019-10-02 12:08:02,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19572 states to 19572 states and 30852 transitions. [2019-10-02 12:08:02,842 INFO L78 Accepts]: Start accepts. Automaton has 19572 states and 30852 transitions. Word has length 212 [2019-10-02 12:08:02,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:08:02,842 INFO L475 AbstractCegarLoop]: Abstraction has 19572 states and 30852 transitions. [2019-10-02 12:08:02,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:08:02,843 INFO L276 IsEmpty]: Start isEmpty. Operand 19572 states and 30852 transitions. [2019-10-02 12:08:02,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-02 12:08:02,847 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:08:02,847 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:08:02,848 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:08:02,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:08:02,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1260053348, now seen corresponding path program 1 times [2019-10-02 12:08:02,848 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:08:02,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:08:02,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:02,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:08:02,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:02,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:08:03,074 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 12:08:03,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:08:03,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:08:03,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:08:03,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:08:03,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:08:03,075 INFO L87 Difference]: Start difference. First operand 19572 states and 30852 transitions. Second operand 9 states. [2019-10-02 12:08:07,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:08:07,306 INFO L93 Difference]: Finished difference Result 39103 states and 61989 transitions. [2019-10-02 12:08:07,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:08:07,307 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 230 [2019-10-02 12:08:07,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:08:07,380 INFO L225 Difference]: With dead ends: 39103 [2019-10-02 12:08:07,380 INFO L226 Difference]: Without dead ends: 19660 [2019-10-02 12:08:07,420 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 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:08:07,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19660 states. [2019-10-02 12:08:08,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19660 to 19572. [2019-10-02 12:08:08,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19572 states. [2019-10-02 12:08:08,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19572 states to 19572 states and 30795 transitions. [2019-10-02 12:08:08,128 INFO L78 Accepts]: Start accepts. Automaton has 19572 states and 30795 transitions. Word has length 230 [2019-10-02 12:08:08,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:08:08,129 INFO L475 AbstractCegarLoop]: Abstraction has 19572 states and 30795 transitions. [2019-10-02 12:08:08,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:08:08,129 INFO L276 IsEmpty]: Start isEmpty. Operand 19572 states and 30795 transitions. [2019-10-02 12:08:08,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-10-02 12:08:08,135 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:08:08,135 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:08:08,136 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:08:08,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:08:08,136 INFO L82 PathProgramCache]: Analyzing trace with hash -2012046886, now seen corresponding path program 1 times [2019-10-02 12:08:08,136 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:08:08,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:08:08,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:08,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:08:08,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:08:08,374 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:08:08,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:08:08,375 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:08:08,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:08:09,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:08:09,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 3691 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-02 12:08:09,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:08:09,202 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 12:08:09,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:08:09,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2019-10-02 12:08:09,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 12:08:09,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 12:08:09,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:08:09,212 INFO L87 Difference]: Start difference. First operand 19572 states and 30795 transitions. Second operand 17 states. [2019-10-02 12:08:19,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:08:19,488 INFO L93 Difference]: Finished difference Result 44954 states and 73398 transitions. [2019-10-02 12:08:19,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-02 12:08:19,488 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 239 [2019-10-02 12:08:19,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:08:19,589 INFO L225 Difference]: With dead ends: 44954 [2019-10-02 12:08:19,590 INFO L226 Difference]: Without dead ends: 26834 [2019-10-02 12:08:19,637 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=220, Invalid=1586, Unknown=0, NotChecked=0, Total=1806 [2019-10-02 12:08:19,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26834 states. [2019-10-02 12:08:20,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26834 to 25362. [2019-10-02 12:08:20,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25362 states. [2019-10-02 12:08:20,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25362 states to 25362 states and 39120 transitions. [2019-10-02 12:08:20,756 INFO L78 Accepts]: Start accepts. Automaton has 25362 states and 39120 transitions. Word has length 239 [2019-10-02 12:08:20,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:08:20,757 INFO L475 AbstractCegarLoop]: Abstraction has 25362 states and 39120 transitions. [2019-10-02 12:08:20,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 12:08:20,757 INFO L276 IsEmpty]: Start isEmpty. Operand 25362 states and 39120 transitions. [2019-10-02 12:08:20,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-10-02 12:08:20,764 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:08:20,764 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:08:20,765 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:08:20,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:08:20,765 INFO L82 PathProgramCache]: Analyzing trace with hash 96143138, now seen corresponding path program 1 times [2019-10-02 12:08:20,765 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:08:20,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:08:20,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:20,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:08:20,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:20,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:08:20,992 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-10-02 12:08:20,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:08:20,993 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:08:21,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:08:21,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:08:21,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 3743 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-02 12:08:21,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:08:21,828 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 62 proven. 10 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-02 12:08:21,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:08:21,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2019-10-02 12:08:21,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 12:08:21,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 12:08:21,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-10-02 12:08:21,842 INFO L87 Difference]: Start difference. First operand 25362 states and 39120 transitions. Second operand 19 states. [2019-10-02 12:08:32,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:08:32,987 INFO L93 Difference]: Finished difference Result 77954 states and 121766 transitions. [2019-10-02 12:08:32,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 12:08:32,988 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 265 [2019-10-02 12:08:32,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:08:34,732 INFO L225 Difference]: With dead ends: 77954 [2019-10-02 12:08:34,732 INFO L226 Difference]: Without dead ends: 52719 [2019-10-02 12:08:34,788 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=777, Unknown=0, NotChecked=0, Total=930 [2019-10-02 12:08:34,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52719 states. [2019-10-02 12:08:36,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52719 to 52139. [2019-10-02 12:08:36,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52139 states. [2019-10-02 12:08:36,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52139 states to 52139 states and 81203 transitions. [2019-10-02 12:08:36,796 INFO L78 Accepts]: Start accepts. Automaton has 52139 states and 81203 transitions. Word has length 265 [2019-10-02 12:08:36,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:08:36,797 INFO L475 AbstractCegarLoop]: Abstraction has 52139 states and 81203 transitions. [2019-10-02 12:08:36,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 12:08:36,797 INFO L276 IsEmpty]: Start isEmpty. Operand 52139 states and 81203 transitions. [2019-10-02 12:08:36,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-10-02 12:08:36,807 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:08:36,807 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:08:36,807 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:08:36,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:08:36,808 INFO L82 PathProgramCache]: Analyzing trace with hash -324632801, now seen corresponding path program 1 times [2019-10-02 12:08:36,808 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:08:36,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:08:36,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:36,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:08:36,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:36,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:08:36,967 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-10-02 12:08:36,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:08:36,968 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:08:37,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:08:38,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:08:38,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 3744 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:08:38,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:08:38,082 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (16)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:08:38,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:08:38,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:08:38,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:08:38,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:08:38,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:08:38,105 INFO L87 Difference]: Start difference. First operand 52139 states and 81203 transitions. Second operand 6 states. [2019-10-02 12:08:40,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:08:40,386 INFO L93 Difference]: Finished difference Result 105915 states and 168143 transitions. [2019-10-02 12:08:40,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:08:40,387 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 266 [2019-10-02 12:08:40,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:08:40,732 INFO L225 Difference]: With dead ends: 105915 [2019-10-02 12:08:40,733 INFO L226 Difference]: Without dead ends: 52619 [2019-10-02 12:08:40,909 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:08:40,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52619 states. [2019-10-02 12:08:45,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52619 to 52529. [2019-10-02 12:08:45,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52529 states. [2019-10-02 12:08:45,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52529 states to 52529 states and 80184 transitions. [2019-10-02 12:08:45,419 INFO L78 Accepts]: Start accepts. Automaton has 52529 states and 80184 transitions. Word has length 266 [2019-10-02 12:08:45,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:08:45,420 INFO L475 AbstractCegarLoop]: Abstraction has 52529 states and 80184 transitions. [2019-10-02 12:08:45,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:08:45,420 INFO L276 IsEmpty]: Start isEmpty. Operand 52529 states and 80184 transitions. [2019-10-02 12:08:45,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2019-10-02 12:08:45,438 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:08:45,439 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:08:45,439 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:08:45,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:08:45,439 INFO L82 PathProgramCache]: Analyzing trace with hash -87376445, now seen corresponding path program 1 times [2019-10-02 12:08:45,440 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:08:45,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:08:45,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:45,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:08:45,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:08:45,660 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2019-10-02 12:08:45,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:08:45,661 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:08:45,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:08:46,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:08:46,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 4971 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:08:46,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:08:46,584 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2019-10-02 12:08:46,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:08:46,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-10-02 12:08:46,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:08:46,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:08:46,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:08:46,596 INFO L87 Difference]: Start difference. First operand 52529 states and 80184 transitions. Second operand 7 states. [2019-10-02 12:08:49,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:08:49,046 INFO L93 Difference]: Finished difference Result 106423 states and 164940 transitions. [2019-10-02 12:08:49,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:08:49,046 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 389 [2019-10-02 12:08:49,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:08:49,278 INFO L225 Difference]: With dead ends: 106423 [2019-10-02 12:08:49,278 INFO L226 Difference]: Without dead ends: 54011 [2019-10-02 12:08:49,410 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 389 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:08:49,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54011 states. [2019-10-02 12:08:51,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54011 to 54011. [2019-10-02 12:08:51,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54011 states. [2019-10-02 12:08:51,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54011 states to 54011 states and 82722 transitions. [2019-10-02 12:08:51,901 INFO L78 Accepts]: Start accepts. Automaton has 54011 states and 82722 transitions. Word has length 389 [2019-10-02 12:08:51,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:08:51,901 INFO L475 AbstractCegarLoop]: Abstraction has 54011 states and 82722 transitions. [2019-10-02 12:08:51,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:08:51,901 INFO L276 IsEmpty]: Start isEmpty. Operand 54011 states and 82722 transitions. [2019-10-02 12:08:51,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2019-10-02 12:08:51,917 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:08:51,918 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 10, 10, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:08:51,918 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:08:51,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:08:51,919 INFO L82 PathProgramCache]: Analyzing trace with hash -921800980, now seen corresponding path program 1 times [2019-10-02 12:08:51,919 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:08:51,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:08:51,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:51,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:08:51,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:51,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:08:52,181 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2019-10-02 12:08:52,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:08:52,182 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:08:52,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:08:52,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:08:53,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 4980 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-02 12:08:53,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:08:53,246 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 0 proven. 279 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2019-10-02 12:08:53,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:08:53,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-10-02 12:08:53,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 12:08:53,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 12:08:53,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:08:53,257 INFO L87 Difference]: Start difference. First operand 54011 states and 82722 transitions. Second operand 15 states. [2019-10-02 12:09:13,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:09:13,310 INFO L93 Difference]: Finished difference Result 182853 states and 293439 transitions. [2019-10-02 12:09:13,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-02 12:09:13,311 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 400 [2019-10-02 12:09:13,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:09:13,925 INFO L225 Difference]: With dead ends: 182853 [2019-10-02 12:09:13,925 INFO L226 Difference]: Without dead ends: 128386 [2019-10-02 12:09:14,118 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 427 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=407, Invalid=1573, Unknown=0, NotChecked=0, Total=1980 [2019-10-02 12:09:14,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128386 states. [2019-10-02 12:09:22,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128386 to 124370. [2019-10-02 12:09:22,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124370 states. [2019-10-02 12:09:23,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124370 states to 124370 states and 191292 transitions. [2019-10-02 12:09:23,079 INFO L78 Accepts]: Start accepts. Automaton has 124370 states and 191292 transitions. Word has length 400 [2019-10-02 12:09:23,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:09:23,080 INFO L475 AbstractCegarLoop]: Abstraction has 124370 states and 191292 transitions. [2019-10-02 12:09:23,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 12:09:23,080 INFO L276 IsEmpty]: Start isEmpty. Operand 124370 states and 191292 transitions. [2019-10-02 12:09:23,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-10-02 12:09:23,094 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:09:23,095 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:09:23,095 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:09:23,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:09:23,095 INFO L82 PathProgramCache]: Analyzing trace with hash -396135728, now seen corresponding path program 1 times [2019-10-02 12:09:23,095 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:09:23,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:09:23,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:09:23,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:09:23,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:09:23,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:09:23,389 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 26 proven. 15 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-10-02 12:09:23,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:09:23,389 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:09:23,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:09:24,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:09:24,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 4299 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:09:24,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:09:24,238 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-10-02 12:09:24,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:09:24,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-10-02 12:09:24,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:09:24,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:09:24,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:09:24,252 INFO L87 Difference]: Start difference. First operand 124370 states and 191292 transitions. Second operand 14 states. [2019-10-02 12:09:48,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:09:48,823 INFO L93 Difference]: Finished difference Result 395889 states and 670168 transitions. [2019-10-02 12:09:48,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-02 12:09:48,823 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 313 [2019-10-02 12:09:48,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:09:50,235 INFO L225 Difference]: With dead ends: 395889 [2019-10-02 12:09:50,235 INFO L226 Difference]: Without dead ends: 263195 [2019-10-02 12:09:50,686 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 342 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 641 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=522, Invalid=1830, Unknown=0, NotChecked=0, Total=2352 [2019-10-02 12:09:50,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263195 states. [2019-10-02 12:10:07,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263195 to 257646. [2019-10-02 12:10:07,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257646 states. [2019-10-02 12:10:16,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257646 states to 257646 states and 410245 transitions. [2019-10-02 12:10:16,763 INFO L78 Accepts]: Start accepts. Automaton has 257646 states and 410245 transitions. Word has length 313 [2019-10-02 12:10:16,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:10:16,764 INFO L475 AbstractCegarLoop]: Abstraction has 257646 states and 410245 transitions. [2019-10-02 12:10:16,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 12:10:16,764 INFO L276 IsEmpty]: Start isEmpty. Operand 257646 states and 410245 transitions. [2019-10-02 12:10:16,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-10-02 12:10:16,783 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:10:16,784 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:10:16,784 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:10:16,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:10:16,785 INFO L82 PathProgramCache]: Analyzing trace with hash -858671167, now seen corresponding path program 1 times [2019-10-02 12:10:16,785 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:10:16,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:10:16,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:16,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:16,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:16,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:17,078 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 26 proven. 11 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-10-02 12:10:17,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:10:17,078 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:10:17,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:17,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:17,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 4343 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-02 12:10:17,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:10:18,032 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 41 proven. 43 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-10-02 12:10:18,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:10:18,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2019-10-02 12:10:18,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 12:10:18,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 12:10:18,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2019-10-02 12:10:18,051 INFO L87 Difference]: Start difference. First operand 257646 states and 410245 transitions. Second operand 19 states. [2019-10-02 12:11:01,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:11:01,544 INFO L93 Difference]: Finished difference Result 683790 states and 1180034 transitions. [2019-10-02 12:11:01,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-10-02 12:11:01,545 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 324 [2019-10-02 12:11:01,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:11:13,125 INFO L225 Difference]: With dead ends: 683790 [2019-10-02 12:11:13,125 INFO L226 Difference]: Without dead ends: 410816 [2019-10-02 12:11:13,917 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 362 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1555 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=912, Invalid=4344, Unknown=0, NotChecked=0, Total=5256 [2019-10-02 12:11:14,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410816 states. [2019-10-02 12:11:40,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410816 to 402556. [2019-10-02 12:11:40,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402556 states. [2019-10-02 12:11:44,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402556 states to 402556 states and 644353 transitions. [2019-10-02 12:11:44,628 INFO L78 Accepts]: Start accepts. Automaton has 402556 states and 644353 transitions. Word has length 324 [2019-10-02 12:11:44,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:11:44,629 INFO L475 AbstractCegarLoop]: Abstraction has 402556 states and 644353 transitions. [2019-10-02 12:11:44,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 12:11:44,629 INFO L276 IsEmpty]: Start isEmpty. Operand 402556 states and 644353 transitions. [2019-10-02 12:11:44,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-10-02 12:11:44,640 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:11:44,640 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:11:44,640 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:11:44,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:11:44,641 INFO L82 PathProgramCache]: Analyzing trace with hash -206196666, now seen corresponding path program 1 times [2019-10-02 12:11:44,641 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:11:44,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:11:44,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:11:44,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:11:44,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:11:44,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:11:44,847 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2019-10-02 12:11:44,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:11:44,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:11:44,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:11:44,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:11:44,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:11:44,848 INFO L87 Difference]: Start difference. First operand 402556 states and 644353 transitions. Second operand 8 states. [2019-10-02 12:12:21,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:12:21,477 INFO L93 Difference]: Finished difference Result 789028 states and 1288399 transitions. [2019-10-02 12:12:21,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:12:21,477 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 324 [2019-10-02 12:12:21,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:12:23,604 INFO L225 Difference]: With dead ends: 789028 [2019-10-02 12:12:23,604 INFO L226 Difference]: Without dead ends: 386746 [2019-10-02 12:12:25,895 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:12:26,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386746 states. [2019-10-02 12:12:59,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386746 to 386342. [2019-10-02 12:12:59,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386342 states. [2019-10-02 12:13:02,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386342 states to 386342 states and 618699 transitions. [2019-10-02 12:13:02,466 INFO L78 Accepts]: Start accepts. Automaton has 386342 states and 618699 transitions. Word has length 324 [2019-10-02 12:13:02,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:13:02,466 INFO L475 AbstractCegarLoop]: Abstraction has 386342 states and 618699 transitions. [2019-10-02 12:13:02,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:13:02,466 INFO L276 IsEmpty]: Start isEmpty. Operand 386342 states and 618699 transitions. [2019-10-02 12:13:02,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-10-02 12:13:02,482 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:13:02,482 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:13:02,483 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:13:02,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:13:02,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1560386600, now seen corresponding path program 1 times [2019-10-02 12:13:02,483 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:13:02,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:13:02,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:02,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:02,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:02,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:02,735 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-10-02 12:13:02,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:13:02,735 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:13:02,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:03,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:03,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 4326 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 12:13:03,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:13:03,607 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 40 proven. 38 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-10-02 12:13:03,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:13:03,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2019-10-02 12:13:03,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 12:13:03,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 12:13:03,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:13:03,617 INFO L87 Difference]: Start difference. First operand 386342 states and 618699 transitions. Second operand 15 states. [2019-10-02 12:13:46,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:13:46,904 INFO L93 Difference]: Finished difference Result 823697 states and 1331069 transitions. [2019-10-02 12:13:46,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 12:13:46,904 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 327 [2019-10-02 12:13:46,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:13:49,250 INFO L225 Difference]: With dead ends: 823697 [2019-10-02 12:13:49,250 INFO L226 Difference]: Without dead ends: 425548 [2019-10-02 12:13:50,933 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2019-10-02 12:13:51,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425548 states. [2019-10-02 12:14:25,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425548 to 416950. [2019-10-02 12:14:25,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416950 states. [2019-10-02 12:14:28,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416950 states to 416950 states and 661649 transitions. [2019-10-02 12:14:28,886 INFO L78 Accepts]: Start accepts. Automaton has 416950 states and 661649 transitions. Word has length 327 [2019-10-02 12:14:28,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:14:28,886 INFO L475 AbstractCegarLoop]: Abstraction has 416950 states and 661649 transitions. [2019-10-02 12:14:28,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 12:14:28,886 INFO L276 IsEmpty]: Start isEmpty. Operand 416950 states and 661649 transitions. [2019-10-02 12:14:28,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-10-02 12:14:28,900 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:14:28,900 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:14:28,901 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:14:28,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:14:28,901 INFO L82 PathProgramCache]: Analyzing trace with hash -955923238, now seen corresponding path program 1 times [2019-10-02 12:14:28,901 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:14:28,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:14:28,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:28,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:14:28,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:28,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:14:29,168 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 23 proven. 21 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-10-02 12:14:29,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:14:29,168 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:14:29,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:14:40,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:14:40,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 4348 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-02 12:14:40,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:14:40,738 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 106 proven. 6 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-10-02 12:14:40,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:14:40,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2019-10-02 12:14:40,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 12:14:40,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 12:14:40,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-10-02 12:14:40,749 INFO L87 Difference]: Start difference. First operand 416950 states and 661649 transitions. Second operand 19 states. [2019-10-02 12:15:11,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:15:11,803 INFO L93 Difference]: Finished difference Result 814268 states and 1298976 transitions. [2019-10-02 12:15:11,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 12:15:11,803 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 332 [2019-10-02 12:15:11,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:15:14,860 INFO L225 Difference]: With dead ends: 814268 [2019-10-02 12:15:14,861 INFO L226 Difference]: Without dead ends: 397599 [2019-10-02 12:15:15,739 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=777, Unknown=0, NotChecked=0, Total=930 [2019-10-02 12:15:16,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397599 states. [2019-10-02 12:15:47,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397599 to 395845. [2019-10-02 12:15:47,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395845 states. [2019-10-02 12:15:50,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395845 states to 395845 states and 626890 transitions. [2019-10-02 12:15:50,389 INFO L78 Accepts]: Start accepts. Automaton has 395845 states and 626890 transitions. Word has length 332 [2019-10-02 12:15:50,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:15:50,389 INFO L475 AbstractCegarLoop]: Abstraction has 395845 states and 626890 transitions. [2019-10-02 12:15:50,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 12:15:50,390 INFO L276 IsEmpty]: Start isEmpty. Operand 395845 states and 626890 transitions. [2019-10-02 12:15:50,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2019-10-02 12:15:50,400 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:15:50,400 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:15:50,400 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:15:50,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:15:50,401 INFO L82 PathProgramCache]: Analyzing trace with hash -202453490, now seen corresponding path program 1 times [2019-10-02 12:15:50,401 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:15:50,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:15:50,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:50,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:15:50,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:15:50,654 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-10-02 12:15:50,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:15:50,655 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:15:50,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:15:51,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:15:51,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 4353 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 12:15:51,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:15:51,492 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2019-10-02 12:15:51,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:15:51,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2019-10-02 12:15:51,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:15:51,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:15:51,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:15:51,502 INFO L87 Difference]: Start difference. First operand 395845 states and 626890 transitions. Second operand 11 states. [2019-10-02 12:16:32,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:16:32,406 INFO L93 Difference]: Finished difference Result 876803 states and 1470017 transitions. [2019-10-02 12:16:32,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-02 12:16:32,407 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 347 [2019-10-02 12:16:32,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:16:35,352 INFO L225 Difference]: With dead ends: 876803 [2019-10-02 12:16:35,352 INFO L226 Difference]: Without dead ends: 480834 [2019-10-02 12:16:49,705 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 351 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=216, Invalid=840, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 12:16:50,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480834 states.