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_spec13_product31.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 11:49:33,810 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 11:49:33,812 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 11:49:33,824 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 11:49:33,825 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 11:49:33,826 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 11:49:33,827 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 11:49:33,830 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 11:49:33,841 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 11:49:33,842 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 11:49:33,843 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 11:49:33,844 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 11:49:33,844 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 11:49:33,845 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 11:49:33,846 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 11:49:33,847 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 11:49:33,848 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 11:49:33,849 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 11:49:33,851 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 11:49:33,853 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 11:49:33,854 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 11:49:33,855 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 11:49:33,856 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 11:49:33,857 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 11:49:33,859 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 11:49:33,860 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 11:49:33,860 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 11:49:33,861 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 11:49:33,861 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 11:49:33,862 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 11:49:33,862 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 11:49:33,863 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 11:49:33,864 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 11:49:33,865 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 11:49:33,866 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 11:49:33,866 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 11:49:33,867 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 11:49:33,867 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 11:49:33,867 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 11:49:33,868 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 11:49:33,869 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 11:49:33,869 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 11:49:33,884 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 11:49:33,885 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 11:49:33,886 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 11:49:33,886 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 11:49:33,886 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 11:49:33,887 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 11:49:33,887 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 11:49:33,887 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 11:49:33,887 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 11:49:33,888 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 11:49:33,888 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 11:49:33,888 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 11:49:33,889 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 11:49:33,889 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 11:49:33,889 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 11:49:33,889 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 11:49:33,889 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 11:49:33,890 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 11:49:33,890 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 11:49:33,890 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 11:49:33,891 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 11:49:33,891 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:49:33,892 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 11:49:33,892 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 11:49:33,893 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 11:49:33,893 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 11:49:33,893 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 11:49:33,893 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 11:49:33,893 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 11:49:33,923 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 11:49:33,936 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 11:49:33,940 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 11:49:33,941 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 11:49:33,942 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 11:49:33,942 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec13_product31.cil.c [2019-10-02 11:49:34,002 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7efc20af/ae223504a4c9465194cfbc697e8a68d9/FLAG6d13e8cf7 [2019-10-02 11:49:34,672 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 11:49:34,674 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec13_product31.cil.c [2019-10-02 11:49:34,707 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7efc20af/ae223504a4c9465194cfbc697e8a68d9/FLAG6d13e8cf7 [2019-10-02 11:49:34,858 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7efc20af/ae223504a4c9465194cfbc697e8a68d9 [2019-10-02 11:49:34,869 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 11:49:34,871 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 11:49:34,872 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 11:49:34,872 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 11:49:34,875 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 11:49:34,876 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:49:34" (1/1) ... [2019-10-02 11:49:34,878 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14543c48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:49:34, skipping insertion in model container [2019-10-02 11:49:34,879 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:49:34" (1/1) ... [2019-10-02 11:49:34,885 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 11:49:34,971 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 11:49:35,652 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:49:35,669 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 11:49:35,848 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:49:35,932 INFO L192 MainTranslator]: Completed translation [2019-10-02 11:49:35,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:49:35 WrapperNode [2019-10-02 11:49:35,933 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 11:49:35,934 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 11:49:35,934 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 11:49:35,934 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 11:49:35,945 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:49:35" (1/1) ... [2019-10-02 11:49:35,945 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:49:35" (1/1) ... [2019-10-02 11:49:35,980 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:49:35" (1/1) ... [2019-10-02 11:49:35,980 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:49:35" (1/1) ... [2019-10-02 11:49:36,073 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:49:35" (1/1) ... [2019-10-02 11:49:36,099 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:49:35" (1/1) ... [2019-10-02 11:49:36,111 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:49:35" (1/1) ... [2019-10-02 11:49:36,131 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 11:49:36,132 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 11:49:36,132 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 11:49:36,132 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 11:49:36,133 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:49:35" (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 11:49:36,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 11:49:36,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 11:49:36,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 11:49:36,224 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 11:49:36,225 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 11:49:36,225 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 11:49:36,225 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 11:49:36,226 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 11:49:36,226 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 11:49:36,226 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 11:49:36,227 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification13_spec__1 [2019-10-02 11:49:36,227 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification13_spec__2 [2019-10-02 11:49:36,228 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-02 11:49:36,228 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-02 11:49:36,229 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-02 11:49:36,230 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-02 11:49:36,232 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-02 11:49:36,232 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-02 11:49:36,232 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-02 11:49:36,233 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-02 11:49:36,233 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-02 11:49:36,234 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-02 11:49:36,234 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-02 11:49:36,234 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-02 11:49:36,234 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-02 11:49:36,235 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-02 11:49:36,235 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-02 11:49:36,235 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-02 11:49:36,235 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-02 11:49:36,235 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-02 11:49:36,236 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-02 11:49:36,236 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-02 11:49:36,236 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-02 11:49:36,236 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-02 11:49:36,236 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-02 11:49:36,237 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-02 11:49:36,237 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-02 11:49:36,237 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 11:49:36,237 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-02 11:49:36,237 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 11:49:36,238 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 11:49:36,238 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 11:49:36,239 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 11:49:36,239 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 11:49:36,239 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 11:49:36,239 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-02 11:49:36,239 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-02 11:49:36,240 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-02 11:49:36,240 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-02 11:49:36,240 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-02 11:49:36,241 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-02 11:49:36,241 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-10-02 11:49:36,241 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-02 11:49:36,241 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-02 11:49:36,242 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-02 11:49:36,242 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-02 11:49:36,242 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-02 11:49:36,242 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-02 11:49:36,242 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-02 11:49:36,243 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-02 11:49:36,243 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-02 11:49:36,243 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-02 11:49:36,243 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-10-02 11:49:36,244 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-02 11:49:36,244 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-02 11:49:36,244 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-02 11:49:36,245 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-02 11:49:36,245 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-02 11:49:36,246 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-02 11:49:36,246 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-02 11:49:36,246 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-02 11:49:36,247 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-02 11:49:36,247 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-02 11:49:36,247 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-02 11:49:36,248 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-02 11:49:36,248 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-02 11:49:36,248 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-02 11:49:36,249 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-02 11:49:36,249 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-02 11:49:36,249 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 11:49:36,249 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 11:49:36,249 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 11:49:36,250 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 11:49:36,251 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 11:49:36,251 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 11:49:36,251 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 11:49:36,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 11:49:36,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 11:49:36,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 11:49:36,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 11:49:36,253 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 11:49:36,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 11:49:36,254 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 11:49:36,254 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 11:49:36,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 11:49:36,254 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 11:49:36,254 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 11:49:36,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 11:49:36,255 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 11:49:36,255 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-02 11:49:36,255 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification13_spec__1 [2019-10-02 11:49:36,255 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-02 11:49:36,255 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification13_spec__2 [2019-10-02 11:49:36,256 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-02 11:49:36,256 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-02 11:49:36,256 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-02 11:49:36,256 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-02 11:49:36,256 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-02 11:49:36,257 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-02 11:49:36,257 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-02 11:49:36,257 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-02 11:49:36,257 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-02 11:49:36,258 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-02 11:49:36,258 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-02 11:49:36,258 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 11:49:36,259 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-02 11:49:36,259 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-02 11:49:36,259 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-02 11:49:36,259 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-02 11:49:36,259 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-02 11:49:36,260 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-02 11:49:36,260 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-02 11:49:36,261 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-02 11:49:36,261 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-02 11:49:36,262 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-02 11:49:36,263 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-02 11:49:36,263 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-02 11:49:36,263 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-02 11:49:36,263 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-02 11:49:36,264 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-02 11:49:36,264 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-02 11:49:36,264 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-02 11:49:36,265 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-02 11:49:36,265 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-02 11:49:36,265 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 11:49:36,265 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 11:49:36,265 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-02 11:49:36,265 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 11:49:36,266 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 11:49:36,266 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 11:49:36,270 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 11:49:36,271 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 11:49:36,271 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 11:49:36,272 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-02 11:49:36,279 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-02 11:49:36,279 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-02 11:49:36,279 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-02 11:49:36,280 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-02 11:49:36,280 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-02 11:49:36,280 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-02 11:49:36,280 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-02 11:49:36,280 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-02 11:49:36,280 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-02 11:49:36,281 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-02 11:49:36,281 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-10-02 11:49:36,281 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-02 11:49:36,281 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-02 11:49:36,282 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-02 11:49:36,282 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-02 11:49:36,283 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-10-02 11:49:36,283 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-02 11:49:36,283 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-02 11:49:36,283 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-02 11:49:36,283 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-02 11:49:36,283 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-02 11:49:36,283 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-02 11:49:36,284 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-02 11:49:36,284 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-02 11:49:36,284 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-02 11:49:36,284 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-02 11:49:36,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 11:49:36,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 11:49:36,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 11:49:38,694 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 11:49:38,694 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-02 11:49:38,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:49:38 BoogieIcfgContainer [2019-10-02 11:49:38,697 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 11:49:38,698 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 11:49:38,698 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 11:49:38,702 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 11:49:38,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 11:49:34" (1/3) ... [2019-10-02 11:49:38,703 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d31304d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:49:38, skipping insertion in model container [2019-10-02 11:49:38,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:49:35" (2/3) ... [2019-10-02 11:49:38,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d31304d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:49:38, skipping insertion in model container [2019-10-02 11:49:38,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:49:38" (3/3) ... [2019-10-02 11:49:38,706 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec13_product31.cil.c [2019-10-02 11:49:38,717 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 11:49:38,735 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 11:49:38,753 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 11:49:38,794 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 11:49:38,795 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 11:49:38,796 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 11:49:38,796 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 11:49:38,796 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 11:49:38,796 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 11:49:38,796 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 11:49:38,796 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 11:49:38,796 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 11:49:38,838 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states. [2019-10-02 11:49:38,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-02 11:49:38,869 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:49:38,870 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:49:38,873 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:49:38,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:49:38,879 INFO L82 PathProgramCache]: Analyzing trace with hash -2055588152, now seen corresponding path program 1 times [2019-10-02 11:49:38,883 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:49:38,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:49:38,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:38,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:49:38,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:39,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:49:39,654 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 11:49:39,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:49:39,656 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 11:49:39,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:49:40,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:49:40,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 3003 conjuncts, 1 conjunts are in the unsatisfiable core [2019-10-02 11:49:40,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:49:40,470 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:49:40,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:49:40,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 7 [2019-10-02 11:49:40,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:49:40,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:49:40,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:49:40,504 INFO L87 Difference]: Start difference. First operand 832 states. Second operand 7 states. [2019-10-02 11:49:40,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:49:40,931 INFO L93 Difference]: Finished difference Result 1374 states and 2210 transitions. [2019-10-02 11:49:40,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:49:40,934 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 161 [2019-10-02 11:49:40,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:49:40,981 INFO L225 Difference]: With dead ends: 1374 [2019-10-02 11:49:40,982 INFO L226 Difference]: Without dead ends: 690 [2019-10-02 11:49:40,998 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 164 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 11:49:41,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2019-10-02 11:49:41,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 690. [2019-10-02 11:49:41,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2019-10-02 11:49:41,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1086 transitions. [2019-10-02 11:49:41,232 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1086 transitions. Word has length 161 [2019-10-02 11:49:41,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:49:41,234 INFO L475 AbstractCegarLoop]: Abstraction has 690 states and 1086 transitions. [2019-10-02 11:49:41,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:49:41,235 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1086 transitions. [2019-10-02 11:49:41,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-02 11:49:41,256 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:49:41,256 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:49:41,257 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:49:41,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:49:41,258 INFO L82 PathProgramCache]: Analyzing trace with hash -916200834, now seen corresponding path program 1 times [2019-10-02 11:49:41,258 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:49:41,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:49:41,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:41,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:49:41,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:41,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:49:41,504 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-02 11:49:41,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:49:41,504 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 11:49:41,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:49:42,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:49:42,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 2999 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 11:49:42,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:49:42,290 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 11:49:42,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:49:42,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2019-10-02 11:49:42,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:49:42,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:49:42,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:49:42,307 INFO L87 Difference]: Start difference. First operand 690 states and 1086 transitions. Second operand 9 states. [2019-10-02 11:49:43,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:49:43,257 INFO L93 Difference]: Finished difference Result 1403 states and 2241 transitions. [2019-10-02 11:49:43,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 11:49:43,257 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 163 [2019-10-02 11:49:43,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:49:43,264 INFO L225 Difference]: With dead ends: 1403 [2019-10-02 11:49:43,265 INFO L226 Difference]: Without dead ends: 741 [2019-10-02 11:49:43,269 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-10-02 11:49:43,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2019-10-02 11:49:43,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 736. [2019-10-02 11:49:43,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2019-10-02 11:49:43,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1171 transitions. [2019-10-02 11:49:43,340 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1171 transitions. Word has length 163 [2019-10-02 11:49:43,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:49:43,341 INFO L475 AbstractCegarLoop]: Abstraction has 736 states and 1171 transitions. [2019-10-02 11:49:43,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:49:43,341 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1171 transitions. [2019-10-02 11:49:43,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-02 11:49:43,348 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:49:43,348 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 11:49:43,349 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:49:43,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:49:43,349 INFO L82 PathProgramCache]: Analyzing trace with hash 762157303, now seen corresponding path program 1 times [2019-10-02 11:49:43,349 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:49:43,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:49:43,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:43,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:49:43,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:43,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:49:43,537 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 11:49:43,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:49:43,538 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 11:49:43,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:49:44,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:49:44,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 3002 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 11:49:44,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:49:44,261 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Stream closed [2019-10-02 11:49:44,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:49:44,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 11:49:44,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:49:44,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:49:44,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:49:44,277 INFO L87 Difference]: Start difference. First operand 736 states and 1171 transitions. Second operand 6 states. [2019-10-02 11:49:44,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:49:44,422 INFO L93 Difference]: Finished difference Result 1451 states and 2323 transitions. [2019-10-02 11:49:44,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:49:44,422 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 166 [2019-10-02 11:49:44,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:49:44,429 INFO L225 Difference]: With dead ends: 1451 [2019-10-02 11:49:44,430 INFO L226 Difference]: Without dead ends: 737 [2019-10-02 11:49:44,434 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 167 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 11:49:44,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2019-10-02 11:49:44,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 737. [2019-10-02 11:49:44,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2019-10-02 11:49:44,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1167 transitions. [2019-10-02 11:49:44,466 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1167 transitions. Word has length 166 [2019-10-02 11:49:44,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:49:44,467 INFO L475 AbstractCegarLoop]: Abstraction has 737 states and 1167 transitions. [2019-10-02 11:49:44,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:49:44,467 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1167 transitions. [2019-10-02 11:49:44,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-02 11:49:44,472 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:49:44,473 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:49:44,473 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:49:44,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:49:44,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1733142766, now seen corresponding path program 1 times [2019-10-02 11:49:44,474 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:49:44,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:49:44,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:44,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:49:44,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:44,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:49:44,647 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-02 11:49:44,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:49:44,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 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 11:49:44,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:49:45,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:49:45,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 3003 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 11:49:45,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:49:45,600 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 11:49:45,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:49:45,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-10-02 11:49:45,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 11:49:45,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 11:49:45,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:49:45,618 INFO L87 Difference]: Start difference. First operand 737 states and 1167 transitions. Second operand 12 states. [2019-10-02 11:49:45,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:49:45,829 INFO L93 Difference]: Finished difference Result 1450 states and 2312 transitions. [2019-10-02 11:49:45,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:49:45,830 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 167 [2019-10-02 11:49:45,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:49:45,837 INFO L225 Difference]: With dead ends: 1450 [2019-10-02 11:49:45,838 INFO L226 Difference]: Without dead ends: 746 [2019-10-02 11:49:45,842 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:49:45,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2019-10-02 11:49:45,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 737. [2019-10-02 11:49:45,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2019-10-02 11:49:45,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1167 transitions. [2019-10-02 11:49:45,877 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1167 transitions. Word has length 167 [2019-10-02 11:49:45,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:49:45,878 INFO L475 AbstractCegarLoop]: Abstraction has 737 states and 1167 transitions. [2019-10-02 11:49:45,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 11:49:45,878 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1167 transitions. [2019-10-02 11:49:45,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-02 11:49:45,887 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:49:45,887 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:49:45,887 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:49:45,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:49:45,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1358377349, now seen corresponding path program 1 times [2019-10-02 11:49:45,888 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:49:45,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:49:45,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:45,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:49:45,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:45,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:49:46,068 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-02 11:49:46,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:49:46,069 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 11:49:46,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:49:46,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:49:46,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 3004 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 11:49:46,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:49:46,912 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 11:49:46,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:49:46,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-10-02 11:49:46,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 11:49:46,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 11:49:46,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:49:46,932 INFO L87 Difference]: Start difference. First operand 737 states and 1167 transitions. Second operand 12 states. [2019-10-02 11:49:47,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:49:47,131 INFO L93 Difference]: Finished difference Result 1450 states and 2312 transitions. [2019-10-02 11:49:47,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:49:47,132 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 168 [2019-10-02 11:49:47,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:49:47,139 INFO L225 Difference]: With dead ends: 1450 [2019-10-02 11:49:47,139 INFO L226 Difference]: Without dead ends: 746 [2019-10-02 11:49:47,143 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:49:47,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2019-10-02 11:49:47,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 737. [2019-10-02 11:49:47,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2019-10-02 11:49:47,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1167 transitions. [2019-10-02 11:49:47,169 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1167 transitions. Word has length 168 [2019-10-02 11:49:47,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:49:47,169 INFO L475 AbstractCegarLoop]: Abstraction has 737 states and 1167 transitions. [2019-10-02 11:49:47,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 11:49:47,170 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1167 transitions. [2019-10-02 11:49:47,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-02 11:49:47,175 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:49:47,175 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:49:47,175 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:49:47,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:49:47,176 INFO L82 PathProgramCache]: Analyzing trace with hash -610866503, now seen corresponding path program 1 times [2019-10-02 11:49:47,176 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:49:47,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:49:47,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:47,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:49:47,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:47,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:49:47,311 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-02 11:49:47,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:49:47,311 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 11:49:47,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:49:47,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:49:47,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 3000 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 11:49:47,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:49:48,154 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:49:48,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:49:48,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2019-10-02 11:49:48,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 11:49:48,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 11:49:48,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:49:48,175 INFO L87 Difference]: Start difference. First operand 737 states and 1167 transitions. Second operand 14 states. [2019-10-02 11:49:48,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:49:48,577 INFO L93 Difference]: Finished difference Result 1463 states and 2336 transitions. [2019-10-02 11:49:48,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 11:49:48,578 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 168 [2019-10-02 11:49:48,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:49:48,589 INFO L225 Difference]: With dead ends: 1463 [2019-10-02 11:49:48,590 INFO L226 Difference]: Without dead ends: 759 [2019-10-02 11:49:48,595 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-10-02 11:49:48,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2019-10-02 11:49:48,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 747. [2019-10-02 11:49:48,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 747 states. [2019-10-02 11:49:48,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1186 transitions. [2019-10-02 11:49:48,633 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1186 transitions. Word has length 168 [2019-10-02 11:49:48,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:49:48,635 INFO L475 AbstractCegarLoop]: Abstraction has 747 states and 1186 transitions. [2019-10-02 11:49:48,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 11:49:48,635 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1186 transitions. [2019-10-02 11:49:48,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-02 11:49:48,640 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:49:48,641 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:49:48,641 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:49:48,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:49:48,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1881224147, now seen corresponding path program 1 times [2019-10-02 11:49:48,642 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:49:48,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:49:48,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:48,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:49:48,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:48,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:49:48,856 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-02 11:49:48,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:49:48,856 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 11:49:48,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:49:49,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:49:49,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 3006 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 11:49:49,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:49:49,570 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-02 11:49:49,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:49:49,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-10-02 11:49:49,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:49:49,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:49:49,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:49:49,581 INFO L87 Difference]: Start difference. First operand 747 states and 1186 transitions. Second operand 8 states. [2019-10-02 11:49:49,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:49:49,743 INFO L93 Difference]: Finished difference Result 1479 states and 2377 transitions. [2019-10-02 11:49:49,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:49:49,744 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 170 [2019-10-02 11:49:49,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:49:49,752 INFO L225 Difference]: With dead ends: 1479 [2019-10-02 11:49:49,752 INFO L226 Difference]: Without dead ends: 763 [2019-10-02 11:49:49,757 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:49:49,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2019-10-02 11:49:49,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 755. [2019-10-02 11:49:49,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2019-10-02 11:49:49,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1200 transitions. [2019-10-02 11:49:49,792 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1200 transitions. Word has length 170 [2019-10-02 11:49:49,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:49:49,793 INFO L475 AbstractCegarLoop]: Abstraction has 755 states and 1200 transitions. [2019-10-02 11:49:49,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:49:49,793 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1200 transitions. [2019-10-02 11:49:49,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-02 11:49:49,798 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:49:49,799 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:49:49,799 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:49:49,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:49:49,803 INFO L82 PathProgramCache]: Analyzing trace with hash 2136333939, now seen corresponding path program 1 times [2019-10-02 11:49:49,803 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:49:49,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:49:49,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:49,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:49:49,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:49,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:49:49,964 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-02 11:49:49,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:49:49,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 11:49:50,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:49:50,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:49:50,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 3007 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 11:49:50,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:49:50,614 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-02 11:49:50,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:49:50,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-10-02 11:49:50,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:49:50,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:49:50,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:49:50,624 INFO L87 Difference]: Start difference. First operand 755 states and 1200 transitions. Second operand 8 states. [2019-10-02 11:49:50,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:49:50,778 INFO L93 Difference]: Finished difference Result 1491 states and 2398 transitions. [2019-10-02 11:49:50,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:49:50,779 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 171 [2019-10-02 11:49:50,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:49:50,785 INFO L225 Difference]: With dead ends: 1491 [2019-10-02 11:49:50,785 INFO L226 Difference]: Without dead ends: 767 [2019-10-02 11:49:50,790 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:49:50,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2019-10-02 11:49:50,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 759. [2019-10-02 11:49:50,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2019-10-02 11:49:50,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1208 transitions. [2019-10-02 11:49:50,824 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1208 transitions. Word has length 171 [2019-10-02 11:49:50,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:49:50,824 INFO L475 AbstractCegarLoop]: Abstraction has 759 states and 1208 transitions. [2019-10-02 11:49:50,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:49:50,824 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1208 transitions. [2019-10-02 11:49:50,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-02 11:49:50,832 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:49:50,833 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:49:50,833 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:49:50,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:49:50,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1778944744, now seen corresponding path program 1 times [2019-10-02 11:49:50,834 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:49:50,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:49:50,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:50,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:49:50,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:50,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:49:51,038 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 11:49:51,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:49:51,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:49:51,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:49:51,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:49:51,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:49:51,040 INFO L87 Difference]: Start difference. First operand 759 states and 1208 transitions. Second operand 9 states. [2019-10-02 11:49:51,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:49:51,332 INFO L93 Difference]: Finished difference Result 1433 states and 2281 transitions. [2019-10-02 11:49:51,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 11:49:51,333 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 172 [2019-10-02 11:49:51,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:49:51,343 INFO L225 Difference]: With dead ends: 1433 [2019-10-02 11:49:51,343 INFO L226 Difference]: Without dead ends: 769 [2019-10-02 11:49:51,349 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 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 11:49:51,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2019-10-02 11:49:51,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 765. [2019-10-02 11:49:51,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 765 states. [2019-10-02 11:49:51,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1215 transitions. [2019-10-02 11:49:51,397 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1215 transitions. Word has length 172 [2019-10-02 11:49:51,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:49:51,397 INFO L475 AbstractCegarLoop]: Abstraction has 765 states and 1215 transitions. [2019-10-02 11:49:51,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:49:51,398 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1215 transitions. [2019-10-02 11:49:51,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-10-02 11:49:51,404 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:49:51,404 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:49:51,405 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:49:51,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:49:51,405 INFO L82 PathProgramCache]: Analyzing trace with hash -245271149, now seen corresponding path program 1 times [2019-10-02 11:49:51,405 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:49:51,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:49:51,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:51,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:49:51,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:51,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:49:51,745 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 11:49:51,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:49:51,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:49:51,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:49:51,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:49:51,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:49:51,747 INFO L87 Difference]: Start difference. First operand 765 states and 1215 transitions. Second operand 9 states. [2019-10-02 11:49:52,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:49:52,066 INFO L93 Difference]: Finished difference Result 1435 states and 2282 transitions. [2019-10-02 11:49:52,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 11:49:52,067 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 173 [2019-10-02 11:49:52,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:49:52,073 INFO L225 Difference]: With dead ends: 1435 [2019-10-02 11:49:52,074 INFO L226 Difference]: Without dead ends: 771 [2019-10-02 11:49:52,078 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:49:52,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2019-10-02 11:49:52,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 765. [2019-10-02 11:49:52,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 765 states. [2019-10-02 11:49:52,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1215 transitions. [2019-10-02 11:49:52,111 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1215 transitions. Word has length 173 [2019-10-02 11:49:52,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:49:52,112 INFO L475 AbstractCegarLoop]: Abstraction has 765 states and 1215 transitions. [2019-10-02 11:49:52,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:49:52,112 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1215 transitions. [2019-10-02 11:49:52,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-10-02 11:49:52,118 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:49:52,118 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:49:52,118 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:49:52,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:49:52,119 INFO L82 PathProgramCache]: Analyzing trace with hash -340139927, now seen corresponding path program 1 times [2019-10-02 11:49:52,119 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:49:52,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:49:52,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:52,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:49:52,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:52,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:49:52,255 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-02 11:49:52,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:49:52,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:49:52,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:49:52,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:49:52,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:49:52,257 INFO L87 Difference]: Start difference. First operand 765 states and 1215 transitions. Second operand 4 states. [2019-10-02 11:49:52,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:49:52,324 INFO L93 Difference]: Finished difference Result 1477 states and 2367 transitions. [2019-10-02 11:49:52,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:49:52,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-10-02 11:49:52,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:49:52,331 INFO L225 Difference]: With dead ends: 1477 [2019-10-02 11:49:52,331 INFO L226 Difference]: Without dead ends: 742 [2019-10-02 11:49:52,336 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 11:49:52,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2019-10-02 11:49:52,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 742. [2019-10-02 11:49:52,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 742 states. [2019-10-02 11:49:52,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1167 transitions. [2019-10-02 11:49:52,369 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1167 transitions. Word has length 173 [2019-10-02 11:49:52,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:49:52,370 INFO L475 AbstractCegarLoop]: Abstraction has 742 states and 1167 transitions. [2019-10-02 11:49:52,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:49:52,370 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1167 transitions. [2019-10-02 11:49:52,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-02 11:49:52,375 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:49:52,375 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:49:52,376 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:49:52,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:49:52,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1719803092, now seen corresponding path program 1 times [2019-10-02 11:49:52,376 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:49:52,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:49:52,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:52,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:49:52,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:52,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:49:52,518 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 11:49:52,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:49:52,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:49:52,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:49:52,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:49:52,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:49:52,519 INFO L87 Difference]: Start difference. First operand 742 states and 1167 transitions. Second operand 6 states. [2019-10-02 11:49:52,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:49:52,868 INFO L93 Difference]: Finished difference Result 1477 states and 2354 transitions. [2019-10-02 11:49:52,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:49:52,868 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 174 [2019-10-02 11:49:52,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:49:52,875 INFO L225 Difference]: With dead ends: 1477 [2019-10-02 11:49:52,875 INFO L226 Difference]: Without dead ends: 752 [2019-10-02 11:49:52,880 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 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 11:49:52,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2019-10-02 11:49:52,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 749. [2019-10-02 11:49:52,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 749 states. [2019-10-02 11:49:52,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1166 transitions. [2019-10-02 11:49:52,907 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1166 transitions. Word has length 174 [2019-10-02 11:49:52,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:49:52,909 INFO L475 AbstractCegarLoop]: Abstraction has 749 states and 1166 transitions. [2019-10-02 11:49:52,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:49:52,909 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1166 transitions. [2019-10-02 11:49:52,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-02 11:49:52,915 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:49:52,915 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:49:52,916 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:49:52,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:49:52,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1390383890, now seen corresponding path program 1 times [2019-10-02 11:49:52,916 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:49:52,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:49:52,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:52,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:49:52,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:52,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:49:53,070 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-02 11:49:53,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:49:53,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 11:49:53,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:49:53,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:49:53,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:49:53,072 INFO L87 Difference]: Start difference. First operand 749 states and 1166 transitions. Second operand 7 states. [2019-10-02 11:49:53,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:49:53,192 INFO L93 Difference]: Finished difference Result 1417 states and 2225 transitions. [2019-10-02 11:49:53,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:49:53,192 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 174 [2019-10-02 11:49:53,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:49:53,198 INFO L225 Difference]: With dead ends: 1417 [2019-10-02 11:49:53,199 INFO L226 Difference]: Without dead ends: 735 [2019-10-02 11:49:53,203 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 11:49:53,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2019-10-02 11:49:53,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 733. [2019-10-02 11:49:53,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2019-10-02 11:49:53,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 1133 transitions. [2019-10-02 11:49:53,229 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 1133 transitions. Word has length 174 [2019-10-02 11:49:53,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:49:53,230 INFO L475 AbstractCegarLoop]: Abstraction has 733 states and 1133 transitions. [2019-10-02 11:49:53,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:49:53,230 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1133 transitions. [2019-10-02 11:49:53,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-02 11:49:53,235 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:49:53,235 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:49:53,235 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:49:53,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:49:53,236 INFO L82 PathProgramCache]: Analyzing trace with hash 264526029, now seen corresponding path program 1 times [2019-10-02 11:49:53,236 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:49:53,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:49:53,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:53,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:49:53,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:53,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:49:53,471 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 11:49:53,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:49:53,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 11:49:53,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 11:49:53,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 11:49:53,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:49:53,473 INFO L87 Difference]: Start difference. First operand 733 states and 1133 transitions. Second operand 11 states. [2019-10-02 11:49:53,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:49:53,873 INFO L93 Difference]: Finished difference Result 1395 states and 2187 transitions. [2019-10-02 11:49:53,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 11:49:53,874 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 175 [2019-10-02 11:49:53,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:49:53,880 INFO L225 Difference]: With dead ends: 1395 [2019-10-02 11:49:53,880 INFO L226 Difference]: Without dead ends: 729 [2019-10-02 11:49:53,885 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-10-02 11:49:53,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2019-10-02 11:49:53,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 727. [2019-10-02 11:49:53,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2019-10-02 11:49:53,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1123 transitions. [2019-10-02 11:49:53,910 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1123 transitions. Word has length 175 [2019-10-02 11:49:53,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:49:53,911 INFO L475 AbstractCegarLoop]: Abstraction has 727 states and 1123 transitions. [2019-10-02 11:49:53,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 11:49:53,911 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1123 transitions. [2019-10-02 11:49:53,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-10-02 11:49:53,916 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:49:53,916 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:49:53,917 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:49:53,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:49:53,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1617825486, now seen corresponding path program 1 times [2019-10-02 11:49:53,917 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:49:53,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:49:53,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:53,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:49:53,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:53,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:49:54,095 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 11:49:54,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:49:54,095 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 11:49:54,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:49:54,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:49:54,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 3013 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 11:49:54,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:49:54,849 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:49:54,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:49:54,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-10-02 11:49:54,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:49:54,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:49:54,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:49:54,862 INFO L87 Difference]: Start difference. First operand 727 states and 1123 transitions. Second operand 9 states. [2019-10-02 11:49:56,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:49:56,381 INFO L93 Difference]: Finished difference Result 1385 states and 2201 transitions. [2019-10-02 11:49:56,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:49:56,382 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 177 [2019-10-02 11:49:56,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:49:56,388 INFO L225 Difference]: With dead ends: 1385 [2019-10-02 11:49:56,388 INFO L226 Difference]: Without dead ends: 731 [2019-10-02 11:49:56,395 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 175 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:49:56,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2019-10-02 11:49:56,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 731. [2019-10-02 11:49:56,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2019-10-02 11:49:56,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1127 transitions. [2019-10-02 11:49:56,440 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1127 transitions. Word has length 177 [2019-10-02 11:49:56,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:49:56,440 INFO L475 AbstractCegarLoop]: Abstraction has 731 states and 1127 transitions. [2019-10-02 11:49:56,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:49:56,441 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1127 transitions. [2019-10-02 11:49:56,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-10-02 11:49:56,446 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:49:56,448 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:49:56,448 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:49:56,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:49:56,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1076658614, now seen corresponding path program 1 times [2019-10-02 11:49:56,449 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:49:56,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:49:56,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:56,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:49:56,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:56,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:49:56,701 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 11:49:56,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:49:56,702 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 11:49:56,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:49:57,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:49:57,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 3015 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 11:49:57,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:49:57,511 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:49:57,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:49:57,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-10-02 11:49:57,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:49:57,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:49:57,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:49:57,531 INFO L87 Difference]: Start difference. First operand 731 states and 1127 transitions. Second operand 9 states. [2019-10-02 11:49:59,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:49:59,214 INFO L93 Difference]: Finished difference Result 1394 states and 2208 transitions. [2019-10-02 11:49:59,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:49:59,214 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 179 [2019-10-02 11:49:59,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:49:59,220 INFO L225 Difference]: With dead ends: 1394 [2019-10-02 11:49:59,221 INFO L226 Difference]: Without dead ends: 736 [2019-10-02 11:49:59,225 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 178 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:49:59,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2019-10-02 11:49:59,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 736. [2019-10-02 11:49:59,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2019-10-02 11:49:59,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1132 transitions. [2019-10-02 11:49:59,249 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1132 transitions. Word has length 179 [2019-10-02 11:49:59,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:49:59,249 INFO L475 AbstractCegarLoop]: Abstraction has 736 states and 1132 transitions. [2019-10-02 11:49:59,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:49:59,250 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1132 transitions. [2019-10-02 11:49:59,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-10-02 11:49:59,254 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:49:59,255 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:49:59,255 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:49:59,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:49:59,255 INFO L82 PathProgramCache]: Analyzing trace with hash 480474162, now seen corresponding path program 1 times [2019-10-02 11:49:59,255 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:49:59,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:49:59,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:59,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:49:59,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:59,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:49:59,401 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 11:49:59,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:49:59,402 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 11:49:59,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:50:00,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:50:00,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 3017 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 11:50:00,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:50:00,176 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 11:50:00,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:50:00,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-10-02 11:50:00,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:50:00,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:50:00,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:50:00,187 INFO L87 Difference]: Start difference. First operand 736 states and 1132 transitions. Second operand 9 states. [2019-10-02 11:50:01,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:50:01,883 INFO L93 Difference]: Finished difference Result 1405 states and 2217 transitions. [2019-10-02 11:50:01,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:50:01,884 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 181 [2019-10-02 11:50:01,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:50:01,890 INFO L225 Difference]: With dead ends: 1405 [2019-10-02 11:50:01,890 INFO L226 Difference]: Without dead ends: 742 [2019-10-02 11:50:01,894 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 180 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:50:01,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2019-10-02 11:50:01,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 742. [2019-10-02 11:50:01,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 742 states. [2019-10-02 11:50:01,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1138 transitions. [2019-10-02 11:50:01,921 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1138 transitions. Word has length 181 [2019-10-02 11:50:01,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:50:01,922 INFO L475 AbstractCegarLoop]: Abstraction has 742 states and 1138 transitions. [2019-10-02 11:50:01,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:50:01,922 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1138 transitions. [2019-10-02 11:50:01,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-10-02 11:50:01,928 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:50:01,928 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 11:50:01,928 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:50:01,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:50:01,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1297147198, now seen corresponding path program 1 times [2019-10-02 11:50:01,929 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:50:01,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:50:01,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:01,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:50:01,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:01,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:50:02,084 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 11:50:02,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:50:02,085 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 11:50:02,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:50:02,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:50:02,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 3019 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 11:50:02,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:50:02,840 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 11:50:02,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:50:02,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-10-02 11:50:02,850 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:50:02,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:50:02,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:50:02,850 INFO L87 Difference]: Start difference. First operand 742 states and 1138 transitions. Second operand 9 states. [2019-10-02 11:50:04,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:50:04,367 INFO L93 Difference]: Finished difference Result 1418 states and 2228 transitions. [2019-10-02 11:50:04,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:50:04,368 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 183 [2019-10-02 11:50:04,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:50:04,374 INFO L225 Difference]: With dead ends: 1418 [2019-10-02 11:50:04,374 INFO L226 Difference]: Without dead ends: 749 [2019-10-02 11:50:04,377 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 182 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:50:04,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2019-10-02 11:50:04,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 749. [2019-10-02 11:50:04,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 749 states. [2019-10-02 11:50:04,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1145 transitions. [2019-10-02 11:50:04,402 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1145 transitions. Word has length 183 [2019-10-02 11:50:04,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:50:04,402 INFO L475 AbstractCegarLoop]: Abstraction has 749 states and 1145 transitions. [2019-10-02 11:50:04,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:50:04,402 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1145 transitions. [2019-10-02 11:50:04,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-10-02 11:50:04,407 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:50:04,407 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 11:50:04,408 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:50:04,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:50:04,408 INFO L82 PathProgramCache]: Analyzing trace with hash 2073095570, now seen corresponding path program 1 times [2019-10-02 11:50:04,408 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:50:04,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:50:04,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:04,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:50:04,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:04,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:50:04,561 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 11:50:04,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:50:04,562 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 11:50:04,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:50:05,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:50:05,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 3019 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 11:50:05,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:50:05,288 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 11:50:05,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:50:05,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2019-10-02 11:50:05,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:50:05,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:50:05,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:50:05,297 INFO L87 Difference]: Start difference. First operand 749 states and 1145 transitions. Second operand 8 states. [2019-10-02 11:50:06,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:50:06,056 INFO L93 Difference]: Finished difference Result 1427 states and 2230 transitions. [2019-10-02 11:50:06,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:50:06,057 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 185 [2019-10-02 11:50:06,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:50:06,061 INFO L225 Difference]: With dead ends: 1427 [2019-10-02 11:50:06,062 INFO L226 Difference]: Without dead ends: 751 [2019-10-02 11:50:06,064 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 185 SyntacticMatches, 0 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 11:50:06,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2019-10-02 11:50:06,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 751. [2019-10-02 11:50:06,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 751 states. [2019-10-02 11:50:06,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1147 transitions. [2019-10-02 11:50:06,091 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1147 transitions. Word has length 185 [2019-10-02 11:50:06,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:50:06,092 INFO L475 AbstractCegarLoop]: Abstraction has 751 states and 1147 transitions. [2019-10-02 11:50:06,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:50:06,092 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1147 transitions. [2019-10-02 11:50:06,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-10-02 11:50:06,096 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:50:06,096 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 11:50:06,097 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:50:06,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:50:06,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1174825678, now seen corresponding path program 1 times [2019-10-02 11:50:06,097 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:50:06,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:50:06,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:06,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:50:06,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:06,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:50:06,288 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 11:50:06,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:50:06,289 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 11:50:06,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:50:07,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:50:07,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 3021 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-02 11:50:07,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:50:07,103 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 11:50:07,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:50:07,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2019-10-02 11:50:07,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 11:50:07,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 11:50:07,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-02 11:50:07,113 INFO L87 Difference]: Start difference. First operand 751 states and 1147 transitions. Second operand 13 states. [2019-10-02 11:50:26,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:50:26,823 INFO L93 Difference]: Finished difference Result 3654 states and 5820 transitions. [2019-10-02 11:50:26,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-02 11:50:26,823 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 185 [2019-10-02 11:50:26,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:50:26,845 INFO L225 Difference]: With dead ends: 3654 [2019-10-02 11:50:26,845 INFO L226 Difference]: Without dead ends: 2976 [2019-10-02 11:50:26,851 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=279, Invalid=1883, Unknown=0, NotChecked=0, Total=2162 [2019-10-02 11:50:26,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2976 states. [2019-10-02 11:50:26,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2976 to 2924. [2019-10-02 11:50:26,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2924 states. [2019-10-02 11:50:26,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2924 states to 2924 states and 4624 transitions. [2019-10-02 11:50:27,000 INFO L78 Accepts]: Start accepts. Automaton has 2924 states and 4624 transitions. Word has length 185 [2019-10-02 11:50:27,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:50:27,000 INFO L475 AbstractCegarLoop]: Abstraction has 2924 states and 4624 transitions. [2019-10-02 11:50:27,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 11:50:27,001 INFO L276 IsEmpty]: Start isEmpty. Operand 2924 states and 4624 transitions. [2019-10-02 11:50:27,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-10-02 11:50:27,011 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:50:27,011 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 11:50:27,011 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:50:27,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:50:27,012 INFO L82 PathProgramCache]: Analyzing trace with hash 96434197, now seen corresponding path program 1 times [2019-10-02 11:50:27,012 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:50:27,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:50:27,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:27,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:50:27,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:27,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:50:27,168 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 11:50:27,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:50:27,169 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 11:50:27,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:50:27,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:50:27,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 3039 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 11:50:27,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:50:27,857 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 11:50:27,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:50:27,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2019-10-02 11:50:27,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 11:50:27,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 11:50:27,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:50:27,867 INFO L87 Difference]: Start difference. First operand 2924 states and 4624 transitions. Second operand 10 states. [2019-10-02 11:50:28,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:50:28,561 INFO L93 Difference]: Finished difference Result 7230 states and 11619 transitions. [2019-10-02 11:50:28,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 11:50:28,562 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 191 [2019-10-02 11:50:28,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:50:28,591 INFO L225 Difference]: With dead ends: 7230 [2019-10-02 11:50:28,591 INFO L226 Difference]: Without dead ends: 4347 [2019-10-02 11:50:28,605 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2019-10-02 11:50:28,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4347 states. [2019-10-02 11:50:28,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4347 to 4321. [2019-10-02 11:50:28,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4321 states. [2019-10-02 11:50:28,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4321 states to 4321 states and 6888 transitions. [2019-10-02 11:50:28,840 INFO L78 Accepts]: Start accepts. Automaton has 4321 states and 6888 transitions. Word has length 191 [2019-10-02 11:50:28,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:50:28,841 INFO L475 AbstractCegarLoop]: Abstraction has 4321 states and 6888 transitions. [2019-10-02 11:50:28,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 11:50:28,841 INFO L276 IsEmpty]: Start isEmpty. Operand 4321 states and 6888 transitions. [2019-10-02 11:50:28,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-02 11:50:28,849 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:50:28,850 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 11:50:28,850 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:50:28,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:50:28,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1050672274, now seen corresponding path program 1 times [2019-10-02 11:50:28,851 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:50:28,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:50:28,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:28,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:50:28,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:28,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:50:29,014 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 11:50:29,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:50:29,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:50:29,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:50:29,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:50:29,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:50:29,016 INFO L87 Difference]: Start difference. First operand 4321 states and 6888 transitions. Second operand 9 states. [2019-10-02 11:50:29,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:50:29,383 INFO L93 Difference]: Finished difference Result 8331 states and 13269 transitions. [2019-10-02 11:50:29,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 11:50:29,385 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 192 [2019-10-02 11:50:29,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:50:29,410 INFO L225 Difference]: With dead ends: 8331 [2019-10-02 11:50:29,410 INFO L226 Difference]: Without dead ends: 4077 [2019-10-02 11:50:29,423 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 11:50:29,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4077 states. [2019-10-02 11:50:29,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4077 to 2757. [2019-10-02 11:50:29,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2757 states. [2019-10-02 11:50:29,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2757 states to 2757 states and 4339 transitions. [2019-10-02 11:50:29,534 INFO L78 Accepts]: Start accepts. Automaton has 2757 states and 4339 transitions. Word has length 192 [2019-10-02 11:50:29,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:50:29,535 INFO L475 AbstractCegarLoop]: Abstraction has 2757 states and 4339 transitions. [2019-10-02 11:50:29,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:50:29,535 INFO L276 IsEmpty]: Start isEmpty. Operand 2757 states and 4339 transitions. [2019-10-02 11:50:29,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-10-02 11:50:29,540 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:50:29,540 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 11:50:29,541 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:50:29,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:50:29,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1402176260, now seen corresponding path program 1 times [2019-10-02 11:50:29,541 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:50:29,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:50:29,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:29,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:50:29,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:29,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:50:29,723 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 11:50:29,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:50:29,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 11:50:29,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 11:50:29,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 11:50:29,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:50:29,724 INFO L87 Difference]: Start difference. First operand 2757 states and 4339 transitions. Second operand 10 states. [2019-10-02 11:50:38,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:50:38,571 INFO L93 Difference]: Finished difference Result 5240 states and 8273 transitions. [2019-10-02 11:50:38,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 11:50:38,571 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 201 [2019-10-02 11:50:38,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:50:38,587 INFO L225 Difference]: With dead ends: 5240 [2019-10-02 11:50:38,587 INFO L226 Difference]: Without dead ends: 2556 [2019-10-02 11:50:38,595 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2019-10-02 11:50:38,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2556 states. [2019-10-02 11:50:38,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2556 to 2528. [2019-10-02 11:50:38,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2528 states. [2019-10-02 11:50:38,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2528 states to 2528 states and 3939 transitions. [2019-10-02 11:50:38,682 INFO L78 Accepts]: Start accepts. Automaton has 2528 states and 3939 transitions. Word has length 201 [2019-10-02 11:50:38,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:50:38,683 INFO L475 AbstractCegarLoop]: Abstraction has 2528 states and 3939 transitions. [2019-10-02 11:50:38,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 11:50:38,683 INFO L276 IsEmpty]: Start isEmpty. Operand 2528 states and 3939 transitions. [2019-10-02 11:50:38,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-10-02 11:50:38,688 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:50:38,688 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 11:50:38,689 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:50:38,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:50:38,689 INFO L82 PathProgramCache]: Analyzing trace with hash -566086375, now seen corresponding path program 1 times [2019-10-02 11:50:38,689 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:50:38,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:50:38,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:38,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:50:38,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:38,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:50:38,836 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 11:50:38,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:50:38,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:50:38,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:50:38,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:50:38,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:50:38,839 INFO L87 Difference]: Start difference. First operand 2528 states and 3939 transitions. Second operand 4 states. [2019-10-02 11:50:40,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:50:40,439 INFO L93 Difference]: Finished difference Result 7341 states and 11746 transitions. [2019-10-02 11:50:40,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:50:40,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 215 [2019-10-02 11:50:40,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:50:40,499 INFO L225 Difference]: With dead ends: 7341 [2019-10-02 11:50:40,499 INFO L226 Difference]: Without dead ends: 4886 [2019-10-02 11:50:40,514 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:50:40,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4886 states. [2019-10-02 11:50:40,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4886 to 4870. [2019-10-02 11:50:40,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4870 states. [2019-10-02 11:50:40,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4870 states to 4870 states and 7694 transitions. [2019-10-02 11:50:40,817 INFO L78 Accepts]: Start accepts. Automaton has 4870 states and 7694 transitions. Word has length 215 [2019-10-02 11:50:40,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:50:40,818 INFO L475 AbstractCegarLoop]: Abstraction has 4870 states and 7694 transitions. [2019-10-02 11:50:40,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:50:40,819 INFO L276 IsEmpty]: Start isEmpty. Operand 4870 states and 7694 transitions. [2019-10-02 11:50:40,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-10-02 11:50:40,827 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:50:40,831 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:50:40,831 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:50:40,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:50:40,832 INFO L82 PathProgramCache]: Analyzing trace with hash 660868865, now seen corresponding path program 1 times [2019-10-02 11:50:40,832 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:50:40,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:50:40,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:40,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:50:40,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:40,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:50:41,201 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 11:50:41,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:50:41,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:50:41,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:50:41,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:50:41,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:50:41,204 INFO L87 Difference]: Start difference. First operand 4870 states and 7694 transitions. Second operand 4 states. [2019-10-02 11:50:43,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:50:43,500 INFO L93 Difference]: Finished difference Result 14391 states and 23374 transitions. [2019-10-02 11:50:43,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:50:43,502 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 216 [2019-10-02 11:50:43,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:50:43,582 INFO L225 Difference]: With dead ends: 14391 [2019-10-02 11:50:43,582 INFO L226 Difference]: Without dead ends: 9594 [2019-10-02 11:50:43,613 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:50:43,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9594 states. [2019-10-02 11:50:44,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9594 to 9582. [2019-10-02 11:50:44,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9582 states. [2019-10-02 11:50:44,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9582 states to 9582 states and 15366 transitions. [2019-10-02 11:50:44,223 INFO L78 Accepts]: Start accepts. Automaton has 9582 states and 15366 transitions. Word has length 216 [2019-10-02 11:50:44,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:50:44,223 INFO L475 AbstractCegarLoop]: Abstraction has 9582 states and 15366 transitions. [2019-10-02 11:50:44,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:50:44,223 INFO L276 IsEmpty]: Start isEmpty. Operand 9582 states and 15366 transitions. [2019-10-02 11:50:44,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-10-02 11:50:44,229 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:50:44,230 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:50:44,230 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:50:44,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:50:44,230 INFO L82 PathProgramCache]: Analyzing trace with hash -330042339, now seen corresponding path program 1 times [2019-10-02 11:50:44,230 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:50:44,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:50:44,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:44,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:50:44,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:44,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:50:44,390 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 11:50:44,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:50:44,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:50:44,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:50:44,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:50:44,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:50:44,393 INFO L87 Difference]: Start difference. First operand 9582 states and 15366 transitions. Second operand 4 states. [2019-10-02 11:50:46,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:50:46,711 INFO L93 Difference]: Finished difference Result 28553 states and 47452 transitions. [2019-10-02 11:50:46,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:50:46,711 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 217 [2019-10-02 11:50:46,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:50:46,854 INFO L225 Difference]: With dead ends: 28553 [2019-10-02 11:50:46,854 INFO L226 Difference]: Without dead ends: 19044 [2019-10-02 11:50:46,904 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:50:46,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19044 states. [2019-10-02 11:50:47,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19044 to 19036. [2019-10-02 11:50:47,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19036 states. [2019-10-02 11:50:47,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19036 states to 19036 states and 31186 transitions. [2019-10-02 11:50:47,816 INFO L78 Accepts]: Start accepts. Automaton has 19036 states and 31186 transitions. Word has length 217 [2019-10-02 11:50:47,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:50:47,816 INFO L475 AbstractCegarLoop]: Abstraction has 19036 states and 31186 transitions. [2019-10-02 11:50:47,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:50:47,817 INFO L276 IsEmpty]: Start isEmpty. Operand 19036 states and 31186 transitions. [2019-10-02 11:50:47,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-10-02 11:50:47,823 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:50:47,824 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 11:50:47,824 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:50:47,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:50:47,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1355336571, now seen corresponding path program 1 times [2019-10-02 11:50:47,825 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:50:47,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:50:47,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:47,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:50:47,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:47,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:50:47,962 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 11:50:47,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:50:47,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:50:47,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:50:47,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:50:47,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:50:47,964 INFO L87 Difference]: Start difference. First operand 19036 states and 31186 transitions. Second operand 4 states. [2019-10-02 11:50:50,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:50:50,212 INFO L93 Difference]: Finished difference Result 56943 states and 98474 transitions. [2019-10-02 11:50:50,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:50:50,213 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 218 [2019-10-02 11:50:50,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:50:50,528 INFO L225 Difference]: With dead ends: 56943 [2019-10-02 11:50:50,528 INFO L226 Difference]: Without dead ends: 37980 [2019-10-02 11:50:50,647 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:50:50,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37980 states. [2019-10-02 11:50:53,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37980 to 37976. [2019-10-02 11:50:53,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37976 states. [2019-10-02 11:50:53,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37976 states to 37976 states and 64492 transitions. [2019-10-02 11:50:53,665 INFO L78 Accepts]: Start accepts. Automaton has 37976 states and 64492 transitions. Word has length 218 [2019-10-02 11:50:53,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:50:53,666 INFO L475 AbstractCegarLoop]: Abstraction has 37976 states and 64492 transitions. [2019-10-02 11:50:53,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:50:53,666 INFO L276 IsEmpty]: Start isEmpty. Operand 37976 states and 64492 transitions. [2019-10-02 11:50:53,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-10-02 11:50:53,681 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:50:53,682 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 11:50:53,682 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:50:53,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:50:53,682 INFO L82 PathProgramCache]: Analyzing trace with hash 848462625, now seen corresponding path program 1 times [2019-10-02 11:50:53,682 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:50:53,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:50:53,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:53,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:50:53,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:53,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:50:53,825 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 11:50:53,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:50:53,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:50:53,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:50:53,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:50:53,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:50:53,827 INFO L87 Difference]: Start difference. First operand 37976 states and 64492 transitions. Second operand 4 states. [2019-10-02 11:50:59,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:50:59,533 INFO L93 Difference]: Finished difference Result 113781 states and 211332 transitions. [2019-10-02 11:50:59,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:50:59,534 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 219 [2019-10-02 11:50:59,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:51:00,066 INFO L225 Difference]: With dead ends: 113781 [2019-10-02 11:51:00,066 INFO L226 Difference]: Without dead ends: 75878 [2019-10-02 11:51:00,297 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:51:00,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75878 states. [2019-10-02 11:51:03,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75878 to 75874. [2019-10-02 11:51:03,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75874 states. [2019-10-02 11:51:03,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75874 states to 75874 states and 137364 transitions. [2019-10-02 11:51:03,928 INFO L78 Accepts]: Start accepts. Automaton has 75874 states and 137364 transitions. Word has length 219 [2019-10-02 11:51:03,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:51:03,928 INFO L475 AbstractCegarLoop]: Abstraction has 75874 states and 137364 transitions. [2019-10-02 11:51:03,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:51:03,929 INFO L276 IsEmpty]: Start isEmpty. Operand 75874 states and 137364 transitions. [2019-10-02 11:51:03,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-10-02 11:51:03,936 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:51:03,936 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 11:51:03,937 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:51:03,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:51:03,937 INFO L82 PathProgramCache]: Analyzing trace with hash -318233694, now seen corresponding path program 1 times [2019-10-02 11:51:03,937 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:51:03,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:51:03,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:03,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:51:03,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:03,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:51:04,121 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 11:51:04,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:51:04,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:51:04,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:51:04,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:51:04,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:51:04,122 INFO L87 Difference]: Start difference. First operand 75874 states and 137364 transitions. Second operand 9 states. [2019-10-02 11:51:10,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:51:10,226 INFO L93 Difference]: Finished difference Result 152480 states and 275102 transitions. [2019-10-02 11:51:10,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 11:51:10,226 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 219 [2019-10-02 11:51:10,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:51:10,628 INFO L225 Difference]: With dead ends: 152480 [2019-10-02 11:51:10,628 INFO L226 Difference]: Without dead ends: 76710 [2019-10-02 11:51:10,891 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2019-10-02 11:51:10,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76710 states. [2019-10-02 11:51:13,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76710 to 76194. [2019-10-02 11:51:13,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76194 states. [2019-10-02 11:51:13,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76194 states to 76194 states and 137748 transitions. [2019-10-02 11:51:13,858 INFO L78 Accepts]: Start accepts. Automaton has 76194 states and 137748 transitions. Word has length 219 [2019-10-02 11:51:13,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:51:13,858 INFO L475 AbstractCegarLoop]: Abstraction has 76194 states and 137748 transitions. [2019-10-02 11:51:13,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:51:13,859 INFO L276 IsEmpty]: Start isEmpty. Operand 76194 states and 137748 transitions. [2019-10-02 11:51:13,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-10-02 11:51:13,866 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:51:13,866 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 11:51:13,866 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:51:13,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:51:13,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1435360280, now seen corresponding path program 1 times [2019-10-02 11:51:13,867 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:51:13,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:51:13,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:13,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:51:13,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:13,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:51:14,001 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-10-02 11:51:14,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:51:14,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:51:14,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:51:14,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:51:14,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:51:14,003 INFO L87 Difference]: Start difference. First operand 76194 states and 137748 transitions. Second operand 5 states. [2019-10-02 11:51:17,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:51:17,166 INFO L93 Difference]: Finished difference Result 152465 states and 274533 transitions. [2019-10-02 11:51:17,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:51:17,167 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 225 [2019-10-02 11:51:17,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:51:21,268 INFO L225 Difference]: With dead ends: 152465 [2019-10-02 11:51:21,269 INFO L226 Difference]: Without dead ends: 76375 [2019-10-02 11:51:21,518 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:51:21,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76375 states. [2019-10-02 11:51:23,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76375 to 76189. [2019-10-02 11:51:23,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76189 states. [2019-10-02 11:51:24,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76189 states to 76189 states and 137738 transitions. [2019-10-02 11:51:24,498 INFO L78 Accepts]: Start accepts. Automaton has 76189 states and 137738 transitions. Word has length 225 [2019-10-02 11:51:24,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:51:24,499 INFO L475 AbstractCegarLoop]: Abstraction has 76189 states and 137738 transitions. [2019-10-02 11:51:24,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:51:24,499 INFO L276 IsEmpty]: Start isEmpty. Operand 76189 states and 137738 transitions. [2019-10-02 11:51:24,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-10-02 11:51:24,504 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:51:24,504 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 11:51:24,504 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:51:24,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:51:24,505 INFO L82 PathProgramCache]: Analyzing trace with hash -481846826, now seen corresponding path program 1 times [2019-10-02 11:51:24,505 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:51:24,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:51:24,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:24,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:51:24,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:24,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:51:24,690 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-10-02 11:51:24,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:51:24,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:51:24,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:51:24,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:51:24,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:51:24,694 INFO L87 Difference]: Start difference. First operand 76189 states and 137738 transitions. Second operand 9 states. [2019-10-02 11:51:28,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:51:28,139 INFO L93 Difference]: Finished difference Result 153554 states and 277066 transitions. [2019-10-02 11:51:28,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:51:28,139 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 225 [2019-10-02 11:51:28,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:51:28,643 INFO L225 Difference]: With dead ends: 153554 [2019-10-02 11:51:28,643 INFO L226 Difference]: Without dead ends: 77469 [2019-10-02 11:51:28,949 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:51:29,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77469 states. [2019-10-02 11:51:32,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77469 to 77213. [2019-10-02 11:51:32,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77213 states. [2019-10-02 11:51:33,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77213 states to 77213 states and 139660 transitions. [2019-10-02 11:51:33,729 INFO L78 Accepts]: Start accepts. Automaton has 77213 states and 139660 transitions. Word has length 225 [2019-10-02 11:51:33,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:51:33,730 INFO L475 AbstractCegarLoop]: Abstraction has 77213 states and 139660 transitions. [2019-10-02 11:51:33,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:51:33,730 INFO L276 IsEmpty]: Start isEmpty. Operand 77213 states and 139660 transitions. [2019-10-02 11:51:33,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-10-02 11:51:33,737 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:51:33,737 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 11:51:33,738 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:51:33,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:51:33,738 INFO L82 PathProgramCache]: Analyzing trace with hash -387903790, now seen corresponding path program 1 times [2019-10-02 11:51:33,738 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:51:33,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:51:33,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:33,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:51:33,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:33,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:51:33,966 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-10-02 11:51:33,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:51:33,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:51:33,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:51:33,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:51:33,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:51:33,967 INFO L87 Difference]: Start difference. First operand 77213 states and 139660 transitions. Second operand 9 states. [2019-10-02 11:51:38,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:51:38,232 INFO L93 Difference]: Finished difference Result 154774 states and 279310 transitions. [2019-10-02 11:51:38,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 11:51:38,233 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 276 [2019-10-02 11:51:38,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:51:38,667 INFO L225 Difference]: With dead ends: 154774 [2019-10-02 11:51:38,667 INFO L226 Difference]: Without dead ends: 77537 [2019-10-02 11:51:38,957 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2019-10-02 11:51:39,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77537 states. [2019-10-02 11:51:45,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77537 to 77213. [2019-10-02 11:51:45,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77213 states. [2019-10-02 11:51:45,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77213 states to 77213 states and 139596 transitions. [2019-10-02 11:51:45,792 INFO L78 Accepts]: Start accepts. Automaton has 77213 states and 139596 transitions. Word has length 276 [2019-10-02 11:51:45,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:51:45,792 INFO L475 AbstractCegarLoop]: Abstraction has 77213 states and 139596 transitions. [2019-10-02 11:51:45,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:51:45,792 INFO L276 IsEmpty]: Start isEmpty. Operand 77213 states and 139596 transitions. [2019-10-02 11:51:45,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-10-02 11:51:45,798 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:51:45,799 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 11:51:45,799 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:51:45,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:51:45,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1851778332, now seen corresponding path program 1 times [2019-10-02 11:51:45,799 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:51:45,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:51:45,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:45,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:51:45,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:45,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:51:45,980 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-10-02 11:51:45,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:51:45,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:51:45,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:51:45,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:51:45,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:51:45,981 INFO L87 Difference]: Start difference. First operand 77213 states and 139596 transitions. Second operand 9 states. [2019-10-02 11:51:51,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:51:51,567 INFO L93 Difference]: Finished difference Result 155090 states and 279372 transitions. [2019-10-02 11:51:51,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:51:51,567 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 224 [2019-10-02 11:51:51,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:51:51,967 INFO L225 Difference]: With dead ends: 155090 [2019-10-02 11:51:51,967 INFO L226 Difference]: Without dead ends: 77981 [2019-10-02 11:51:52,226 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:51:52,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77981 states. [2019-10-02 11:51:54,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77981 to 77277. [2019-10-02 11:51:54,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77277 states. [2019-10-02 11:51:55,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77277 states to 77277 states and 139660 transitions. [2019-10-02 11:51:55,265 INFO L78 Accepts]: Start accepts. Automaton has 77277 states and 139660 transitions. Word has length 224 [2019-10-02 11:51:55,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:51:55,265 INFO L475 AbstractCegarLoop]: Abstraction has 77277 states and 139660 transitions. [2019-10-02 11:51:55,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:51:55,265 INFO L276 IsEmpty]: Start isEmpty. Operand 77277 states and 139660 transitions. [2019-10-02 11:51:55,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-10-02 11:51:55,272 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:51:55,272 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 11:51:55,272 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:51:55,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:51:55,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1358194797, now seen corresponding path program 1 times [2019-10-02 11:51:55,273 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:51:55,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:51:55,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:55,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:51:55,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:55,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:51:55,442 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-10-02 11:51:55,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:51:55,442 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 11:51:55,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:51:56,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:51:56,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 3326 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 11:51:56,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:51:56,286 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-10-02 11:51:56,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:51:56,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2019-10-02 11:51:56,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:51:56,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:51:56,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:51:56,294 INFO L87 Difference]: Start difference. First operand 77277 states and 139660 transitions. Second operand 8 states. [2019-10-02 11:52:01,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:52:01,814 INFO L93 Difference]: Finished difference Result 193629 states and 375795 transitions. [2019-10-02 11:52:01,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 11:52:01,814 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 276 [2019-10-02 11:52:01,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:52:02,476 INFO L225 Difference]: With dead ends: 193629 [2019-10-02 11:52:02,477 INFO L226 Difference]: Without dead ends: 116425 [2019-10-02 11:52:07,244 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:52:07,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116425 states. [2019-10-02 11:52:10,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116425 to 115974. [2019-10-02 11:52:10,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115974 states. [2019-10-02 11:52:11,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115974 states to 115974 states and 209263 transitions. [2019-10-02 11:52:11,838 INFO L78 Accepts]: Start accepts. Automaton has 115974 states and 209263 transitions. Word has length 276 [2019-10-02 11:52:11,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:52:11,839 INFO L475 AbstractCegarLoop]: Abstraction has 115974 states and 209263 transitions. [2019-10-02 11:52:11,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:52:11,839 INFO L276 IsEmpty]: Start isEmpty. Operand 115974 states and 209263 transitions. [2019-10-02 11:52:11,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-10-02 11:52:11,844 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:52:11,844 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, 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] [2019-10-02 11:52:11,845 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:52:11,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:52:11,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1659517449, now seen corresponding path program 1 times [2019-10-02 11:52:11,845 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:52:11,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:52:11,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:11,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:52:11,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:11,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:52:12,017 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-10-02 11:52:12,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:52:12,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:52:12,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:52:12,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:52:12,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:52:12,019 INFO L87 Difference]: Start difference. First operand 115974 states and 209263 transitions. Second operand 4 states. [2019-10-02 11:52:23,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:52:23,992 INFO L93 Difference]: Finished difference Result 356117 states and 639269 transitions. [2019-10-02 11:52:23,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:52:23,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 235 [2019-10-02 11:52:23,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:52:25,144 INFO L225 Difference]: With dead ends: 356117 [2019-10-02 11:52:25,144 INFO L226 Difference]: Without dead ends: 239927 [2019-10-02 11:52:33,152 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:52:33,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239927 states. [2019-10-02 11:52:47,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239927 to 239407. [2019-10-02 11:52:47,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239407 states. [2019-10-02 11:52:49,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239407 states to 239407 states and 424194 transitions. [2019-10-02 11:52:49,457 INFO L78 Accepts]: Start accepts. Automaton has 239407 states and 424194 transitions. Word has length 235 [2019-10-02 11:52:49,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:52:49,457 INFO L475 AbstractCegarLoop]: Abstraction has 239407 states and 424194 transitions. [2019-10-02 11:52:49,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:52:49,458 INFO L276 IsEmpty]: Start isEmpty. Operand 239407 states and 424194 transitions. [2019-10-02 11:52:49,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-10-02 11:52:49,463 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:52:49,463 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:52:49,463 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:52:49,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:52:49,463 INFO L82 PathProgramCache]: Analyzing trace with hash 2104563104, now seen corresponding path program 1 times [2019-10-02 11:52:49,464 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:52:49,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:52:49,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:49,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:52:49,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:49,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:52:49,643 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-10-02 11:52:49,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:52:49,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 11:52:49,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:52:49,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:52:49,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:52:49,645 INFO L87 Difference]: Start difference. First operand 239407 states and 424194 transitions. Second operand 8 states. [2019-10-02 11:53:21,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:53:21,286 INFO L93 Difference]: Finished difference Result 591618 states and 1065975 transitions. [2019-10-02 11:53:21,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 11:53:21,286 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 239 [2019-10-02 11:53:21,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:53:24,455 INFO L225 Difference]: With dead ends: 591618 [2019-10-02 11:53:24,455 INFO L226 Difference]: Without dead ends: 385224 [2019-10-02 11:53:26,916 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-10-02 11:53:27,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385224 states. [2019-10-02 11:53:53,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385224 to 374804. [2019-10-02 11:53:53,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374804 states. [2019-10-02 11:54:08,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374804 states to 374804 states and 665015 transitions. [2019-10-02 11:54:08,937 INFO L78 Accepts]: Start accepts. Automaton has 374804 states and 665015 transitions. Word has length 239 [2019-10-02 11:54:08,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:54:08,937 INFO L475 AbstractCegarLoop]: Abstraction has 374804 states and 665015 transitions. [2019-10-02 11:54:08,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:54:08,938 INFO L276 IsEmpty]: Start isEmpty. Operand 374804 states and 665015 transitions. [2019-10-02 11:54:08,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-10-02 11:54:08,943 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:54:08,944 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 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] [2019-10-02 11:54:08,944 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:54:08,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:54:08,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1005798025, now seen corresponding path program 1 times [2019-10-02 11:54:08,944 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:54:08,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:54:08,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:08,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:08,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:08,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:09,107 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-10-02 11:54:09,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:54:09,107 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 11:54:09,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:09,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:09,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 3381 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 11:54:09,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:54:18,591 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-02 11:54:18,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:54:18,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2019-10-02 11:54:18,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:54:18,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:54:18,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:54:18,602 INFO L87 Difference]: Start difference. First operand 374804 states and 665015 transitions. Second operand 9 states. [2019-10-02 11:54:42,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:54:42,351 INFO L93 Difference]: Finished difference Result 757594 states and 1421358 transitions. [2019-10-02 11:54:42,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:54:42,351 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 231 [2019-10-02 11:54:42,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:54:57,647 INFO L225 Difference]: With dead ends: 757594 [2019-10-02 11:54:57,647 INFO L226 Difference]: Without dead ends: 382868 [2019-10-02 11:55:01,280 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:55:01,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382868 states. [2019-10-02 11:55:29,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382868 to 382868. [2019-10-02 11:55:29,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382868 states. [2019-10-02 11:55:33,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382868 states to 382868 states and 675383 transitions. [2019-10-02 11:55:33,706 INFO L78 Accepts]: Start accepts. Automaton has 382868 states and 675383 transitions. Word has length 231 [2019-10-02 11:55:33,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:55:33,707 INFO L475 AbstractCegarLoop]: Abstraction has 382868 states and 675383 transitions. [2019-10-02 11:55:33,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:55:33,707 INFO L276 IsEmpty]: Start isEmpty. Operand 382868 states and 675383 transitions. [2019-10-02 11:55:33,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-10-02 11:55:33,715 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:55:33,716 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:55:33,716 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:55:33,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:55:33,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1389063280, now seen corresponding path program 1 times [2019-10-02 11:55:33,717 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:55:33,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:55:33,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:55:33,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:55:33,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:55:33,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:55:33,965 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-02 11:55:33,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:55:33,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 11:55:33,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 11:55:33,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 11:55:33,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:55:33,967 INFO L87 Difference]: Start difference. First operand 382868 states and 675383 transitions. Second operand 12 states. [2019-10-02 11:56:05,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:56:05,854 INFO L93 Difference]: Finished difference Result 741157 states and 1312119 transitions. [2019-10-02 11:56:05,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 11:56:05,855 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 244 [2019-10-02 11:56:05,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:56:08,205 INFO L225 Difference]: With dead ends: 741157 [2019-10-02 11:56:08,205 INFO L226 Difference]: Without dead ends: 397596 [2019-10-02 11:56:13,257 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:56:13,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397596 states. [2019-10-02 11:56:44,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397596 to 396328. [2019-10-02 11:56:44,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396328 states. [2019-10-02 11:56:49,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396328 states to 396328 states and 693867 transitions. [2019-10-02 11:56:49,697 INFO L78 Accepts]: Start accepts. Automaton has 396328 states and 693867 transitions. Word has length 244 [2019-10-02 11:56:49,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:56:49,698 INFO L475 AbstractCegarLoop]: Abstraction has 396328 states and 693867 transitions. [2019-10-02 11:56:49,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 11:56:49,698 INFO L276 IsEmpty]: Start isEmpty. Operand 396328 states and 693867 transitions. [2019-10-02 11:56:49,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-10-02 11:56:49,706 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:56:49,707 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:56:49,707 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:56:49,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:56:49,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1003432971, now seen corresponding path program 1 times [2019-10-02 11:56:49,708 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:56:49,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:56:49,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:56:49,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:56:49,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:56:49,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:56:49,922 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-02 11:56:49,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:56:49,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 11:56:49,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 11:56:49,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 11:56:49,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:56:49,924 INFO L87 Difference]: Start difference. First operand 396328 states and 693867 transitions. Second operand 11 states. [2019-10-02 11:57:23,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:23,111 INFO L93 Difference]: Finished difference Result 771210 states and 1353709 transitions. [2019-10-02 11:57:23,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 11:57:23,112 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 251 [2019-10-02 11:57:23,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:27,474 INFO L225 Difference]: With dead ends: 771210 [2019-10-02 11:57:27,474 INFO L226 Difference]: Without dead ends: 387600 [2019-10-02 11:57:32,505 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:57:32,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387600 states. [2019-10-02 11:58:17,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387600 to 387280. [2019-10-02 11:58:17,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387280 states. [2019-10-02 11:58:22,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387280 states to 387280 states and 676411 transitions. [2019-10-02 11:58:22,713 INFO L78 Accepts]: Start accepts. Automaton has 387280 states and 676411 transitions. Word has length 251 [2019-10-02 11:58:22,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:58:22,714 INFO L475 AbstractCegarLoop]: Abstraction has 387280 states and 676411 transitions. [2019-10-02 11:58:22,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 11:58:22,714 INFO L276 IsEmpty]: Start isEmpty. Operand 387280 states and 676411 transitions. [2019-10-02 11:58:22,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-10-02 11:58:22,719 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:58:22,719 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 11:58:22,720 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:58:22,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:58:22,720 INFO L82 PathProgramCache]: Analyzing trace with hash -599792886, now seen corresponding path program 1 times [2019-10-02 11:58:22,720 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:58:22,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:58:22,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:22,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:58:22,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:22,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:58:22,892 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-10-02 11:58:22,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:58:22,892 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 11:58:23,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:58:23,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:58:23,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 3330 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 11:58:23,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:58:23,760 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-10-02 11:58:23,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:58:23,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2019-10-02 11:58:23,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 11:58:23,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 11:58:23,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:58:23,768 INFO L87 Difference]: Start difference. First operand 387280 states and 676411 transitions. Second operand 10 states.