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_spec9_product27.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 12:37:37,454 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 12:37:37,456 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 12:37:37,469 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 12:37:37,469 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 12:37:37,470 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 12:37:37,472 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 12:37:37,474 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 12:37:37,476 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 12:37:37,477 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 12:37:37,478 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 12:37:37,479 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 12:37:37,479 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 12:37:37,480 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 12:37:37,481 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 12:37:37,482 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 12:37:37,483 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 12:37:37,484 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 12:37:37,486 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 12:37:37,488 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 12:37:37,489 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 12:37:37,491 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 12:37:37,492 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 12:37:37,493 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 12:37:37,495 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 12:37:37,495 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 12:37:37,496 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 12:37:37,497 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 12:37:37,497 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 12:37:37,498 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 12:37:37,498 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 12:37:37,499 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 12:37:37,500 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 12:37:37,501 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 12:37:37,502 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 12:37:37,502 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 12:37:37,503 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 12:37:37,503 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 12:37:37,503 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 12:37:37,504 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 12:37:37,504 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 12:37:37,505 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:37:37,520 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 12:37:37,521 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 12:37:37,522 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 12:37:37,522 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 12:37:37,522 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 12:37:37,523 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 12:37:37,523 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 12:37:37,523 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 12:37:37,523 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 12:37:37,524 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 12:37:37,524 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 12:37:37,524 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 12:37:37,524 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 12:37:37,524 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 12:37:37,524 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 12:37:37,525 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 12:37:37,525 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 12:37:37,525 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 12:37:37,525 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 12:37:37,526 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 12:37:37,526 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 12:37:37,526 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:37:37,526 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 12:37:37,526 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 12:37:37,527 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 12:37:37,527 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 12:37:37,527 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 12:37:37,527 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 12:37:37,527 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 12:37:37,562 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 12:37:37,576 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 12:37:37,580 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 12:37:37,581 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 12:37:37,582 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 12:37:37,583 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec9_product27.cil.c [2019-10-02 12:37:37,654 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f094a34bf/6ac08dda84c74c55ade13c51dc2cb361/FLAG6bc4792e7 [2019-10-02 12:37:38,366 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 12:37:38,367 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec9_product27.cil.c [2019-10-02 12:37:38,390 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f094a34bf/6ac08dda84c74c55ade13c51dc2cb361/FLAG6bc4792e7 [2019-10-02 12:37:38,544 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f094a34bf/6ac08dda84c74c55ade13c51dc2cb361 [2019-10-02 12:37:38,556 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 12:37:38,558 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 12:37:38,559 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 12:37:38,559 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 12:37:38,563 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 12:37:38,564 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:37:38" (1/1) ... [2019-10-02 12:37:38,567 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25b30546 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:37:38, skipping insertion in model container [2019-10-02 12:37:38,568 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:37:38" (1/1) ... [2019-10-02 12:37:38,576 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 12:37:38,669 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 12:37:39,469 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:37:39,485 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 12:37:39,611 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:37:39,674 INFO L192 MainTranslator]: Completed translation [2019-10-02 12:37:39,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:37:39 WrapperNode [2019-10-02 12:37:39,675 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 12:37:39,675 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 12:37:39,676 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 12:37:39,676 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 12:37:39,690 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:37:39" (1/1) ... [2019-10-02 12:37:39,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:37:39" (1/1) ... [2019-10-02 12:37:39,721 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:37:39" (1/1) ... [2019-10-02 12:37:39,722 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:37:39" (1/1) ... [2019-10-02 12:37:39,797 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:37:39" (1/1) ... [2019-10-02 12:37:39,822 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:37:39" (1/1) ... [2019-10-02 12:37:39,833 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:37:39" (1/1) ... [2019-10-02 12:37:39,850 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 12:37:39,851 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 12:37:39,851 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 12:37:39,851 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 12:37:39,853 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:37:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:37:39,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 12:37:39,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 12:37:39,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 12:37:39,928 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 12:37:39,928 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 12:37:39,929 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 12:37:39,929 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 12:37:39,929 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 12:37:39,929 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 12:37:39,929 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-02 12:37:39,930 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-02 12:37:39,930 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-02 12:37:39,930 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-02 12:37:39,930 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-02 12:37:39,930 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-02 12:37:39,930 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-02 12:37:39,931 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-02 12:37:39,931 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-02 12:37:39,931 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-02 12:37:39,931 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-02 12:37:39,931 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-02 12:37:39,932 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-02 12:37:39,932 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-02 12:37:39,932 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-02 12:37:39,932 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-02 12:37:39,932 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 12:37:39,932 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-02 12:37:39,933 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 12:37:39,933 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-02 12:37:39,933 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-02 12:37:39,933 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-02 12:37:39,933 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-02 12:37:39,933 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-02 12:37:39,933 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-02 12:37:39,933 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-10-02 12:37:39,933 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-02 12:37:39,934 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-02 12:37:39,934 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-02 12:37:39,934 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-02 12:37:39,934 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-02 12:37:39,934 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-02 12:37:39,934 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-02 12:37:39,934 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-02 12:37:39,934 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-02 12:37:39,934 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-02 12:37:39,934 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-10-02 12:37:39,935 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-02 12:37:39,935 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-02 12:37:39,935 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-02 12:37:39,935 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-02 12:37:39,935 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-02 12:37:39,935 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-02 12:37:39,935 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-02 12:37:39,936 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-02 12:37:39,936 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-02 12:37:39,936 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-02 12:37:39,936 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-02 12:37:39,936 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-02 12:37:39,936 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-02 12:37:39,937 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-02 12:37:39,937 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-02 12:37:39,937 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-02 12:37:39,937 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-02 12:37:39,937 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-02 12:37:39,938 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-02 12:37:39,938 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-02 12:37:39,938 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 12:37:39,938 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 12:37:39,938 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__1 [2019-10-02 12:37:39,939 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__2 [2019-10-02 12:37:39,939 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__3 [2019-10-02 12:37:39,939 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__4 [2019-10-02 12:37:39,939 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 12:37:39,939 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 12:37:39,939 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 12:37:39,940 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 12:37:39,940 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-02 12:37:39,941 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-02 12:37:39,942 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-02 12:37:39,942 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 12:37:39,943 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 12:37:39,943 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 12:37:39,944 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 12:37:39,944 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 12:37:39,944 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 12:37:39,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 12:37:39,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 12:37:39,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 12:37:39,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 12:37:39,946 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 12:37:39,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 12:37:39,947 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 12:37:39,947 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 12:37:39,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 12:37:39,948 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 12:37:39,948 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 12:37:39,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 12:37:39,948 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 12:37:39,948 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-02 12:37:39,948 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-02 12:37:39,949 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-02 12:37:39,949 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-02 12:37:39,949 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-02 12:37:39,949 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-02 12:37:39,949 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-02 12:37:39,949 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-02 12:37:39,950 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-02 12:37:39,950 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 12:37:39,950 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-02 12:37:39,950 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-02 12:37:39,950 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-02 12:37:39,951 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-02 12:37:39,951 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-02 12:37:39,951 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-02 12:37:39,951 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-02 12:37:39,951 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-02 12:37:39,952 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-02 12:37:39,952 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-02 12:37:39,952 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-02 12:37:39,952 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-02 12:37:39,953 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-02 12:37:39,953 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-02 12:37:39,953 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-02 12:37:39,954 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 12:37:39,955 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__1 [2019-10-02 12:37:39,955 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__4 [2019-10-02 12:37:39,955 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 12:37:39,955 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-02 12:37:39,956 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 12:37:39,956 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 12:37:39,956 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 12:37:39,956 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 12:37:39,957 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 12:37:39,957 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-02 12:37:39,957 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-02 12:37:39,960 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-02 12:37:39,960 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-02 12:37:39,960 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-02 12:37:39,960 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-02 12:37:39,961 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-02 12:37:39,961 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-02 12:37:39,961 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-02 12:37:39,961 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-02 12:37:39,961 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-02 12:37:39,961 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-02 12:37:39,962 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-02 12:37:39,962 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-02 12:37:39,962 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-02 12:37:39,962 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-02 12:37:39,962 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-02 12:37:39,963 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-02 12:37:39,963 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-10-02 12:37:39,963 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-02 12:37:39,963 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__2 [2019-10-02 12:37:39,963 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-02 12:37:39,963 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-02 12:37:39,963 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-02 12:37:39,963 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-02 12:37:39,964 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-10-02 12:37:39,964 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-02 12:37:39,964 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-02 12:37:39,964 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-02 12:37:39,964 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-02 12:37:39,964 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-02 12:37:39,964 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-02 12:37:39,964 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__3 [2019-10-02 12:37:39,964 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-02 12:37:39,965 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-02 12:37:39,965 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 12:37:39,965 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 12:37:39,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 12:37:39,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 12:37:39,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 12:37:42,323 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 12:37:42,323 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-02 12:37:42,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:37:42 BoogieIcfgContainer [2019-10-02 12:37:42,325 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 12:37:42,327 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 12:37:42,327 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 12:37:42,330 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 12:37:42,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:37:38" (1/3) ... [2019-10-02 12:37:42,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16f84088 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:37:42, skipping insertion in model container [2019-10-02 12:37:42,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:37:39" (2/3) ... [2019-10-02 12:37:42,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16f84088 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:37:42, skipping insertion in model container [2019-10-02 12:37:42,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:37:42" (3/3) ... [2019-10-02 12:37:42,335 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product27.cil.c [2019-10-02 12:37:42,346 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 12:37:42,358 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 12:37:42,375 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 12:37:42,419 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 12:37:42,420 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 12:37:42,420 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 12:37:42,420 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 12:37:42,420 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 12:37:42,420 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 12:37:42,420 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 12:37:42,421 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 12:37:42,421 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 12:37:42,458 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states. [2019-10-02 12:37:42,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-02 12:37:42,492 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:37:42,493 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:37:42,496 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:37:42,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:37:42,502 INFO L82 PathProgramCache]: Analyzing trace with hash 18579608, now seen corresponding path program 1 times [2019-10-02 12:37:42,504 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:37:42,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:37:42,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:42,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:37:42,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:42,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:37:43,119 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:37:43,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:37:43,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:37:43,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:37:43,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:37:43,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:37:43,144 INFO L87 Difference]: Start difference. First operand 777 states. Second operand 4 states. [2019-10-02 12:37:43,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:37:43,400 INFO L93 Difference]: Finished difference Result 1217 states and 1959 transitions. [2019-10-02 12:37:43,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:37:43,402 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-10-02 12:37:43,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:37:43,437 INFO L225 Difference]: With dead ends: 1217 [2019-10-02 12:37:43,437 INFO L226 Difference]: Without dead ends: 617 [2019-10-02 12:37:43,450 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:37:43,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-10-02 12:37:43,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2019-10-02 12:37:43,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2019-10-02 12:37:43,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 981 transitions. [2019-10-02 12:37:43,579 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 981 transitions. Word has length 135 [2019-10-02 12:37:43,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:37:43,580 INFO L475 AbstractCegarLoop]: Abstraction has 617 states and 981 transitions. [2019-10-02 12:37:43,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:37:43,580 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 981 transitions. [2019-10-02 12:37:43,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-02 12:37:43,590 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:37:43,591 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:37:43,591 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:37:43,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:37:43,592 INFO L82 PathProgramCache]: Analyzing trace with hash -270965621, now seen corresponding path program 1 times [2019-10-02 12:37:43,592 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:37:43,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:37:43,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:43,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:37:43,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:43,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:37:43,908 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:37:43,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:37:43,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:37:43,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:37:43,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:37:43,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:37:43,913 INFO L87 Difference]: Start difference. First operand 617 states and 981 transitions. Second operand 4 states. [2019-10-02 12:37:44,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:37:44,011 INFO L93 Difference]: Finished difference Result 1197 states and 1920 transitions. [2019-10-02 12:37:44,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:37:44,012 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-10-02 12:37:44,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:37:44,017 INFO L225 Difference]: With dead ends: 1197 [2019-10-02 12:37:44,018 INFO L226 Difference]: Without dead ends: 617 [2019-10-02 12:37:44,021 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:37:44,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-10-02 12:37:44,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2019-10-02 12:37:44,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2019-10-02 12:37:44,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 980 transitions. [2019-10-02 12:37:44,104 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 980 transitions. Word has length 138 [2019-10-02 12:37:44,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:37:44,105 INFO L475 AbstractCegarLoop]: Abstraction has 617 states and 980 transitions. [2019-10-02 12:37:44,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:37:44,112 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 980 transitions. [2019-10-02 12:37:44,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-02 12:37:44,119 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:37:44,119 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:37:44,119 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:37:44,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:37:44,120 INFO L82 PathProgramCache]: Analyzing trace with hash 932085763, now seen corresponding path program 1 times [2019-10-02 12:37:44,120 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:37:44,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:37:44,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:44,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:37:44,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:44,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:37:44,336 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:37:44,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:37:44,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:37:44,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:37:44,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:37:44,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:37:44,339 INFO L87 Difference]: Start difference. First operand 617 states and 980 transitions. Second operand 4 states. [2019-10-02 12:37:44,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:37:44,430 INFO L93 Difference]: Finished difference Result 1197 states and 1919 transitions. [2019-10-02 12:37:44,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:37:44,430 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-10-02 12:37:44,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:37:44,438 INFO L225 Difference]: With dead ends: 1197 [2019-10-02 12:37:44,438 INFO L226 Difference]: Without dead ends: 617 [2019-10-02 12:37:44,442 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:37:44,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-10-02 12:37:44,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2019-10-02 12:37:44,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2019-10-02 12:37:44,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 979 transitions. [2019-10-02 12:37:44,486 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 979 transitions. Word has length 139 [2019-10-02 12:37:44,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:37:44,487 INFO L475 AbstractCegarLoop]: Abstraction has 617 states and 979 transitions. [2019-10-02 12:37:44,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:37:44,489 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 979 transitions. [2019-10-02 12:37:44,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-02 12:37:44,494 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:37:44,495 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:37:44,495 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:37:44,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:37:44,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1674590201, now seen corresponding path program 1 times [2019-10-02 12:37:44,496 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:37:44,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:37:44,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:44,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:37:44,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:44,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:37:44,611 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:37:44,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:37:44,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:37:44,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:37:44,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:37:44,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:37:44,613 INFO L87 Difference]: Start difference. First operand 617 states and 979 transitions. Second operand 4 states. [2019-10-02 12:37:44,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:37:44,667 INFO L93 Difference]: Finished difference Result 1197 states and 1918 transitions. [2019-10-02 12:37:44,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:37:44,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-10-02 12:37:44,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:37:44,673 INFO L225 Difference]: With dead ends: 1197 [2019-10-02 12:37:44,673 INFO L226 Difference]: Without dead ends: 617 [2019-10-02 12:37:44,676 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:37:44,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-10-02 12:37:44,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2019-10-02 12:37:44,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2019-10-02 12:37:44,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 978 transitions. [2019-10-02 12:37:44,699 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 978 transitions. Word has length 140 [2019-10-02 12:37:44,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:37:44,700 INFO L475 AbstractCegarLoop]: Abstraction has 617 states and 978 transitions. [2019-10-02 12:37:44,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:37:44,700 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 978 transitions. [2019-10-02 12:37:44,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-02 12:37:44,705 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:37:44,705 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:37:44,705 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:37:44,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:37:44,706 INFO L82 PathProgramCache]: Analyzing trace with hash -2123729665, now seen corresponding path program 1 times [2019-10-02 12:37:44,706 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:37:44,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:37:44,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:44,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:37:44,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:44,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:37:44,882 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:37:44,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:37:44,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:37:44,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:37:44,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:37:44,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:37:44,884 INFO L87 Difference]: Start difference. First operand 617 states and 978 transitions. Second operand 4 states. [2019-10-02 12:37:44,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:37:44,953 INFO L93 Difference]: Finished difference Result 1197 states and 1917 transitions. [2019-10-02 12:37:44,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:37:44,954 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-10-02 12:37:44,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:37:44,960 INFO L225 Difference]: With dead ends: 1197 [2019-10-02 12:37:44,961 INFO L226 Difference]: Without dead ends: 617 [2019-10-02 12:37:44,965 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:37:44,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-10-02 12:37:44,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2019-10-02 12:37:44,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2019-10-02 12:37:44,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 977 transitions. [2019-10-02 12:37:44,992 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 977 transitions. Word has length 141 [2019-10-02 12:37:44,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:37:44,993 INFO L475 AbstractCegarLoop]: Abstraction has 617 states and 977 transitions. [2019-10-02 12:37:44,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:37:44,993 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 977 transitions. [2019-10-02 12:37:44,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-02 12:37:44,997 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:37:44,998 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:37:44,998 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:37:44,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:37:44,998 INFO L82 PathProgramCache]: Analyzing trace with hash -113747069, now seen corresponding path program 1 times [2019-10-02 12:37:44,999 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:37:44,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:37:45,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:45,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:37:45,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:45,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:37:45,178 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:37:45,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:37:45,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 12:37:45,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 12:37:45,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 12:37:45,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:37:45,180 INFO L87 Difference]: Start difference. First operand 617 states and 977 transitions. Second operand 10 states. [2019-10-02 12:37:45,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:37:45,368 INFO L93 Difference]: Finished difference Result 1155 states and 1837 transitions. [2019-10-02 12:37:45,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:37:45,372 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 142 [2019-10-02 12:37:45,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:37:45,383 INFO L225 Difference]: With dead ends: 1155 [2019-10-02 12:37:45,383 INFO L226 Difference]: Without dead ends: 626 [2019-10-02 12:37:45,389 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:37:45,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-02 12:37:45,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 624. [2019-10-02 12:37:45,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2019-10-02 12:37:45,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 986 transitions. [2019-10-02 12:37:45,437 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 986 transitions. Word has length 142 [2019-10-02 12:37:45,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:37:45,439 INFO L475 AbstractCegarLoop]: Abstraction has 624 states and 986 transitions. [2019-10-02 12:37:45,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 12:37:45,440 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 986 transitions. [2019-10-02 12:37:45,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-02 12:37:45,446 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:37:45,446 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:37:45,447 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:37:45,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:37:45,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1722095778, now seen corresponding path program 1 times [2019-10-02 12:37:45,447 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:37:45,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:37:45,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:45,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:37:45,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:45,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:37:45,622 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:37:45,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:37:45,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:37:45,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:37:45,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:37:45,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:37:45,624 INFO L87 Difference]: Start difference. First operand 624 states and 986 transitions. Second operand 4 states. [2019-10-02 12:37:45,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:37:45,686 INFO L93 Difference]: Finished difference Result 1203 states and 1923 transitions. [2019-10-02 12:37:45,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:37:45,686 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-10-02 12:37:45,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:37:45,693 INFO L225 Difference]: With dead ends: 1203 [2019-10-02 12:37:45,693 INFO L226 Difference]: Without dead ends: 611 [2019-10-02 12:37:45,696 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:37:45,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-10-02 12:37:45,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-10-02 12:37:45,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-10-02 12:37:45,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 963 transitions. [2019-10-02 12:37:45,721 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 963 transitions. Word has length 142 [2019-10-02 12:37:45,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:37:45,723 INFO L475 AbstractCegarLoop]: Abstraction has 611 states and 963 transitions. [2019-10-02 12:37:45,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:37:45,723 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 963 transitions. [2019-10-02 12:37:45,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-02 12:37:45,729 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:37:45,730 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:37:45,730 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:37:45,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:37:45,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1252309947, now seen corresponding path program 1 times [2019-10-02 12:37:45,731 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:37:45,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:37:45,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:45,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:37:45,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:45,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:37:45,879 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:37:45,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:37:45,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:37:45,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:37:45,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:37:45,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:37:45,882 INFO L87 Difference]: Start difference. First operand 611 states and 963 transitions. Second operand 6 states. [2019-10-02 12:37:46,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:37:46,096 INFO L93 Difference]: Finished difference Result 1143 states and 1815 transitions. [2019-10-02 12:37:46,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:37:46,097 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-10-02 12:37:46,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:37:46,102 INFO L225 Difference]: With dead ends: 1143 [2019-10-02 12:37:46,102 INFO L226 Difference]: Without dead ends: 611 [2019-10-02 12:37:46,105 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:37:46,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-10-02 12:37:46,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-10-02 12:37:46,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-10-02 12:37:46,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 959 transitions. [2019-10-02 12:37:46,137 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 959 transitions. Word has length 143 [2019-10-02 12:37:46,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:37:46,138 INFO L475 AbstractCegarLoop]: Abstraction has 611 states and 959 transitions. [2019-10-02 12:37:46,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:37:46,138 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 959 transitions. [2019-10-02 12:37:46,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-02 12:37:46,144 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:37:46,144 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:37:46,145 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:37:46,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:37:46,145 INFO L82 PathProgramCache]: Analyzing trace with hash -320376282, now seen corresponding path program 1 times [2019-10-02 12:37:46,145 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:37:46,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:37:46,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:46,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:37:46,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:46,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:37:46,310 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:37:46,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:37:46,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:37:46,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:37:46,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:37:46,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:37:46,312 INFO L87 Difference]: Start difference. First operand 611 states and 959 transitions. Second operand 6 states. [2019-10-02 12:37:46,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:37:46,568 INFO L93 Difference]: Finished difference Result 1143 states and 1811 transitions. [2019-10-02 12:37:46,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:37:46,569 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-10-02 12:37:46,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:37:46,575 INFO L225 Difference]: With dead ends: 1143 [2019-10-02 12:37:46,575 INFO L226 Difference]: Without dead ends: 611 [2019-10-02 12:37:46,579 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:37:46,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-10-02 12:37:46,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-10-02 12:37:46,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-10-02 12:37:46,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 955 transitions. [2019-10-02 12:37:46,661 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 955 transitions. Word has length 144 [2019-10-02 12:37:46,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:37:46,661 INFO L475 AbstractCegarLoop]: Abstraction has 611 states and 955 transitions. [2019-10-02 12:37:46,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:37:46,661 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 955 transitions. [2019-10-02 12:37:46,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-02 12:37:46,666 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:37:46,666 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:37:46,666 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:37:46,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:37:46,667 INFO L82 PathProgramCache]: Analyzing trace with hash 748593120, now seen corresponding path program 1 times [2019-10-02 12:37:46,667 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:37:46,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:37:46,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:46,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:37:46,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:46,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:37:46,799 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:37:46,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:37:46,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:37:46,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:37:46,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:37:46,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:37:46,800 INFO L87 Difference]: Start difference. First operand 611 states and 955 transitions. Second operand 6 states. [2019-10-02 12:37:46,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:37:46,987 INFO L93 Difference]: Finished difference Result 1143 states and 1807 transitions. [2019-10-02 12:37:46,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:37:46,988 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-10-02 12:37:46,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:37:46,993 INFO L225 Difference]: With dead ends: 1143 [2019-10-02 12:37:46,993 INFO L226 Difference]: Without dead ends: 611 [2019-10-02 12:37:46,996 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:37:46,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-10-02 12:37:47,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-10-02 12:37:47,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-10-02 12:37:47,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 951 transitions. [2019-10-02 12:37:47,017 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 951 transitions. Word has length 145 [2019-10-02 12:37:47,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:37:47,017 INFO L475 AbstractCegarLoop]: Abstraction has 611 states and 951 transitions. [2019-10-02 12:37:47,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:37:47,017 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 951 transitions. [2019-10-02 12:37:47,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-02 12:37:47,021 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:37:47,022 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:37:47,022 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:37:47,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:37:47,023 INFO L82 PathProgramCache]: Analyzing trace with hash 485194848, now seen corresponding path program 1 times [2019-10-02 12:37:47,023 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:37:47,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:37:47,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:47,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:37:47,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:47,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:37:47,169 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:37:47,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:37:47,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:37:47,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:37:47,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:37:47,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:37:47,171 INFO L87 Difference]: Start difference. First operand 611 states and 951 transitions. Second operand 7 states. [2019-10-02 12:37:47,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:37:47,282 INFO L93 Difference]: Finished difference Result 1143 states and 1803 transitions. [2019-10-02 12:37:47,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:37:47,283 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 145 [2019-10-02 12:37:47,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:37:47,290 INFO L225 Difference]: With dead ends: 1143 [2019-10-02 12:37:47,290 INFO L226 Difference]: Without dead ends: 590 [2019-10-02 12:37:47,295 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:37:47,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-10-02 12:37:47,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-10-02 12:37:47,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-10-02 12:37:47,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 917 transitions. [2019-10-02 12:37:47,318 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 917 transitions. Word has length 145 [2019-10-02 12:37:47,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:37:47,318 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 917 transitions. [2019-10-02 12:37:47,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:37:47,318 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 917 transitions. [2019-10-02 12:37:47,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-02 12:37:47,325 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:37:47,325 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:37:47,325 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:37:47,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:37:47,326 INFO L82 PathProgramCache]: Analyzing trace with hash 2104508459, now seen corresponding path program 1 times [2019-10-02 12:37:47,326 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:37:47,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:37:47,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:47,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:37:47,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:47,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:37:47,502 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:37:47,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:37:47,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:37:47,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:37:47,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:37:47,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:37:47,504 INFO L87 Difference]: Start difference. First operand 590 states and 917 transitions. Second operand 6 states. [2019-10-02 12:37:47,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:37:47,603 INFO L93 Difference]: Finished difference Result 1122 states and 1769 transitions. [2019-10-02 12:37:47,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:37:47,604 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 146 [2019-10-02 12:37:47,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:37:47,609 INFO L225 Difference]: With dead ends: 1122 [2019-10-02 12:37:47,610 INFO L226 Difference]: Without dead ends: 590 [2019-10-02 12:37:47,613 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:37:47,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-10-02 12:37:47,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-10-02 12:37:47,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-10-02 12:37:47,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 916 transitions. [2019-10-02 12:37:47,634 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 916 transitions. Word has length 146 [2019-10-02 12:37:47,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:37:47,634 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 916 transitions. [2019-10-02 12:37:47,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:37:47,635 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 916 transitions. [2019-10-02 12:37:47,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-02 12:37:47,639 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:37:47,639 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:37:47,639 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:37:47,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:37:47,640 INFO L82 PathProgramCache]: Analyzing trace with hash -529154043, now seen corresponding path program 1 times [2019-10-02 12:37:47,640 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:37:47,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:37:47,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:47,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:37:47,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:47,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:37:47,763 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:37:47,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:37:47,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:37:47,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:37:47,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:37:47,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:37:47,765 INFO L87 Difference]: Start difference. First operand 590 states and 916 transitions. Second operand 6 states. [2019-10-02 12:37:47,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:37:47,859 INFO L93 Difference]: Finished difference Result 1122 states and 1768 transitions. [2019-10-02 12:37:47,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:37:47,860 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 147 [2019-10-02 12:37:47,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:37:47,864 INFO L225 Difference]: With dead ends: 1122 [2019-10-02 12:37:47,865 INFO L226 Difference]: Without dead ends: 590 [2019-10-02 12:37:47,868 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:37:47,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-10-02 12:37:47,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-10-02 12:37:47,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-10-02 12:37:47,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 915 transitions. [2019-10-02 12:37:47,889 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 915 transitions. Word has length 147 [2019-10-02 12:37:47,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:37:47,889 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 915 transitions. [2019-10-02 12:37:47,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:37:47,890 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 915 transitions. [2019-10-02 12:37:47,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-02 12:37:47,894 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:37:47,895 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:37:47,895 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:37:47,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:37:47,895 INFO L82 PathProgramCache]: Analyzing trace with hash 2009289264, now seen corresponding path program 1 times [2019-10-02 12:37:47,895 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:37:47,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:37:47,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:47,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:37:47,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:47,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:37:48,078 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:37:48,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:37:48,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 12:37:48,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:37:48,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:37:48,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:37:48,080 INFO L87 Difference]: Start difference. First operand 590 states and 915 transitions. Second operand 12 states. [2019-10-02 12:37:48,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:37:48,249 INFO L93 Difference]: Finished difference Result 1123 states and 1767 transitions. [2019-10-02 12:37:48,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:37:48,250 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 148 [2019-10-02 12:37:48,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:37:48,255 INFO L225 Difference]: With dead ends: 1123 [2019-10-02 12:37:48,255 INFO L226 Difference]: Without dead ends: 590 [2019-10-02 12:37:48,259 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:37:48,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-10-02 12:37:48,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-10-02 12:37:48,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-10-02 12:37:48,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 914 transitions. [2019-10-02 12:37:48,279 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 914 transitions. Word has length 148 [2019-10-02 12:37:48,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:37:48,280 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 914 transitions. [2019-10-02 12:37:48,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:37:48,280 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 914 transitions. [2019-10-02 12:37:48,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-02 12:37:48,285 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:37:48,285 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:37:48,286 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:37:48,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:37:48,286 INFO L82 PathProgramCache]: Analyzing trace with hash -650692984, now seen corresponding path program 1 times [2019-10-02 12:37:48,287 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:37:48,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:37:48,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:48,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:37:48,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:48,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:37:48,468 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 12:37:48,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:37:48,468 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:37:48,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:37:49,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:37:49,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 2791 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:37:49,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:37:49,246 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:37:49,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:37:49,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-10-02 12:37:49,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:37:49,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:37:49,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:37:49,264 INFO L87 Difference]: Start difference. First operand 590 states and 914 transitions. Second operand 7 states. [2019-10-02 12:37:50,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:37:50,658 INFO L93 Difference]: Finished difference Result 1637 states and 2660 transitions. [2019-10-02 12:37:50,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:37:50,659 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 149 [2019-10-02 12:37:50,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:37:50,670 INFO L225 Difference]: With dead ends: 1637 [2019-10-02 12:37:50,671 INFO L226 Difference]: Without dead ends: 1113 [2019-10-02 12:37:50,676 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:37:50,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2019-10-02 12:37:50,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1111. [2019-10-02 12:37:50,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1111 states. [2019-10-02 12:37:50,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1761 transitions. [2019-10-02 12:37:50,731 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 1761 transitions. Word has length 149 [2019-10-02 12:37:50,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:37:50,731 INFO L475 AbstractCegarLoop]: Abstraction has 1111 states and 1761 transitions. [2019-10-02 12:37:50,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:37:50,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1761 transitions. [2019-10-02 12:37:50,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-02 12:37:50,736 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:37:50,737 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:37:50,737 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:37:50,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:37:50,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1884922170, now seen corresponding path program 1 times [2019-10-02 12:37:50,738 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:37:50,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:37:50,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:50,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:37:50,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:50,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:37:50,890 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 12:37:50,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:37:50,892 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:37:50,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:37:51,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:37:51,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 2795 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:37:51,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:37:51,438 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:37:51,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:37:51,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-10-02 12:37:51,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:37:51,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:37:51,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:37:51,455 INFO L87 Difference]: Start difference. First operand 1111 states and 1761 transitions. Second operand 7 states. [2019-10-02 12:37:52,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:37:52,758 INFO L93 Difference]: Finished difference Result 3214 states and 5283 transitions. [2019-10-02 12:37:52,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:37:52,758 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 152 [2019-10-02 12:37:52,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:37:52,781 INFO L225 Difference]: With dead ends: 3214 [2019-10-02 12:37:52,782 INFO L226 Difference]: Without dead ends: 2169 [2019-10-02 12:37:52,789 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:37:52,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2169 states. [2019-10-02 12:37:52,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2169 to 2166. [2019-10-02 12:37:52,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2166 states. [2019-10-02 12:37:52,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2166 states to 2166 states and 3485 transitions. [2019-10-02 12:37:52,910 INFO L78 Accepts]: Start accepts. Automaton has 2166 states and 3485 transitions. Word has length 152 [2019-10-02 12:37:52,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:37:52,911 INFO L475 AbstractCegarLoop]: Abstraction has 2166 states and 3485 transitions. [2019-10-02 12:37:52,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:37:52,912 INFO L276 IsEmpty]: Start isEmpty. Operand 2166 states and 3485 transitions. [2019-10-02 12:37:52,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-02 12:37:52,917 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:37:52,918 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:37:52,918 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:37:52,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:37:52,919 INFO L82 PathProgramCache]: Analyzing trace with hash 2042213898, now seen corresponding path program 1 times [2019-10-02 12:37:52,919 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:37:52,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:37:52,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:52,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:37:52,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:52,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:37:53,085 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 12:37:53,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:37:53,086 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:37:53,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:37:53,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:37:53,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 2799 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:37:53,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:37:53,681 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-02 12:37:53,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:37:53,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-10-02 12:37:53,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:37:53,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:37:53,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:37:53,702 INFO L87 Difference]: Start difference. First operand 2166 states and 3485 transitions. Second operand 7 states. [2019-10-02 12:37:55,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:37:55,001 INFO L93 Difference]: Finished difference Result 6409 states and 10642 transitions. [2019-10-02 12:37:55,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:37:55,002 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 155 [2019-10-02 12:37:55,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:37:55,039 INFO L225 Difference]: With dead ends: 6409 [2019-10-02 12:37:55,040 INFO L226 Difference]: Without dead ends: 4309 [2019-10-02 12:37:55,056 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:37:55,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4309 states. [2019-10-02 12:37:55,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4309 to 4305. [2019-10-02 12:37:55,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4305 states. [2019-10-02 12:37:55,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4305 states to 4305 states and 7011 transitions. [2019-10-02 12:37:55,330 INFO L78 Accepts]: Start accepts. Automaton has 4305 states and 7011 transitions. Word has length 155 [2019-10-02 12:37:55,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:37:55,330 INFO L475 AbstractCegarLoop]: Abstraction has 4305 states and 7011 transitions. [2019-10-02 12:37:55,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:37:55,331 INFO L276 IsEmpty]: Start isEmpty. Operand 4305 states and 7011 transitions. [2019-10-02 12:37:55,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-02 12:37:55,340 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:37:55,340 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:37:55,341 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:37:55,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:37:55,341 INFO L82 PathProgramCache]: Analyzing trace with hash -60670832, now seen corresponding path program 1 times [2019-10-02 12:37:55,341 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:37:55,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:37:55,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:55,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:37:55,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:55,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:37:55,603 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 12:37:55,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:37:55,603 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:37:55,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:37:56,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:37:56,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 2803 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:37:56,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:37:56,107 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Stream Closed [2019-10-02 12:37:56,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:37:56,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-10-02 12:37:56,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:37:56,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:37:56,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:37:56,120 INFO L87 Difference]: Start difference. First operand 4305 states and 7011 transitions. Second operand 7 states. [2019-10-02 12:37:57,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:37:57,828 INFO L93 Difference]: Finished difference Result 12892 states and 21697 transitions. [2019-10-02 12:37:57,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:37:57,829 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 158 [2019-10-02 12:37:57,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:37:57,897 INFO L225 Difference]: With dead ends: 12892 [2019-10-02 12:37:57,897 INFO L226 Difference]: Without dead ends: 8653 [2019-10-02 12:37:57,922 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:37:57,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8653 states. [2019-10-02 12:37:58,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8653 to 8648. [2019-10-02 12:37:58,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8648 states. [2019-10-02 12:37:58,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8648 states to 8648 states and 14285 transitions. [2019-10-02 12:37:58,304 INFO L78 Accepts]: Start accepts. Automaton has 8648 states and 14285 transitions. Word has length 158 [2019-10-02 12:37:58,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:37:58,304 INFO L475 AbstractCegarLoop]: Abstraction has 8648 states and 14285 transitions. [2019-10-02 12:37:58,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:37:58,305 INFO L276 IsEmpty]: Start isEmpty. Operand 8648 states and 14285 transitions. [2019-10-02 12:37:58,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-02 12:37:58,310 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:37:58,311 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:37:58,311 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:37:58,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:37:58,311 INFO L82 PathProgramCache]: Analyzing trace with hash 383413132, now seen corresponding path program 1 times [2019-10-02 12:37:58,312 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:37:58,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:37:58,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:58,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:37:58,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:58,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:37:58,537 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-02 12:37:58,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:37:58,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 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:37:58,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:37:59,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:37:59,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 2807 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:37:59,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:37:59,289 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-02 12:37:59,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:37:59,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2019-10-02 12:37:59,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:37:59,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:37:59,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:37:59,311 INFO L87 Difference]: Start difference. First operand 8648 states and 14285 transitions. Second operand 12 states. [2019-10-02 12:38:08,175 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2019-10-02 12:38:16,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:38:16,481 INFO L93 Difference]: Finished difference Result 45543 states and 81801 transitions. [2019-10-02 12:38:16,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-02 12:38:16,481 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 161 [2019-10-02 12:38:16,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:38:16,738 INFO L225 Difference]: With dead ends: 45543 [2019-10-02 12:38:16,738 INFO L226 Difference]: Without dead ends: 36937 [2019-10-02 12:38:16,792 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=234, Invalid=1326, Unknown=0, NotChecked=0, Total=1560 [2019-10-02 12:38:16,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36937 states. [2019-10-02 12:38:19,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36937 to 36420. [2019-10-02 12:38:19,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36420 states. [2019-10-02 12:38:19,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36420 states to 36420 states and 64939 transitions. [2019-10-02 12:38:19,918 INFO L78 Accepts]: Start accepts. Automaton has 36420 states and 64939 transitions. Word has length 161 [2019-10-02 12:38:19,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:38:19,918 INFO L475 AbstractCegarLoop]: Abstraction has 36420 states and 64939 transitions. [2019-10-02 12:38:19,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:38:19,918 INFO L276 IsEmpty]: Start isEmpty. Operand 36420 states and 64939 transitions. [2019-10-02 12:38:19,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-10-02 12:38:19,991 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:38:19,991 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:38:19,991 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:38:19,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:38:19,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1898286683, now seen corresponding path program 1 times [2019-10-02 12:38:19,992 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:38:19,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:38:19,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:38:19,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:38:19,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:38:20,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:38:20,185 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-10-02 12:38:20,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:38:20,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:38:20,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:38:20,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:38:20,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:38:20,188 INFO L87 Difference]: Start difference. First operand 36420 states and 64939 transitions. Second operand 9 states. [2019-10-02 12:38:22,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:38:22,615 INFO L93 Difference]: Finished difference Result 53416 states and 93835 transitions. [2019-10-02 12:38:22,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:38:22,616 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 245 [2019-10-02 12:38:22,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:38:22,752 INFO L225 Difference]: With dead ends: 53416 [2019-10-02 12:38:22,753 INFO L226 Difference]: Without dead ends: 17050 [2019-10-02 12:38:22,884 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:38:22,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17050 states. [2019-10-02 12:38:23,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17050 to 17050. [2019-10-02 12:38:23,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17050 states. [2019-10-02 12:38:23,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17050 states to 17050 states and 28951 transitions. [2019-10-02 12:38:23,611 INFO L78 Accepts]: Start accepts. Automaton has 17050 states and 28951 transitions. Word has length 245 [2019-10-02 12:38:23,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:38:23,613 INFO L475 AbstractCegarLoop]: Abstraction has 17050 states and 28951 transitions. [2019-10-02 12:38:23,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:38:23,613 INFO L276 IsEmpty]: Start isEmpty. Operand 17050 states and 28951 transitions. [2019-10-02 12:38:23,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-10-02 12:38:23,640 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:38:23,640 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:38:23,641 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:38:23,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:38:23,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1031668665, now seen corresponding path program 1 times [2019-10-02 12:38:23,641 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:38:23,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:38:23,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:38:23,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:38:23,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:38:23,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:38:23,891 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-10-02 12:38:23,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:38:23,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:38:23,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:38:23,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:38:23,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:38:23,894 INFO L87 Difference]: Start difference. First operand 17050 states and 28951 transitions. Second operand 9 states. [2019-10-02 12:38:28,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:38:28,177 INFO L93 Difference]: Finished difference Result 34229 states and 59278 transitions. [2019-10-02 12:38:28,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:38:28,178 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 244 [2019-10-02 12:38:28,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:38:28,289 INFO L225 Difference]: With dead ends: 34229 [2019-10-02 12:38:28,289 INFO L226 Difference]: Without dead ends: 17242 [2019-10-02 12:38:28,344 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:38:28,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17242 states. [2019-10-02 12:38:29,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17242 to 17178. [2019-10-02 12:38:29,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17178 states. [2019-10-02 12:38:29,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17178 states to 17178 states and 29207 transitions. [2019-10-02 12:38:29,195 INFO L78 Accepts]: Start accepts. Automaton has 17178 states and 29207 transitions. Word has length 244 [2019-10-02 12:38:29,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:38:29,196 INFO L475 AbstractCegarLoop]: Abstraction has 17178 states and 29207 transitions. [2019-10-02 12:38:29,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:38:29,196 INFO L276 IsEmpty]: Start isEmpty. Operand 17178 states and 29207 transitions. [2019-10-02 12:38:29,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-10-02 12:38:29,209 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:38:29,209 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:38:29,209 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:38:29,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:38:29,210 INFO L82 PathProgramCache]: Analyzing trace with hash 886597945, now seen corresponding path program 1 times [2019-10-02 12:38:29,210 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:38:29,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:38:29,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:38:29,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:38:29,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:38:29,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:38:29,391 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-10-02 12:38:29,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:38:29,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:38:29,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:38:29,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:38:29,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:38:29,395 INFO L87 Difference]: Start difference. First operand 17178 states and 29207 transitions. Second operand 8 states. [2019-10-02 12:38:37,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:38:37,613 INFO L93 Difference]: Finished difference Result 65868 states and 117449 transitions. [2019-10-02 12:38:37,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 12:38:37,614 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 245 [2019-10-02 12:38:37,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:38:38,067 INFO L225 Difference]: With dead ends: 65868 [2019-10-02 12:38:38,068 INFO L226 Difference]: Without dead ends: 48753 [2019-10-02 12:38:38,185 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-10-02 12:38:38,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48753 states. [2019-10-02 12:38:40,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48753 to 48248. [2019-10-02 12:38:40,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48248 states. [2019-10-02 12:38:41,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48248 states to 48248 states and 84116 transitions. [2019-10-02 12:38:41,202 INFO L78 Accepts]: Start accepts. Automaton has 48248 states and 84116 transitions. Word has length 245 [2019-10-02 12:38:41,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:38:41,202 INFO L475 AbstractCegarLoop]: Abstraction has 48248 states and 84116 transitions. [2019-10-02 12:38:41,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:38:41,202 INFO L276 IsEmpty]: Start isEmpty. Operand 48248 states and 84116 transitions. [2019-10-02 12:38:41,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-10-02 12:38:41,213 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:38:41,213 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:38:41,213 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:38:41,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:38:41,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1360204451, now seen corresponding path program 1 times [2019-10-02 12:38:41,214 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:38:41,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:38:41,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:38:41,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:38:41,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:38:41,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:38:41,411 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-10-02 12:38:41,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:38:41,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:38:41,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:38:41,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:38:41,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:38:41,413 INFO L87 Difference]: Start difference. First operand 48248 states and 84116 transitions. Second operand 9 states. [2019-10-02 12:38:54,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:38:54,614 INFO L93 Difference]: Finished difference Result 158503 states and 336595 transitions. [2019-10-02 12:38:54,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 12:38:54,615 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 251 [2019-10-02 12:38:54,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:38:55,505 INFO L225 Difference]: With dead ends: 158503 [2019-10-02 12:38:55,506 INFO L226 Difference]: Without dead ends: 110318 [2019-10-02 12:38:55,784 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:38:55,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110318 states. [2019-10-02 12:39:04,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110318 to 103509. [2019-10-02 12:39:04,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103509 states. [2019-10-02 12:39:04,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103509 states to 103509 states and 194111 transitions. [2019-10-02 12:39:04,912 INFO L78 Accepts]: Start accepts. Automaton has 103509 states and 194111 transitions. Word has length 251 [2019-10-02 12:39:04,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:04,912 INFO L475 AbstractCegarLoop]: Abstraction has 103509 states and 194111 transitions. [2019-10-02 12:39:04,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:39:04,913 INFO L276 IsEmpty]: Start isEmpty. Operand 103509 states and 194111 transitions. [2019-10-02 12:39:04,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-10-02 12:39:04,929 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:04,929 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:39:04,929 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:04,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:04,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1054569922, now seen corresponding path program 1 times [2019-10-02 12:39:04,930 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:04,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:04,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:04,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:04,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:04,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:05,093 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-10-02 12:39:05,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:05,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:39:05,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:39:05,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:39:05,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:39:05,095 INFO L87 Difference]: Start difference. First operand 103509 states and 194111 transitions. Second operand 7 states. [2019-10-02 12:39:10,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:10,406 INFO L93 Difference]: Finished difference Result 208304 states and 406274 transitions. [2019-10-02 12:39:10,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:39:10,406 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 251 [2019-10-02 12:39:10,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:11,412 INFO L225 Difference]: With dead ends: 208304 [2019-10-02 12:39:11,412 INFO L226 Difference]: Without dead ends: 104859 [2019-10-02 12:39:11,780 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:39:11,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104859 states. [2019-10-02 12:39:21,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104859 to 104853. [2019-10-02 12:39:21,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104853 states. [2019-10-02 12:39:22,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104853 states to 104853 states and 195583 transitions. [2019-10-02 12:39:22,041 INFO L78 Accepts]: Start accepts. Automaton has 104853 states and 195583 transitions. Word has length 251 [2019-10-02 12:39:22,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:22,042 INFO L475 AbstractCegarLoop]: Abstraction has 104853 states and 195583 transitions. [2019-10-02 12:39:22,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:39:22,042 INFO L276 IsEmpty]: Start isEmpty. Operand 104853 states and 195583 transitions. [2019-10-02 12:39:22,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-10-02 12:39:22,064 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:22,064 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:39:22,064 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:22,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:22,065 INFO L82 PathProgramCache]: Analyzing trace with hash -8873018, now seen corresponding path program 1 times [2019-10-02 12:39:22,065 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:22,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:22,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:22,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:22,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:22,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:22,260 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-10-02 12:39:22,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:22,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:39:22,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:39:22,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:39:22,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:39:22,263 INFO L87 Difference]: Start difference. First operand 104853 states and 195583 transitions. Second operand 8 states. [2019-10-02 12:39:36,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:36,948 INFO L93 Difference]: Finished difference Result 249391 states and 487865 transitions. [2019-10-02 12:39:36,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 12:39:36,949 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 252 [2019-10-02 12:39:36,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:37,913 INFO L225 Difference]: With dead ends: 249391 [2019-10-02 12:39:37,913 INFO L226 Difference]: Without dead ends: 144467 [2019-10-02 12:39:38,678 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:39:38,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144467 states. [2019-10-02 12:39:47,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144467 to 143863. [2019-10-02 12:39:47,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143863 states. [2019-10-02 12:39:48,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143863 states to 143863 states and 281848 transitions. [2019-10-02 12:39:48,815 INFO L78 Accepts]: Start accepts. Automaton has 143863 states and 281848 transitions. Word has length 252 [2019-10-02 12:39:48,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:48,816 INFO L475 AbstractCegarLoop]: Abstraction has 143863 states and 281848 transitions. [2019-10-02 12:39:48,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:39:48,816 INFO L276 IsEmpty]: Start isEmpty. Operand 143863 states and 281848 transitions. [2019-10-02 12:39:48,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2019-10-02 12:39:48,845 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:48,845 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:48,846 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:48,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:48,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1774406771, now seen corresponding path program 1 times [2019-10-02 12:39:48,846 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:48,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:48,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:48,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:48,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:48,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:49,094 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-10-02 12:39:49,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:39:49,095 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:39:49,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:49,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:49,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 4125 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-02 12:39:49,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:39:50,807 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 201 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:39:50,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:39:50,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2019-10-02 12:39:50,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 12:39:50,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 12:39:50,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:39:50,829 INFO L87 Difference]: Start difference. First operand 143863 states and 281848 transitions. Second operand 10 states. [2019-10-02 12:40:39,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:40:39,232 INFO L93 Difference]: Finished difference Result 678592 states and 1988991 transitions. [2019-10-02 12:40:39,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-02 12:40:39,233 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 369 [2019-10-02 12:40:39,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:41:04,829 INFO L225 Difference]: With dead ends: 678592 [2019-10-02 12:41:04,830 INFO L226 Difference]: Without dead ends: 533524 [2019-10-02 12:41:05,831 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 386 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=164, Invalid=592, Unknown=0, NotChecked=0, Total=756 [2019-10-02 12:41:06,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533524 states. [2019-10-02 12:41:50,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533524 to 480709. [2019-10-02 12:41:50,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480709 states. [2019-10-02 12:42:12,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480709 states to 480709 states and 1071703 transitions. [2019-10-02 12:42:13,030 INFO L78 Accepts]: Start accepts. Automaton has 480709 states and 1071703 transitions. Word has length 369 [2019-10-02 12:42:13,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:42:13,031 INFO L475 AbstractCegarLoop]: Abstraction has 480709 states and 1071703 transitions. [2019-10-02 12:42:13,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 12:42:13,031 INFO L276 IsEmpty]: Start isEmpty. Operand 480709 states and 1071703 transitions. [2019-10-02 12:42:13,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2019-10-02 12:42:13,172 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:42:13,173 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:13,173 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:42:13,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:42:13,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1665489387, now seen corresponding path program 1 times [2019-10-02 12:42:13,174 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:42:13,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:42:13,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:13,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:42:13,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:13,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:42:13,546 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2019-10-02 12:42:13,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:42:13,547 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:42:13,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:42:25,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:42:25,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 4129 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-02 12:42:25,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:42:25,547 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2019-10-02 12:42:25,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:42:25,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 16 [2019-10-02 12:42:25,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 12:42:25,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 12:42:25,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:42:25,565 INFO L87 Difference]: Start difference. First operand 480709 states and 1071703 transitions. Second operand 16 states.