java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/product-lines/elevator_spec1_product11.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 12:02:43,842 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 12:02:43,845 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 12:02:43,857 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 12:02:43,857 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 12:02:43,858 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 12:02:43,860 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 12:02:43,862 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 12:02:43,864 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 12:02:43,865 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 12:02:43,866 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 12:02:43,867 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 12:02:43,867 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 12:02:43,868 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 12:02:43,870 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 12:02:43,871 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 12:02:43,873 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 12:02:43,874 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 12:02:43,875 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 12:02:43,877 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 12:02:43,879 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 12:02:43,880 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 12:02:43,881 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 12:02:43,882 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 12:02:43,885 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 12:02:43,885 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 12:02:43,885 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 12:02:43,886 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 12:02:43,887 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 12:02:43,888 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 12:02:43,888 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 12:02:43,889 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 12:02:43,890 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 12:02:43,891 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 12:02:43,892 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 12:02:43,892 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 12:02:43,893 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 12:02:43,893 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 12:02:43,893 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 12:02:43,894 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 12:02:43,895 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 12:02:43,896 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:02:43,912 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 12:02:43,912 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 12:02:43,914 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 12:02:43,914 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 12:02:43,914 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 12:02:43,914 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 12:02:43,915 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 12:02:43,915 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 12:02:43,915 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 12:02:43,915 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 12:02:43,915 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 12:02:43,915 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 12:02:43,916 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 12:02:43,916 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 12:02:43,916 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 12:02:43,916 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 12:02:43,916 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 12:02:43,917 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 12:02:43,917 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 12:02:43,917 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 12:02:43,917 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 12:02:43,917 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:02:43,918 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 12:02:43,918 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 12:02:43,918 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 12:02:43,918 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 12:02:43,918 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 12:02:43,919 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 12:02:43,919 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 12:02:43,948 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 12:02:43,961 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 12:02:43,966 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 12:02:43,968 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 12:02:43,969 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 12:02:43,970 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec1_product11.cil.c [2019-10-02 12:02:44,050 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a349c93c/888e27ff63404340980dab5fcb79efb9/FLAGa892daef9 [2019-10-02 12:02:44,723 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 12:02:44,724 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec1_product11.cil.c [2019-10-02 12:02:44,750 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a349c93c/888e27ff63404340980dab5fcb79efb9/FLAGa892daef9 [2019-10-02 12:02:44,866 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a349c93c/888e27ff63404340980dab5fcb79efb9 [2019-10-02 12:02:44,875 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 12:02:44,877 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 12:02:44,878 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 12:02:44,878 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 12:02:44,881 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 12:02:44,882 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:02:44" (1/1) ... [2019-10-02 12:02:44,886 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@283534bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:02:44, skipping insertion in model container [2019-10-02 12:02:44,887 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:02:44" (1/1) ... [2019-10-02 12:02:44,895 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 12:02:44,987 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 12:02:45,712 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:02:45,734 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 12:02:45,854 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:02:45,914 INFO L192 MainTranslator]: Completed translation [2019-10-02 12:02:45,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:02:45 WrapperNode [2019-10-02 12:02:45,914 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 12:02:45,915 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 12:02:45,915 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 12:02:45,915 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 12:02:45,929 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:02:45" (1/1) ... [2019-10-02 12:02:45,930 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:02:45" (1/1) ... [2019-10-02 12:02:45,962 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:02:45" (1/1) ... [2019-10-02 12:02:45,963 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:02:45" (1/1) ... [2019-10-02 12:02:46,024 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:02:45" (1/1) ... [2019-10-02 12:02:46,061 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:02:45" (1/1) ... [2019-10-02 12:02:46,073 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:02:45" (1/1) ... [2019-10-02 12:02:46,090 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 12:02:46,091 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 12:02:46,091 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 12:02:46,091 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 12:02:46,092 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:02:45" (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:02:46,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 12:02:46,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 12:02:46,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 12:02:46,163 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-02 12:02:46,164 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-02 12:02:46,164 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-02 12:02:46,164 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 12:02:46,165 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__1 [2019-10-02 12:02:46,165 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__2 [2019-10-02 12:02:46,165 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__3 [2019-10-02 12:02:46,165 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__4 [2019-10-02 12:02:46,166 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-02 12:02:46,166 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-02 12:02:46,166 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-02 12:02:46,167 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-02 12:02:46,167 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-02 12:02:46,169 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-02 12:02:46,170 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-02 12:02:46,170 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-02 12:02:46,170 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-02 12:02:46,170 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-02 12:02:46,170 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-02 12:02:46,171 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-02 12:02:46,171 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-02 12:02:46,171 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-02 12:02:46,171 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-02 12:02:46,171 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-10-02 12:02:46,172 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-02 12:02:46,172 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-02 12:02:46,172 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-02 12:02:46,172 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-02 12:02:46,173 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-02 12:02:46,173 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-02 12:02:46,173 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-02 12:02:46,173 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-02 12:02:46,173 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-02 12:02:46,173 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-02 12:02:46,173 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-02 12:02:46,173 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-02 12:02:46,174 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 12:02:46,174 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 12:02:46,174 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 12:02:46,174 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 12:02:46,174 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 12:02:46,175 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-02 12:02:46,175 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-02 12:02:46,175 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 12:02:46,175 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 12:02:46,175 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 12:02:46,176 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 12:02:46,176 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 12:02:46,176 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 12:02:46,176 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-02 12:02:46,176 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-02 12:02:46,176 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-02 12:02:46,176 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-02 12:02:46,177 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-02 12:02:46,177 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-02 12:02:46,177 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-02 12:02:46,177 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-02 12:02:46,177 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-02 12:02:46,178 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-02 12:02:46,178 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-02 12:02:46,178 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-02 12:02:46,178 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-02 12:02:46,178 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-02 12:02:46,179 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 12:02:46,179 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-02 12:02:46,179 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 12:02:46,180 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-02 12:02:46,180 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-02 12:02:46,180 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-02 12:02:46,180 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-02 12:02:46,180 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-02 12:02:46,181 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-02 12:02:46,181 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-02 12:02:46,181 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-02 12:02:46,182 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 12:02:46,182 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 12:02:46,182 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-02 12:02:46,182 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-02 12:02:46,182 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-02 12:02:46,183 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-02 12:02:46,183 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-02 12:02:46,184 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-02 12:02:46,184 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 12:02:46,184 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 12:02:46,185 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-02 12:02:46,185 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-02 12:02:46,185 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__1 [2019-10-02 12:02:46,185 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__2 [2019-10-02 12:02:46,186 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__3 [2019-10-02 12:02:46,186 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__4 [2019-10-02 12:02:46,187 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 12:02:46,187 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-02 12:02:46,187 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-02 12:02:46,187 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-02 12:02:46,188 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-02 12:02:46,188 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-02 12:02:46,188 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-02 12:02:46,188 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-02 12:02:46,189 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-02 12:02:46,189 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-02 12:02:46,189 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-02 12:02:46,189 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-02 12:02:46,189 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-02 12:02:46,190 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-02 12:02:46,190 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-02 12:02:46,190 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-02 12:02:46,190 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-02 12:02:46,191 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-02 12:02:46,191 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-02 12:02:46,191 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-02 12:02:46,191 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-02 12:02:46,192 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-02 12:02:46,192 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-02 12:02:46,192 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-02 12:02:46,193 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-02 12:02:46,193 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-10-02 12:02:46,193 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-02 12:02:46,194 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-02 12:02:46,194 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-02 12:02:46,194 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-02 12:02:46,194 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-02 12:02:46,195 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-02 12:02:46,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 12:02:46,196 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-02 12:02:46,196 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 12:02:46,196 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 12:02:46,196 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 12:02:46,196 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 12:02:46,197 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-02 12:02:46,197 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-02 12:02:46,197 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-02 12:02:46,197 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 12:02:46,198 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 12:02:46,198 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 12:02:46,198 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 12:02:46,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 12:02:46,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 12:02:46,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 12:02:46,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 12:02:46,204 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 12:02:46,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 12:02:46,211 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 12:02:46,212 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 12:02:46,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 12:02:46,212 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 12:02:46,212 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 12:02:46,212 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 12:02:46,212 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 12:02:46,212 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-02 12:02:46,213 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-02 12:02:46,213 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-02 12:02:46,213 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-02 12:02:46,213 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-02 12:02:46,214 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-02 12:02:46,214 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-02 12:02:46,214 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-02 12:02:46,215 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-02 12:02:46,215 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-02 12:02:46,215 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-02 12:02:46,215 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 12:02:46,215 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-02 12:02:46,216 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 12:02:46,216 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-02 12:02:46,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 12:02:46,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 12:02:46,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 12:02:48,747 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 12:02:48,748 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-02 12:02:48,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:02:48 BoogieIcfgContainer [2019-10-02 12:02:48,750 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 12:02:48,751 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 12:02:48,752 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 12:02:48,755 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 12:02:48,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:02:44" (1/3) ... [2019-10-02 12:02:48,756 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29737aac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:02:48, skipping insertion in model container [2019-10-02 12:02:48,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:02:45" (2/3) ... [2019-10-02 12:02:48,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29737aac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:02:48, skipping insertion in model container [2019-10-02 12:02:48,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:02:48" (3/3) ... [2019-10-02 12:02:48,759 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec1_product11.cil.c [2019-10-02 12:02:48,770 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 12:02:48,784 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 12:02:48,802 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 12:02:48,847 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 12:02:48,848 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 12:02:48,848 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 12:02:48,848 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 12:02:48,848 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 12:02:48,849 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 12:02:48,849 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 12:02:48,849 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 12:02:48,849 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 12:02:48,889 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states. [2019-10-02 12:02:48,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-02 12:02:48,924 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:02:48,925 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:02:48,928 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:02:48,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:02:48,935 INFO L82 PathProgramCache]: Analyzing trace with hash 2009729749, now seen corresponding path program 1 times [2019-10-02 12:02:48,937 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:02:48,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:02:49,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:02:49,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:02:49,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:02:49,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:02:49,616 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 12:02:49,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:02:49,619 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:02:49,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:02:50,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:02:50,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 3257 conjuncts, 1 conjunts are in the unsatisfiable core [2019-10-02 12:02:50,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:02:50,381 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-02 12:02:50,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:02:50,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 4 [2019-10-02 12:02:50,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:02:50,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:02:50,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:02:50,413 INFO L87 Difference]: Start difference. First operand 766 states. Second operand 4 states. [2019-10-02 12:02:50,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:02:50,629 INFO L93 Difference]: Finished difference Result 1216 states and 1967 transitions. [2019-10-02 12:02:50,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:02:50,631 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-10-02 12:02:50,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:02:50,669 INFO L225 Difference]: With dead ends: 1216 [2019-10-02 12:02:50,670 INFO L226 Difference]: Without dead ends: 612 [2019-10-02 12:02:50,684 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 165 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:02:50,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-10-02 12:02:50,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2019-10-02 12:02:50,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-10-02 12:02:50,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 977 transitions. [2019-10-02 12:02:50,806 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 977 transitions. Word has length 164 [2019-10-02 12:02:50,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:02:50,807 INFO L475 AbstractCegarLoop]: Abstraction has 612 states and 977 transitions. [2019-10-02 12:02:50,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:02:50,808 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 977 transitions. [2019-10-02 12:02:50,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-02 12:02:50,820 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:02:50,821 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:02:50,821 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:02:50,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:02:50,822 INFO L82 PathProgramCache]: Analyzing trace with hash 2119485278, now seen corresponding path program 1 times [2019-10-02 12:02:50,822 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:02:50,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:02:50,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:02:50,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:02:50,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:02:50,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:02:51,035 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 12:02:51,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:02:51,036 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:02:51,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:02:51,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:02:51,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 3262 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:02:51,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:02:51,787 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 12:02:51,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:02:51,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:02:51,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:02:51,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:02:51,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:02:51,808 INFO L87 Difference]: Start difference. First operand 612 states and 977 transitions. Second operand 6 states. [2019-10-02 12:02:51,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:02:51,924 INFO L93 Difference]: Finished difference Result 1196 states and 1927 transitions. [2019-10-02 12:02:51,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:02:51,924 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 168 [2019-10-02 12:02:51,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:02:51,931 INFO L225 Difference]: With dead ends: 1196 [2019-10-02 12:02:51,931 INFO L226 Difference]: Without dead ends: 612 [2019-10-02 12:02:51,936 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:02:51,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-10-02 12:02:51,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2019-10-02 12:02:51,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-10-02 12:02:51,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 976 transitions. [2019-10-02 12:02:51,979 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 976 transitions. Word has length 168 [2019-10-02 12:02:51,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:02:51,979 INFO L475 AbstractCegarLoop]: Abstraction has 612 states and 976 transitions. [2019-10-02 12:02:51,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:02:51,980 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 976 transitions. [2019-10-02 12:02:51,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-02 12:02:51,987 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:02:51,987 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:02:51,988 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:02:51,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:02:51,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1181326224, now seen corresponding path program 1 times [2019-10-02 12:02:51,988 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:02:51,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:02:51,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:02:51,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:02:51,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:02:52,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:02:52,153 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 12:02:52,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:02:52,154 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:02:52,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:02:52,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:02:52,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 3264 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:02:52,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:02:52,815 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Stream closed [2019-10-02 12:02:52,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:02:52,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:02:52,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:02:52,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:02:52,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:02:52,836 INFO L87 Difference]: Start difference. First operand 612 states and 976 transitions. Second operand 6 states. [2019-10-02 12:02:52,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:02:52,924 INFO L93 Difference]: Finished difference Result 1200 states and 1930 transitions. [2019-10-02 12:02:52,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:02:52,925 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 170 [2019-10-02 12:02:52,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:02:52,931 INFO L225 Difference]: With dead ends: 1200 [2019-10-02 12:02:52,931 INFO L226 Difference]: Without dead ends: 618 [2019-10-02 12:02:52,935 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:02:52,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-10-02 12:02:52,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 618. [2019-10-02 12:02:52,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-10-02 12:02:52,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 981 transitions. [2019-10-02 12:02:52,968 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 981 transitions. Word has length 170 [2019-10-02 12:02:52,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:02:52,968 INFO L475 AbstractCegarLoop]: Abstraction has 618 states and 981 transitions. [2019-10-02 12:02:52,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:02:52,969 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 981 transitions. [2019-10-02 12:02:52,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-02 12:02:52,974 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:02:52,974 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:02:52,975 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:02:52,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:02:52,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1277638939, now seen corresponding path program 1 times [2019-10-02 12:02:52,975 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:02:52,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:02:52,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:02:52,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:02:52,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:02:53,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:02:53,134 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 12:02:53,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:02:53,135 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:02:53,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:02:53,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:02:53,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 3265 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:02:53,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:02:53,831 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:02:53,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:02:53,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:02:53,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:02:53,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:02:53,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:02:53,842 INFO L87 Difference]: Start difference. First operand 618 states and 981 transitions. Second operand 6 states. [2019-10-02 12:02:53,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:02:53,932 INFO L93 Difference]: Finished difference Result 1199 states and 1921 transitions. [2019-10-02 12:02:53,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:02:53,933 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 171 [2019-10-02 12:02:53,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:02:53,941 INFO L225 Difference]: With dead ends: 1199 [2019-10-02 12:02:53,941 INFO L226 Difference]: Without dead ends: 618 [2019-10-02 12:02:53,945 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:02:53,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-10-02 12:02:53,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 618. [2019-10-02 12:02:53,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-10-02 12:02:53,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 980 transitions. [2019-10-02 12:02:53,976 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 980 transitions. Word has length 171 [2019-10-02 12:02:53,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:02:53,977 INFO L475 AbstractCegarLoop]: Abstraction has 618 states and 980 transitions. [2019-10-02 12:02:53,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:02:53,978 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 980 transitions. [2019-10-02 12:02:53,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-02 12:02:53,983 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:02:53,984 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:02:53,984 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:02:53,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:02:53,984 INFO L82 PathProgramCache]: Analyzing trace with hash 107661556, now seen corresponding path program 1 times [2019-10-02 12:02:53,984 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:02:53,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:02:53,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:02:53,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:02:53,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:02:54,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:02:54,130 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 12:02:54,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:02:54,135 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:02:54,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:02:54,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:02:54,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 3266 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:02:54,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:02:54,857 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 12:02:54,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:02:54,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:02:54,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:02:54,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:02:54,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:02:54,867 INFO L87 Difference]: Start difference. First operand 618 states and 980 transitions. Second operand 6 states. [2019-10-02 12:02:54,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:02:54,949 INFO L93 Difference]: Finished difference Result 1199 states and 1920 transitions. [2019-10-02 12:02:54,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:02:54,949 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 172 [2019-10-02 12:02:54,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:02:54,954 INFO L225 Difference]: With dead ends: 1199 [2019-10-02 12:02:54,955 INFO L226 Difference]: Without dead ends: 618 [2019-10-02 12:02:54,958 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:02:54,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-10-02 12:02:54,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 618. [2019-10-02 12:02:54,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-10-02 12:02:54,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 979 transitions. [2019-10-02 12:02:54,989 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 979 transitions. Word has length 172 [2019-10-02 12:02:54,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:02:54,989 INFO L475 AbstractCegarLoop]: Abstraction has 618 states and 979 transitions. [2019-10-02 12:02:54,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:02:54,990 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 979 transitions. [2019-10-02 12:02:54,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-10-02 12:02:54,995 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:02:54,995 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:02:54,996 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:02:54,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:02:54,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1662603201, now seen corresponding path program 1 times [2019-10-02 12:02:54,996 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:02:54,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:02:55,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:02:55,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:02:55,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:02:55,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:02:55,242 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 12:02:55,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:02:55,243 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:02:55,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:02:55,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:02:55,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 3267 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:02:55,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:02:55,921 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:02:55,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:02:55,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2019-10-02 12:02:55,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:02:55,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:02:55,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:02:55,932 INFO L87 Difference]: Start difference. First operand 618 states and 979 transitions. Second operand 12 states. [2019-10-02 12:02:56,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:02:56,641 INFO L93 Difference]: Finished difference Result 1210 states and 1940 transitions. [2019-10-02 12:02:56,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:02:56,642 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 173 [2019-10-02 12:02:56,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:02:56,650 INFO L225 Difference]: With dead ends: 1210 [2019-10-02 12:02:56,651 INFO L226 Difference]: Without dead ends: 627 [2019-10-02 12:02:56,656 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:02:56,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2019-10-02 12:02:56,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 625. [2019-10-02 12:02:56,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625 states. [2019-10-02 12:02:56,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 984 transitions. [2019-10-02 12:02:56,698 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 984 transitions. Word has length 173 [2019-10-02 12:02:56,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:02:56,699 INFO L475 AbstractCegarLoop]: Abstraction has 625 states and 984 transitions. [2019-10-02 12:02:56,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:02:56,699 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 984 transitions. [2019-10-02 12:02:56,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-02 12:02:56,707 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:02:56,708 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:02:56,708 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:02:56,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:02:56,709 INFO L82 PathProgramCache]: Analyzing trace with hash -98031894, now seen corresponding path program 1 times [2019-10-02 12:02:56,709 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:02:56,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:02:56,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:02:56,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:02:56,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:02:56,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:02:56,891 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 12:02:56,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:02:56,892 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:02:57,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:02:57,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:02:57,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 3268 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:02:57,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:02:57,557 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:02:57,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:02:57,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:02:57,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:02:57,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:02:57,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:02:57,568 INFO L87 Difference]: Start difference. First operand 625 states and 984 transitions. Second operand 6 states. [2019-10-02 12:02:57,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:02:57,883 INFO L93 Difference]: Finished difference Result 1211 states and 1928 transitions. [2019-10-02 12:02:57,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:02:57,884 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 175 [2019-10-02 12:02:57,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:02:57,892 INFO L225 Difference]: With dead ends: 1211 [2019-10-02 12:02:57,892 INFO L226 Difference]: Without dead ends: 621 [2019-10-02 12:02:57,896 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 175 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:02:57,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2019-10-02 12:02:57,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 621. [2019-10-02 12:02:57,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2019-10-02 12:02:57,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 972 transitions. [2019-10-02 12:02:57,921 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 972 transitions. Word has length 175 [2019-10-02 12:02:57,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:02:57,922 INFO L475 AbstractCegarLoop]: Abstraction has 621 states and 972 transitions. [2019-10-02 12:02:57,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:02:57,922 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 972 transitions. [2019-10-02 12:02:57,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-02 12:02:57,928 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:02:57,928 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:57,928 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:02:57,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:02:57,929 INFO L82 PathProgramCache]: Analyzing trace with hash -862868501, now seen corresponding path program 1 times [2019-10-02 12:02:57,929 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:02:57,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:02:57,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:02:57,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:02:57,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:02:57,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:02:58,088 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-02 12:02:58,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:02:58,089 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:02:58,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:02:58,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:02:58,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 3272 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:02:58,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:02:58,699 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:02:58,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:02:58,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 12:02:58,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:02:58,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:02:58,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:02:58,720 INFO L87 Difference]: Start difference. First operand 621 states and 972 transitions. Second operand 8 states. [2019-10-02 12:02:59,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:02:59,049 INFO L93 Difference]: Finished difference Result 1228 states and 1942 transitions. [2019-10-02 12:02:59,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:02:59,050 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 178 [2019-10-02 12:02:59,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:02:59,058 INFO L225 Difference]: With dead ends: 1228 [2019-10-02 12:02:59,058 INFO L226 Difference]: Without dead ends: 639 [2019-10-02 12:02:59,064 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:02:59,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2019-10-02 12:02:59,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 636. [2019-10-02 12:02:59,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2019-10-02 12:02:59,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 985 transitions. [2019-10-02 12:02:59,100 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 985 transitions. Word has length 178 [2019-10-02 12:02:59,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:02:59,103 INFO L475 AbstractCegarLoop]: Abstraction has 636 states and 985 transitions. [2019-10-02 12:02:59,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:02:59,103 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 985 transitions. [2019-10-02 12:02:59,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-02 12:02:59,113 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:02:59,113 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:59,114 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:02:59,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:02:59,114 INFO L82 PathProgramCache]: Analyzing trace with hash -231579797, now seen corresponding path program 1 times [2019-10-02 12:02:59,114 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:02:59,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:02:59,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:02:59,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:02:59,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:02:59,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:02:59,393 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 12:02:59,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:02:59,397 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:02:59,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:02:59,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:00,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 3268 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 12:03:00,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:03:00,155 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:03:00,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:03:00,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2019-10-02 12:03:00,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:03:00,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:03:00,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:03:00,175 INFO L87 Difference]: Start difference. First operand 636 states and 985 transitions. Second operand 14 states. [2019-10-02 12:03:00,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:00,516 INFO L93 Difference]: Finished difference Result 1218 states and 1907 transitions. [2019-10-02 12:03:00,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:03:00,517 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 178 [2019-10-02 12:03:00,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:00,524 INFO L225 Difference]: With dead ends: 1218 [2019-10-02 12:03:00,525 INFO L226 Difference]: Without dead ends: 630 [2019-10-02 12:03:00,529 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:03:00,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-10-02 12:03:00,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 625. [2019-10-02 12:03:00,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625 states. [2019-10-02 12:03:00,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 965 transitions. [2019-10-02 12:03:00,556 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 965 transitions. Word has length 178 [2019-10-02 12:03:00,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:00,556 INFO L475 AbstractCegarLoop]: Abstraction has 625 states and 965 transitions. [2019-10-02 12:03:00,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 12:03:00,557 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 965 transitions. [2019-10-02 12:03:00,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-10-02 12:03:00,562 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:00,562 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:03:00,563 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:00,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:00,563 INFO L82 PathProgramCache]: Analyzing trace with hash 922691447, now seen corresponding path program 1 times [2019-10-02 12:03:00,563 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:00,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:00,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:00,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:00,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:00,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:00,713 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-02 12:03:00,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:03:00,714 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:03:00,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:01,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:01,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 3275 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:03:01,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:03:01,414 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:03:01,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:03:01,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 12:03:01,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:03:01,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:03:01,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:03:01,429 INFO L87 Difference]: Start difference. First operand 625 states and 965 transitions. Second operand 8 states. [2019-10-02 12:03:01,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:01,636 INFO L93 Difference]: Finished difference Result 1200 states and 1876 transitions. [2019-10-02 12:03:01,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:03:01,637 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 181 [2019-10-02 12:03:01,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:01,643 INFO L225 Difference]: With dead ends: 1200 [2019-10-02 12:03:01,643 INFO L226 Difference]: Without dead ends: 625 [2019-10-02 12:03:01,646 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:03:01,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2019-10-02 12:03:01,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 625. [2019-10-02 12:03:01,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625 states. [2019-10-02 12:03:01,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 964 transitions. [2019-10-02 12:03:01,672 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 964 transitions. Word has length 181 [2019-10-02 12:03:01,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:01,672 INFO L475 AbstractCegarLoop]: Abstraction has 625 states and 964 transitions. [2019-10-02 12:03:01,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:03:01,672 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 964 transitions. [2019-10-02 12:03:01,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-10-02 12:03:01,677 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:01,678 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:03:01,678 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:01,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:01,678 INFO L82 PathProgramCache]: Analyzing trace with hash -937209397, now seen corresponding path program 1 times [2019-10-02 12:03:01,679 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:01,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:01,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:01,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:01,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:01,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:01,825 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-02 12:03:01,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:03:01,826 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:03:01,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:02,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:02,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 3276 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:03:02,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:03:02,647 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:03:02,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:03:02,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 12:03:02,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:03:02,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:03:02,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:03:02,667 INFO L87 Difference]: Start difference. First operand 625 states and 964 transitions. Second operand 8 states. [2019-10-02 12:03:02,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:02,867 INFO L93 Difference]: Finished difference Result 1200 states and 1875 transitions. [2019-10-02 12:03:02,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:03:02,868 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 182 [2019-10-02 12:03:02,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:02,875 INFO L225 Difference]: With dead ends: 1200 [2019-10-02 12:03:02,875 INFO L226 Difference]: Without dead ends: 625 [2019-10-02 12:03:02,880 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:03:02,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2019-10-02 12:03:02,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 625. [2019-10-02 12:03:02,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625 states. [2019-10-02 12:03:02,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 963 transitions. [2019-10-02 12:03:02,905 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 963 transitions. Word has length 182 [2019-10-02 12:03:02,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:02,906 INFO L475 AbstractCegarLoop]: Abstraction has 625 states and 963 transitions. [2019-10-02 12:03:02,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:03:02,906 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 963 transitions. [2019-10-02 12:03:02,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-10-02 12:03:02,911 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:02,911 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:03:02,912 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:02,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:02,912 INFO L82 PathProgramCache]: Analyzing trace with hash -360710894, now seen corresponding path program 1 times [2019-10-02 12:03:02,912 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:02,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:02,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:02,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:02,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:02,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:03,197 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 12:03:03,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:03:03,197 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:03:03,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:03,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:03,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 3277 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 12:03:03,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:03:04,026 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-02 12:03:04,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:03:04,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 18 [2019-10-02 12:03:04,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 12:03:04,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 12:03:04,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-10-02 12:03:04,041 INFO L87 Difference]: Start difference. First operand 625 states and 963 transitions. Second operand 18 states. [2019-10-02 12:03:04,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:04,662 INFO L93 Difference]: Finished difference Result 1216 states and 1902 transitions. [2019-10-02 12:03:04,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 12:03:04,662 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 183 [2019-10-02 12:03:04,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:04,668 INFO L225 Difference]: With dead ends: 1216 [2019-10-02 12:03:04,669 INFO L226 Difference]: Without dead ends: 640 [2019-10-02 12:03:04,673 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-10-02 12:03:04,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2019-10-02 12:03:04,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 636. [2019-10-02 12:03:04,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2019-10-02 12:03:04,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 971 transitions. [2019-10-02 12:03:04,699 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 971 transitions. Word has length 183 [2019-10-02 12:03:04,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:04,701 INFO L475 AbstractCegarLoop]: Abstraction has 636 states and 971 transitions. [2019-10-02 12:03:04,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 12:03:04,701 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 971 transitions. [2019-10-02 12:03:04,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-10-02 12:03:04,706 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:04,707 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:03:04,707 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:04,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:04,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1347578447, now seen corresponding path program 1 times [2019-10-02 12:03:04,707 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:04,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:04,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:04,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:04,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:04,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:04,942 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-02 12:03:04,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:03:04,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:03:04,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:03:04,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:03:04,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:03:04,946 INFO L87 Difference]: Start difference. First operand 636 states and 971 transitions. Second operand 9 states. [2019-10-02 12:03:05,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:05,165 INFO L93 Difference]: Finished difference Result 1147 states and 1798 transitions. [2019-10-02 12:03:05,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:03:05,166 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 184 [2019-10-02 12:03:05,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:05,176 INFO L225 Difference]: With dead ends: 1147 [2019-10-02 12:03:05,176 INFO L226 Difference]: Without dead ends: 633 [2019-10-02 12:03:05,181 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:03:05,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2019-10-02 12:03:05,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 633. [2019-10-02 12:03:05,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2019-10-02 12:03:05,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 966 transitions. [2019-10-02 12:03:05,215 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 966 transitions. Word has length 184 [2019-10-02 12:03:05,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:05,215 INFO L475 AbstractCegarLoop]: Abstraction has 633 states and 966 transitions. [2019-10-02 12:03:05,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:03:05,216 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 966 transitions. [2019-10-02 12:03:05,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-10-02 12:03:05,224 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:05,224 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:03:05,224 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:05,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:05,225 INFO L82 PathProgramCache]: Analyzing trace with hash 107211580, now seen corresponding path program 1 times [2019-10-02 12:03:05,225 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:05,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:05,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:05,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:05,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:05,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:05,452 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 12:03:05,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:03:05,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:03:05,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:03:05,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:03:05,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:03:05,456 INFO L87 Difference]: Start difference. First operand 633 states and 966 transitions. Second operand 7 states. [2019-10-02 12:03:05,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:05,570 INFO L93 Difference]: Finished difference Result 1144 states and 1793 transitions. [2019-10-02 12:03:05,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:03:05,571 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 185 [2019-10-02 12:03:05,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:05,577 INFO L225 Difference]: With dead ends: 1144 [2019-10-02 12:03:05,577 INFO L226 Difference]: Without dead ends: 612 [2019-10-02 12:03:05,581 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:03:05,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-10-02 12:03:05,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 610. [2019-10-02 12:03:05,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-10-02 12:03:05,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 936 transitions. [2019-10-02 12:03:05,605 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 936 transitions. Word has length 185 [2019-10-02 12:03:05,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:05,605 INFO L475 AbstractCegarLoop]: Abstraction has 610 states and 936 transitions. [2019-10-02 12:03:05,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:03:05,605 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 936 transitions. [2019-10-02 12:03:05,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-10-02 12:03:05,611 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:05,611 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:05,612 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:05,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:05,612 INFO L82 PathProgramCache]: Analyzing trace with hash 377493183, now seen corresponding path program 1 times [2019-10-02 12:03:05,612 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:05,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:05,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:05,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:05,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:05,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:05,861 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-02 12:03:05,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:03:05,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 12:03:05,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 12:03:05,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 12:03:05,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:03:05,863 INFO L87 Difference]: Start difference. First operand 610 states and 936 transitions. Second operand 13 states. [2019-10-02 12:03:06,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:06,197 INFO L93 Difference]: Finished difference Result 1122 states and 1761 transitions. [2019-10-02 12:03:06,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 12:03:06,198 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 185 [2019-10-02 12:03:06,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:06,202 INFO L225 Difference]: With dead ends: 1122 [2019-10-02 12:03:06,203 INFO L226 Difference]: Without dead ends: 603 [2019-10-02 12:03:06,206 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-10-02 12:03:06,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-10-02 12:03:06,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 603. [2019-10-02 12:03:06,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-10-02 12:03:06,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 927 transitions. [2019-10-02 12:03:06,229 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 927 transitions. Word has length 185 [2019-10-02 12:03:06,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:06,229 INFO L475 AbstractCegarLoop]: Abstraction has 603 states and 927 transitions. [2019-10-02 12:03:06,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 12:03:06,229 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 927 transitions. [2019-10-02 12:03:06,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-10-02 12:03:06,235 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:06,235 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:03:06,235 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:06,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:06,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1817636718, now seen corresponding path program 1 times [2019-10-02 12:03:06,236 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:06,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:06,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:06,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:06,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:06,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:06,512 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-02 12:03:06,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:03:06,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 12:03:06,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 12:03:06,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 12:03:06,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:03:06,515 INFO L87 Difference]: Start difference. First operand 603 states and 927 transitions. Second operand 13 states. [2019-10-02 12:03:06,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:06,843 INFO L93 Difference]: Finished difference Result 1173 states and 1829 transitions. [2019-10-02 12:03:06,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 12:03:06,843 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 186 [2019-10-02 12:03:06,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:06,850 INFO L225 Difference]: With dead ends: 1173 [2019-10-02 12:03:06,850 INFO L226 Difference]: Without dead ends: 617 [2019-10-02 12:03:06,854 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-10-02 12:03:06,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-10-02 12:03:06,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 615. [2019-10-02 12:03:06,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2019-10-02 12:03:06,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 942 transitions. [2019-10-02 12:03:06,877 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 942 transitions. Word has length 186 [2019-10-02 12:03:06,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:06,878 INFO L475 AbstractCegarLoop]: Abstraction has 615 states and 942 transitions. [2019-10-02 12:03:06,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 12:03:06,878 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 942 transitions. [2019-10-02 12:03:06,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-10-02 12:03:06,883 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:06,883 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:06,884 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:06,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:06,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1074843484, now seen corresponding path program 1 times [2019-10-02 12:03:06,884 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:06,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:06,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:06,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:06,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:06,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:07,081 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 12:03:07,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:03:07,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:03:07,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:03:07,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:03:07,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:03:07,083 INFO L87 Difference]: Start difference. First operand 615 states and 942 transitions. Second operand 11 states. [2019-10-02 12:03:07,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:07,328 INFO L93 Difference]: Finished difference Result 1127 states and 1767 transitions. [2019-10-02 12:03:07,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:03:07,329 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 187 [2019-10-02 12:03:07,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:07,334 INFO L225 Difference]: With dead ends: 1127 [2019-10-02 12:03:07,334 INFO L226 Difference]: Without dead ends: 615 [2019-10-02 12:03:07,341 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:03:07,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2019-10-02 12:03:07,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 615. [2019-10-02 12:03:07,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2019-10-02 12:03:07,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 941 transitions. [2019-10-02 12:03:07,361 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 941 transitions. Word has length 187 [2019-10-02 12:03:07,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:07,362 INFO L475 AbstractCegarLoop]: Abstraction has 615 states and 941 transitions. [2019-10-02 12:03:07,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:03:07,362 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 941 transitions. [2019-10-02 12:03:07,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-10-02 12:03:07,366 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:07,367 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:03:07,367 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:07,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:07,367 INFO L82 PathProgramCache]: Analyzing trace with hash 834371519, now seen corresponding path program 1 times [2019-10-02 12:03:07,368 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:07,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:07,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:07,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:07,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:07,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:07,575 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 12:03:07,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:03:07,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:03:07,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:03:07,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:03:07,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:03:07,577 INFO L87 Difference]: Start difference. First operand 615 states and 941 transitions. Second operand 11 states. [2019-10-02 12:03:07,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:07,844 INFO L93 Difference]: Finished difference Result 1173 states and 1820 transitions. [2019-10-02 12:03:07,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:03:07,845 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 188 [2019-10-02 12:03:07,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:07,850 INFO L225 Difference]: With dead ends: 1173 [2019-10-02 12:03:07,850 INFO L226 Difference]: Without dead ends: 612 [2019-10-02 12:03:07,853 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:03:07,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-10-02 12:03:07,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2019-10-02 12:03:07,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-10-02 12:03:07,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 933 transitions. [2019-10-02 12:03:07,873 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 933 transitions. Word has length 188 [2019-10-02 12:03:07,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:07,874 INFO L475 AbstractCegarLoop]: Abstraction has 612 states and 933 transitions. [2019-10-02 12:03:07,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:03:07,875 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 933 transitions. [2019-10-02 12:03:07,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-10-02 12:03:07,880 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:07,880 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:03:07,880 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:07,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:07,881 INFO L82 PathProgramCache]: Analyzing trace with hash 138024479, now seen corresponding path program 1 times [2019-10-02 12:03:07,881 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:07,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:07,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:07,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:07,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:07,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:08,064 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 12:03:08,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:03:08,065 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:03:08,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:08,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:08,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 3283 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:03:08,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:03:08,711 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 12:03:08,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:03:08,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-10-02 12:03:08,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:03:08,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:03:08,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:03:08,731 INFO L87 Difference]: Start difference. First operand 612 states and 933 transitions. Second operand 9 states. [2019-10-02 12:03:10,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:10,011 INFO L93 Difference]: Finished difference Result 1119 states and 1779 transitions. [2019-10-02 12:03:10,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:03:10,011 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 189 [2019-10-02 12:03:10,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:10,016 INFO L225 Difference]: With dead ends: 1119 [2019-10-02 12:03:10,016 INFO L226 Difference]: Without dead ends: 616 [2019-10-02 12:03:10,020 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 187 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:03:10,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2019-10-02 12:03:10,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 616. [2019-10-02 12:03:10,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2019-10-02 12:03:10,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 937 transitions. [2019-10-02 12:03:10,042 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 937 transitions. Word has length 189 [2019-10-02 12:03:10,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:10,043 INFO L475 AbstractCegarLoop]: Abstraction has 616 states and 937 transitions. [2019-10-02 12:03:10,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:03:10,043 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 937 transitions. [2019-10-02 12:03:10,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-10-02 12:03:10,048 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:10,048 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:03:10,049 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:10,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:10,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1103194685, now seen corresponding path program 1 times [2019-10-02 12:03:10,049 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:10,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:10,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:10,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:10,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:10,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:10,221 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 12:03:10,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:03:10,222 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:03:10,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:10,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:10,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 3285 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:03:10,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:03:10,881 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 12:03:10,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:03:10,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-10-02 12:03:10,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:03:10,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:03:10,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:03:10,892 INFO L87 Difference]: Start difference. First operand 616 states and 937 transitions. Second operand 9 states. [2019-10-02 12:03:12,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:12,161 INFO L93 Difference]: Finished difference Result 1128 states and 1786 transitions. [2019-10-02 12:03:12,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:03:12,162 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 191 [2019-10-02 12:03:12,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:12,167 INFO L225 Difference]: With dead ends: 1128 [2019-10-02 12:03:12,167 INFO L226 Difference]: Without dead ends: 621 [2019-10-02 12:03:12,171 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 190 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:03:12,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2019-10-02 12:03:12,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 621. [2019-10-02 12:03:12,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2019-10-02 12:03:12,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 942 transitions. [2019-10-02 12:03:12,209 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 942 transitions. Word has length 191 [2019-10-02 12:03:12,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:12,210 INFO L475 AbstractCegarLoop]: Abstraction has 621 states and 942 transitions. [2019-10-02 12:03:12,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:03:12,210 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 942 transitions. [2019-10-02 12:03:12,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-10-02 12:03:12,215 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:12,215 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:03:12,216 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:12,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:12,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1039013023, now seen corresponding path program 1 times [2019-10-02 12:03:12,216 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:12,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:12,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:12,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:12,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:12,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:12,403 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 12:03:12,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:03:12,404 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:03:12,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:13,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:13,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 3287 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:03:13,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:03:13,122 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 12:03:13,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:03:13,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-10-02 12:03:13,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:03:13,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:03:13,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:03:13,131 INFO L87 Difference]: Start difference. First operand 621 states and 942 transitions. Second operand 9 states. [2019-10-02 12:03:14,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:14,369 INFO L93 Difference]: Finished difference Result 1139 states and 1795 transitions. [2019-10-02 12:03:14,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:03:14,370 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 193 [2019-10-02 12:03:14,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:14,375 INFO L225 Difference]: With dead ends: 1139 [2019-10-02 12:03:14,376 INFO L226 Difference]: Without dead ends: 627 [2019-10-02 12:03:14,379 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 192 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:03:14,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2019-10-02 12:03:14,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 627. [2019-10-02 12:03:14,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-10-02 12:03:14,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 948 transitions. [2019-10-02 12:03:14,400 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 948 transitions. Word has length 193 [2019-10-02 12:03:14,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:14,401 INFO L475 AbstractCegarLoop]: Abstraction has 627 states and 948 transitions. [2019-10-02 12:03:14,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:03:14,401 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 948 transitions. [2019-10-02 12:03:14,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-10-02 12:03:14,405 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:14,405 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:03:14,405 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:14,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:14,406 INFO L82 PathProgramCache]: Analyzing trace with hash 446068923, now seen corresponding path program 1 times [2019-10-02 12:03:14,406 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:14,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:14,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:14,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:14,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:14,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:14,565 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 12:03:14,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:03:14,565 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:03:14,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:15,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:15,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 3289 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:03:15,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:03:15,206 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 12:03:15,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:03:15,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-10-02 12:03:15,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:03:15,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:03:15,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:03:15,224 INFO L87 Difference]: Start difference. First operand 627 states and 948 transitions. Second operand 9 states. [2019-10-02 12:03:16,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:16,402 INFO L93 Difference]: Finished difference Result 1152 states and 1806 transitions. [2019-10-02 12:03:16,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:03:16,405 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 195 [2019-10-02 12:03:16,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:16,410 INFO L225 Difference]: With dead ends: 1152 [2019-10-02 12:03:16,410 INFO L226 Difference]: Without dead ends: 634 [2019-10-02 12:03:16,412 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 194 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:03:16,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2019-10-02 12:03:16,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 634. [2019-10-02 12:03:16,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2019-10-02 12:03:16,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 955 transitions. [2019-10-02 12:03:16,432 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 955 transitions. Word has length 195 [2019-10-02 12:03:16,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:16,432 INFO L475 AbstractCegarLoop]: Abstraction has 634 states and 955 transitions. [2019-10-02 12:03:16,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:03:16,432 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 955 transitions. [2019-10-02 12:03:16,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-10-02 12:03:16,436 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:16,436 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:03:16,437 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:16,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:16,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1735732961, now seen corresponding path program 1 times [2019-10-02 12:03:16,437 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:16,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:16,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:16,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:16,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:16,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:16,638 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 12:03:16,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:03:16,639 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:03:16,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:17,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:17,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 3291 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:03:17,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:03:17,349 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-02 12:03:17,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:03:17,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-10-02 12:03:17,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:03:17,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:03:17,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:03:17,359 INFO L87 Difference]: Start difference. First operand 634 states and 955 transitions. Second operand 14 states. [2019-10-02 12:03:28,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:28,960 INFO L93 Difference]: Finished difference Result 1812 states and 2843 transitions. [2019-10-02 12:03:28,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 12:03:28,960 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 197 [2019-10-02 12:03:28,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:28,971 INFO L225 Difference]: With dead ends: 1812 [2019-10-02 12:03:28,971 INFO L226 Difference]: Without dead ends: 1287 [2019-10-02 12:03:28,975 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 215 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=196, Invalid=994, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 12:03:28,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2019-10-02 12:03:29,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 1231. [2019-10-02 12:03:29,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1231 states. [2019-10-02 12:03:29,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 1912 transitions. [2019-10-02 12:03:29,030 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 1912 transitions. Word has length 197 [2019-10-02 12:03:29,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:29,030 INFO L475 AbstractCegarLoop]: Abstraction has 1231 states and 1912 transitions. [2019-10-02 12:03:29,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 12:03:29,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 1912 transitions. [2019-10-02 12:03:29,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-10-02 12:03:29,038 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:29,038 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:03:29,039 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:29,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:29,039 INFO L82 PathProgramCache]: Analyzing trace with hash 793054709, now seen corresponding path program 1 times [2019-10-02 12:03:29,039 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:29,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:29,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:29,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:29,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:29,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:29,204 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 12:03:29,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:03:29,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:03:29,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:03:29,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:03:29,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:03:29,206 INFO L87 Difference]: Start difference. First operand 1231 states and 1912 transitions. Second operand 9 states. [2019-10-02 12:03:29,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:29,371 INFO L93 Difference]: Finished difference Result 1763 states and 2753 transitions. [2019-10-02 12:03:29,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:03:29,372 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 205 [2019-10-02 12:03:29,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:29,377 INFO L225 Difference]: With dead ends: 1763 [2019-10-02 12:03:29,377 INFO L226 Difference]: Without dead ends: 630 [2019-10-02 12:03:29,383 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:03:29,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-10-02 12:03:29,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2019-10-02 12:03:29,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-10-02 12:03:29,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 944 transitions. [2019-10-02 12:03:29,409 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 944 transitions. Word has length 205 [2019-10-02 12:03:29,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:29,409 INFO L475 AbstractCegarLoop]: Abstraction has 630 states and 944 transitions. [2019-10-02 12:03:29,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:03:29,410 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 944 transitions. [2019-10-02 12:03:29,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-10-02 12:03:29,413 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:29,413 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:03:29,414 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:29,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:29,414 INFO L82 PathProgramCache]: Analyzing trace with hash 2054421205, now seen corresponding path program 1 times [2019-10-02 12:03:29,414 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:29,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:29,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:29,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:29,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:29,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:29,623 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-10-02 12:03:29,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:03:29,624 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:03:29,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:30,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:30,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 3326 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 12:03:30,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:03:30,313 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:03:30,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:03:30,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2019-10-02 12:03:30,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:03:30,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:03:30,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:03:30,324 INFO L87 Difference]: Start difference. First operand 630 states and 944 transitions. Second operand 14 states. [2019-10-02 12:03:35,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:35,596 INFO L93 Difference]: Finished difference Result 1201 states and 1861 transitions. [2019-10-02 12:03:35,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 12:03:35,596 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 209 [2019-10-02 12:03:35,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:35,601 INFO L225 Difference]: With dead ends: 1201 [2019-10-02 12:03:35,601 INFO L226 Difference]: Without dead ends: 678 [2019-10-02 12:03:35,604 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2019-10-02 12:03:35,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2019-10-02 12:03:35,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 641. [2019-10-02 12:03:35,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-10-02 12:03:35,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 959 transitions. [2019-10-02 12:03:35,630 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 959 transitions. Word has length 209 [2019-10-02 12:03:35,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:35,631 INFO L475 AbstractCegarLoop]: Abstraction has 641 states and 959 transitions. [2019-10-02 12:03:35,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 12:03:35,631 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 959 transitions. [2019-10-02 12:03:35,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-10-02 12:03:35,634 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:35,635 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:03:35,635 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:35,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:35,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1361207174, now seen corresponding path program 1 times [2019-10-02 12:03:35,636 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:35,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:35,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:35,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:35,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:35,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:35,822 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 12:03:35,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:03:35,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:03:35,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:03:35,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:03:35,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:03:35,823 INFO L87 Difference]: Start difference. First operand 641 states and 959 transitions. Second operand 11 states. [2019-10-02 12:03:39,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:39,920 INFO L93 Difference]: Finished difference Result 1173 states and 1806 transitions. [2019-10-02 12:03:39,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:03:39,920 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 216 [2019-10-02 12:03:39,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:39,926 INFO L225 Difference]: With dead ends: 1173 [2019-10-02 12:03:39,927 INFO L226 Difference]: Without dead ends: 639 [2019-10-02 12:03:39,929 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:03:39,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2019-10-02 12:03:39,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2019-10-02 12:03:39,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-10-02 12:03:39,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 955 transitions. [2019-10-02 12:03:39,955 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 955 transitions. Word has length 216 [2019-10-02 12:03:39,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:39,955 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 955 transitions. [2019-10-02 12:03:39,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:03:39,956 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 955 transitions. [2019-10-02 12:03:39,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-10-02 12:03:39,959 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:39,959 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:03:39,960 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:39,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:39,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1940586207, now seen corresponding path program 1 times [2019-10-02 12:03:39,960 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:39,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:39,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:39,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:39,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:40,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:40,133 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 12:03:40,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:03:40,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:03:40,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:03:40,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:03:40,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:03:40,136 INFO L87 Difference]: Start difference. First operand 639 states and 955 transitions. Second operand 9 states. [2019-10-02 12:03:45,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:45,470 INFO L93 Difference]: Finished difference Result 1902 states and 2958 transitions. [2019-10-02 12:03:45,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 12:03:45,471 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 218 [2019-10-02 12:03:45,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:45,478 INFO L225 Difference]: With dead ends: 1902 [2019-10-02 12:03:45,479 INFO L226 Difference]: Without dead ends: 1370 [2019-10-02 12:03:45,481 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2019-10-02 12:03:45,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2019-10-02 12:03:45,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1326. [2019-10-02 12:03:45,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1326 states. [2019-10-02 12:03:45,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1326 states and 2042 transitions. [2019-10-02 12:03:45,540 INFO L78 Accepts]: Start accepts. Automaton has 1326 states and 2042 transitions. Word has length 218 [2019-10-02 12:03:45,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:45,540 INFO L475 AbstractCegarLoop]: Abstraction has 1326 states and 2042 transitions. [2019-10-02 12:03:45,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:03:45,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 2042 transitions. [2019-10-02 12:03:45,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-10-02 12:03:45,544 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:45,545 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:03:45,545 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:45,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:45,545 INFO L82 PathProgramCache]: Analyzing trace with hash -502763883, now seen corresponding path program 1 times [2019-10-02 12:03:45,546 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:45,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:45,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:45,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:45,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:45,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:45,692 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 12:03:45,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:03:45,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:03:45,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:03:45,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:03:45,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:03:45,693 INFO L87 Difference]: Start difference. First operand 1326 states and 2042 transitions. Second operand 7 states. [2019-10-02 12:03:45,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:45,777 INFO L93 Difference]: Finished difference Result 2588 states and 4033 transitions. [2019-10-02 12:03:45,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:03:45,778 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 223 [2019-10-02 12:03:45,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:45,786 INFO L225 Difference]: With dead ends: 2588 [2019-10-02 12:03:45,787 INFO L226 Difference]: Without dead ends: 1369 [2019-10-02 12:03:45,791 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:03:45,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2019-10-02 12:03:45,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 1347. [2019-10-02 12:03:45,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1347 states. [2019-10-02 12:03:45,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 2066 transitions. [2019-10-02 12:03:45,856 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 2066 transitions. Word has length 223 [2019-10-02 12:03:45,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:45,857 INFO L475 AbstractCegarLoop]: Abstraction has 1347 states and 2066 transitions. [2019-10-02 12:03:45,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:03:45,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 2066 transitions. [2019-10-02 12:03:45,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-10-02 12:03:45,863 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:45,864 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:03:45,864 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:45,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:45,864 INFO L82 PathProgramCache]: Analyzing trace with hash 2131868925, now seen corresponding path program 1 times [2019-10-02 12:03:45,864 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:45,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:45,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:45,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:45,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:45,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:46,129 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 12:03:46,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:03:46,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:03:46,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:03:46,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:03:46,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:03:46,132 INFO L87 Difference]: Start difference. First operand 1347 states and 2066 transitions. Second operand 8 states. [2019-10-02 12:03:51,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:51,111 INFO L93 Difference]: Finished difference Result 4198 states and 6603 transitions. [2019-10-02 12:03:51,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:03:51,112 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 227 [2019-10-02 12:03:51,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:51,140 INFO L225 Difference]: With dead ends: 4198 [2019-10-02 12:03:51,140 INFO L226 Difference]: Without dead ends: 2956 [2019-10-02 12:03:51,151 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:03:51,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2019-10-02 12:03:51,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 2919. [2019-10-02 12:03:51,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2919 states. [2019-10-02 12:03:51,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2919 states to 2919 states and 4522 transitions. [2019-10-02 12:03:51,352 INFO L78 Accepts]: Start accepts. Automaton has 2919 states and 4522 transitions. Word has length 227 [2019-10-02 12:03:51,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:51,353 INFO L475 AbstractCegarLoop]: Abstraction has 2919 states and 4522 transitions. [2019-10-02 12:03:51,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:03:51,353 INFO L276 IsEmpty]: Start isEmpty. Operand 2919 states and 4522 transitions. [2019-10-02 12:03:51,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-02 12:03:51,359 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:51,361 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:03:51,362 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:51,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:51,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1585475037, now seen corresponding path program 1 times [2019-10-02 12:03:51,363 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:51,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:51,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:51,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:51,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:51,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:51,636 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 12:03:51,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:03:51,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:03:51,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:03:51,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:03:51,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:03:51,638 INFO L87 Difference]: Start difference. First operand 2919 states and 4522 transitions. Second operand 9 states. [2019-10-02 12:03:52,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:52,085 INFO L93 Difference]: Finished difference Result 5660 states and 8948 transitions. [2019-10-02 12:03:52,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:03:52,085 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 230 [2019-10-02 12:03:52,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:52,112 INFO L225 Difference]: With dead ends: 5660 [2019-10-02 12:03:52,113 INFO L226 Difference]: Without dead ends: 2919 [2019-10-02 12:03:52,129 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:03:52,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2919 states. [2019-10-02 12:03:52,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2919 to 2919. [2019-10-02 12:03:52,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2919 states. [2019-10-02 12:03:52,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2919 states to 2919 states and 4476 transitions. [2019-10-02 12:03:52,316 INFO L78 Accepts]: Start accepts. Automaton has 2919 states and 4476 transitions. Word has length 230 [2019-10-02 12:03:52,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:52,316 INFO L475 AbstractCegarLoop]: Abstraction has 2919 states and 4476 transitions. [2019-10-02 12:03:52,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:03:52,317 INFO L276 IsEmpty]: Start isEmpty. Operand 2919 states and 4476 transitions. [2019-10-02 12:03:52,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-10-02 12:03:52,320 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:52,320 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:03:52,321 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:52,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:52,321 INFO L82 PathProgramCache]: Analyzing trace with hash 770197530, now seen corresponding path program 1 times [2019-10-02 12:03:52,321 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:52,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:52,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:52,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:52,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:52,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:52,507 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-10-02 12:03:52,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:03:52,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:03:52,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:03:52,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:03:52,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:03:52,511 INFO L87 Difference]: Start difference. First operand 2919 states and 4476 transitions. Second operand 7 states. [2019-10-02 12:03:56,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:56,571 INFO L93 Difference]: Finished difference Result 5456 states and 8427 transitions. [2019-10-02 12:03:56,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 12:03:56,571 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 235 [2019-10-02 12:03:56,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:56,589 INFO L225 Difference]: With dead ends: 5456 [2019-10-02 12:03:56,589 INFO L226 Difference]: Without dead ends: 3102 [2019-10-02 12:03:56,600 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:03:56,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3102 states. [2019-10-02 12:03:56,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3102 to 3035. [2019-10-02 12:03:56,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3035 states. [2019-10-02 12:03:56,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3035 states to 3035 states and 4633 transitions. [2019-10-02 12:03:56,740 INFO L78 Accepts]: Start accepts. Automaton has 3035 states and 4633 transitions. Word has length 235 [2019-10-02 12:03:56,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:56,741 INFO L475 AbstractCegarLoop]: Abstraction has 3035 states and 4633 transitions. [2019-10-02 12:03:56,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:03:56,741 INFO L276 IsEmpty]: Start isEmpty. Operand 3035 states and 4633 transitions. [2019-10-02 12:03:56,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-10-02 12:03:56,745 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:56,745 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:03:56,746 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:56,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:56,746 INFO L82 PathProgramCache]: Analyzing trace with hash 670543760, now seen corresponding path program 1 times [2019-10-02 12:03:56,746 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:56,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:56,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:56,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:56,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:56,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:56,930 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-10-02 12:03:56,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:03:56,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:03:56,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:03:56,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:03:56,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:03:56,932 INFO L87 Difference]: Start difference. First operand 3035 states and 4633 transitions. Second operand 8 states. [2019-10-02 12:03:57,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:57,030 INFO L93 Difference]: Finished difference Result 3058 states and 4662 transitions. [2019-10-02 12:03:57,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:03:57,030 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 240 [2019-10-02 12:03:57,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:57,047 INFO L225 Difference]: With dead ends: 3058 [2019-10-02 12:03:57,048 INFO L226 Difference]: Without dead ends: 3041 [2019-10-02 12:03:57,050 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:03:57,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3041 states. [2019-10-02 12:03:57,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3041 to 3035. [2019-10-02 12:03:57,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3035 states. [2019-10-02 12:03:57,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3035 states to 3035 states and 4628 transitions. [2019-10-02 12:03:57,182 INFO L78 Accepts]: Start accepts. Automaton has 3035 states and 4628 transitions. Word has length 240 [2019-10-02 12:03:57,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:57,183 INFO L475 AbstractCegarLoop]: Abstraction has 3035 states and 4628 transitions. [2019-10-02 12:03:57,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:03:57,183 INFO L276 IsEmpty]: Start isEmpty. Operand 3035 states and 4628 transitions. [2019-10-02 12:03:57,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-10-02 12:03:57,187 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:57,188 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:03:57,188 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:57,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:57,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1491797122, now seen corresponding path program 1 times [2019-10-02 12:03:57,188 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:57,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:57,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:57,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:57,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:57,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:57,409 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-10-02 12:03:57,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:03:57,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:03:57,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:03:57,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:03:57,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:03:57,411 INFO L87 Difference]: Start difference. First operand 3035 states and 4628 transitions. Second operand 9 states. [2019-10-02 12:04:00,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:00,503 INFO L93 Difference]: Finished difference Result 5955 states and 9146 transitions. [2019-10-02 12:04:00,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:04:00,504 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 258 [2019-10-02 12:04:00,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:00,518 INFO L225 Difference]: With dead ends: 5955 [2019-10-02 12:04:00,518 INFO L226 Difference]: Without dead ends: 3039 [2019-10-02 12:04:00,527 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:04:00,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3039 states. [2019-10-02 12:04:00,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3039 to 3035. [2019-10-02 12:04:00,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3035 states. [2019-10-02 12:04:00,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3035 states to 3035 states and 4623 transitions. [2019-10-02 12:04:00,661 INFO L78 Accepts]: Start accepts. Automaton has 3035 states and 4623 transitions. Word has length 258 [2019-10-02 12:04:00,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:00,662 INFO L475 AbstractCegarLoop]: Abstraction has 3035 states and 4623 transitions. [2019-10-02 12:04:00,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:04:00,662 INFO L276 IsEmpty]: Start isEmpty. Operand 3035 states and 4623 transitions. [2019-10-02 12:04:00,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-10-02 12:04:00,666 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:00,666 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:04:00,667 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:00,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:00,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1627955149, now seen corresponding path program 1 times [2019-10-02 12:04:00,667 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:00,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:00,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:00,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:00,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:00,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:00,862 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-10-02 12:04:00,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:04:00,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:04:00,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:04:00,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:04:00,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:04:00,864 INFO L87 Difference]: Start difference. First operand 3035 states and 4623 transitions. Second operand 6 states. [2019-10-02 12:04:04,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:04,641 INFO L93 Difference]: Finished difference Result 9533 states and 14994 transitions. [2019-10-02 12:04:04,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:04:04,641 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 259 [2019-10-02 12:04:04,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:04,675 INFO L225 Difference]: With dead ends: 9533 [2019-10-02 12:04:04,675 INFO L226 Difference]: Without dead ends: 6617 [2019-10-02 12:04:04,685 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:04:04,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6617 states. [2019-10-02 12:04:04,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6617 to 6278. [2019-10-02 12:04:04,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6278 states. [2019-10-02 12:04:05,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6278 states to 6278 states and 9702 transitions. [2019-10-02 12:04:05,006 INFO L78 Accepts]: Start accepts. Automaton has 6278 states and 9702 transitions. Word has length 259 [2019-10-02 12:04:05,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:05,008 INFO L475 AbstractCegarLoop]: Abstraction has 6278 states and 9702 transitions. [2019-10-02 12:04:05,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:04:05,009 INFO L276 IsEmpty]: Start isEmpty. Operand 6278 states and 9702 transitions. [2019-10-02 12:04:05,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-10-02 12:04:05,013 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:05,014 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:04:05,014 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:05,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:05,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1542284448, now seen corresponding path program 1 times [2019-10-02 12:04:05,014 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:05,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:05,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:05,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:05,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:05,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:05,199 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-02 12:04:05,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:04:05,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:04:05,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:04:05,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:04:05,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:04:05,201 INFO L87 Difference]: Start difference. First operand 6278 states and 9702 transitions. Second operand 4 states. [2019-10-02 12:04:05,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:05,960 INFO L93 Difference]: Finished difference Result 12412 states and 19333 transitions. [2019-10-02 12:04:05,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:04:05,963 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 267 [2019-10-02 12:04:05,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:05,999 INFO L225 Difference]: With dead ends: 12412 [2019-10-02 12:04:05,999 INFO L226 Difference]: Without dead ends: 6241 [2019-10-02 12:04:06,017 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:04:06,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6241 states. [2019-10-02 12:04:06,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6241 to 6241. [2019-10-02 12:04:06,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6241 states. [2019-10-02 12:04:06,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6241 states to 6241 states and 9628 transitions. [2019-10-02 12:04:06,348 INFO L78 Accepts]: Start accepts. Automaton has 6241 states and 9628 transitions. Word has length 267 [2019-10-02 12:04:06,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:06,349 INFO L475 AbstractCegarLoop]: Abstraction has 6241 states and 9628 transitions. [2019-10-02 12:04:06,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:04:06,349 INFO L276 IsEmpty]: Start isEmpty. Operand 6241 states and 9628 transitions. [2019-10-02 12:04:06,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-10-02 12:04:06,354 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:06,354 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:04:06,354 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:06,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:06,355 INFO L82 PathProgramCache]: Analyzing trace with hash -566475387, now seen corresponding path program 1 times [2019-10-02 12:04:06,355 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:06,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:06,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:06,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:06,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:06,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:06,801 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-02 12:04:06,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:04:06,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 12:04:06,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 12:04:06,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 12:04:06,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:04:06,803 INFO L87 Difference]: Start difference. First operand 6241 states and 9628 transitions. Second operand 10 states. [2019-10-02 12:04:07,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:07,086 INFO L93 Difference]: Finished difference Result 6317 states and 9722 transitions. [2019-10-02 12:04:07,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:04:07,087 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 268 [2019-10-02 12:04:07,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:07,127 INFO L225 Difference]: With dead ends: 6317 [2019-10-02 12:04:07,127 INFO L226 Difference]: Without dead ends: 6301 [2019-10-02 12:04:07,133 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:04:07,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6301 states. [2019-10-02 12:04:07,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6301 to 6276. [2019-10-02 12:04:07,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6276 states. [2019-10-02 12:04:07,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6276 states to 6276 states and 9658 transitions. [2019-10-02 12:04:07,489 INFO L78 Accepts]: Start accepts. Automaton has 6276 states and 9658 transitions. Word has length 268 [2019-10-02 12:04:07,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:07,490 INFO L475 AbstractCegarLoop]: Abstraction has 6276 states and 9658 transitions. [2019-10-02 12:04:07,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 12:04:07,490 INFO L276 IsEmpty]: Start isEmpty. Operand 6276 states and 9658 transitions. [2019-10-02 12:04:07,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2019-10-02 12:04:07,496 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:07,497 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:07,497 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:07,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:07,497 INFO L82 PathProgramCache]: Analyzing trace with hash 121322402, now seen corresponding path program 1 times [2019-10-02 12:04:07,497 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:07,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:07,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:07,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:07,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:07,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:07,840 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 4 proven. 36 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2019-10-02 12:04:07,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:07,841 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:04:07,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:08,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:08,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 4278 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-02 12:04:08,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:08,757 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 4 proven. 49 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2019-10-02 12:04:08,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:04:08,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-10-02 12:04:08,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 12:04:08,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 12:04:08,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:04:08,766 INFO L87 Difference]: Start difference. First operand 6276 states and 9658 transitions. Second operand 15 states. [2019-10-02 12:04:22,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:22,914 INFO L93 Difference]: Finished difference Result 20896 states and 33176 transitions. [2019-10-02 12:04:22,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-10-02 12:04:22,914 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 393 [2019-10-02 12:04:22,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:23,010 INFO L225 Difference]: With dead ends: 20896 [2019-10-02 12:04:23,010 INFO L226 Difference]: Without dead ends: 14707 [2019-10-02 12:04:23,040 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 422 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 892 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=569, Invalid=2293, Unknown=0, NotChecked=0, Total=2862 [2019-10-02 12:04:23,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14707 states. [2019-10-02 12:04:24,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14707 to 14479. [2019-10-02 12:04:24,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14479 states. [2019-10-02 12:04:24,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14479 states to 14479 states and 22258 transitions. [2019-10-02 12:04:24,536 INFO L78 Accepts]: Start accepts. Automaton has 14479 states and 22258 transitions. Word has length 393 [2019-10-02 12:04:24,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:24,537 INFO L475 AbstractCegarLoop]: Abstraction has 14479 states and 22258 transitions. [2019-10-02 12:04:24,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 12:04:24,537 INFO L276 IsEmpty]: Start isEmpty. Operand 14479 states and 22258 transitions. [2019-10-02 12:04:24,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2019-10-02 12:04:24,542 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:24,542 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:24,542 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:24,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:24,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1022612254, now seen corresponding path program 1 times [2019-10-02 12:04:24,543 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:24,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:24,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:24,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:24,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:24,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:24,770 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2019-10-02 12:04:24,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:24,771 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:04:24,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:25,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:25,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 4298 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:04:25,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:25,564 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-10-02 12:04:25,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:04:25,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2019-10-02 12:04:25,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:04:25,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:04:25,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:04:25,574 INFO L87 Difference]: Start difference. First operand 14479 states and 22258 transitions. Second operand 11 states. [2019-10-02 12:04:34,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:34,848 INFO L93 Difference]: Finished difference Result 30709 states and 48501 transitions. [2019-10-02 12:04:34,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-02 12:04:34,849 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 399 [2019-10-02 12:04:34,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:34,907 INFO L225 Difference]: With dead ends: 30709 [2019-10-02 12:04:34,907 INFO L226 Difference]: Without dead ends: 16345 [2019-10-02 12:04:34,941 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 413 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2019-10-02 12:04:34,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16345 states. [2019-10-02 12:04:35,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16345 to 15511. [2019-10-02 12:04:35,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15511 states. [2019-10-02 12:04:35,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15511 states to 15511 states and 24106 transitions. [2019-10-02 12:04:35,549 INFO L78 Accepts]: Start accepts. Automaton has 15511 states and 24106 transitions. Word has length 399 [2019-10-02 12:04:35,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:35,550 INFO L475 AbstractCegarLoop]: Abstraction has 15511 states and 24106 transitions. [2019-10-02 12:04:35,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:04:35,550 INFO L276 IsEmpty]: Start isEmpty. Operand 15511 states and 24106 transitions. [2019-10-02 12:04:35,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-10-02 12:04:35,554 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:35,555 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 7, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:04:35,555 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:35,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:35,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1951538389, now seen corresponding path program 1 times [2019-10-02 12:04:35,555 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:35,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:35,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:35,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:35,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:35,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:35,786 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-10-02 12:04:35,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:35,786 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:04:35,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:36,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:36,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 3573 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-02 12:04:36,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:36,543 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 108 proven. 10 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-10-02 12:04:36,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:04:36,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2019-10-02 12:04:36,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 12:04:36,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 12:04:36,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-10-02 12:04:36,553 INFO L87 Difference]: Start difference. First operand 15511 states and 24106 transitions. Second operand 19 states. [2019-10-02 12:04:46,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:46,506 INFO L93 Difference]: Finished difference Result 47921 states and 75261 transitions. [2019-10-02 12:04:46,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 12:04:46,507 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 302 [2019-10-02 12:04:46,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:46,667 INFO L225 Difference]: With dead ends: 47921 [2019-10-02 12:04:46,667 INFO L226 Difference]: Without dead ends: 32523 [2019-10-02 12:04:46,706 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=777, Unknown=0, NotChecked=0, Total=930 [2019-10-02 12:04:46,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32523 states. [2019-10-02 12:04:47,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32523 to 32467. [2019-10-02 12:04:47,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32467 states. [2019-10-02 12:04:49,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32467 states to 32467 states and 51123 transitions. [2019-10-02 12:04:49,493 INFO L78 Accepts]: Start accepts. Automaton has 32467 states and 51123 transitions. Word has length 302 [2019-10-02 12:04:49,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:49,494 INFO L475 AbstractCegarLoop]: Abstraction has 32467 states and 51123 transitions. [2019-10-02 12:04:49,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 12:04:49,494 INFO L276 IsEmpty]: Start isEmpty. Operand 32467 states and 51123 transitions. [2019-10-02 12:04:49,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2019-10-02 12:04:49,503 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:49,503 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:49,503 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:49,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:49,504 INFO L82 PathProgramCache]: Analyzing trace with hash -678395537, now seen corresponding path program 1 times [2019-10-02 12:04:49,504 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:49,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:49,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:49,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:49,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:49,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:49,714 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2019-10-02 12:04:49,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:49,715 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:04:49,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:50,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:50,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 4304 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:04:50,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:50,496 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-10-02 12:04:50,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:04:50,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2019-10-02 12:04:50,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:04:50,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:04:50,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:04:50,505 INFO L87 Difference]: Start difference. First operand 32467 states and 51123 transitions. Second operand 9 states. [2019-10-02 12:04:52,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:52,257 INFO L93 Difference]: Finished difference Result 66703 states and 106493 transitions. [2019-10-02 12:04:52,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:04:52,257 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 404 [2019-10-02 12:04:52,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:52,403 INFO L225 Difference]: With dead ends: 66703 [2019-10-02 12:04:52,404 INFO L226 Difference]: Without dead ends: 34351 [2019-10-02 12:04:52,469 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 404 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:04:52,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34351 states. [2019-10-02 12:04:53,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34351 to 34339. [2019-10-02 12:04:53,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34339 states. [2019-10-02 12:04:53,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34339 states to 34339 states and 54579 transitions. [2019-10-02 12:04:53,663 INFO L78 Accepts]: Start accepts. Automaton has 34339 states and 54579 transitions. Word has length 404 [2019-10-02 12:04:53,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:53,664 INFO L475 AbstractCegarLoop]: Abstraction has 34339 states and 54579 transitions. [2019-10-02 12:04:53,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:04:53,664 INFO L276 IsEmpty]: Start isEmpty. Operand 34339 states and 54579 transitions. [2019-10-02 12:04:53,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2019-10-02 12:04:53,674 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:53,674 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:53,674 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:53,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:53,675 INFO L82 PathProgramCache]: Analyzing trace with hash -642179231, now seen corresponding path program 1 times [2019-10-02 12:04:53,675 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:53,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:53,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:53,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:53,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:53,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:53,934 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2019-10-02 12:04:53,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:53,934 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:04:54,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:54,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:54,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 4308 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-02 12:04:54,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:55,099 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2019-10-02 12:04:55,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:04:55,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-10-02 12:04:55,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 12:04:55,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 12:04:55,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:04:55,110 INFO L87 Difference]: Start difference. First operand 34339 states and 54579 transitions. Second operand 15 states. [2019-10-02 12:05:11,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:05:11,613 INFO L93 Difference]: Finished difference Result 134723 states and 222685 transitions. [2019-10-02 12:05:11,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-02 12:05:11,615 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 409 [2019-10-02 12:05:11,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:05:12,148 INFO L225 Difference]: With dead ends: 134723 [2019-10-02 12:05:12,148 INFO L226 Difference]: Without dead ends: 100215 [2019-10-02 12:05:12,259 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 431 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=407, Invalid=1573, Unknown=0, NotChecked=0, Total=1980 [2019-10-02 12:05:12,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100215 states. [2019-10-02 12:05:17,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100215 to 99769. [2019-10-02 12:05:17,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99769 states. [2019-10-02 12:05:18,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99769 states to 99769 states and 163421 transitions. [2019-10-02 12:05:18,475 INFO L78 Accepts]: Start accepts. Automaton has 99769 states and 163421 transitions. Word has length 409 [2019-10-02 12:05:18,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:05:18,476 INFO L475 AbstractCegarLoop]: Abstraction has 99769 states and 163421 transitions. [2019-10-02 12:05:18,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 12:05:18,476 INFO L276 IsEmpty]: Start isEmpty. Operand 99769 states and 163421 transitions. [2019-10-02 12:05:18,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2019-10-02 12:05:18,483 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:05:18,483 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 12:05:18,483 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:05:18,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:05:18,484 INFO L82 PathProgramCache]: Analyzing trace with hash 565655457, now seen corresponding path program 1 times [2019-10-02 12:05:18,484 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:05:18,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:05:18,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:18,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:18,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:18,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:19,241 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 49 proven. 16 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-10-02 12:05:19,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:05:19,241 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:05:19,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:19,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:19,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 4037 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 12:05:19,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:05:19,988 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2019-10-02 12:05:19,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:05:19,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2019-10-02 12:05:19,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:05:19,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:05:19,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:05:19,997 INFO L87 Difference]: Start difference. First operand 99769 states and 163421 transitions. Second operand 12 states. [2019-10-02 12:05:41,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:05:41,938 INFO L93 Difference]: Finished difference Result 317718 states and 537902 transitions. [2019-10-02 12:05:41,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-02 12:05:41,939 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 388 [2019-10-02 12:05:41,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:05:46,667 INFO L225 Difference]: With dead ends: 317718 [2019-10-02 12:05:46,668 INFO L226 Difference]: Without dead ends: 216710 [2019-10-02 12:05:46,925 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 399 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=211, Invalid=1195, Unknown=0, NotChecked=0, Total=1406 [2019-10-02 12:05:47,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216710 states. [2019-10-02 12:05:54,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216710 to 215435. [2019-10-02 12:05:54,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215435 states. [2019-10-02 12:05:56,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215435 states to 215435 states and 357209 transitions. [2019-10-02 12:05:56,233 INFO L78 Accepts]: Start accepts. Automaton has 215435 states and 357209 transitions. Word has length 388 [2019-10-02 12:05:56,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:05:56,234 INFO L475 AbstractCegarLoop]: Abstraction has 215435 states and 357209 transitions. [2019-10-02 12:05:56,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:05:56,234 INFO L276 IsEmpty]: Start isEmpty. Operand 215435 states and 357209 transitions. [2019-10-02 12:05:56,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2019-10-02 12:05:56,244 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:05:56,244 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 8, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:05:56,245 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:05:56,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:05:56,245 INFO L82 PathProgramCache]: Analyzing trace with hash -155354026, now seen corresponding path program 1 times [2019-10-02 12:05:56,245 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:05:56,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:05:56,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:56,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:56,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:56,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:56,501 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 8 proven. 21 refuted. 0 times theorem prover too weak. 413 trivial. 0 not checked. [2019-10-02 12:05:56,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:05:56,502 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:05:56,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:57,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:57,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 4143 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 12:05:57,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:06:02,058 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 8 proven. 21 refuted. 0 times theorem prover too weak. 413 trivial. 0 not checked. [2019-10-02 12:06:02,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:06:02,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2019-10-02 12:06:02,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:06:02,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:06:02,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:06:02,072 INFO L87 Difference]: Start difference. First operand 215435 states and 357209 transitions. Second operand 12 states. [2019-10-02 12:06:44,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:44,188 INFO L93 Difference]: Finished difference Result 866863 states and 1488128 transitions. [2019-10-02 12:06:44,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:06:44,188 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 422 [2019-10-02 12:06:44,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:47,930 INFO L225 Difference]: With dead ends: 866863 [2019-10-02 12:06:47,931 INFO L226 Difference]: Without dead ends: 651679 [2019-10-02 12:06:49,310 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 427 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:06:49,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651679 states. [2019-10-02 12:07:47,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651679 to 651661. [2019-10-02 12:07:47,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651661 states. [2019-10-02 12:07:52,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651661 states to 651661 states and 1117895 transitions. [2019-10-02 12:07:52,607 INFO L78 Accepts]: Start accepts. Automaton has 651661 states and 1117895 transitions. Word has length 422 [2019-10-02 12:07:52,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:07:52,608 INFO L475 AbstractCegarLoop]: Abstraction has 651661 states and 1117895 transitions. [2019-10-02 12:07:52,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:07:52,608 INFO L276 IsEmpty]: Start isEmpty. Operand 651661 states and 1117895 transitions. [2019-10-02 12:07:54,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2019-10-02 12:07:54,126 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:07:54,126 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 7, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:07:54,127 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:07:54,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:07:54,127 INFO L82 PathProgramCache]: Analyzing trace with hash -5811428, now seen corresponding path program 1 times [2019-10-02 12:07:54,127 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:07:54,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:07:54,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:54,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:54,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:54,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:54,371 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2019-10-02 12:07:54,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:07:54,372 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:07:54,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:55,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:55,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 4035 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:07:55,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:07:55,207 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 51 proven. 139 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2019-10-02 12:07:55,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:07:55,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-10-02 12:07:55,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:07:55,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:07:55,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:07:55,216 INFO L87 Difference]: Start difference. First operand 651661 states and 1117895 transitions. Second operand 11 states. [2019-10-02 12:09:29,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:09:29,445 INFO L93 Difference]: Finished difference Result 1503105 states and 2768400 transitions. [2019-10-02 12:09:29,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:09:29,445 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 390 [2019-10-02 12:09:29,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:09:37,766 INFO L225 Difference]: With dead ends: 1503105 [2019-10-02 12:09:37,766 INFO L226 Difference]: Without dead ends: 848389 [2019-10-02 12:09:40,538 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 391 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:09:41,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848389 states.