java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/product-lines/elevator_spec9_product32.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 12:39:19,797 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 12:39:19,801 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 12:39:19,816 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 12:39:19,816 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 12:39:19,817 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 12:39:19,818 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 12:39:19,820 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 12:39:19,822 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 12:39:19,823 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 12:39:19,824 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 12:39:19,825 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 12:39:19,825 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 12:39:19,826 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 12:39:19,827 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 12:39:19,828 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 12:39:19,829 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 12:39:19,830 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 12:39:19,832 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 12:39:19,834 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 12:39:19,836 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 12:39:19,837 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 12:39:19,838 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 12:39:19,839 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 12:39:19,841 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 12:39:19,841 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 12:39:19,842 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 12:39:19,843 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 12:39:19,843 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 12:39:19,844 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 12:39:19,844 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 12:39:19,845 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 12:39:19,846 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 12:39:19,847 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 12:39:19,848 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 12:39:19,848 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 12:39:19,849 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 12:39:19,849 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 12:39:19,849 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 12:39:19,851 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 12:39:19,852 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 12:39:19,853 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 12:39:19,879 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 12:39:19,879 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 12:39:19,884 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 12:39:19,884 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 12:39:19,884 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 12:39:19,885 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 12:39:19,885 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 12:39:19,885 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 12:39:19,885 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 12:39:19,885 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 12:39:19,886 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 12:39:19,887 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 12:39:19,887 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 12:39:19,887 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 12:39:19,888 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 12:39:19,888 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 12:39:19,888 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 12:39:19,889 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 12:39:19,889 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 12:39:19,889 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 12:39:19,890 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 12:39:19,890 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:39:19,890 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 12:39:19,890 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 12:39:19,891 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 12:39:19,891 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 12:39:19,891 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 12:39:19,891 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 12:39:19,891 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 12:39:19,929 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 12:39:19,940 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 12:39:19,944 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 12:39:19,946 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 12:39:19,946 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 12:39:19,947 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec9_product32.cil.c [2019-10-02 12:39:20,009 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ad92c55f/389d7f4f5f064a2cb77b940a1df8e017/FLAGb7fb26e60 [2019-10-02 12:39:20,641 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 12:39:20,641 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec9_product32.cil.c [2019-10-02 12:39:20,668 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ad92c55f/389d7f4f5f064a2cb77b940a1df8e017/FLAGb7fb26e60 [2019-10-02 12:39:20,845 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ad92c55f/389d7f4f5f064a2cb77b940a1df8e017 [2019-10-02 12:39:20,855 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 12:39:20,857 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 12:39:20,858 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 12:39:20,858 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 12:39:20,862 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 12:39:20,863 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:39:20" (1/1) ... [2019-10-02 12:39:20,865 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ba36926 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:39:20, skipping insertion in model container [2019-10-02 12:39:20,866 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:39:20" (1/1) ... [2019-10-02 12:39:20,873 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 12:39:20,950 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 12:39:21,648 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:39:21,674 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 12:39:21,822 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:39:21,917 INFO L192 MainTranslator]: Completed translation [2019-10-02 12:39:21,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:39:21 WrapperNode [2019-10-02 12:39:21,918 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 12:39:21,919 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 12:39:21,919 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 12:39:21,919 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 12:39:21,934 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:39:21" (1/1) ... [2019-10-02 12:39:21,934 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:39:21" (1/1) ... [2019-10-02 12:39:21,970 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:39:21" (1/1) ... [2019-10-02 12:39:21,970 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:39:21" (1/1) ... [2019-10-02 12:39:22,050 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:39:21" (1/1) ... [2019-10-02 12:39:22,089 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:39:21" (1/1) ... [2019-10-02 12:39:22,106 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:39:21" (1/1) ... [2019-10-02 12:39:22,129 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 12:39:22,130 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 12:39:22,130 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 12:39:22,131 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 12:39:22,132 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:39:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:39:22,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 12:39:22,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 12:39:22,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 12:39:22,213 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-02 12:39:22,214 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-02 12:39:22,214 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-02 12:39:22,215 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-02 12:39:22,215 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-02 12:39:22,215 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-02 12:39:22,216 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-02 12:39:22,216 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-02 12:39:22,216 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 12:39:22,217 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 12:39:22,217 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__1 [2019-10-02 12:39:22,218 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__2 [2019-10-02 12:39:22,219 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__3 [2019-10-02 12:39:22,221 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__4 [2019-10-02 12:39:22,221 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-02 12:39:22,221 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-02 12:39:22,222 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-02 12:39:22,222 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-02 12:39:22,222 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-02 12:39:22,222 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-02 12:39:22,223 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-10-02 12:39:22,223 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-02 12:39:22,223 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-02 12:39:22,223 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-02 12:39:22,223 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-02 12:39:22,224 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-02 12:39:22,224 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-02 12:39:22,225 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-02 12:39:22,225 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-02 12:39:22,225 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-02 12:39:22,225 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-02 12:39:22,225 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-10-02 12:39:22,226 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-02 12:39:22,226 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-02 12:39:22,226 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-02 12:39:22,227 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-02 12:39:22,227 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-02 12:39:22,227 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-02 12:39:22,228 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-02 12:39:22,228 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-02 12:39:22,228 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-02 12:39:22,228 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2019-10-02 12:39:22,229 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-02 12:39:22,229 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__executivefloor [2019-10-02 12:39:22,230 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-02 12:39:22,230 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-02 12:39:22,230 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-02 12:39:22,230 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-02 12:39:22,230 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 12:39:22,231 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 12:39:22,231 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 12:39:22,231 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 12:39:22,231 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 12:39:22,231 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 12:39:22,232 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 12:39:22,232 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 12:39:22,232 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 12:39:22,232 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 12:39:22,232 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-02 12:39:22,233 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-02 12:39:22,233 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-02 12:39:22,233 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-02 12:39:22,233 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-02 12:39:22,233 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-02 12:39:22,234 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-02 12:39:22,234 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-02 12:39:22,234 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-02 12:39:22,234 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-02 12:39:22,235 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-02 12:39:22,235 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-02 12:39:22,235 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-02 12:39:22,236 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-02 12:39:22,236 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 12:39:22,236 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-02 12:39:22,236 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 12:39:22,236 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-02 12:39:22,237 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-02 12:39:22,237 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-02 12:39:22,237 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-02 12:39:22,237 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-02 12:39:22,238 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 12:39:22,238 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 12:39:22,238 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-02 12:39:22,238 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-02 12:39:22,238 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-02 12:39:22,239 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-02 12:39:22,239 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-02 12:39:22,240 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-02 12:39:22,240 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-02 12:39:22,240 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-02 12:39:22,240 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 12:39:22,241 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-02 12:39:22,241 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-02 12:39:22,241 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 12:39:22,241 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-02 12:39:22,241 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-02 12:39:22,241 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-02 12:39:22,241 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__1 [2019-10-02 12:39:22,241 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__2 [2019-10-02 12:39:22,242 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__3 [2019-10-02 12:39:22,242 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__4 [2019-10-02 12:39:22,242 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 12:39:22,242 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-02 12:39:22,242 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-02 12:39:22,242 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-02 12:39:22,243 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-02 12:39:22,243 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-02 12:39:22,243 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-02 12:39:22,243 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-02 12:39:22,243 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-02 12:39:22,243 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-02 12:39:22,243 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-02 12:39:22,244 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-02 12:39:22,244 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-02 12:39:22,244 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-02 12:39:22,244 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-02 12:39:22,244 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-02 12:39:22,245 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-10-02 12:39:22,245 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-02 12:39:22,245 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-02 12:39:22,245 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-02 12:39:22,246 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-02 12:39:22,247 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-02 12:39:22,247 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-10-02 12:39:22,247 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-02 12:39:22,247 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-02 12:39:22,247 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-02 12:39:22,247 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-02 12:39:22,248 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-02 12:39:22,248 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-02 12:39:22,248 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-02 12:39:22,248 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-02 12:39:22,248 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2019-10-02 12:39:22,249 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__executivefloor [2019-10-02 12:39:22,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 12:39:22,249 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-02 12:39:22,250 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 12:39:22,253 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 12:39:22,253 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 12:39:22,253 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 12:39:22,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 12:39:22,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 12:39:22,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 12:39:22,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 12:39:22,260 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 12:39:22,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 12:39:22,261 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 12:39:22,261 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 12:39:22,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 12:39:22,261 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 12:39:22,262 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 12:39:22,262 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 12:39:22,263 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 12:39:22,263 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 12:39:22,263 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 12:39:22,263 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 12:39:22,263 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 12:39:22,263 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-02 12:39:22,263 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-02 12:39:22,264 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-02 12:39:22,264 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-02 12:39:22,264 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-02 12:39:22,264 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-02 12:39:22,264 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-02 12:39:22,264 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-02 12:39:22,264 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-02 12:39:22,265 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-02 12:39:22,265 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-02 12:39:22,265 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-02 12:39:22,265 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-02 12:39:22,265 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 12:39:22,265 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-02 12:39:22,265 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 12:39:22,265 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-02 12:39:22,266 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-02 12:39:22,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 12:39:22,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 12:39:22,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 12:39:24,768 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 12:39:24,768 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-02 12:39:24,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:39:24 BoogieIcfgContainer [2019-10-02 12:39:24,770 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 12:39:24,772 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 12:39:24,772 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 12:39:24,775 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 12:39:24,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:39:20" (1/3) ... [2019-10-02 12:39:24,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7581eee7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:39:24, skipping insertion in model container [2019-10-02 12:39:24,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:39:21" (2/3) ... [2019-10-02 12:39:24,778 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7581eee7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:39:24, skipping insertion in model container [2019-10-02 12:39:24,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:39:24" (3/3) ... [2019-10-02 12:39:24,780 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product32.cil.c [2019-10-02 12:39:24,793 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 12:39:24,804 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 12:39:24,824 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 12:39:24,869 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 12:39:24,870 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 12:39:24,870 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 12:39:24,870 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 12:39:24,871 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 12:39:24,871 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 12:39:24,871 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 12:39:24,871 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 12:39:24,871 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 12:39:24,912 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states. [2019-10-02 12:39:24,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-02 12:39:24,928 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:24,930 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:39:24,936 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:24,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:24,944 INFO L82 PathProgramCache]: Analyzing trace with hash 165755889, now seen corresponding path program 1 times [2019-10-02 12:39:24,946 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:24,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:25,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:25,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:25,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:25,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:25,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:39:25,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:25,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:39:25,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:39:25,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:39:25,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:39:25,849 INFO L87 Difference]: Start difference. First operand 824 states. Second operand 4 states. [2019-10-02 12:39:26,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:26,096 INFO L93 Difference]: Finished difference Result 1297 states and 2071 transitions. [2019-10-02 12:39:26,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:39:26,099 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-10-02 12:39:26,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:26,125 INFO L225 Difference]: With dead ends: 1297 [2019-10-02 12:39:26,125 INFO L226 Difference]: Without dead ends: 657 [2019-10-02 12:39:26,138 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:39:26,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-10-02 12:39:26,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2019-10-02 12:39:26,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-10-02 12:39:26,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1037 transitions. [2019-10-02 12:39:26,297 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1037 transitions. Word has length 87 [2019-10-02 12:39:26,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:26,297 INFO L475 AbstractCegarLoop]: Abstraction has 657 states and 1037 transitions. [2019-10-02 12:39:26,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:39:26,298 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1037 transitions. [2019-10-02 12:39:26,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-02 12:39:26,311 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:26,311 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:39:26,311 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:26,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:26,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1802747224, now seen corresponding path program 1 times [2019-10-02 12:39:26,313 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:26,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:26,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:26,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:26,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:26,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:26,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:39:26,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:26,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:39:26,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:39:26,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:39:26,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:39:26,540 INFO L87 Difference]: Start difference. First operand 657 states and 1037 transitions. Second operand 4 states. [2019-10-02 12:39:26,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:26,677 INFO L93 Difference]: Finished difference Result 1277 states and 2032 transitions. [2019-10-02 12:39:26,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:39:26,678 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-10-02 12:39:26,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:26,691 INFO L225 Difference]: With dead ends: 1277 [2019-10-02 12:39:26,691 INFO L226 Difference]: Without dead ends: 657 [2019-10-02 12:39:26,707 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:39:26,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-10-02 12:39:26,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2019-10-02 12:39:26,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-10-02 12:39:26,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1036 transitions. [2019-10-02 12:39:26,758 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1036 transitions. Word has length 90 [2019-10-02 12:39:26,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:26,759 INFO L475 AbstractCegarLoop]: Abstraction has 657 states and 1036 transitions. [2019-10-02 12:39:26,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:39:26,759 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1036 transitions. [2019-10-02 12:39:26,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-02 12:39:26,762 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:26,762 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:39:26,763 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:26,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:26,763 INFO L82 PathProgramCache]: Analyzing trace with hash 464088220, now seen corresponding path program 1 times [2019-10-02 12:39:26,763 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:26,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:26,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:26,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:26,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:26,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:26,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:39:26,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:26,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:39:26,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:39:26,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:39:26,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:39:26,972 INFO L87 Difference]: Start difference. First operand 657 states and 1036 transitions. Second operand 4 states. [2019-10-02 12:39:27,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:27,053 INFO L93 Difference]: Finished difference Result 1277 states and 2031 transitions. [2019-10-02 12:39:27,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:39:27,053 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-10-02 12:39:27,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:27,062 INFO L225 Difference]: With dead ends: 1277 [2019-10-02 12:39:27,062 INFO L226 Difference]: Without dead ends: 657 [2019-10-02 12:39:27,066 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:39:27,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-10-02 12:39:27,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2019-10-02 12:39:27,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-10-02 12:39:27,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1035 transitions. [2019-10-02 12:39:27,151 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1035 transitions. Word has length 91 [2019-10-02 12:39:27,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:27,151 INFO L475 AbstractCegarLoop]: Abstraction has 657 states and 1035 transitions. [2019-10-02 12:39:27,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:39:27,152 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1035 transitions. [2019-10-02 12:39:27,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-02 12:39:27,153 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:27,153 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:39:27,154 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:27,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:27,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1512177068, now seen corresponding path program 1 times [2019-10-02 12:39:27,154 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:27,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:27,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:27,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:27,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:27,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:27,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:39:27,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:27,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:39:27,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:39:27,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:39:27,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:39:27,282 INFO L87 Difference]: Start difference. First operand 657 states and 1035 transitions. Second operand 4 states. [2019-10-02 12:39:27,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:27,348 INFO L93 Difference]: Finished difference Result 1277 states and 2030 transitions. [2019-10-02 12:39:27,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:39:27,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-10-02 12:39:27,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:27,355 INFO L225 Difference]: With dead ends: 1277 [2019-10-02 12:39:27,355 INFO L226 Difference]: Without dead ends: 657 [2019-10-02 12:39:27,361 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:39:27,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-10-02 12:39:27,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2019-10-02 12:39:27,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-10-02 12:39:27,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1034 transitions. [2019-10-02 12:39:27,387 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1034 transitions. Word has length 92 [2019-10-02 12:39:27,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:27,388 INFO L475 AbstractCegarLoop]: Abstraction has 657 states and 1034 transitions. [2019-10-02 12:39:27,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:39:27,389 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1034 transitions. [2019-10-02 12:39:27,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-02 12:39:27,395 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:27,396 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:39:27,396 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:27,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:27,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1779400680, now seen corresponding path program 1 times [2019-10-02 12:39:27,397 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:27,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:27,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:27,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:27,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:27,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:27,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:39:27,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:27,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:39:27,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:39:27,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:39:27,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:39:27,558 INFO L87 Difference]: Start difference. First operand 657 states and 1034 transitions. Second operand 4 states. [2019-10-02 12:39:27,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:27,624 INFO L93 Difference]: Finished difference Result 1277 states and 2029 transitions. [2019-10-02 12:39:27,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:39:27,625 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-10-02 12:39:27,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:27,631 INFO L225 Difference]: With dead ends: 1277 [2019-10-02 12:39:27,631 INFO L226 Difference]: Without dead ends: 657 [2019-10-02 12:39:27,635 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:39:27,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-10-02 12:39:27,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2019-10-02 12:39:27,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-10-02 12:39:27,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1033 transitions. [2019-10-02 12:39:27,662 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1033 transitions. Word has length 93 [2019-10-02 12:39:27,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:27,663 INFO L475 AbstractCegarLoop]: Abstraction has 657 states and 1033 transitions. [2019-10-02 12:39:27,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:39:27,665 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1033 transitions. [2019-10-02 12:39:27,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-02 12:39:27,667 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:27,668 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:39:27,668 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:27,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:27,669 INFO L82 PathProgramCache]: Analyzing trace with hash -605939888, now seen corresponding path program 1 times [2019-10-02 12:39:27,669 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:27,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:27,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:27,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:27,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:27,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:27,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:39:27,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:27,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 12:39:27,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 12:39:27,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 12:39:27,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:39:27,913 INFO L87 Difference]: Start difference. First operand 657 states and 1033 transitions. Second operand 10 states. [2019-10-02 12:39:28,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:28,129 INFO L93 Difference]: Finished difference Result 1235 states and 1949 transitions. [2019-10-02 12:39:28,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:39:28,130 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2019-10-02 12:39:28,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:28,142 INFO L225 Difference]: With dead ends: 1235 [2019-10-02 12:39:28,142 INFO L226 Difference]: Without dead ends: 666 [2019-10-02 12:39:28,148 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:39:28,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2019-10-02 12:39:28,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 664. [2019-10-02 12:39:28,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2019-10-02 12:39:28,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 1042 transitions. [2019-10-02 12:39:28,193 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 1042 transitions. Word has length 94 [2019-10-02 12:39:28,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:28,195 INFO L475 AbstractCegarLoop]: Abstraction has 664 states and 1042 transitions. [2019-10-02 12:39:28,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 12:39:28,195 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 1042 transitions. [2019-10-02 12:39:28,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-02 12:39:28,199 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:28,199 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:39:28,200 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:28,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:28,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1758408303, now seen corresponding path program 1 times [2019-10-02 12:39:28,200 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:28,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:28,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:28,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:28,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:28,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:28,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:39:28,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:28,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:39:28,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:39:28,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:39:28,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:39:28,365 INFO L87 Difference]: Start difference. First operand 664 states and 1042 transitions. Second operand 4 states. [2019-10-02 12:39:28,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:28,416 INFO L93 Difference]: Finished difference Result 1283 states and 2035 transitions. [2019-10-02 12:39:28,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:39:28,417 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-10-02 12:39:28,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:28,422 INFO L225 Difference]: With dead ends: 1283 [2019-10-02 12:39:28,422 INFO L226 Difference]: Without dead ends: 651 [2019-10-02 12:39:28,426 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:39:28,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-10-02 12:39:28,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2019-10-02 12:39:28,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-10-02 12:39:28,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1019 transitions. [2019-10-02 12:39:28,447 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1019 transitions. Word has length 94 [2019-10-02 12:39:28,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:28,447 INFO L475 AbstractCegarLoop]: Abstraction has 651 states and 1019 transitions. [2019-10-02 12:39:28,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:39:28,448 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1019 transitions. [2019-10-02 12:39:28,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-02 12:39:28,449 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:28,450 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:39:28,450 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:28,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:28,450 INFO L82 PathProgramCache]: Analyzing trace with hash -795855418, now seen corresponding path program 1 times [2019-10-02 12:39:28,450 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:28,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:28,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:28,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:28,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:28,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:28,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:39:28,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:28,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:39:28,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:39:28,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:39:28,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:39:28,574 INFO L87 Difference]: Start difference. First operand 651 states and 1019 transitions. Second operand 6 states. [2019-10-02 12:39:28,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:28,795 INFO L93 Difference]: Finished difference Result 1223 states and 1927 transitions. [2019-10-02 12:39:28,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:39:28,796 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-10-02 12:39:28,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:28,801 INFO L225 Difference]: With dead ends: 1223 [2019-10-02 12:39:28,802 INFO L226 Difference]: Without dead ends: 651 [2019-10-02 12:39:28,805 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:39:28,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-10-02 12:39:28,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2019-10-02 12:39:28,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-10-02 12:39:28,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1015 transitions. [2019-10-02 12:39:28,828 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1015 transitions. Word has length 95 [2019-10-02 12:39:28,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:28,829 INFO L475 AbstractCegarLoop]: Abstraction has 651 states and 1015 transitions. [2019-10-02 12:39:28,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:39:28,829 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1015 transitions. [2019-10-02 12:39:28,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-02 12:39:28,831 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:28,831 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:39:28,831 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:28,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:28,832 INFO L82 PathProgramCache]: Analyzing trace with hash 26339251, now seen corresponding path program 1 times [2019-10-02 12:39:28,832 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:28,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:28,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:28,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:28,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:28,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:28,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:39:28,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:28,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:39:28,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:39:28,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:39:28,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:39:28,958 INFO L87 Difference]: Start difference. First operand 651 states and 1015 transitions. Second operand 6 states. [2019-10-02 12:39:29,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:29,223 INFO L93 Difference]: Finished difference Result 1223 states and 1923 transitions. [2019-10-02 12:39:29,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:39:29,224 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-10-02 12:39:29,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:29,230 INFO L225 Difference]: With dead ends: 1223 [2019-10-02 12:39:29,230 INFO L226 Difference]: Without dead ends: 651 [2019-10-02 12:39:29,234 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:39:29,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-10-02 12:39:29,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2019-10-02 12:39:29,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-10-02 12:39:29,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1011 transitions. [2019-10-02 12:39:29,272 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1011 transitions. Word has length 96 [2019-10-02 12:39:29,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:29,273 INFO L475 AbstractCegarLoop]: Abstraction has 651 states and 1011 transitions. [2019-10-02 12:39:29,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:39:29,273 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1011 transitions. [2019-10-02 12:39:29,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-02 12:39:29,275 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:29,275 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:39:29,276 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:29,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:29,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1115555883, now seen corresponding path program 1 times [2019-10-02 12:39:29,276 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:29,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:29,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:29,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:29,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:29,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:29,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:39:29,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:29,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:39:29,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:39:29,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:39:29,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:39:29,427 INFO L87 Difference]: Start difference. First operand 651 states and 1011 transitions. Second operand 6 states. [2019-10-02 12:39:29,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:29,640 INFO L93 Difference]: Finished difference Result 1223 states and 1919 transitions. [2019-10-02 12:39:29,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:39:29,641 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-10-02 12:39:29,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:29,647 INFO L225 Difference]: With dead ends: 1223 [2019-10-02 12:39:29,648 INFO L226 Difference]: Without dead ends: 651 [2019-10-02 12:39:29,652 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:39:29,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-10-02 12:39:29,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2019-10-02 12:39:29,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-10-02 12:39:29,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1007 transitions. [2019-10-02 12:39:29,683 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1007 transitions. Word has length 97 [2019-10-02 12:39:29,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:29,683 INFO L475 AbstractCegarLoop]: Abstraction has 651 states and 1007 transitions. [2019-10-02 12:39:29,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:39:29,684 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1007 transitions. [2019-10-02 12:39:29,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-02 12:39:29,686 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:29,686 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:39:29,686 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:29,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:29,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1213864789, now seen corresponding path program 1 times [2019-10-02 12:39:29,687 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:29,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:29,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:29,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:29,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:29,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:29,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:39:29,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:29,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:39:29,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:39:29,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:39:29,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:39:29,874 INFO L87 Difference]: Start difference. First operand 651 states and 1007 transitions. Second operand 7 states. [2019-10-02 12:39:29,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:29,959 INFO L93 Difference]: Finished difference Result 1223 states and 1915 transitions. [2019-10-02 12:39:29,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:39:29,960 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-10-02 12:39:29,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:29,965 INFO L225 Difference]: With dead ends: 1223 [2019-10-02 12:39:29,965 INFO L226 Difference]: Without dead ends: 630 [2019-10-02 12:39:29,970 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:39:29,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-10-02 12:39:29,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2019-10-02 12:39:29,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-10-02 12:39:29,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 973 transitions. [2019-10-02 12:39:29,998 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 973 transitions. Word has length 97 [2019-10-02 12:39:29,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:29,999 INFO L475 AbstractCegarLoop]: Abstraction has 630 states and 973 transitions. [2019-10-02 12:39:29,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:39:29,999 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 973 transitions. [2019-10-02 12:39:30,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-02 12:39:30,000 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:30,001 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:39:30,001 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:30,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:30,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1892518776, now seen corresponding path program 1 times [2019-10-02 12:39:30,001 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:30,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:30,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:30,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:30,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:30,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:30,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:39:30,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:30,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:39:30,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:39:30,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:39:30,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:39:30,155 INFO L87 Difference]: Start difference. First operand 630 states and 973 transitions. Second operand 6 states. [2019-10-02 12:39:30,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:30,267 INFO L93 Difference]: Finished difference Result 1202 states and 1881 transitions. [2019-10-02 12:39:30,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:39:30,268 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-10-02 12:39:30,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:30,272 INFO L225 Difference]: With dead ends: 1202 [2019-10-02 12:39:30,273 INFO L226 Difference]: Without dead ends: 630 [2019-10-02 12:39:30,276 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:39:30,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-10-02 12:39:30,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2019-10-02 12:39:30,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-10-02 12:39:30,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 972 transitions. [2019-10-02 12:39:30,304 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 972 transitions. Word has length 98 [2019-10-02 12:39:30,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:30,305 INFO L475 AbstractCegarLoop]: Abstraction has 630 states and 972 transitions. [2019-10-02 12:39:30,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:39:30,306 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 972 transitions. [2019-10-02 12:39:30,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-02 12:39:30,307 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:30,307 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:39:30,307 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:30,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:30,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1579550352, now seen corresponding path program 1 times [2019-10-02 12:39:30,308 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:30,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:30,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:30,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:30,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:30,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:30,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:39:30,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:30,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:39:30,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:39:30,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:39:30,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:39:30,566 INFO L87 Difference]: Start difference. First operand 630 states and 972 transitions. Second operand 6 states. [2019-10-02 12:39:30,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:30,689 INFO L93 Difference]: Finished difference Result 1202 states and 1880 transitions. [2019-10-02 12:39:30,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:39:30,689 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-10-02 12:39:30,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:30,694 INFO L225 Difference]: With dead ends: 1202 [2019-10-02 12:39:30,695 INFO L226 Difference]: Without dead ends: 630 [2019-10-02 12:39:30,698 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:39:30,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-10-02 12:39:30,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2019-10-02 12:39:30,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-10-02 12:39:30,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 971 transitions. [2019-10-02 12:39:30,722 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 971 transitions. Word has length 99 [2019-10-02 12:39:30,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:30,724 INFO L475 AbstractCegarLoop]: Abstraction has 630 states and 971 transitions. [2019-10-02 12:39:30,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:39:30,724 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 971 transitions. [2019-10-02 12:39:30,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-02 12:39:30,725 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:30,726 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:39:30,726 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:30,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:30,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1838449469, now seen corresponding path program 1 times [2019-10-02 12:39:30,726 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:30,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:30,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:30,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:30,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:30,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:30,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:39:30,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:30,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 12:39:30,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:39:30,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:39:30,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:39:30,953 INFO L87 Difference]: Start difference. First operand 630 states and 971 transitions. Second operand 12 states. [2019-10-02 12:39:31,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:31,153 INFO L93 Difference]: Finished difference Result 1203 states and 1879 transitions. [2019-10-02 12:39:31,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:39:31,154 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 100 [2019-10-02 12:39:31,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:31,160 INFO L225 Difference]: With dead ends: 1203 [2019-10-02 12:39:31,160 INFO L226 Difference]: Without dead ends: 630 [2019-10-02 12:39:31,165 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:39:31,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-10-02 12:39:31,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2019-10-02 12:39:31,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-10-02 12:39:31,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 970 transitions. [2019-10-02 12:39:31,192 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 970 transitions. Word has length 100 [2019-10-02 12:39:31,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:31,192 INFO L475 AbstractCegarLoop]: Abstraction has 630 states and 970 transitions. [2019-10-02 12:39:31,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:39:31,193 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 970 transitions. [2019-10-02 12:39:31,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-02 12:39:31,194 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:31,195 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:39:31,195 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:31,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:31,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1351924293, now seen corresponding path program 1 times [2019-10-02 12:39:31,196 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:31,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:31,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:31,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:31,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:31,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:31,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:39:31,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:31,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:39:31,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:39:31,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:39:31,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:39:31,414 INFO L87 Difference]: Start difference. First operand 630 states and 970 transitions. Second operand 6 states. [2019-10-02 12:39:35,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:35,274 INFO L93 Difference]: Finished difference Result 1863 states and 2953 transitions. [2019-10-02 12:39:35,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:39:35,274 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2019-10-02 12:39:35,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:35,285 INFO L225 Difference]: With dead ends: 1863 [2019-10-02 12:39:35,285 INFO L226 Difference]: Without dead ends: 1299 [2019-10-02 12:39:35,289 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:39:35,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1299 states. [2019-10-02 12:39:35,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1299 to 1172. [2019-10-02 12:39:35,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1172 states. [2019-10-02 12:39:35,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1850 transitions. [2019-10-02 12:39:35,348 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1850 transitions. Word has length 101 [2019-10-02 12:39:35,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:35,349 INFO L475 AbstractCegarLoop]: Abstraction has 1172 states and 1850 transitions. [2019-10-02 12:39:35,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:39:35,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1850 transitions. [2019-10-02 12:39:35,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-02 12:39:35,355 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:35,355 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:39:35,356 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:35,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:35,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1530865345, now seen corresponding path program 1 times [2019-10-02 12:39:35,356 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:35,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:35,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:35,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:35,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:35,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:35,619 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:39:35,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:35,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 12:39:35,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:39:35,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:39:35,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:39:35,624 INFO L87 Difference]: Start difference. First operand 1172 states and 1850 transitions. Second operand 12 states. [2019-10-02 12:39:46,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:46,964 INFO L93 Difference]: Finished difference Result 3848 states and 6081 transitions. [2019-10-02 12:39:46,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 12:39:46,966 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 159 [2019-10-02 12:39:46,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:46,988 INFO L225 Difference]: With dead ends: 3848 [2019-10-02 12:39:46,988 INFO L226 Difference]: Without dead ends: 2742 [2019-10-02 12:39:46,995 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2019-10-02 12:39:46,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2742 states. [2019-10-02 12:39:47,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2742 to 2684. [2019-10-02 12:39:47,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2684 states. [2019-10-02 12:39:47,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2684 states to 2684 states and 4196 transitions. [2019-10-02 12:39:47,124 INFO L78 Accepts]: Start accepts. Automaton has 2684 states and 4196 transitions. Word has length 159 [2019-10-02 12:39:47,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:47,124 INFO L475 AbstractCegarLoop]: Abstraction has 2684 states and 4196 transitions. [2019-10-02 12:39:47,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:39:47,124 INFO L276 IsEmpty]: Start isEmpty. Operand 2684 states and 4196 transitions. [2019-10-02 12:39:47,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-02 12:39:47,130 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:47,130 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:39:47,131 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:47,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:47,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1845349951, now seen corresponding path program 1 times [2019-10-02 12:39:47,131 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:47,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:47,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:47,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:47,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:47,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:47,329 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-02 12:39:47,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:39:47,330 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:39:47,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:47,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:47,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 3076 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:39:47,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:39:47,955 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 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 12:39:47,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:39:47,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2019-10-02 12:39:47,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:39:47,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:39:47,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:39:47,967 INFO L87 Difference]: Start difference. First operand 2684 states and 4196 transitions. Second operand 12 states. [2019-10-02 12:39:56,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:56,118 INFO L93 Difference]: Finished difference Result 6842 states and 11003 transitions. [2019-10-02 12:39:56,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 12:39:56,119 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 160 [2019-10-02 12:39:56,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:56,148 INFO L225 Difference]: With dead ends: 6842 [2019-10-02 12:39:56,149 INFO L226 Difference]: Without dead ends: 4224 [2019-10-02 12:39:56,164 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600 [2019-10-02 12:39:56,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4224 states. [2019-10-02 12:39:56,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4224 to 4189. [2019-10-02 12:39:56,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4189 states. [2019-10-02 12:39:56,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4189 states to 4189 states and 6681 transitions. [2019-10-02 12:39:56,384 INFO L78 Accepts]: Start accepts. Automaton has 4189 states and 6681 transitions. Word has length 160 [2019-10-02 12:39:56,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:56,385 INFO L475 AbstractCegarLoop]: Abstraction has 4189 states and 6681 transitions. [2019-10-02 12:39:56,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:39:56,385 INFO L276 IsEmpty]: Start isEmpty. Operand 4189 states and 6681 transitions. [2019-10-02 12:39:56,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-02 12:39:56,392 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:56,393 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-10-02 12:39:56,393 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:56,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:56,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1677346838, now seen corresponding path program 1 times [2019-10-02 12:39:56,393 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:56,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:56,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:56,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:56,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:56,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:56,721 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 12:39:56,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:39:56,721 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:39:56,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:57,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:57,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 3079 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:39:57,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:39:57,662 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:39:57,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:39:57,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [13] total 14 [2019-10-02 12:39:57,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:39:57,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:39:57,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:39:57,681 INFO L87 Difference]: Start difference. First operand 4189 states and 6681 transitions. Second operand 14 states. [2019-10-02 12:40:07,139 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 14 [2019-10-02 12:40:42,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:40:42,385 INFO L93 Difference]: Finished difference Result 48156 states and 83151 transitions. [2019-10-02 12:40:42,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2019-10-02 12:40:42,385 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 162 [2019-10-02 12:40:42,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:40:42,577 INFO L225 Difference]: With dead ends: 48156 [2019-10-02 12:40:42,577 INFO L226 Difference]: Without dead ends: 25727 [2019-10-02 12:40:42,704 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8067 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1917, Invalid=17823, Unknown=0, NotChecked=0, Total=19740 [2019-10-02 12:40:42,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25727 states. [2019-10-02 12:40:45,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25727 to 25017. [2019-10-02 12:40:45,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25017 states. [2019-10-02 12:40:45,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25017 states to 25017 states and 40139 transitions. [2019-10-02 12:40:45,223 INFO L78 Accepts]: Start accepts. Automaton has 25017 states and 40139 transitions. Word has length 162 [2019-10-02 12:40:45,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:40:45,224 INFO L475 AbstractCegarLoop]: Abstraction has 25017 states and 40139 transitions. [2019-10-02 12:40:45,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 12:40:45,225 INFO L276 IsEmpty]: Start isEmpty. Operand 25017 states and 40139 transitions. [2019-10-02 12:40:45,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-02 12:40:45,231 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:40:45,232 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:40:45,232 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:40:45,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:40:45,232 INFO L82 PathProgramCache]: Analyzing trace with hash -335151049, now seen corresponding path program 1 times [2019-10-02 12:40:45,233 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:40:45,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:40:45,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:40:45,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:40:45,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:40:45,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:40:45,439 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 12:40:45,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:40:45,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:40:45,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:40:45,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:40:45,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:40:45,442 INFO L87 Difference]: Start difference. First operand 25017 states and 40139 transitions. Second operand 6 states. [2019-10-02 12:40:47,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:40:47,160 INFO L93 Difference]: Finished difference Result 50518 states and 83594 transitions. [2019-10-02 12:40:47,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:40:47,161 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 164 [2019-10-02 12:40:47,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:40:47,354 INFO L225 Difference]: With dead ends: 50518 [2019-10-02 12:40:47,355 INFO L226 Difference]: Without dead ends: 25567 [2019-10-02 12:40:47,460 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:40:47,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25567 states. [2019-10-02 12:40:48,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25567 to 25567. [2019-10-02 12:40:48,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25567 states. [2019-10-02 12:40:48,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25567 states to 25567 states and 40564 transitions. [2019-10-02 12:40:48,629 INFO L78 Accepts]: Start accepts. Automaton has 25567 states and 40564 transitions. Word has length 164 [2019-10-02 12:40:48,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:40:48,629 INFO L475 AbstractCegarLoop]: Abstraction has 25567 states and 40564 transitions. [2019-10-02 12:40:48,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:40:48,629 INFO L276 IsEmpty]: Start isEmpty. Operand 25567 states and 40564 transitions. [2019-10-02 12:40:48,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-02 12:40:48,637 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:40:48,637 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:40:48,637 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:40:48,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:40:48,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1673278401, now seen corresponding path program 1 times [2019-10-02 12:40:48,638 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:40:48,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:40:48,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:40:48,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:40:48,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:40:48,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:40:48,861 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 12:40:48,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:40:48,862 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:40:48,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:40:49,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:40:49,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 3084 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:40:49,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:40:49,492 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-02 12:40:49,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:40:49,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2019-10-02 12:40:49,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:40:49,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:40:49,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:40:49,519 INFO L87 Difference]: Start difference. First operand 25567 states and 40564 transitions. Second operand 12 states. [2019-10-02 12:41:07,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:41:07,309 INFO L93 Difference]: Finished difference Result 124930 states and 213468 transitions. [2019-10-02 12:41:07,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-02 12:41:07,310 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 166 [2019-10-02 12:41:07,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:41:08,009 INFO L225 Difference]: With dead ends: 124930 [2019-10-02 12:41:08,011 INFO L226 Difference]: Without dead ends: 99429 [2019-10-02 12:41:08,193 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=234, Invalid=1326, Unknown=0, NotChecked=0, Total=1560 [2019-10-02 12:41:08,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99429 states. [2019-10-02 12:41:15,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99429 to 97029. [2019-10-02 12:41:15,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97029 states. [2019-10-02 12:41:16,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97029 states to 97029 states and 163187 transitions. [2019-10-02 12:41:16,082 INFO L78 Accepts]: Start accepts. Automaton has 97029 states and 163187 transitions. Word has length 166 [2019-10-02 12:41:16,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:41:16,083 INFO L475 AbstractCegarLoop]: Abstraction has 97029 states and 163187 transitions. [2019-10-02 12:41:16,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:41:16,083 INFO L276 IsEmpty]: Start isEmpty. Operand 97029 states and 163187 transitions. [2019-10-02 12:41:16,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-02 12:41:16,099 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:41:16,099 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:41:16,099 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:41:16,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:41:16,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1308534504, now seen corresponding path program 1 times [2019-10-02 12:41:16,100 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:41:16,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:41:16,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:16,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:41:16,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:16,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:41:16,296 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 12:41:16,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:41:16,297 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:41:16,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:41:16,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:41:16,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 3087 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:41:16,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:41:16,964 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-02 12:41:16,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:41:16,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2019-10-02 12:41:16,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:41:16,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:41:16,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:41:16,987 INFO L87 Difference]: Start difference. First operand 97029 states and 163187 transitions. Second operand 12 states. [2019-10-02 12:41:47,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:41:47,257 INFO L93 Difference]: Finished difference Result 385548 states and 718371 transitions. [2019-10-02 12:41:47,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-02 12:41:47,258 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 168 [2019-10-02 12:41:47,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:41:48,958 INFO L225 Difference]: With dead ends: 385548 [2019-10-02 12:41:48,958 INFO L226 Difference]: Without dead ends: 288594 [2019-10-02 12:41:49,325 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=234, Invalid=1326, Unknown=0, NotChecked=0, Total=1560 [2019-10-02 12:41:49,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288594 states. [2019-10-02 12:42:08,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288594 to 281107. [2019-10-02 12:42:08,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281107 states. [2019-10-02 12:42:11,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281107 states to 281107 states and 510108 transitions. [2019-10-02 12:42:11,225 INFO L78 Accepts]: Start accepts. Automaton has 281107 states and 510108 transitions. Word has length 168 [2019-10-02 12:42:11,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:42:11,226 INFO L475 AbstractCegarLoop]: Abstraction has 281107 states and 510108 transitions. [2019-10-02 12:42:11,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:42:11,226 INFO L276 IsEmpty]: Start isEmpty. Operand 281107 states and 510108 transitions. [2019-10-02 12:42:11,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-10-02 12:42:11,247 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:42:11,247 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:42:11,248 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:42:11,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:42:11,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1980407056, now seen corresponding path program 1 times [2019-10-02 12:42:11,248 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:42:11,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:42:11,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:11,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:42:11,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:11,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:42:11,399 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-02 12:42:11,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:42:11,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:42:11,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:42:11,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:42:11,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:42:11,405 INFO L87 Difference]: Start difference. First operand 281107 states and 510108 transitions. Second operand 9 states. [2019-10-02 12:42:23,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:42:23,011 INFO L93 Difference]: Finished difference Result 369999 states and 660024 transitions. [2019-10-02 12:42:23,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:42:23,013 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 169 [2019-10-02 12:42:23,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:42:23,505 INFO L225 Difference]: With dead ends: 369999 [2019-10-02 12:42:23,505 INFO L226 Difference]: Without dead ends: 88946 [2019-10-02 12:42:24,954 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:42:25,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88946 states. [2019-10-02 12:42:29,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88946 to 88946. [2019-10-02 12:42:29,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88946 states. [2019-10-02 12:42:29,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88946 states to 88946 states and 149971 transitions. [2019-10-02 12:42:29,742 INFO L78 Accepts]: Start accepts. Automaton has 88946 states and 149971 transitions. Word has length 169 [2019-10-02 12:42:29,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:42:29,743 INFO L475 AbstractCegarLoop]: Abstraction has 88946 states and 149971 transitions. [2019-10-02 12:42:29,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:42:29,743 INFO L276 IsEmpty]: Start isEmpty. Operand 88946 states and 149971 transitions. [2019-10-02 12:42:29,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-02 12:42:29,751 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:42:29,752 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:42:29,752 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:42:29,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:42:29,752 INFO L82 PathProgramCache]: Analyzing trace with hash 2029938087, now seen corresponding path program 1 times [2019-10-02 12:42:29,752 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:42:29,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:42:29,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:29,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:42:29,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:29,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:42:29,963 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 12:42:29,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:42:29,964 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:42:30,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:42:30,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:42:30,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 3090 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:42:30,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:42:30,557 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-02 12:42:30,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:42:30,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2019-10-02 12:42:30,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:42:30,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:42:30,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:42:30,570 INFO L87 Difference]: Start difference. First operand 88946 states and 149971 transitions. Second operand 12 states. [2019-10-02 12:42:47,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:42:47,449 INFO L93 Difference]: Finished difference Result 206382 states and 375433 transitions. [2019-10-02 12:42:47,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 12:42:47,450 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 170 [2019-10-02 12:42:47,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:42:48,145 INFO L225 Difference]: With dead ends: 206382 [2019-10-02 12:42:48,145 INFO L226 Difference]: Without dead ends: 117489 [2019-10-02 12:42:48,396 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600 [2019-10-02 12:42:48,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117489 states. [2019-10-02 12:42:57,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117489 to 113853. [2019-10-02 12:42:57,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113853 states. [2019-10-02 12:42:58,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113853 states to 113853 states and 200974 transitions. [2019-10-02 12:42:58,673 INFO L78 Accepts]: Start accepts. Automaton has 113853 states and 200974 transitions. Word has length 170 [2019-10-02 12:42:58,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:42:58,674 INFO L475 AbstractCegarLoop]: Abstraction has 113853 states and 200974 transitions. [2019-10-02 12:42:58,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:42:58,674 INFO L276 IsEmpty]: Start isEmpty. Operand 113853 states and 200974 transitions. [2019-10-02 12:42:58,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-10-02 12:42:58,701 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:42:58,701 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:42:58,702 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:42:58,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:42:58,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1462400544, now seen corresponding path program 1 times [2019-10-02 12:42:58,702 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:42:58,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:42:58,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:58,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:42:58,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:58,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:42:58,932 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-10-02 12:42:58,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:42:58,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:42:58,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:42:58,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:42:58,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:42:58,933 INFO L87 Difference]: Start difference. First operand 113853 states and 200974 transitions. Second operand 5 states. [2019-10-02 12:43:15,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:43:15,420 INFO L93 Difference]: Finished difference Result 394047 states and 885285 transitions. [2019-10-02 12:43:15,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:43:15,421 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 291 [2019-10-02 12:43:15,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:43:17,595 INFO L225 Difference]: With dead ends: 394047 [2019-10-02 12:43:17,596 INFO L226 Difference]: Without dead ends: 280257 [2019-10-02 12:43:18,045 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:43:18,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280257 states. [2019-10-02 12:43:40,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280257 to 272140. [2019-10-02 12:43:40,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272140 states. [2019-10-02 12:43:44,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272140 states to 272140 states and 554804 transitions. [2019-10-02 12:43:44,219 INFO L78 Accepts]: Start accepts. Automaton has 272140 states and 554804 transitions. Word has length 291 [2019-10-02 12:43:44,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:43:44,220 INFO L475 AbstractCegarLoop]: Abstraction has 272140 states and 554804 transitions. [2019-10-02 12:43:44,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:43:44,220 INFO L276 IsEmpty]: Start isEmpty. Operand 272140 states and 554804 transitions. [2019-10-02 12:43:44,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-10-02 12:43:44,260 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:43:44,260 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:43:44,261 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:43:44,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:43:44,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1637651230, now seen corresponding path program 1 times [2019-10-02 12:43:44,261 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:43:44,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:43:44,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:43:44,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:43:44,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:43:44,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:43:44,512 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-10-02 12:43:44,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:43:44,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:43:44,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:43:44,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:43:44,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:43:44,514 INFO L87 Difference]: Start difference. First operand 272140 states and 554804 transitions. Second operand 5 states. [2019-10-02 12:45:20,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:45:20,802 INFO L93 Difference]: Finished difference Result 996865 states and 3044543 transitions. [2019-10-02 12:45:20,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:45:20,803 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 291 [2019-10-02 12:45:20,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:45:32,969 INFO L225 Difference]: With dead ends: 996865 [2019-10-02 12:45:32,969 INFO L226 Difference]: Without dead ends: 724788 [2019-10-02 12:45:48,029 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:45:48,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724788 states.