java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/product-lines/elevator_spec1_product28.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 12:07:40,836 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 12:07:40,838 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 12:07:40,858 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 12:07:40,859 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 12:07:40,860 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 12:07:40,862 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 12:07:40,874 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 12:07:40,876 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 12:07:40,878 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 12:07:40,879 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 12:07:40,882 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 12:07:40,882 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 12:07:40,883 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 12:07:40,884 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 12:07:40,885 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 12:07:40,886 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 12:07:40,886 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 12:07:40,888 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 12:07:40,890 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 12:07:40,891 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 12:07:40,892 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 12:07:40,893 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 12:07:40,893 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 12:07:40,896 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 12:07:40,896 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 12:07:40,896 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 12:07:40,897 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 12:07:40,898 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 12:07:40,901 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 12:07:40,901 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 12:07:40,902 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 12:07:40,902 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 12:07:40,903 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 12:07:40,907 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 12:07:40,908 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 12:07:40,908 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 12:07:40,908 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 12:07:40,909 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 12:07:40,910 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 12:07:40,912 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 12:07:40,913 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:07:40,932 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 12:07:40,932 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 12:07:40,934 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 12:07:40,934 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 12:07:40,935 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 12:07:40,935 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 12:07:40,935 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 12:07:40,935 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 12:07:40,935 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 12:07:40,936 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 12:07:40,937 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 12:07:40,937 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 12:07:40,937 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 12:07:40,937 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 12:07:40,938 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 12:07:40,938 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 12:07:40,938 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 12:07:40,938 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 12:07:40,938 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 12:07:40,939 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 12:07:40,939 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 12:07:40,939 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:07:40,939 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 12:07:40,940 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 12:07:40,940 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 12:07:40,940 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 12:07:40,940 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 12:07:40,940 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 12:07:40,941 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 12:07:40,971 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 12:07:40,983 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 12:07:40,987 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 12:07:40,988 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 12:07:40,988 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 12:07:40,989 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec1_product28.cil.c [2019-10-02 12:07:41,057 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3952c54d5/f1a0e07d82c348a58b0acbd7fe117b62/FLAGcfd9b2e95 [2019-10-02 12:07:41,654 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 12:07:41,656 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec1_product28.cil.c [2019-10-02 12:07:41,688 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3952c54d5/f1a0e07d82c348a58b0acbd7fe117b62/FLAGcfd9b2e95 [2019-10-02 12:07:41,855 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3952c54d5/f1a0e07d82c348a58b0acbd7fe117b62 [2019-10-02 12:07:41,867 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 12:07:41,869 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 12:07:41,870 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 12:07:41,870 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 12:07:41,872 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 12:07:41,873 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:07:41" (1/1) ... [2019-10-02 12:07:41,875 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@283534bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:07:41, skipping insertion in model container [2019-10-02 12:07:41,875 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:07:41" (1/1) ... [2019-10-02 12:07:41,881 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 12:07:41,962 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 12:07:42,659 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:07:42,679 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 12:07:42,836 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:07:42,897 INFO L192 MainTranslator]: Completed translation [2019-10-02 12:07:42,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:07:42 WrapperNode [2019-10-02 12:07:42,898 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 12:07:42,898 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 12:07:42,898 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 12:07:42,899 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 12:07:42,912 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:07:42" (1/1) ... [2019-10-02 12:07:42,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:07:42" (1/1) ... [2019-10-02 12:07:42,955 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:07:42" (1/1) ... [2019-10-02 12:07:42,956 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:07:42" (1/1) ... [2019-10-02 12:07:43,025 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:07:42" (1/1) ... [2019-10-02 12:07:43,049 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:07:42" (1/1) ... [2019-10-02 12:07:43,059 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:07:42" (1/1) ... [2019-10-02 12:07:43,075 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 12:07:43,076 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 12:07:43,076 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 12:07:43,077 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 12:07:43,078 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:07:42" (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:07:43,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 12:07:43,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 12:07:43,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 12:07:43,144 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-02 12:07:43,145 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-02 12:07:43,145 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-02 12:07:43,145 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-02 12:07:43,145 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-02 12:07:43,145 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-02 12:07:43,146 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-02 12:07:43,146 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-02 12:07:43,146 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-02 12:07:43,146 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-02 12:07:43,147 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-02 12:07:43,147 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-02 12:07:43,147 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-02 12:07:43,147 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-02 12:07:43,147 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 12:07:43,148 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-02 12:07:43,148 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 12:07:43,148 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-02 12:07:43,148 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-02 12:07:43,148 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-02 12:07:43,149 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 12:07:43,149 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 12:07:43,149 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 12:07:43,149 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 12:07:43,149 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__1 [2019-10-02 12:07:43,149 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__2 [2019-10-02 12:07:43,150 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__3 [2019-10-02 12:07:43,150 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__4 [2019-10-02 12:07:43,150 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-02 12:07:43,150 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-02 12:07:43,150 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-02 12:07:43,151 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-02 12:07:43,151 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-02 12:07:43,151 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-02 12:07:43,151 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-02 12:07:43,151 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-02 12:07:43,151 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-02 12:07:43,151 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-02 12:07:43,152 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-02 12:07:43,152 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-02 12:07:43,152 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-02 12:07:43,152 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-02 12:07:43,152 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-02 12:07:43,152 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-02 12:07:43,152 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-10-02 12:07:43,153 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-02 12:07:43,153 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-02 12:07:43,153 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-02 12:07:43,153 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-02 12:07:43,153 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-02 12:07:43,154 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-02 12:07:43,154 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-02 12:07:43,154 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-02 12:07:43,154 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-02 12:07:43,154 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-02 12:07:43,154 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-10-02 12:07:43,155 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-02 12:07:43,155 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-02 12:07:43,155 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-02 12:07:43,155 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-02 12:07:43,155 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-02 12:07:43,156 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-02 12:07:43,156 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-02 12:07:43,156 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2019-10-02 12:07:43,156 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-02 12:07:43,156 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__executivefloor [2019-10-02 12:07:43,157 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-02 12:07:43,157 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-02 12:07:43,157 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-02 12:07:43,157 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-02 12:07:43,157 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 12:07:43,158 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 12:07:43,158 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 12:07:43,158 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 12:07:43,158 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 12:07:43,158 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 12:07:43,158 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 12:07:43,159 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 12:07:43,159 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 12:07:43,159 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 12:07:43,159 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 12:07:43,159 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-02 12:07:43,160 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-02 12:07:43,160 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-02 12:07:43,160 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-02 12:07:43,160 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-02 12:07:43,160 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-02 12:07:43,161 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-02 12:07:43,161 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-02 12:07:43,161 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-02 12:07:43,161 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-02 12:07:43,161 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-02 12:07:43,162 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-02 12:07:43,162 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-02 12:07:43,162 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-02 12:07:43,162 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-02 12:07:43,162 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-02 12:07:43,162 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-02 12:07:43,163 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-02 12:07:43,163 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-02 12:07:43,163 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-02 12:07:43,163 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-02 12:07:43,163 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 12:07:43,163 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__1 [2019-10-02 12:07:43,164 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__4 [2019-10-02 12:07:43,164 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 12:07:43,164 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-02 12:07:43,164 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 12:07:43,164 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 12:07:43,164 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 12:07:43,165 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 12:07:43,165 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-02 12:07:43,165 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-02 12:07:43,165 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 12:07:43,165 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 12:07:43,165 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-02 12:07:43,166 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-02 12:07:43,166 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__2 [2019-10-02 12:07:43,166 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__3 [2019-10-02 12:07:43,166 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-02 12:07:43,166 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-02 12:07:43,166 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-02 12:07:43,167 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-02 12:07:43,167 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-02 12:07:43,167 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-02 12:07:43,167 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-02 12:07:43,167 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-02 12:07:43,167 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-02 12:07:43,167 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-02 12:07:43,168 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 12:07:43,168 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-02 12:07:43,168 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-02 12:07:43,168 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-02 12:07:43,168 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-02 12:07:43,168 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-02 12:07:43,168 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-02 12:07:43,169 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-02 12:07:43,169 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-02 12:07:43,169 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-10-02 12:07:43,169 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-02 12:07:43,169 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-02 12:07:43,169 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-02 12:07:43,170 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-02 12:07:43,170 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-02 12:07:43,170 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-10-02 12:07:43,170 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-02 12:07:43,170 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-02 12:07:43,170 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-02 12:07:43,171 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-02 12:07:43,171 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-02 12:07:43,171 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-02 12:07:43,171 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2019-10-02 12:07:43,171 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__executivefloor [2019-10-02 12:07:43,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 12:07:43,171 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-02 12:07:43,172 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 12:07:43,172 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 12:07:43,172 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 12:07:43,172 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 12:07:43,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 12:07:43,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 12:07:43,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 12:07:43,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 12:07:43,173 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 12:07:43,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 12:07:43,173 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 12:07:43,173 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 12:07:43,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 12:07:43,173 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 12:07:43,174 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 12:07:43,174 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 12:07:43,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 12:07:43,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 12:07:43,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 12:07:45,525 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 12:07:45,526 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-02 12:07:45,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:07:45 BoogieIcfgContainer [2019-10-02 12:07:45,528 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 12:07:45,529 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 12:07:45,529 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 12:07:45,533 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 12:07:45,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:07:41" (1/3) ... [2019-10-02 12:07:45,534 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1086d9d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:07:45, skipping insertion in model container [2019-10-02 12:07:45,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:07:42" (2/3) ... [2019-10-02 12:07:45,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1086d9d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:07:45, skipping insertion in model container [2019-10-02 12:07:45,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:07:45" (3/3) ... [2019-10-02 12:07:45,537 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec1_product28.cil.c [2019-10-02 12:07:45,547 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 12:07:45,556 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 12:07:45,573 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 12:07:45,608 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 12:07:45,609 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 12:07:45,609 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 12:07:45,609 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 12:07:45,610 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 12:07:45,610 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 12:07:45,610 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 12:07:45,610 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 12:07:45,610 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 12:07:45,645 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states. [2019-10-02 12:07:45,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-02 12:07:45,661 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:07:45,662 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:07:45,665 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:07:45,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:07:45,672 INFO L82 PathProgramCache]: Analyzing trace with hash -837542985, now seen corresponding path program 1 times [2019-10-02 12:07:45,676 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:07:45,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:07:45,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:45,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:45,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:46,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:46,297 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:07:46,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:07:46,300 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:07:46,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:46,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:46,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 3176 conjuncts, 1 conjunts are in the unsatisfiable core [2019-10-02 12:07:46,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:07:47,005 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:07:47,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:07:47,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 4 [2019-10-02 12:07:47,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:07:47,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:07:47,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:07:47,045 INFO L87 Difference]: Start difference. First operand 803 states. Second operand 4 states. [2019-10-02 12:07:47,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:07:47,232 INFO L93 Difference]: Finished difference Result 1276 states and 2049 transitions. [2019-10-02 12:07:47,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:07:47,234 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-10-02 12:07:47,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:07:47,271 INFO L225 Difference]: With dead ends: 1276 [2019-10-02 12:07:47,271 INFO L226 Difference]: Without dead ends: 642 [2019-10-02 12:07:47,284 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:07:47,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-10-02 12:07:47,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2019-10-02 12:07:47,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-10-02 12:07:47,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 1018 transitions. [2019-10-02 12:07:47,421 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 1018 transitions. Word has length 116 [2019-10-02 12:07:47,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:07:47,422 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 1018 transitions. [2019-10-02 12:07:47,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:07:47,422 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 1018 transitions. [2019-10-02 12:07:47,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-02 12:07:47,430 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:07:47,430 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:07:47,430 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:07:47,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:07:47,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1594115156, now seen corresponding path program 1 times [2019-10-02 12:07:47,431 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:07:47,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:07:47,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:47,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:47,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:47,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:47,647 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:07:47,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:07:47,648 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:07:47,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:48,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:48,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 3181 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:07:48,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:07:48,327 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 12:07:48,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:07:48,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:07:48,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:07:48,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:07:48,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:07:48,350 INFO L87 Difference]: Start difference. First operand 642 states and 1018 transitions. Second operand 6 states. [2019-10-02 12:07:48,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:07:48,482 INFO L93 Difference]: Finished difference Result 1256 states and 2009 transitions. [2019-10-02 12:07:48,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:07:48,483 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 120 [2019-10-02 12:07:48,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:07:48,489 INFO L225 Difference]: With dead ends: 1256 [2019-10-02 12:07:48,489 INFO L226 Difference]: Without dead ends: 642 [2019-10-02 12:07:48,493 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:07:48,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-10-02 12:07:48,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2019-10-02 12:07:48,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-10-02 12:07:48,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 1017 transitions. [2019-10-02 12:07:48,533 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 1017 transitions. Word has length 120 [2019-10-02 12:07:48,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:07:48,533 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 1017 transitions. [2019-10-02 12:07:48,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:07:48,533 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 1017 transitions. [2019-10-02 12:07:48,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-02 12:07:48,539 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:07:48,539 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:07:48,540 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:07:48,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:07:48,540 INFO L82 PathProgramCache]: Analyzing trace with hash -254884654, now seen corresponding path program 1 times [2019-10-02 12:07:48,540 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:07:48,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:07:48,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:48,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:48,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:48,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:48,699 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:07:48,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:07:48,699 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:07:48,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:49,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:49,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 3183 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:07:49,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:07:49,336 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 12:07:49,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:07:49,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:07:49,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:07:49,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:07:49,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:07:49,354 INFO L87 Difference]: Start difference. First operand 642 states and 1017 transitions. Second operand 6 states. [2019-10-02 12:07:49,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:07:49,465 INFO L93 Difference]: Finished difference Result 1260 states and 2012 transitions. [2019-10-02 12:07:49,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:07:49,465 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 122 [2019-10-02 12:07:49,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:07:49,476 INFO L225 Difference]: With dead ends: 1260 [2019-10-02 12:07:49,476 INFO L226 Difference]: Without dead ends: 648 [2019-10-02 12:07:49,479 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:07:49,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2019-10-02 12:07:49,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 648. [2019-10-02 12:07:49,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-10-02 12:07:49,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1022 transitions. [2019-10-02 12:07:49,532 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 1022 transitions. Word has length 122 [2019-10-02 12:07:49,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:07:49,534 INFO L475 AbstractCegarLoop]: Abstraction has 648 states and 1022 transitions. [2019-10-02 12:07:49,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:07:49,534 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1022 transitions. [2019-10-02 12:07:49,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-02 12:07:49,540 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:07:49,540 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:07:49,540 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:07:49,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:07:49,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1100707264, now seen corresponding path program 1 times [2019-10-02 12:07:49,541 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:07:49,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:07:49,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:49,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:49,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:49,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:49,710 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:07:49,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:07:49,710 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:07:49,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:50,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:50,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 3184 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:07:50,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:07:50,386 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 12:07:50,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:07:50,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:07:50,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:07:50,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:07:50,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:07:50,400 INFO L87 Difference]: Start difference. First operand 648 states and 1022 transitions. Second operand 6 states. [2019-10-02 12:07:50,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:07:50,500 INFO L93 Difference]: Finished difference Result 1259 states and 2003 transitions. [2019-10-02 12:07:50,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:07:50,500 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 123 [2019-10-02 12:07:50,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:07:50,516 INFO L225 Difference]: With dead ends: 1259 [2019-10-02 12:07:50,516 INFO L226 Difference]: Without dead ends: 648 [2019-10-02 12:07:50,523 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:07:50,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2019-10-02 12:07:50,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 648. [2019-10-02 12:07:50,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-10-02 12:07:50,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1021 transitions. [2019-10-02 12:07:50,552 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 1021 transitions. Word has length 123 [2019-10-02 12:07:50,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:07:50,553 INFO L475 AbstractCegarLoop]: Abstraction has 648 states and 1021 transitions. [2019-10-02 12:07:50,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:07:50,553 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1021 transitions. [2019-10-02 12:07:50,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-02 12:07:50,555 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:07:50,556 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:07:50,556 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:07:50,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:07:50,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1202095766, now seen corresponding path program 1 times [2019-10-02 12:07:50,556 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:07:50,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:07:50,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:50,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:50,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:50,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:50,712 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:07:50,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:07:50,712 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:07:50,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:51,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:51,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 3185 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:07:51,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:07:51,510 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 12:07:51,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:07:51,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:07:51,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:07:51,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:07:51,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:07:51,528 INFO L87 Difference]: Start difference. First operand 648 states and 1021 transitions. Second operand 6 states. [2019-10-02 12:07:51,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:07:51,617 INFO L93 Difference]: Finished difference Result 1259 states and 2002 transitions. [2019-10-02 12:07:51,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:07:51,617 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 124 [2019-10-02 12:07:51,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:07:51,622 INFO L225 Difference]: With dead ends: 1259 [2019-10-02 12:07:51,622 INFO L226 Difference]: Without dead ends: 648 [2019-10-02 12:07:51,625 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:07:51,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2019-10-02 12:07:51,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 648. [2019-10-02 12:07:51,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-10-02 12:07:51,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1020 transitions. [2019-10-02 12:07:51,648 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 1020 transitions. Word has length 124 [2019-10-02 12:07:51,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:07:51,648 INFO L475 AbstractCegarLoop]: Abstraction has 648 states and 1020 transitions. [2019-10-02 12:07:51,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:07:51,649 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1020 transitions. [2019-10-02 12:07:51,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-02 12:07:51,651 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:07:51,651 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:07:51,651 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:07:51,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:07:51,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1942679045, now seen corresponding path program 1 times [2019-10-02 12:07:51,652 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:07:51,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:07:51,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:51,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:51,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:51,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:51,796 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:07:51,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:07:51,797 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:07:51,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:52,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:52,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 3185 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:07:52,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:07:52,352 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:07:52,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:07:52,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:07:52,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:07:52,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:07:52,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:07:52,362 INFO L87 Difference]: Start difference. First operand 648 states and 1020 transitions. Second operand 6 states. [2019-10-02 12:07:52,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:07:52,660 INFO L93 Difference]: Finished difference Result 1262 states and 2007 transitions. [2019-10-02 12:07:52,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:07:52,660 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 125 [2019-10-02 12:07:52,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:07:52,665 INFO L225 Difference]: With dead ends: 1262 [2019-10-02 12:07:52,665 INFO L226 Difference]: Without dead ends: 648 [2019-10-02 12:07:52,668 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 125 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:07:52,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2019-10-02 12:07:52,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 648. [2019-10-02 12:07:52,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-10-02 12:07:52,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1014 transitions. [2019-10-02 12:07:52,691 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 1014 transitions. Word has length 125 [2019-10-02 12:07:52,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:07:52,692 INFO L475 AbstractCegarLoop]: Abstraction has 648 states and 1014 transitions. [2019-10-02 12:07:52,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:07:52,692 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1014 transitions. [2019-10-02 12:07:52,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-02 12:07:52,694 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:07:52,694 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:07:52,694 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:07:52,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:07:52,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1286158176, now seen corresponding path program 1 times [2019-10-02 12:07:52,695 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:07:52,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:07:52,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:52,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:52,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:52,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:52,927 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-02 12:07:52,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:07:52,927 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:07:53,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:53,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:53,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 3188 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 12:07:53,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:07:53,547 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:07:53,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:07:53,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2019-10-02 12:07:53,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 12:07:53,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 12:07:53,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:07:53,565 INFO L87 Difference]: Start difference. First operand 648 states and 1014 transitions. Second operand 15 states. [2019-10-02 12:07:53,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:07:53,754 INFO L93 Difference]: Finished difference Result 1258 states and 1990 transitions. [2019-10-02 12:07:53,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:07:53,755 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 127 [2019-10-02 12:07:53,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:07:53,761 INFO L225 Difference]: With dead ends: 1258 [2019-10-02 12:07:53,761 INFO L226 Difference]: Without dead ends: 651 [2019-10-02 12:07:53,765 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:07:53,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-10-02 12:07:53,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2019-10-02 12:07:53,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-10-02 12:07:53,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1018 transitions. [2019-10-02 12:07:53,795 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1018 transitions. Word has length 127 [2019-10-02 12:07:53,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:07:53,796 INFO L475 AbstractCegarLoop]: Abstraction has 651 states and 1018 transitions. [2019-10-02 12:07:53,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 12:07:53,796 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1018 transitions. [2019-10-02 12:07:53,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-02 12:07:53,799 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:07:53,799 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:07:53,799 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:07:53,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:07:53,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1471617335, now seen corresponding path program 1 times [2019-10-02 12:07:53,800 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:07:53,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:07:53,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:53,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:53,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:53,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:53,965 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-02 12:07:53,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:07:53,965 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:07:54,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:54,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:54,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 3189 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:07:54,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:07:54,625 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:07:54,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:07:54,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 12:07:54,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:07:54,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:07:54,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:07:54,648 INFO L87 Difference]: Start difference. First operand 651 states and 1018 transitions. Second operand 8 states. [2019-10-02 12:07:54,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:07:54,911 INFO L93 Difference]: Finished difference Result 1267 states and 2003 transitions. [2019-10-02 12:07:54,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:07:54,912 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 128 [2019-10-02 12:07:54,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:07:54,918 INFO L225 Difference]: With dead ends: 1267 [2019-10-02 12:07:54,918 INFO L226 Difference]: Without dead ends: 651 [2019-10-02 12:07:54,921 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:07:54,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-10-02 12:07:54,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2019-10-02 12:07:54,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-10-02 12:07:54,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1013 transitions. [2019-10-02 12:07:54,945 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1013 transitions. Word has length 128 [2019-10-02 12:07:54,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:07:54,946 INFO L475 AbstractCegarLoop]: Abstraction has 651 states and 1013 transitions. [2019-10-02 12:07:54,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:07:54,946 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1013 transitions. [2019-10-02 12:07:54,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-02 12:07:54,949 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:07:54,949 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:07:54,950 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:07:54,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:07:54,950 INFO L82 PathProgramCache]: Analyzing trace with hash -468935617, now seen corresponding path program 1 times [2019-10-02 12:07:54,950 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:07:54,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:07:54,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:54,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:54,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:55,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:55,116 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-02 12:07:55,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:07:55,119 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:07:55,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:55,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:55,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 3191 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:07:55,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:07:55,820 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:07:55,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:07:55,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 12:07:55,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:07:55,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:07:55,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:07:55,840 INFO L87 Difference]: Start difference. First operand 651 states and 1013 transitions. Second operand 8 states. [2019-10-02 12:07:56,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:07:56,172 INFO L93 Difference]: Finished difference Result 1288 states and 2024 transitions. [2019-10-02 12:07:56,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:07:56,173 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 130 [2019-10-02 12:07:56,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:07:56,181 INFO L225 Difference]: With dead ends: 1288 [2019-10-02 12:07:56,181 INFO L226 Difference]: Without dead ends: 669 [2019-10-02 12:07:56,184 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:07:56,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2019-10-02 12:07:56,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 666. [2019-10-02 12:07:56,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2019-10-02 12:07:56,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1026 transitions. [2019-10-02 12:07:56,215 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1026 transitions. Word has length 130 [2019-10-02 12:07:56,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:07:56,216 INFO L475 AbstractCegarLoop]: Abstraction has 666 states and 1026 transitions. [2019-10-02 12:07:56,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:07:56,217 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1026 transitions. [2019-10-02 12:07:56,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-02 12:07:56,219 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:07:56,219 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:07:56,220 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:07:56,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:07:56,220 INFO L82 PathProgramCache]: Analyzing trace with hash -869118017, now seen corresponding path program 1 times [2019-10-02 12:07:56,220 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:07:56,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:07:56,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:56,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:56,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:56,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:56,415 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-02 12:07:56,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:07:56,415 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:07:56,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:57,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:57,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 3187 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 12:07:57,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:07:57,185 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:07:57,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:07:57,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2019-10-02 12:07:57,199 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:07:57,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:07:57,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:07:57,199 INFO L87 Difference]: Start difference. First operand 666 states and 1026 transitions. Second operand 14 states. [2019-10-02 12:07:57,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:07:57,509 INFO L93 Difference]: Finished difference Result 1278 states and 1989 transitions. [2019-10-02 12:07:57,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:07:57,509 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 130 [2019-10-02 12:07:57,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:07:57,514 INFO L225 Difference]: With dead ends: 1278 [2019-10-02 12:07:57,515 INFO L226 Difference]: Without dead ends: 660 [2019-10-02 12:07:57,518 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:07:57,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2019-10-02 12:07:57,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 655. [2019-10-02 12:07:57,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-10-02 12:07:57,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1006 transitions. [2019-10-02 12:07:57,549 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1006 transitions. Word has length 130 [2019-10-02 12:07:57,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:07:57,550 INFO L475 AbstractCegarLoop]: Abstraction has 655 states and 1006 transitions. [2019-10-02 12:07:57,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 12:07:57,550 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1006 transitions. [2019-10-02 12:07:57,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-02 12:07:57,552 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:07:57,552 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:07:57,552 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:07:57,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:07:57,553 INFO L82 PathProgramCache]: Analyzing trace with hash -637679780, now seen corresponding path program 1 times [2019-10-02 12:07:57,553 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:07:57,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:07:57,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:57,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:57,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:57,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:57,694 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-02 12:07:57,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:07:57,695 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:07:57,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:58,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:58,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 3194 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:07:58,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:07:58,472 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:07:58,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:07:58,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 12:07:58,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:07:58,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:07:58,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:07:58,491 INFO L87 Difference]: Start difference. First operand 655 states and 1006 transitions. Second operand 8 states. [2019-10-02 12:07:58,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:07:58,746 INFO L93 Difference]: Finished difference Result 1260 states and 1958 transitions. [2019-10-02 12:07:58,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:07:58,747 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 133 [2019-10-02 12:07:58,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:07:58,754 INFO L225 Difference]: With dead ends: 1260 [2019-10-02 12:07:58,754 INFO L226 Difference]: Without dead ends: 655 [2019-10-02 12:07:58,759 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:07:58,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2019-10-02 12:07:58,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2019-10-02 12:07:58,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-10-02 12:07:58,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1005 transitions. [2019-10-02 12:07:58,786 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1005 transitions. Word has length 133 [2019-10-02 12:07:58,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:07:58,787 INFO L475 AbstractCegarLoop]: Abstraction has 655 states and 1005 transitions. [2019-10-02 12:07:58,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:07:58,787 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1005 transitions. [2019-10-02 12:07:58,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-02 12:07:58,789 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:07:58,790 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:07:58,790 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:07:58,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:07:58,790 INFO L82 PathProgramCache]: Analyzing trace with hash 742060991, now seen corresponding path program 1 times [2019-10-02 12:07:58,790 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:07:58,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:07:58,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:58,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:58,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:58,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:58,915 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-02 12:07:58,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:07:58,916 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:07:59,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:59,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:59,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 3195 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:07:59,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:07:59,449 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:07:59,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:07:59,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 12:07:59,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:07:59,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:07:59,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:07:59,459 INFO L87 Difference]: Start difference. First operand 655 states and 1005 transitions. Second operand 8 states. [2019-10-02 12:07:59,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:07:59,641 INFO L93 Difference]: Finished difference Result 1260 states and 1957 transitions. [2019-10-02 12:07:59,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:07:59,642 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 134 [2019-10-02 12:07:59,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:07:59,646 INFO L225 Difference]: With dead ends: 1260 [2019-10-02 12:07:59,646 INFO L226 Difference]: Without dead ends: 655 [2019-10-02 12:07:59,650 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:07:59,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2019-10-02 12:07:59,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2019-10-02 12:07:59,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-10-02 12:07:59,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1004 transitions. [2019-10-02 12:07:59,678 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1004 transitions. Word has length 134 [2019-10-02 12:07:59,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:07:59,679 INFO L475 AbstractCegarLoop]: Abstraction has 655 states and 1004 transitions. [2019-10-02 12:07:59,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:07:59,679 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1004 transitions. [2019-10-02 12:07:59,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-02 12:07:59,681 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:07:59,681 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:07:59,682 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:07:59,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:07:59,682 INFO L82 PathProgramCache]: Analyzing trace with hash 2110365911, now seen corresponding path program 1 times [2019-10-02 12:07:59,682 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:07:59,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:07:59,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:59,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:59,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:59,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:59,892 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-02 12:07:59,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:07:59,893 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:08:00,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:08:00,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:08:00,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 3196 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 12:08:00,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:08:00,629 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 12:08:00,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:08:00,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 18 [2019-10-02 12:08:00,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 12:08:00,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 12:08:00,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-10-02 12:08:00,641 INFO L87 Difference]: Start difference. First operand 655 states and 1004 transitions. Second operand 18 states. [2019-10-02 12:08:01,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:08:01,191 INFO L93 Difference]: Finished difference Result 1276 states and 1984 transitions. [2019-10-02 12:08:01,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 12:08:01,192 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 135 [2019-10-02 12:08:01,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:08:01,197 INFO L225 Difference]: With dead ends: 1276 [2019-10-02 12:08:01,197 INFO L226 Difference]: Without dead ends: 670 [2019-10-02 12:08:01,200 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-10-02 12:08:01,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2019-10-02 12:08:01,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 666. [2019-10-02 12:08:01,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2019-10-02 12:08:01,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1012 transitions. [2019-10-02 12:08:01,224 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1012 transitions. Word has length 135 [2019-10-02 12:08:01,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:08:01,225 INFO L475 AbstractCegarLoop]: Abstraction has 666 states and 1012 transitions. [2019-10-02 12:08:01,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 12:08:01,225 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1012 transitions. [2019-10-02 12:08:01,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-02 12:08:01,227 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:08:01,227 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:08:01,227 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:08:01,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:08:01,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1333367510, now seen corresponding path program 1 times [2019-10-02 12:08:01,228 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:08:01,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:08:01,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:01,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:08:01,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:01,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:08:01,372 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-02 12:08:01,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:08:01,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:08:01,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:08:01,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:08:01,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:08:01,374 INFO L87 Difference]: Start difference. First operand 666 states and 1012 transitions. Second operand 9 states. [2019-10-02 12:08:01,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:08:01,531 INFO L93 Difference]: Finished difference Result 1207 states and 1880 transitions. [2019-10-02 12:08:01,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:08:01,531 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-10-02 12:08:01,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:08:01,538 INFO L225 Difference]: With dead ends: 1207 [2019-10-02 12:08:01,538 INFO L226 Difference]: Without dead ends: 663 [2019-10-02 12:08:01,541 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:08:01,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2019-10-02 12:08:01,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 663. [2019-10-02 12:08:01,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2019-10-02 12:08:01,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 1007 transitions. [2019-10-02 12:08:01,564 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 1007 transitions. Word has length 136 [2019-10-02 12:08:01,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:08:01,564 INFO L475 AbstractCegarLoop]: Abstraction has 663 states and 1007 transitions. [2019-10-02 12:08:01,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:08:01,565 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 1007 transitions. [2019-10-02 12:08:01,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-02 12:08:01,567 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:08:01,567 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:08:01,567 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:08:01,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:08:01,568 INFO L82 PathProgramCache]: Analyzing trace with hash 976961706, now seen corresponding path program 1 times [2019-10-02 12:08:01,568 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:08:01,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:08:01,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:01,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:08:01,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:01,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:08:01,705 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-02 12:08:01,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:08:01,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:08:01,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:08:01,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:08:01,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:08:01,707 INFO L87 Difference]: Start difference. First operand 663 states and 1007 transitions. Second operand 7 states. [2019-10-02 12:08:01,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:08:01,793 INFO L93 Difference]: Finished difference Result 1204 states and 1875 transitions. [2019-10-02 12:08:01,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:08:01,794 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 136 [2019-10-02 12:08:01,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:08:01,799 INFO L225 Difference]: With dead ends: 1204 [2019-10-02 12:08:01,799 INFO L226 Difference]: Without dead ends: 642 [2019-10-02 12:08:01,804 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:08:01,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-10-02 12:08:01,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 640. [2019-10-02 12:08:01,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2019-10-02 12:08:01,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 977 transitions. [2019-10-02 12:08:01,828 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 977 transitions. Word has length 136 [2019-10-02 12:08:01,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:08:01,830 INFO L475 AbstractCegarLoop]: Abstraction has 640 states and 977 transitions. [2019-10-02 12:08:01,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:08:01,830 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 977 transitions. [2019-10-02 12:08:01,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-02 12:08:01,832 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:08:01,832 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:08:01,832 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:08:01,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:08:01,833 INFO L82 PathProgramCache]: Analyzing trace with hash 607414833, now seen corresponding path program 1 times [2019-10-02 12:08:01,833 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:08:01,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:08:01,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:01,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:08:01,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:01,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:08:02,046 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 12:08:02,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:08:02,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 12:08:02,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 12:08:02,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 12:08:02,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:08:02,048 INFO L87 Difference]: Start difference. First operand 640 states and 977 transitions. Second operand 13 states. [2019-10-02 12:08:02,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:08:02,337 INFO L93 Difference]: Finished difference Result 1182 states and 1843 transitions. [2019-10-02 12:08:02,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 12:08:02,337 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 137 [2019-10-02 12:08:02,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:08:02,341 INFO L225 Difference]: With dead ends: 1182 [2019-10-02 12:08:02,342 INFO L226 Difference]: Without dead ends: 633 [2019-10-02 12:08:02,344 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-10-02 12:08:02,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2019-10-02 12:08:02,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 633. [2019-10-02 12:08:02,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2019-10-02 12:08:02,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 968 transitions. [2019-10-02 12:08:02,365 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 968 transitions. Word has length 137 [2019-10-02 12:08:02,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:08:02,366 INFO L475 AbstractCegarLoop]: Abstraction has 633 states and 968 transitions. [2019-10-02 12:08:02,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 12:08:02,366 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 968 transitions. [2019-10-02 12:08:02,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-02 12:08:02,368 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:08:02,368 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:08:02,368 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:08:02,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:08:02,368 INFO L82 PathProgramCache]: Analyzing trace with hash 110067564, now seen corresponding path program 1 times [2019-10-02 12:08:02,369 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:08:02,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:08:02,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:02,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:08:02,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:02,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:08:02,554 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 12:08:02,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:08:02,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 12:08:02,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 12:08:02,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 12:08:02,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:08:02,556 INFO L87 Difference]: Start difference. First operand 633 states and 968 transitions. Second operand 13 states. [2019-10-02 12:08:02,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:08:02,945 INFO L93 Difference]: Finished difference Result 1233 states and 1911 transitions. [2019-10-02 12:08:02,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 12:08:02,946 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 138 [2019-10-02 12:08:02,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:08:02,958 INFO L225 Difference]: With dead ends: 1233 [2019-10-02 12:08:02,958 INFO L226 Difference]: Without dead ends: 647 [2019-10-02 12:08:02,961 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-10-02 12:08:02,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2019-10-02 12:08:02,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 645. [2019-10-02 12:08:02,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2019-10-02 12:08:02,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 983 transitions. [2019-10-02 12:08:02,985 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 983 transitions. Word has length 138 [2019-10-02 12:08:02,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:08:02,986 INFO L475 AbstractCegarLoop]: Abstraction has 645 states and 983 transitions. [2019-10-02 12:08:02,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 12:08:02,986 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 983 transitions. [2019-10-02 12:08:02,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-02 12:08:02,989 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:08:02,989 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:08:02,990 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:08:02,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:08:02,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1833374614, now seen corresponding path program 1 times [2019-10-02 12:08:02,991 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:08:02,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:08:02,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:02,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:08:02,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:03,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:08:03,183 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 12:08:03,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:08:03,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:08:03,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:08:03,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:08:03,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:08:03,185 INFO L87 Difference]: Start difference. First operand 645 states and 983 transitions. Second operand 11 states. [2019-10-02 12:08:03,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:08:03,428 INFO L93 Difference]: Finished difference Result 1187 states and 1849 transitions. [2019-10-02 12:08:03,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:08:03,429 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 139 [2019-10-02 12:08:03,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:08:03,434 INFO L225 Difference]: With dead ends: 1187 [2019-10-02 12:08:03,434 INFO L226 Difference]: Without dead ends: 645 [2019-10-02 12:08:03,437 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:08:03,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2019-10-02 12:08:03,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 645. [2019-10-02 12:08:03,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2019-10-02 12:08:03,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 982 transitions. [2019-10-02 12:08:03,456 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 982 transitions. Word has length 139 [2019-10-02 12:08:03,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:08:03,457 INFO L475 AbstractCegarLoop]: Abstraction has 645 states and 982 transitions. [2019-10-02 12:08:03,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:08:03,457 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 982 transitions. [2019-10-02 12:08:03,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-02 12:08:03,459 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:08:03,459 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:08:03,459 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:08:03,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:08:03,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1774948726, now seen corresponding path program 1 times [2019-10-02 12:08:03,460 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:08:03,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:08:03,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:03,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:08:03,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:03,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:08:03,628 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 12:08:03,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:08:03,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:08:03,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:08:03,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:08:03,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:08:03,630 INFO L87 Difference]: Start difference. First operand 645 states and 982 transitions. Second operand 11 states. [2019-10-02 12:08:03,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:08:03,863 INFO L93 Difference]: Finished difference Result 1233 states and 1902 transitions. [2019-10-02 12:08:03,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:08:03,863 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 140 [2019-10-02 12:08:03,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:08:03,867 INFO L225 Difference]: With dead ends: 1233 [2019-10-02 12:08:03,868 INFO L226 Difference]: Without dead ends: 642 [2019-10-02 12:08:03,870 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:08:03,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-10-02 12:08:03,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2019-10-02 12:08:03,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-10-02 12:08:03,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 974 transitions. [2019-10-02 12:08:03,890 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 974 transitions. Word has length 140 [2019-10-02 12:08:03,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:08:03,892 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 974 transitions. [2019-10-02 12:08:03,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:08:03,892 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 974 transitions. [2019-10-02 12:08:03,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-02 12:08:03,894 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:08:03,894 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:08:03,894 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:08:03,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:08:03,894 INFO L82 PathProgramCache]: Analyzing trace with hash 709375537, now seen corresponding path program 1 times [2019-10-02 12:08:03,896 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:08:03,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:08:03,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:03,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:08:03,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:03,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:08:04,068 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-02 12:08:04,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:08:04,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:08:04,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:08:04,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:08:04,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:08:04,070 INFO L87 Difference]: Start difference. First operand 642 states and 974 transitions. Second operand 9 states. [2019-10-02 12:08:10,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:08:10,934 INFO L93 Difference]: Finished difference Result 1674 states and 2635 transitions. [2019-10-02 12:08:10,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 12:08:10,934 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 141 [2019-10-02 12:08:10,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:08:10,942 INFO L225 Difference]: With dead ends: 1674 [2019-10-02 12:08:10,942 INFO L226 Difference]: Without dead ends: 1141 [2019-10-02 12:08:10,945 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2019-10-02 12:08:10,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2019-10-02 12:08:10,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 1109. [2019-10-02 12:08:10,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1109 states. [2019-10-02 12:08:10,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1693 transitions. [2019-10-02 12:08:10,987 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1693 transitions. Word has length 141 [2019-10-02 12:08:10,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:08:10,988 INFO L475 AbstractCegarLoop]: Abstraction has 1109 states and 1693 transitions. [2019-10-02 12:08:10,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:08:10,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1693 transitions. [2019-10-02 12:08:10,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-02 12:08:10,990 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:08:10,990 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:08:10,990 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:08:10,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:08:10,991 INFO L82 PathProgramCache]: Analyzing trace with hash -2008199229, now seen corresponding path program 1 times [2019-10-02 12:08:10,991 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:08:10,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:08:10,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:10,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:08:10,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:11,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:08:11,127 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-02 12:08:11,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:08:11,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:08:11,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:08:11,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:08:11,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:08:11,128 INFO L87 Difference]: Start difference. First operand 1109 states and 1693 transitions. Second operand 5 states. [2019-10-02 12:08:11,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:08:11,770 INFO L93 Difference]: Finished difference Result 2104 states and 3265 transitions. [2019-10-02 12:08:11,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:08:11,770 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 142 [2019-10-02 12:08:11,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:08:11,778 INFO L225 Difference]: With dead ends: 2104 [2019-10-02 12:08:11,778 INFO L226 Difference]: Without dead ends: 1105 [2019-10-02 12:08:11,783 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:08:11,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2019-10-02 12:08:11,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 1105. [2019-10-02 12:08:11,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1105 states. [2019-10-02 12:08:11,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1105 states to 1105 states and 1685 transitions. [2019-10-02 12:08:11,841 INFO L78 Accepts]: Start accepts. Automaton has 1105 states and 1685 transitions. Word has length 142 [2019-10-02 12:08:11,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:08:11,842 INFO L475 AbstractCegarLoop]: Abstraction has 1105 states and 1685 transitions. [2019-10-02 12:08:11,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:08:11,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1105 states and 1685 transitions. [2019-10-02 12:08:11,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-02 12:08:11,844 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:08:11,844 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:08:11,844 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:08:11,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:08:11,846 INFO L82 PathProgramCache]: Analyzing trace with hash -2125027260, now seen corresponding path program 1 times [2019-10-02 12:08:11,846 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:08:11,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:08:11,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:11,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:08:11,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:11,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:08:12,053 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-02 12:08:12,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:08:12,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:08:12,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:08:12,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:08:12,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:08:12,055 INFO L87 Difference]: Start difference. First operand 1105 states and 1685 transitions. Second operand 6 states. [2019-10-02 12:08:15,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:08:15,348 INFO L93 Difference]: Finished difference Result 3261 states and 5112 transitions. [2019-10-02 12:08:15,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:08:15,351 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-10-02 12:08:15,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:08:15,365 INFO L225 Difference]: With dead ends: 3261 [2019-10-02 12:08:15,365 INFO L226 Difference]: Without dead ends: 2266 [2019-10-02 12:08:15,371 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:08:15,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2266 states. [2019-10-02 12:08:15,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2266 to 2048. [2019-10-02 12:08:15,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2048 states. [2019-10-02 12:08:15,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2048 states to 2048 states and 3188 transitions. [2019-10-02 12:08:15,465 INFO L78 Accepts]: Start accepts. Automaton has 2048 states and 3188 transitions. Word has length 143 [2019-10-02 12:08:15,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:08:15,465 INFO L475 AbstractCegarLoop]: Abstraction has 2048 states and 3188 transitions. [2019-10-02 12:08:15,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:08:15,465 INFO L276 IsEmpty]: Start isEmpty. Operand 2048 states and 3188 transitions. [2019-10-02 12:08:15,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-10-02 12:08:15,471 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:08:15,471 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:08:15,471 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:08:15,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:08:15,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1651596535, now seen corresponding path program 1 times [2019-10-02 12:08:15,472 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:08:15,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:08:15,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:15,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:08:15,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:15,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:08:15,683 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 12:08:15,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:08:15,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 12:08:15,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:08:15,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:08:15,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:08:15,685 INFO L87 Difference]: Start difference. First operand 2048 states and 3188 transitions. Second operand 12 states. [2019-10-02 12:08:25,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:08:25,711 INFO L93 Difference]: Finished difference Result 6461 states and 10017 transitions. [2019-10-02 12:08:25,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 12:08:25,712 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 200 [2019-10-02 12:08:25,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:08:25,735 INFO L225 Difference]: With dead ends: 6461 [2019-10-02 12:08:25,735 INFO L226 Difference]: Without dead ends: 4522 [2019-10-02 12:08:25,746 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2019-10-02 12:08:25,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4522 states. [2019-10-02 12:08:25,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4522 to 4466. [2019-10-02 12:08:25,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4466 states. [2019-10-02 12:08:25,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4466 states to 4466 states and 6810 transitions. [2019-10-02 12:08:25,961 INFO L78 Accepts]: Start accepts. Automaton has 4466 states and 6810 transitions. Word has length 200 [2019-10-02 12:08:25,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:08:25,963 INFO L475 AbstractCegarLoop]: Abstraction has 4466 states and 6810 transitions. [2019-10-02 12:08:25,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:08:25,963 INFO L276 IsEmpty]: Start isEmpty. Operand 4466 states and 6810 transitions. [2019-10-02 12:08:25,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-10-02 12:08:25,968 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:08:25,969 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:08:25,969 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:08:25,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:08:25,969 INFO L82 PathProgramCache]: Analyzing trace with hash -256966683, now seen corresponding path program 1 times [2019-10-02 12:08:25,969 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:08:25,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:08:25,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:25,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:08:25,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:26,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:08:26,199 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 12:08:26,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:08:26,199 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:08:26,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:08:26,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:08:26,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 3579 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:08:26,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:08:26,968 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 12:08:26,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:08:26,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-10-02 12:08:26,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:08:26,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:08:26,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:08:26,978 INFO L87 Difference]: Start difference. First operand 4466 states and 6810 transitions. Second operand 14 states. [2019-10-02 12:08:33,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:08:33,052 INFO L93 Difference]: Finished difference Result 9095 states and 14343 transitions. [2019-10-02 12:08:33,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 12:08:33,052 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 201 [2019-10-02 12:08:33,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:08:33,076 INFO L225 Difference]: With dead ends: 9095 [2019-10-02 12:08:33,076 INFO L226 Difference]: Without dead ends: 4738 [2019-10-02 12:08:33,095 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 223 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2019-10-02 12:08:33,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4738 states. [2019-10-02 12:08:33,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4738 to 4686. [2019-10-02 12:08:33,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4686 states. [2019-10-02 12:08:33,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4686 states to 4686 states and 7202 transitions. [2019-10-02 12:08:33,319 INFO L78 Accepts]: Start accepts. Automaton has 4686 states and 7202 transitions. Word has length 201 [2019-10-02 12:08:33,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:08:33,319 INFO L475 AbstractCegarLoop]: Abstraction has 4686 states and 7202 transitions. [2019-10-02 12:08:33,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 12:08:33,319 INFO L276 IsEmpty]: Start isEmpty. Operand 4686 states and 7202 transitions. [2019-10-02 12:08:33,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-10-02 12:08:33,325 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:08:33,325 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:08:33,325 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:08:33,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:08:33,326 INFO L82 PathProgramCache]: Analyzing trace with hash 490673765, now seen corresponding path program 1 times [2019-10-02 12:08:33,326 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:08:33,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:08:33,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:33,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:08:33,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:33,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:08:33,520 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 12:08:33,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:08:33,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:08:33,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:08:33,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:08:33,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:08:33,522 INFO L87 Difference]: Start difference. First operand 4686 states and 7202 transitions. Second operand 6 states. [2019-10-02 12:08:34,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:08:34,295 INFO L93 Difference]: Finished difference Result 9371 states and 14773 transitions. [2019-10-02 12:08:34,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:08:34,296 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 203 [2019-10-02 12:08:34,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:08:34,320 INFO L225 Difference]: With dead ends: 9371 [2019-10-02 12:08:34,320 INFO L226 Difference]: Without dead ends: 4766 [2019-10-02 12:08:34,337 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:08:34,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4766 states. [2019-10-02 12:08:34,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4766 to 4766. [2019-10-02 12:08:34,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4766 states. [2019-10-02 12:08:34,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4766 states to 4766 states and 7244 transitions. [2019-10-02 12:08:34,629 INFO L78 Accepts]: Start accepts. Automaton has 4766 states and 7244 transitions. Word has length 203 [2019-10-02 12:08:34,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:08:34,630 INFO L475 AbstractCegarLoop]: Abstraction has 4766 states and 7244 transitions. [2019-10-02 12:08:34,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:08:34,630 INFO L276 IsEmpty]: Start isEmpty. Operand 4766 states and 7244 transitions. [2019-10-02 12:08:34,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-10-02 12:08:34,646 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:08:34,647 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:08:34,647 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:08:34,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:08:34,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1988945947, now seen corresponding path program 1 times [2019-10-02 12:08:34,648 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:08:34,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:08:34,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:34,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:08:34,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:34,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:08:34,931 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 12:08:34,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:08:34,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:08:34,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:08:34,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:08:34,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:08:34,934 INFO L87 Difference]: Start difference. First operand 4766 states and 7244 transitions. Second operand 6 states. [2019-10-02 12:08:36,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:08:36,208 INFO L93 Difference]: Finished difference Result 9547 states and 14859 transitions. [2019-10-02 12:08:36,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:08:36,209 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 205 [2019-10-02 12:08:36,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:08:36,240 INFO L225 Difference]: With dead ends: 9547 [2019-10-02 12:08:36,241 INFO L226 Difference]: Without dead ends: 4862 [2019-10-02 12:08:36,261 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:08:36,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4862 states. [2019-10-02 12:08:36,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4862 to 4862. [2019-10-02 12:08:36,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4862 states. [2019-10-02 12:08:36,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4862 states to 4862 states and 7302 transitions. [2019-10-02 12:08:36,602 INFO L78 Accepts]: Start accepts. Automaton has 4862 states and 7302 transitions. Word has length 205 [2019-10-02 12:08:36,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:08:36,603 INFO L475 AbstractCegarLoop]: Abstraction has 4862 states and 7302 transitions. [2019-10-02 12:08:36,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:08:36,603 INFO L276 IsEmpty]: Start isEmpty. Operand 4862 states and 7302 transitions. [2019-10-02 12:08:36,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-10-02 12:08:36,612 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:08:36,614 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:08:36,615 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:08:36,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:08:36,615 INFO L82 PathProgramCache]: Analyzing trace with hash -243696147, now seen corresponding path program 1 times [2019-10-02 12:08:36,615 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:08:36,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:08:36,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:36,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:08:36,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:36,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:08:36,952 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-02 12:08:36,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:08:36,953 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:08:37,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:08:37,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:08:37,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 3585 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:08:37,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:08:37,982 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 12:08:38,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:08:38,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-10-02 12:08:38,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:08:38,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:08:38,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:08:38,003 INFO L87 Difference]: Start difference. First operand 4862 states and 7302 transitions. Second operand 14 states. [2019-10-02 12:08:50,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:08:50,066 INFO L93 Difference]: Finished difference Result 15241 states and 23645 transitions. [2019-10-02 12:08:50,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-02 12:08:50,067 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 207 [2019-10-02 12:08:50,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:08:50,113 INFO L225 Difference]: With dead ends: 15241 [2019-10-02 12:08:50,113 INFO L226 Difference]: Without dead ends: 10488 [2019-10-02 12:08:50,130 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 232 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=181, Invalid=811, Unknown=0, NotChecked=0, Total=992 [2019-10-02 12:08:50,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10488 states. [2019-10-02 12:08:50,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10488 to 10286. [2019-10-02 12:08:50,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10286 states. [2019-10-02 12:08:50,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10286 states to 10286 states and 15608 transitions. [2019-10-02 12:08:50,677 INFO L78 Accepts]: Start accepts. Automaton has 10286 states and 15608 transitions. Word has length 207 [2019-10-02 12:08:50,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:08:50,677 INFO L475 AbstractCegarLoop]: Abstraction has 10286 states and 15608 transitions. [2019-10-02 12:08:50,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 12:08:50,677 INFO L276 IsEmpty]: Start isEmpty. Operand 10286 states and 15608 transitions. [2019-10-02 12:08:50,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-10-02 12:08:50,688 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:08:50,688 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:08:50,688 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:08:50,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:08:50,689 INFO L82 PathProgramCache]: Analyzing trace with hash 212723494, now seen corresponding path program 1 times [2019-10-02 12:08:50,689 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:08:50,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:08:50,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:50,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:08:50,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:50,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:08:51,541 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 12:08:51,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:08:51,541 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:08:51,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:08:52,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:08:52,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 3586 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:08:52,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:08:52,217 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-02 12:08:52,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:08:52,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-10-02 12:08:52,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:08:52,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:08:52,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:08:52,227 INFO L87 Difference]: Start difference. First operand 10286 states and 15608 transitions. Second operand 14 states. [2019-10-02 12:09:03,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:09:03,795 INFO L93 Difference]: Finished difference Result 25997 states and 40218 transitions. [2019-10-02 12:09:03,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 12:09:03,795 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 209 [2019-10-02 12:09:03,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:09:03,862 INFO L225 Difference]: With dead ends: 25997 [2019-10-02 12:09:03,862 INFO L226 Difference]: Without dead ends: 15829 [2019-10-02 12:09:03,894 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 230 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=196, Invalid=994, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 12:09:03,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15829 states. [2019-10-02 12:09:04,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15829 to 15309. [2019-10-02 12:09:04,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15309 states. [2019-10-02 12:09:04,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15309 states to 15309 states and 23261 transitions. [2019-10-02 12:09:04,948 INFO L78 Accepts]: Start accepts. Automaton has 15309 states and 23261 transitions. Word has length 209 [2019-10-02 12:09:04,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:09:04,949 INFO L475 AbstractCegarLoop]: Abstraction has 15309 states and 23261 transitions. [2019-10-02 12:09:04,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 12:09:04,949 INFO L276 IsEmpty]: Start isEmpty. Operand 15309 states and 23261 transitions. [2019-10-02 12:09:04,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-10-02 12:09:04,965 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:09:04,966 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:09:04,966 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:09:04,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:09:04,968 INFO L82 PathProgramCache]: Analyzing trace with hash 163362918, now seen corresponding path program 1 times [2019-10-02 12:09:04,968 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:09:04,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:09:04,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:09:04,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:09:04,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:09:05,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:09:05,145 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 12:09:05,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:09:05,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:09:05,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:09:05,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:09:05,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:09:05,147 INFO L87 Difference]: Start difference. First operand 15309 states and 23261 transitions. Second operand 9 states. [2019-10-02 12:09:05,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:09:05,612 INFO L93 Difference]: Finished difference Result 20088 states and 30448 transitions. [2019-10-02 12:09:05,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:09:05,613 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 217 [2019-10-02 12:09:05,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:09:05,638 INFO L225 Difference]: With dead ends: 20088 [2019-10-02 12:09:05,638 INFO L226 Difference]: Without dead ends: 4877 [2019-10-02 12:09:05,674 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:09:05,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4877 states. [2019-10-02 12:09:05,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4877 to 4877. [2019-10-02 12:09:05,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4877 states. [2019-10-02 12:09:05,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4877 states to 4877 states and 7290 transitions. [2019-10-02 12:09:05,946 INFO L78 Accepts]: Start accepts. Automaton has 4877 states and 7290 transitions. Word has length 217 [2019-10-02 12:09:05,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:09:05,947 INFO L475 AbstractCegarLoop]: Abstraction has 4877 states and 7290 transitions. [2019-10-02 12:09:05,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:09:05,947 INFO L276 IsEmpty]: Start isEmpty. Operand 4877 states and 7290 transitions. [2019-10-02 12:09:05,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-10-02 12:09:05,952 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:09:05,953 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 12:09:05,953 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:09:05,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:09:05,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1029783510, now seen corresponding path program 1 times [2019-10-02 12:09:05,954 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:09:05,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:09:05,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:09:05,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:09:05,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:09:06,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:09:06,165 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-10-02 12:09:06,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:09:06,165 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:09:06,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:09:06,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:09:06,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 3620 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 12:09:06,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:09:06,897 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:09:06,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:09:06,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2019-10-02 12:09:06,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:09:06,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:09:06,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:09:06,914 INFO L87 Difference]: Start difference. First operand 4877 states and 7290 transitions. Second operand 14 states. [2019-10-02 12:09:12,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:09:12,421 INFO L93 Difference]: Finished difference Result 10387 states and 15832 transitions. [2019-10-02 12:09:12,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 12:09:12,422 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 221 [2019-10-02 12:09:12,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:09:12,440 INFO L225 Difference]: With dead ends: 10387 [2019-10-02 12:09:12,440 INFO L226 Difference]: Without dead ends: 5617 [2019-10-02 12:09:12,452 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2019-10-02 12:09:12,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5617 states. [2019-10-02 12:09:12,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5617 to 5009. [2019-10-02 12:09:12,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5009 states. [2019-10-02 12:09:12,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5009 states to 5009 states and 7454 transitions. [2019-10-02 12:09:12,776 INFO L78 Accepts]: Start accepts. Automaton has 5009 states and 7454 transitions. Word has length 221 [2019-10-02 12:09:12,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:09:12,777 INFO L475 AbstractCegarLoop]: Abstraction has 5009 states and 7454 transitions. [2019-10-02 12:09:12,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 12:09:12,777 INFO L276 IsEmpty]: Start isEmpty. Operand 5009 states and 7454 transitions. [2019-10-02 12:09:12,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-10-02 12:09:12,782 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:09:12,783 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:09:12,784 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:09:12,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:09:12,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1937541648, now seen corresponding path program 1 times [2019-10-02 12:09:12,785 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:09:12,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:09:12,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:09:12,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:09:12,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:09:12,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:09:12,940 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 12:09:12,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:09:12,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:09:12,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:09:12,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:09:12,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:09:12,943 INFO L87 Difference]: Start difference. First operand 5009 states and 7454 transitions. Second operand 7 states. [2019-10-02 12:09:13,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:09:13,109 INFO L93 Difference]: Finished difference Result 10067 states and 15092 transitions. [2019-10-02 12:09:13,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:09:13,110 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 228 [2019-10-02 12:09:13,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:09:13,124 INFO L225 Difference]: With dead ends: 10067 [2019-10-02 12:09:13,124 INFO L226 Difference]: Without dead ends: 5173 [2019-10-02 12:09:13,133 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:09:13,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5173 states. [2019-10-02 12:09:13,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5173 to 5077. [2019-10-02 12:09:13,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5077 states. [2019-10-02 12:09:13,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5077 states to 5077 states and 7540 transitions. [2019-10-02 12:09:13,439 INFO L78 Accepts]: Start accepts. Automaton has 5077 states and 7540 transitions. Word has length 228 [2019-10-02 12:09:13,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:09:13,440 INFO L475 AbstractCegarLoop]: Abstraction has 5077 states and 7540 transitions. [2019-10-02 12:09:13,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:09:13,440 INFO L276 IsEmpty]: Start isEmpty. Operand 5077 states and 7540 transitions. [2019-10-02 12:09:13,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-10-02 12:09:13,448 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:09:13,449 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 12:09:13,449 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:09:13,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:09:13,450 INFO L82 PathProgramCache]: Analyzing trace with hash -770845329, now seen corresponding path program 1 times [2019-10-02 12:09:13,450 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:09:13,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:09:13,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:09:13,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:09:13,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:09:13,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:09:13,796 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 12:09:13,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:09:13,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:09:13,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:09:13,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:09:13,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:09:13,798 INFO L87 Difference]: Start difference. First operand 5077 states and 7540 transitions. Second operand 11 states. [2019-10-02 12:09:18,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:09:18,350 INFO L93 Difference]: Finished difference Result 10033 states and 15038 transitions. [2019-10-02 12:09:18,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:09:18,352 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 228 [2019-10-02 12:09:18,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:09:18,367 INFO L225 Difference]: With dead ends: 10033 [2019-10-02 12:09:18,367 INFO L226 Difference]: Without dead ends: 5071 [2019-10-02 12:09:18,377 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:09:18,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5071 states. [2019-10-02 12:09:18,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5071 to 4967. [2019-10-02 12:09:18,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4967 states. [2019-10-02 12:09:18,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4967 states to 4967 states and 7394 transitions. [2019-10-02 12:09:18,669 INFO L78 Accepts]: Start accepts. Automaton has 4967 states and 7394 transitions. Word has length 228 [2019-10-02 12:09:18,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:09:18,670 INFO L475 AbstractCegarLoop]: Abstraction has 4967 states and 7394 transitions. [2019-10-02 12:09:18,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:09:18,670 INFO L276 IsEmpty]: Start isEmpty. Operand 4967 states and 7394 transitions. [2019-10-02 12:09:18,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-02 12:09:18,675 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:09:18,676 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:09:18,676 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:09:18,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:09:18,676 INFO L82 PathProgramCache]: Analyzing trace with hash 240463957, now seen corresponding path program 1 times [2019-10-02 12:09:18,677 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:09:18,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:09:18,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:09:18,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:09:18,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:09:18,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:09:18,852 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 12:09:18,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:09:18,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:09:18,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:09:18,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:09:18,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:09:18,855 INFO L87 Difference]: Start difference. First operand 4967 states and 7394 transitions. Second operand 9 states. [2019-10-02 12:09:24,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:09:24,497 INFO L93 Difference]: Finished difference Result 16875 states and 25619 transitions. [2019-10-02 12:09:24,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 12:09:24,498 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 230 [2019-10-02 12:09:24,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:09:24,538 INFO L225 Difference]: With dead ends: 16875 [2019-10-02 12:09:24,539 INFO L226 Difference]: Without dead ends: 12011 [2019-10-02 12:09:24,554 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2019-10-02 12:09:24,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12011 states. [2019-10-02 12:09:25,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12011 to 11675. [2019-10-02 12:09:25,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11675 states. [2019-10-02 12:09:25,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11675 states to 11675 states and 17480 transitions. [2019-10-02 12:09:25,144 INFO L78 Accepts]: Start accepts. Automaton has 11675 states and 17480 transitions. Word has length 230 [2019-10-02 12:09:25,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:09:25,144 INFO L475 AbstractCegarLoop]: Abstraction has 11675 states and 17480 transitions. [2019-10-02 12:09:25,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:09:25,145 INFO L276 IsEmpty]: Start isEmpty. Operand 11675 states and 17480 transitions. [2019-10-02 12:09:25,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-10-02 12:09:25,151 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:09:25,152 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 12:09:25,152 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:09:25,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:09:25,152 INFO L82 PathProgramCache]: Analyzing trace with hash -511655229, now seen corresponding path program 1 times [2019-10-02 12:09:25,152 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:09:25,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:09:25,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:09:25,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:09:25,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:09:25,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:09:25,304 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 12:09:25,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:09:25,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:09:25,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:09:25,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:09:25,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:09:25,306 INFO L87 Difference]: Start difference. First operand 11675 states and 17480 transitions. Second operand 7 states. [2019-10-02 12:09:25,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:09:25,747 INFO L93 Difference]: Finished difference Result 23613 states and 35554 transitions. [2019-10-02 12:09:25,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:09:25,747 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 235 [2019-10-02 12:09:25,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:09:25,799 INFO L225 Difference]: With dead ends: 23613 [2019-10-02 12:09:25,800 INFO L226 Difference]: Without dead ends: 12053 [2019-10-02 12:09:25,828 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:09:25,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12053 states. [2019-10-02 12:09:26,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12053 to 11879. [2019-10-02 12:09:26,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11879 states. [2019-10-02 12:09:26,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11879 states to 11879 states and 17696 transitions. [2019-10-02 12:09:26,299 INFO L78 Accepts]: Start accepts. Automaton has 11879 states and 17696 transitions. Word has length 235 [2019-10-02 12:09:26,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:09:26,299 INFO L475 AbstractCegarLoop]: Abstraction has 11879 states and 17696 transitions. [2019-10-02 12:09:26,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:09:26,299 INFO L276 IsEmpty]: Start isEmpty. Operand 11879 states and 17696 transitions. [2019-10-02 12:09:26,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-10-02 12:09:26,306 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:09:26,306 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:09:26,306 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:09:26,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:09:26,307 INFO L82 PathProgramCache]: Analyzing trace with hash -125941927, now seen corresponding path program 1 times [2019-10-02 12:09:26,307 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:09:26,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:09:26,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:09:26,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:09:26,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:09:26,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:09:26,472 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 12:09:26,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:09:26,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:09:26,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:09:26,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:09:26,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:09:26,474 INFO L87 Difference]: Start difference. First operand 11879 states and 17696 transitions. Second operand 9 states. [2019-10-02 12:09:27,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:09:27,217 INFO L93 Difference]: Finished difference Result 25185 states and 38374 transitions. [2019-10-02 12:09:27,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:09:27,218 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 242 [2019-10-02 12:09:27,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:09:27,266 INFO L225 Difference]: With dead ends: 25185 [2019-10-02 12:09:27,266 INFO L226 Difference]: Without dead ends: 11879 [2019-10-02 12:09:27,294 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:09:27,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11879 states. [2019-10-02 12:09:27,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11879 to 11879. [2019-10-02 12:09:27,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11879 states. [2019-10-02 12:09:27,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11879 states to 11879 states and 17444 transitions. [2019-10-02 12:09:27,726 INFO L78 Accepts]: Start accepts. Automaton has 11879 states and 17444 transitions. Word has length 242 [2019-10-02 12:09:27,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:09:27,726 INFO L475 AbstractCegarLoop]: Abstraction has 11879 states and 17444 transitions. [2019-10-02 12:09:27,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:09:27,726 INFO L276 IsEmpty]: Start isEmpty. Operand 11879 states and 17444 transitions. [2019-10-02 12:09:27,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-10-02 12:09:27,732 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:09:27,732 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:09:27,732 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:09:27,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:09:27,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1493460098, now seen corresponding path program 1 times [2019-10-02 12:09:27,733 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:09:27,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:09:27,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:09:27,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:09:27,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:09:27,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:09:27,908 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-10-02 12:09:27,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:09:27,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:09:27,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:09:27,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:09:27,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:09:27,910 INFO L87 Difference]: Start difference. First operand 11879 states and 17444 transitions. Second operand 7 states. [2019-10-02 12:09:32,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:09:32,554 INFO L93 Difference]: Finished difference Result 24655 states and 36582 transitions. [2019-10-02 12:09:32,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 12:09:32,555 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 247 [2019-10-02 12:09:32,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:09:32,592 INFO L225 Difference]: With dead ends: 24655 [2019-10-02 12:09:32,592 INFO L226 Difference]: Without dead ends: 12895 [2019-10-02 12:09:32,613 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:09:32,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12895 states. [2019-10-02 12:09:33,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12895 to 12509. [2019-10-02 12:09:33,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12509 states. [2019-10-02 12:09:33,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12509 states to 12509 states and 18322 transitions. [2019-10-02 12:09:33,062 INFO L78 Accepts]: Start accepts. Automaton has 12509 states and 18322 transitions. Word has length 247 [2019-10-02 12:09:33,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:09:33,062 INFO L475 AbstractCegarLoop]: Abstraction has 12509 states and 18322 transitions. [2019-10-02 12:09:33,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:09:33,062 INFO L276 IsEmpty]: Start isEmpty. Operand 12509 states and 18322 transitions. [2019-10-02 12:09:33,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-10-02 12:09:33,068 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:09:33,068 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:09:33,069 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:09:33,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:09:33,069 INFO L82 PathProgramCache]: Analyzing trace with hash 524084125, now seen corresponding path program 1 times [2019-10-02 12:09:33,069 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:09:33,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:09:33,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:09:33,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:09:33,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:09:33,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:09:33,213 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-10-02 12:09:33,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:09:33,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:09:33,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:09:33,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:09:33,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:09:33,216 INFO L87 Difference]: Start difference. First operand 12509 states and 18322 transitions. Second operand 6 states. [2019-10-02 12:09:34,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:09:34,011 INFO L93 Difference]: Finished difference Result 31325 states and 46540 transitions. [2019-10-02 12:09:34,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:09:34,011 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 252 [2019-10-02 12:09:34,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:09:34,059 INFO L225 Difference]: With dead ends: 31325 [2019-10-02 12:09:34,059 INFO L226 Difference]: Without dead ends: 18935 [2019-10-02 12:09:34,080 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:09:34,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18935 states. [2019-10-02 12:09:34,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18935 to 15193. [2019-10-02 12:09:34,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15193 states. [2019-10-02 12:09:34,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15193 states to 15193 states and 22453 transitions. [2019-10-02 12:09:34,630 INFO L78 Accepts]: Start accepts. Automaton has 15193 states and 22453 transitions. Word has length 252 [2019-10-02 12:09:34,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:09:34,630 INFO L475 AbstractCegarLoop]: Abstraction has 15193 states and 22453 transitions. [2019-10-02 12:09:34,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:09:34,630 INFO L276 IsEmpty]: Start isEmpty. Operand 15193 states and 22453 transitions. [2019-10-02 12:09:34,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-10-02 12:09:34,635 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:09:34,636 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:09:34,636 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:09:34,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:09:34,636 INFO L82 PathProgramCache]: Analyzing trace with hash -847723173, now seen corresponding path program 1 times [2019-10-02 12:09:34,636 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:09:34,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:09:34,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:09:34,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:09:34,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:09:34,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:09:34,804 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-10-02 12:09:34,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:09:34,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:09:34,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:09:34,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:09:34,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:09:34,806 INFO L87 Difference]: Start difference. First operand 15193 states and 22453 transitions. Second operand 9 states. [2019-10-02 12:09:35,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:09:35,838 INFO L93 Difference]: Finished difference Result 16311 states and 24009 transitions. [2019-10-02 12:09:35,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:09:35,838 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 252 [2019-10-02 12:09:35,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:09:35,885 INFO L225 Difference]: With dead ends: 16311 [2019-10-02 12:09:35,885 INFO L226 Difference]: Without dead ends: 16295 [2019-10-02 12:09:35,894 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:09:35,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16295 states. [2019-10-02 12:09:36,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16295 to 15997. [2019-10-02 12:09:36,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15997 states. [2019-10-02 12:09:36,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15997 states to 15997 states and 23567 transitions. [2019-10-02 12:09:36,642 INFO L78 Accepts]: Start accepts. Automaton has 15997 states and 23567 transitions. Word has length 252 [2019-10-02 12:09:36,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:09:36,643 INFO L475 AbstractCegarLoop]: Abstraction has 15997 states and 23567 transitions. [2019-10-02 12:09:36,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:09:36,643 INFO L276 IsEmpty]: Start isEmpty. Operand 15997 states and 23567 transitions. [2019-10-02 12:09:36,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-10-02 12:09:36,647 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:09:36,647 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:09:36,648 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:09:36,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:09:36,648 INFO L82 PathProgramCache]: Analyzing trace with hash -410915698, now seen corresponding path program 1 times [2019-10-02 12:09:36,648 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:09:36,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:09:36,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:09:36,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:09:36,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:09:36,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:09:36,832 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-10-02 12:09:36,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:09:36,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:09:36,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:09:36,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:09:36,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:09:36,833 INFO L87 Difference]: Start difference. First operand 15997 states and 23567 transitions. Second operand 9 states. [2019-10-02 12:09:40,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:09:40,630 INFO L93 Difference]: Finished difference Result 32323 states and 47698 transitions. [2019-10-02 12:09:40,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:09:40,630 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 270 [2019-10-02 12:09:40,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:09:40,680 INFO L225 Difference]: With dead ends: 32323 [2019-10-02 12:09:40,680 INFO L226 Difference]: Without dead ends: 16449 [2019-10-02 12:09:40,711 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:09:40,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16449 states. [2019-10-02 12:09:41,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16449 to 16157. [2019-10-02 12:09:41,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16157 states. [2019-10-02 12:09:41,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16157 states to 16157 states and 23751 transitions. [2019-10-02 12:09:41,501 INFO L78 Accepts]: Start accepts. Automaton has 16157 states and 23751 transitions. Word has length 270 [2019-10-02 12:09:41,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:09:41,502 INFO L475 AbstractCegarLoop]: Abstraction has 16157 states and 23751 transitions. [2019-10-02 12:09:41,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:09:41,502 INFO L276 IsEmpty]: Start isEmpty. Operand 16157 states and 23751 transitions. [2019-10-02 12:09:41,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-10-02 12:09:41,505 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:09:41,506 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:09:41,506 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:09:41,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:09:41,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1866454596, now seen corresponding path program 1 times [2019-10-02 12:09:41,506 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:09:41,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:09:41,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:09:41,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:09:41,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:09:41,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:09:41,690 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-10-02 12:09:41,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:09:41,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:09:41,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:09:41,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:09:41,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:09:41,693 INFO L87 Difference]: Start difference. First operand 16157 states and 23751 transitions. Second operand 6 states. [2019-10-02 12:09:46,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:09:46,620 INFO L93 Difference]: Finished difference Result 42033 states and 63962 transitions. [2019-10-02 12:09:46,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:09:46,620 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 271 [2019-10-02 12:09:46,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:09:46,694 INFO L225 Difference]: With dead ends: 42033 [2019-10-02 12:09:46,694 INFO L226 Difference]: Without dead ends: 25999 [2019-10-02 12:09:46,722 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:09:46,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25999 states. [2019-10-02 12:09:47,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25999 to 24778. [2019-10-02 12:09:47,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24778 states. [2019-10-02 12:09:47,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24778 states to 24778 states and 36582 transitions. [2019-10-02 12:09:47,712 INFO L78 Accepts]: Start accepts. Automaton has 24778 states and 36582 transitions. Word has length 271 [2019-10-02 12:09:47,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:09:47,712 INFO L475 AbstractCegarLoop]: Abstraction has 24778 states and 36582 transitions. [2019-10-02 12:09:47,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:09:47,712 INFO L276 IsEmpty]: Start isEmpty. Operand 24778 states and 36582 transitions. [2019-10-02 12:09:47,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-10-02 12:09:47,717 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:09:47,717 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:09:47,717 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:09:47,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:09:47,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1849666896, now seen corresponding path program 1 times [2019-10-02 12:09:47,718 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:09:47,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:09:47,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:09:47,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:09:47,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:09:47,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:09:47,875 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-10-02 12:09:47,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:09:47,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:09:47,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:09:47,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:09:47,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:09:47,877 INFO L87 Difference]: Start difference. First operand 24778 states and 36582 transitions. Second operand 4 states. [2019-10-02 12:09:50,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:09:50,378 INFO L93 Difference]: Finished difference Result 49533 states and 74277 transitions. [2019-10-02 12:09:50,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:09:50,379 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 273 [2019-10-02 12:09:50,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:09:50,464 INFO L225 Difference]: With dead ends: 49533 [2019-10-02 12:09:50,464 INFO L226 Difference]: Without dead ends: 24254 [2019-10-02 12:09:50,511 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:09:50,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24254 states. [2019-10-02 12:09:51,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24254 to 24236. [2019-10-02 12:09:51,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24236 states. [2019-10-02 12:09:51,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24236 states to 24236 states and 35579 transitions. [2019-10-02 12:09:51,470 INFO L78 Accepts]: Start accepts. Automaton has 24236 states and 35579 transitions. Word has length 273 [2019-10-02 12:09:51,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:09:51,470 INFO L475 AbstractCegarLoop]: Abstraction has 24236 states and 35579 transitions. [2019-10-02 12:09:51,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:09:51,470 INFO L276 IsEmpty]: Start isEmpty. Operand 24236 states and 35579 transitions. [2019-10-02 12:09:51,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-10-02 12:09:51,475 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:09:51,475 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 12:09:51,475 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:09:51,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:09:51,476 INFO L82 PathProgramCache]: Analyzing trace with hash -374764369, now seen corresponding path program 1 times [2019-10-02 12:09:51,476 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:09:51,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:09:51,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:09:51,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:09:51,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:09:51,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:09:51,709 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-10-02 12:09:51,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:09:51,709 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:09:51,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:09:52,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:09:52,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 3784 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 12:09:52,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:09:52,680 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-02 12:09:52,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:09:52,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2019-10-02 12:09:52,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:09:52,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:09:52,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:09:52,689 INFO L87 Difference]: Start difference. First operand 24236 states and 35579 transitions. Second operand 8 states. [2019-10-02 12:09:54,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:09:54,213 INFO L93 Difference]: Finished difference Result 48451 states and 73213 transitions. [2019-10-02 12:09:54,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:09:54,213 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 279 [2019-10-02 12:09:54,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:09:54,290 INFO L225 Difference]: With dead ends: 48451 [2019-10-02 12:09:54,290 INFO L226 Difference]: Without dead ends: 24236 [2019-10-02 12:09:54,339 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 277 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:09:54,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24236 states. [2019-10-02 12:09:55,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24236 to 24224. [2019-10-02 12:09:55,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24224 states. [2019-10-02 12:09:55,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24224 states to 24224 states and 35328 transitions. [2019-10-02 12:09:55,335 INFO L78 Accepts]: Start accepts. Automaton has 24224 states and 35328 transitions. Word has length 279 [2019-10-02 12:09:55,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:09:55,335 INFO L475 AbstractCegarLoop]: Abstraction has 24224 states and 35328 transitions. [2019-10-02 12:09:55,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:09:55,335 INFO L276 IsEmpty]: Start isEmpty. Operand 24224 states and 35328 transitions. [2019-10-02 12:09:55,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-10-02 12:09:55,341 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:09:55,341 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 12:09:55,341 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:09:55,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:09:55,341 INFO L82 PathProgramCache]: Analyzing trace with hash -304808015, now seen corresponding path program 1 times [2019-10-02 12:09:55,341 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:09:55,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:09:55,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:09:55,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:09:55,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:09:55,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:09:55,884 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-10-02 12:09:55,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:09:55,884 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:09:56,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:09:56,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:09:56,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 3786 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-02 12:09:56,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:09:56,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 12:09:56,658 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 50 proven. 5 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-02 12:09:56,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:09:56,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 17 [2019-10-02 12:09:56,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 12:09:56,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 12:09:56,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:09:56,669 INFO L87 Difference]: Start difference. First operand 24224 states and 35328 transitions. Second operand 17 states. [2019-10-02 12:10:10,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:10:10,261 INFO L93 Difference]: Finished difference Result 78963 states and 117816 transitions. [2019-10-02 12:10:10,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-02 12:10:10,261 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 279 [2019-10-02 12:10:10,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:10:10,454 INFO L225 Difference]: With dead ends: 78963 [2019-10-02 12:10:10,454 INFO L226 Difference]: Without dead ends: 54544 [2019-10-02 12:10:10,517 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 884 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=495, Invalid=2367, Unknown=0, NotChecked=0, Total=2862 [2019-10-02 12:10:10,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54544 states. [2019-10-02 12:10:13,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54544 to 53694. [2019-10-02 12:10:13,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53694 states. [2019-10-02 12:10:13,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53694 states to 53694 states and 77951 transitions. [2019-10-02 12:10:13,193 INFO L78 Accepts]: Start accepts. Automaton has 53694 states and 77951 transitions. Word has length 279 [2019-10-02 12:10:13,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:10:13,194 INFO L475 AbstractCegarLoop]: Abstraction has 53694 states and 77951 transitions. [2019-10-02 12:10:13,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 12:10:13,194 INFO L276 IsEmpty]: Start isEmpty. Operand 53694 states and 77951 transitions. [2019-10-02 12:10:13,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-10-02 12:10:13,199 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:10:13,200 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 12:10:13,200 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:10:13,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:10:13,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1865285869, now seen corresponding path program 1 times [2019-10-02 12:10:13,200 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:10:13,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:10:13,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:13,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:13,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:13,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:13,402 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-02 12:10:13,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:10:13,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 12:10:13,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 12:10:13,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 12:10:13,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:10:13,403 INFO L87 Difference]: Start difference. First operand 53694 states and 77951 transitions. Second operand 10 states. [2019-10-02 12:10:15,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:10:15,593 INFO L93 Difference]: Finished difference Result 54294 states and 78636 transitions. [2019-10-02 12:10:15,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:10:15,593 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 279 [2019-10-02 12:10:15,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:10:15,823 INFO L225 Difference]: With dead ends: 54294 [2019-10-02 12:10:15,823 INFO L226 Difference]: Without dead ends: 54278 [2019-10-02 12:10:15,861 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:10:15,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54278 states. [2019-10-02 12:10:18,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54278 to 54253. [2019-10-02 12:10:18,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54253 states. [2019-10-02 12:10:18,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54253 states to 54253 states and 78469 transitions. [2019-10-02 12:10:18,537 INFO L78 Accepts]: Start accepts. Automaton has 54253 states and 78469 transitions. Word has length 279 [2019-10-02 12:10:18,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:10:18,537 INFO L475 AbstractCegarLoop]: Abstraction has 54253 states and 78469 transitions. [2019-10-02 12:10:18,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 12:10:18,537 INFO L276 IsEmpty]: Start isEmpty. Operand 54253 states and 78469 transitions. [2019-10-02 12:10:18,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2019-10-02 12:10:18,542 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:10:18,543 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 6, 6, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 12:10:18,543 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:10:18,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:10:18,544 INFO L82 PathProgramCache]: Analyzing trace with hash 539710598, now seen corresponding path program 1 times [2019-10-02 12:10:18,544 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:10:18,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:10:18,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:18,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:18,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:18,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:19,251 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 4 proven. 45 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2019-10-02 12:10:19,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:10:19,251 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:10:19,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:20,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:20,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 5365 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-02 12:10:20,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:10:20,286 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 4 proven. 273 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2019-10-02 12:10:20,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:10:20,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-10-02 12:10:20,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 12:10:20,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 12:10:20,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:10:20,296 INFO L87 Difference]: Start difference. First operand 54253 states and 78469 transitions. Second operand 15 states. [2019-10-02 12:10:44,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:10:44,421 INFO L93 Difference]: Finished difference Result 220922 states and 337995 transitions. [2019-10-02 12:10:44,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-10-02 12:10:44,422 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 457 [2019-10-02 12:10:44,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:10:45,142 INFO L225 Difference]: With dead ends: 220922 [2019-10-02 12:10:45,143 INFO L226 Difference]: Without dead ends: 164573 [2019-10-02 12:10:45,309 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 488 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 842 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=569, Invalid=2293, Unknown=0, NotChecked=0, Total=2862 [2019-10-02 12:10:45,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164573 states. [2019-10-02 12:10:57,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164573 to 161998. [2019-10-02 12:10:57,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161998 states. [2019-10-02 12:10:58,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161998 states to 161998 states and 240441 transitions. [2019-10-02 12:10:58,529 INFO L78 Accepts]: Start accepts. Automaton has 161998 states and 240441 transitions. Word has length 457 [2019-10-02 12:10:58,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:10:58,529 INFO L475 AbstractCegarLoop]: Abstraction has 161998 states and 240441 transitions. [2019-10-02 12:10:58,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 12:10:58,530 INFO L276 IsEmpty]: Start isEmpty. Operand 161998 states and 240441 transitions. [2019-10-02 12:10:58,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2019-10-02 12:10:58,535 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:10:58,536 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 12:10:58,536 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:10:58,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:10:58,536 INFO L82 PathProgramCache]: Analyzing trace with hash -469542543, now seen corresponding path program 1 times [2019-10-02 12:10:58,537 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:10:58,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:10:58,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:58,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:58,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:58,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:59,587 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2019-10-02 12:10:59,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:10:59,588 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:10:59,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:11:00,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:11:00,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 4829 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:11:00,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:11:00,471 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-10-02 12:11:00,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:11:00,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2019-10-02 12:11:00,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:11:00,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:11:00,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:11:00,480 INFO L87 Difference]: Start difference. First operand 161998 states and 240441 transitions. Second operand 11 states. [2019-10-02 12:11:22,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:11:22,403 INFO L93 Difference]: Finished difference Result 336673 states and 518041 transitions. [2019-10-02 12:11:22,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-02 12:11:22,404 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 422 [2019-10-02 12:11:22,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:11:23,223 INFO L225 Difference]: With dead ends: 336673 [2019-10-02 12:11:23,223 INFO L226 Difference]: Without dead ends: 174786 [2019-10-02 12:11:23,557 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 438 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2019-10-02 12:11:23,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174786 states. [2019-10-02 12:11:31,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174786 to 169165. [2019-10-02 12:11:31,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169165 states. [2019-10-02 12:11:39,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169165 states to 169165 states and 252402 transitions. [2019-10-02 12:11:39,187 INFO L78 Accepts]: Start accepts. Automaton has 169165 states and 252402 transitions. Word has length 422 [2019-10-02 12:11:39,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:11:39,187 INFO L475 AbstractCegarLoop]: Abstraction has 169165 states and 252402 transitions. [2019-10-02 12:11:39,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:11:39,188 INFO L276 IsEmpty]: Start isEmpty. Operand 169165 states and 252402 transitions. [2019-10-02 12:11:39,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2019-10-02 12:11:39,192 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:11:39,193 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 12:11:39,193 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:11:39,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:11:39,193 INFO L82 PathProgramCache]: Analyzing trace with hash 2123208525, now seen corresponding path program 1 times [2019-10-02 12:11:39,193 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:11:39,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:11:39,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:11:39,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:11:39,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:11:39,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:11:39,422 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-10-02 12:11:39,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:11:39,423 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:11:39,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:11:40,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:11:40,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 4835 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:11:40,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:11:40,288 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2019-10-02 12:11:40,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:11:40,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2019-10-02 12:11:40,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:11:40,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:11:40,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:11:40,299 INFO L87 Difference]: Start difference. First operand 169165 states and 252402 transitions. Second operand 9 states. [2019-10-02 12:11:52,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:11:52,503 INFO L93 Difference]: Finished difference Result 343718 states and 521470 transitions. [2019-10-02 12:11:52,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:11:52,504 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 427 [2019-10-02 12:11:52,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:11:53,191 INFO L225 Difference]: With dead ends: 343718 [2019-10-02 12:11:53,191 INFO L226 Difference]: Without dead ends: 174664 [2019-10-02 12:11:53,531 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 427 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:11:53,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174664 states. [2019-10-02 12:12:02,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174664 to 174664. [2019-10-02 12:12:02,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174664 states. [2019-10-02 12:12:03,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174664 states to 174664 states and 262278 transitions. [2019-10-02 12:12:03,599 INFO L78 Accepts]: Start accepts. Automaton has 174664 states and 262278 transitions. Word has length 427 [2019-10-02 12:12:03,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:12:03,599 INFO L475 AbstractCegarLoop]: Abstraction has 174664 states and 262278 transitions. [2019-10-02 12:12:03,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:12:03,599 INFO L276 IsEmpty]: Start isEmpty. Operand 174664 states and 262278 transitions. [2019-10-02 12:12:03,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-10-02 12:12:03,603 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:12:03,603 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 7, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:03,604 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:12:03,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:12:03,604 INFO L82 PathProgramCache]: Analyzing trace with hash -2060570797, now seen corresponding path program 1 times [2019-10-02 12:12:03,604 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:12:03,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:12:03,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:12:03,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:12:03,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:12:03,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:12:03,834 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-10-02 12:12:03,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:12:03,834 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:12:08,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:12:09,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:12:09,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 3867 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-02 12:12:09,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:12:09,268 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 108 proven. 10 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-10-02 12:12:09,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:12:09,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2019-10-02 12:12:09,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 12:12:09,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 12:12:09,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-10-02 12:12:09,277 INFO L87 Difference]: Start difference. First operand 174664 states and 262278 transitions. Second operand 19 states. [2019-10-02 12:12:36,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:12:36,324 INFO L93 Difference]: Finished difference Result 527528 states and 799973 transitions. [2019-10-02 12:12:36,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 12:12:36,324 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 313 [2019-10-02 12:12:36,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:12:38,562 INFO L225 Difference]: With dead ends: 527528 [2019-10-02 12:12:38,562 INFO L226 Difference]: Without dead ends: 352577 [2019-10-02 12:12:38,895 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=777, Unknown=0, NotChecked=0, Total=930 [2019-10-02 12:12:39,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352577 states. [2019-10-02 12:13:08,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352577 to 351162. [2019-10-02 12:13:08,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351162 states. [2019-10-02 12:13:10,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351162 states to 351162 states and 533798 transitions. [2019-10-02 12:13:10,563 INFO L78 Accepts]: Start accepts. Automaton has 351162 states and 533798 transitions. Word has length 313 [2019-10-02 12:13:10,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:13:10,564 INFO L475 AbstractCegarLoop]: Abstraction has 351162 states and 533798 transitions. [2019-10-02 12:13:10,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 12:13:10,564 INFO L276 IsEmpty]: Start isEmpty. Operand 351162 states and 533798 transitions. [2019-10-02 12:13:10,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2019-10-02 12:13:10,569 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:13:10,570 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 10, 8, 8, 6, 6, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 12:13:10,570 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:13:10,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:13:10,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1772015442, now seen corresponding path program 1 times [2019-10-02 12:13:10,570 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:13:10,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:13:10,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:10,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:10,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:10,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:10,840 INFO L134 CoverageAnalysis]: Checked inductivity of 608 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2019-10-02 12:13:10,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:13:10,840 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:13:10,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:11,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:11,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 5617 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 12:13:11,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:13:11,828 INFO L134 CoverageAnalysis]: Checked inductivity of 608 backedges. 287 proven. 0 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2019-10-02 12:13:11,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:13:11,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-10-02 12:13:11,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:13:11,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:13:11,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:13:11,838 INFO L87 Difference]: Start difference. First operand 351162 states and 533798 transitions. Second operand 9 states. [2019-10-02 12:14:40,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:14:40,048 INFO L93 Difference]: Finished difference Result 1308410 states and 2123699 transitions. [2019-10-02 12:14:40,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 12:14:40,048 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 523 [2019-10-02 12:14:40,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:14:46,202 INFO L225 Difference]: With dead ends: 1308410 [2019-10-02 12:14:46,203 INFO L226 Difference]: Without dead ends: 953293 [2019-10-02 12:14:47,201 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 571 GetRequests, 545 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=538, Unknown=0, NotChecked=0, Total=702 [2019-10-02 12:14:47,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953293 states. [2019-10-02 12:16:27,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953293 to 937900. [2019-10-02 12:16:27,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 937900 states.