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_product17.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 12:02:43,911 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 12:02:43,914 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 12:02:43,926 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 12:02:43,926 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 12:02:43,928 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 12:02:43,929 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 12:02:43,931 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 12:02:43,933 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 12:02:43,934 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 12:02:43,934 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 12:02:43,936 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 12:02:43,936 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 12:02:43,937 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 12:02:43,938 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 12:02:43,939 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 12:02:43,940 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 12:02:43,941 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 12:02:43,943 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 12:02:43,945 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 12:02:43,946 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 12:02:43,947 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 12:02:43,949 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 12:02:43,949 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 12:02:43,952 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 12:02:43,952 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 12:02:43,952 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 12:02:43,953 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 12:02:43,954 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 12:02:43,955 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 12:02:43,955 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 12:02:43,956 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 12:02:43,957 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 12:02:43,957 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 12:02:43,958 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 12:02:43,959 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 12:02:43,959 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 12:02:43,960 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 12:02:43,960 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 12:02:43,961 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 12:02:43,961 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 12:02:43,962 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,977 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 12:02:43,977 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 12:02:43,978 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 12:02:43,979 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 12:02:43,979 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 12:02:43,979 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 12:02:43,979 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 12:02:43,979 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 12:02:43,980 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 12:02:43,980 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 12:02:43,980 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 12:02:43,980 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 12:02:43,981 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 12:02:43,981 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 12:02:43,981 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 12:02:43,981 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 12:02:43,981 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 12:02:43,982 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 12:02:43,982 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 12:02:43,982 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 12:02:43,982 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 12:02:43,982 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:02:43,983 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 12:02:43,983 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 12:02:43,983 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 12:02:43,983 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 12:02:43,984 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 12:02:43,984 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 12:02:43,984 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 12:02:44,013 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 12:02:44,027 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 12:02:44,030 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 12:02:44,032 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 12:02:44,032 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 12:02:44,033 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec1_product17.cil.c [2019-10-02 12:02:44,100 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b73e6d909/9358fe96a7f64846a221caed8c032238/FLAG612b5ab90 [2019-10-02 12:02:44,666 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 12:02:44,667 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec1_product17.cil.c [2019-10-02 12:02:44,690 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b73e6d909/9358fe96a7f64846a221caed8c032238/FLAG612b5ab90 [2019-10-02 12:02:44,941 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b73e6d909/9358fe96a7f64846a221caed8c032238 [2019-10-02 12:02:44,953 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 12:02:44,954 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 12:02:44,956 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 12:02:44,956 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 12:02:44,959 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 12:02:44,961 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,964 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5466f872 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,964 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,972 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 12:02:45,052 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 12:02:45,721 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:02:45,745 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 12:02:45,886 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:02:45,941 INFO L192 MainTranslator]: Completed translation [2019-10-02 12:02:45,941 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,942 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 12:02:45,942 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 12:02:45,943 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 12:02:45,943 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 12:02:45,956 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,956 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:46,007 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:46,008 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,067 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,100 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,110 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,127 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 12:02:46,127 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 12:02:46,128 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 12:02:46,128 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 12:02:46,129 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,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 12:02:46,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 12:02:46,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 12:02:46,194 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-02 12:02:46,194 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-02 12:02:46,194 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-02 12:02:46,195 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-02 12:02:46,195 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-02 12:02:46,195 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-02 12:02:46,195 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-02 12:02:46,195 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-02 12:02:46,196 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 12:02:46,196 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 12:02:46,196 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 12:02:46,196 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 12:02:46,196 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 12:02:46,197 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 12:02:46,197 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 12:02:46,197 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 12:02:46,197 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 12:02:46,197 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 12:02:46,198 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 12:02:46,198 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 12:02:46,199 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-02 12:02:46,199 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-02 12:02:46,199 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-02 12:02:46,199 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-02 12:02:46,199 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-02 12:02:46,199 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-02 12:02:46,199 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-02 12:02:46,200 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-02 12:02:46,200 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-02 12:02:46,200 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-02 12:02:46,200 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-02 12:02:46,200 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-02 12:02:46,200 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-02 12:02:46,200 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-02 12:02:46,201 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-02 12:02:46,201 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-02 12:02:46,201 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-02 12:02:46,201 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-02 12:02:46,201 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-02 12:02:46,201 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-02 12:02:46,201 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-02 12:02:46,202 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-02 12:02:46,202 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-02 12:02:46,202 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-02 12:02:46,202 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-02 12:02:46,202 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__1 [2019-10-02 12:02:46,202 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__2 [2019-10-02 12:02:46,202 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__3 [2019-10-02 12:02:46,203 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__4 [2019-10-02 12:02:46,203 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-02 12:02:46,203 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-02 12:02:46,203 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-02 12:02:46,203 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-02 12:02:46,203 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-02 12:02:46,203 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-02 12:02:46,204 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-02 12:02:46,204 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-02 12:02:46,204 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-02 12:02:46,204 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-02 12:02:46,204 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-02 12:02:46,204 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-02 12:02:46,205 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-02 12:02:46,205 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-02 12:02:46,205 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-02 12:02:46,205 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-02 12:02:46,205 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 12:02:46,206 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-02 12:02:46,206 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 12:02:46,206 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-02 12:02:46,206 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-02 12:02:46,206 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-02 12:02:46,207 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 12:02:46,207 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 12:02:46,207 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-02 12:02:46,207 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-02 12:02:46,207 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-02 12:02:46,207 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-02 12:02:46,208 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-02 12:02:46,208 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-02 12:02:46,208 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-02 12:02:46,208 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-02 12:02:46,208 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__2 [2019-10-02 12:02:46,208 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 12:02:46,209 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 12:02:46,209 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 12:02:46,209 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 12:02:46,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 12:02:46,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 12:02:46,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 12:02:46,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 12:02:46,210 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 12:02:46,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 12:02:46,210 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 12:02:46,210 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 12:02:46,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 12:02:46,211 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 12:02:46,211 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 12:02:46,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 12:02:46,211 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 12:02:46,211 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-02 12:02:46,212 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-02 12:02:46,212 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-02 12:02:46,212 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 12:02:46,212 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 12:02:46,212 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 12:02:46,212 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 12:02:46,213 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 12:02:46,213 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 12:02:46,213 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 12:02:46,213 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-02 12:02:46,213 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-02 12:02:46,214 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-02 12:02:46,214 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-02 12:02:46,214 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-02 12:02:46,214 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-02 12:02:46,214 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-02 12:02:46,214 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-02 12:02:46,215 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-02 12:02:46,215 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-02 12:02:46,215 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-02 12:02:46,215 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-02 12:02:46,215 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-02 12:02:46,215 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-02 12:02:46,216 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-02 12:02:46,216 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-02 12:02:46,216 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-02 12:02:46,216 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-02 12:02:46,216 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-02 12:02:46,217 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-02 12:02:46,217 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-02 12:02:46,217 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-02 12:02:46,217 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-02 12:02:46,217 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-02 12:02:46,218 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-02 12:02:46,218 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-02 12:02:46,218 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__3 [2019-10-02 12:02:46,218 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-02 12:02:46,218 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__1 [2019-10-02 12:02:46,218 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__4 [2019-10-02 12:02:46,219 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-02 12:02:46,219 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-02 12:02:46,219 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-02 12:02:46,219 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 12:02:46,219 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-02 12:02:46,219 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-02 12:02:46,220 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-02 12:02:46,220 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-02 12:02:46,220 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-02 12:02:46,220 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-02 12:02:46,220 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-02 12:02:46,220 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-02 12:02:46,221 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-02 12:02:46,221 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-02 12:02:46,221 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-02 12:02:46,221 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 12:02:46,221 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-02 12:02:46,221 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 12:02:46,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 12:02:46,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 12:02:46,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 12:02:48,587 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 12:02:48,588 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-02 12:02:48,590 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,590 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 12:02:48,593 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 12:02:48,594 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 12:02:48,597 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 12:02:48,598 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,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@172d5917 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,599 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,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@172d5917 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,600 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,602 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec1_product17.cil.c [2019-10-02 12:02:48,612 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 12:02:48,630 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 12:02:48,648 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 12:02:48,699 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 12:02:48,700 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 12:02:48,700 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 12:02:48,700 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 12:02:48,700 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 12:02:48,700 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 12:02:48,700 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 12:02:48,701 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 12:02:48,701 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 12:02:48,742 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states. [2019-10-02 12:02:48,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-02 12:02:48,776 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:02:48,778 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:02:48,781 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:02:48,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:02:48,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1132113922, now seen corresponding path program 1 times [2019-10-02 12:02:48,789 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:02:48,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:02:48,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:02:48,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:02:48,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:02:49,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:02:49,486 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:02:49,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:02:49,489 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,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:02:50,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:02:50,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 3207 conjuncts, 1 conjunts are in the unsatisfiable core [2019-10-02 12:02:50,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:02:50,363 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-02 12:02:50,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:02:50,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 4 [2019-10-02 12:02:50,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:02:50,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:02:50,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:02:50,404 INFO L87 Difference]: Start difference. First operand 743 states. Second operand 4 states. [2019-10-02 12:02:50,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:02:50,625 INFO L93 Difference]: Finished difference Result 1170 states and 1905 transitions. [2019-10-02 12:02:50,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:02:50,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-10-02 12:02:50,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:02:50,667 INFO L225 Difference]: With dead ends: 1170 [2019-10-02 12:02:50,668 INFO L226 Difference]: Without dead ends: 589 [2019-10-02 12:02:50,683 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 139 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,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-10-02 12:02:50,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2019-10-02 12:02:50,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-10-02 12:02:50,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 946 transitions. [2019-10-02 12:02:50,797 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 946 transitions. Word has length 138 [2019-10-02 12:02:50,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:02:50,798 INFO L475 AbstractCegarLoop]: Abstraction has 589 states and 946 transitions. [2019-10-02 12:02:50,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:02:50,798 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 946 transitions. [2019-10-02 12:02:50,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-02 12:02:50,808 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:02:50,808 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:02:50,808 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:02:50,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:02:50,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1619685945, now seen corresponding path program 1 times [2019-10-02 12:02:50,809 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:02:50,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:02:50,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:02:50,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:02:50,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:02:50,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:02:51,110 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:02:51,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:02:51,112 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,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:02:51,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:02:51,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 3212 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:02:51,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:02:51,791 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 12:02:51,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:02:51,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:02:51,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:02:51,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:02:51,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:02:51,802 INFO L87 Difference]: Start difference. First operand 589 states and 946 transitions. Second operand 6 states. [2019-10-02 12:02:51,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:02:51,913 INFO L93 Difference]: Finished difference Result 1150 states and 1865 transitions. [2019-10-02 12:02:51,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:02:51,913 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-10-02 12:02:51,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:02:51,919 INFO L225 Difference]: With dead ends: 1150 [2019-10-02 12:02:51,919 INFO L226 Difference]: Without dead ends: 589 [2019-10-02 12:02:51,923 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 141 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,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-10-02 12:02:51,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2019-10-02 12:02:51,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-10-02 12:02:51,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 945 transitions. [2019-10-02 12:02:51,973 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 945 transitions. Word has length 142 [2019-10-02 12:02:51,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:02:51,974 INFO L475 AbstractCegarLoop]: Abstraction has 589 states and 945 transitions. [2019-10-02 12:02:51,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:02:51,974 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 945 transitions. [2019-10-02 12:02:51,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-02 12:02:51,979 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:02:51,979 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:02:51,980 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:02:51,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:02:51,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1401716195, now seen corresponding path program 1 times [2019-10-02 12:02:51,980 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:02:51,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:02:51,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:02:51,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:02:51,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:02:52,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:02:52,174 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:02:52,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:02:52,175 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,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:02:52,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:02:52,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 3214 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:02:52,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:02:52,836 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:02:52,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:02:52,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:02:52,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:02:52,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:02:52,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:02:52,852 INFO L87 Difference]: Start difference. First operand 589 states and 945 transitions. Second operand 6 states. [2019-10-02 12:02:52,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:02:52,962 INFO L93 Difference]: Finished difference Result 1154 states and 1868 transitions. [2019-10-02 12:02:52,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:02:52,963 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-10-02 12:02:52,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:02:52,970 INFO L225 Difference]: With dead ends: 1154 [2019-10-02 12:02:52,970 INFO L226 Difference]: Without dead ends: 595 [2019-10-02 12:02:52,974 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 143 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,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2019-10-02 12:02:53,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 595. [2019-10-02 12:02:53,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-10-02 12:02:53,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 950 transitions. [2019-10-02 12:02:53,018 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 950 transitions. Word has length 144 [2019-10-02 12:02:53,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:02:53,019 INFO L475 AbstractCegarLoop]: Abstraction has 595 states and 950 transitions. [2019-10-02 12:02:53,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:02:53,020 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 950 transitions. [2019-10-02 12:02:53,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-02 12:02:53,027 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:02:53,027 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:02:53,028 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:02:53,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:02:53,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1990322423, now seen corresponding path program 1 times [2019-10-02 12:02:53,028 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:02:53,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:02:53,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:02:53,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:02:53,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:02:53,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:02:53,184 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:02:53,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:02:53,185 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,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:02:53,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:02:53,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 3215 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:02:53,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:02:53,834 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 12:02:53,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:02:53,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:02:53,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:02:53,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:02:53,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:02:53,844 INFO L87 Difference]: Start difference. First operand 595 states and 950 transitions. Second operand 6 states. [2019-10-02 12:02:53,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:02:53,921 INFO L93 Difference]: Finished difference Result 1153 states and 1859 transitions. [2019-10-02 12:02:53,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:02:53,922 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-10-02 12:02:53,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:02:53,927 INFO L225 Difference]: With dead ends: 1153 [2019-10-02 12:02:53,927 INFO L226 Difference]: Without dead ends: 595 [2019-10-02 12:02:53,931 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 145 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,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2019-10-02 12:02:53,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 595. [2019-10-02 12:02:53,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-10-02 12:02:53,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 949 transitions. [2019-10-02 12:02:53,955 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 949 transitions. Word has length 145 [2019-10-02 12:02:53,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:02:53,955 INFO L475 AbstractCegarLoop]: Abstraction has 595 states and 949 transitions. [2019-10-02 12:02:53,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:02:53,955 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 949 transitions. [2019-10-02 12:02:53,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-02 12:02:53,960 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:02:53,960 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:02:53,961 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:02:53,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:02:53,961 INFO L82 PathProgramCache]: Analyzing trace with hash 769578593, now seen corresponding path program 1 times [2019-10-02 12:02:53,961 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:02:53,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:02:53,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:02:53,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:02:53,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:02:54,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:02:54,076 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:02:54,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:02:54,076 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,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:02:54,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:02:54,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 3216 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:02:54,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:02:54,666 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 12:02:54,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:02:54,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:02:54,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:02:54,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:02:54,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:02:54,687 INFO L87 Difference]: Start difference. First operand 595 states and 949 transitions. Second operand 6 states. [2019-10-02 12:02:54,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:02:54,761 INFO L93 Difference]: Finished difference Result 1153 states and 1858 transitions. [2019-10-02 12:02:54,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:02:54,761 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 146 [2019-10-02 12:02:54,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:02:54,767 INFO L225 Difference]: With dead ends: 1153 [2019-10-02 12:02:54,768 INFO L226 Difference]: Without dead ends: 595 [2019-10-02 12:02:54,771 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 146 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,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2019-10-02 12:02:54,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 595. [2019-10-02 12:02:54,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-10-02 12:02:54,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 948 transitions. [2019-10-02 12:02:54,793 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 948 transitions. Word has length 146 [2019-10-02 12:02:54,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:02:54,793 INFO L475 AbstractCegarLoop]: Abstraction has 595 states and 948 transitions. [2019-10-02 12:02:54,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:02:54,793 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 948 transitions. [2019-10-02 12:02:54,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-02 12:02:54,798 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:02:54,798 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:02:54,798 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:02:54,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:02:54,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1713500357, now seen corresponding path program 1 times [2019-10-02 12:02:54,799 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:02:54,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:02:54,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:02:54,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:02:54,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:02:54,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:02:55,008 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-02 12:02:55,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:02:55,009 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,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:02:55,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:02:55,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 3217 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 12:02:55,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:02:55,660 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:02:55,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:02:55,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2019-10-02 12:02:55,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 12:02:55,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 12:02:55,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:02:55,673 INFO L87 Difference]: Start difference. First operand 595 states and 948 transitions. Second operand 15 states. [2019-10-02 12:02:55,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:02:55,902 INFO L93 Difference]: Finished difference Result 1158 states and 1865 transitions. [2019-10-02 12:02:55,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:02:55,903 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 147 [2019-10-02 12:02:55,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:02:55,908 INFO L225 Difference]: With dead ends: 1158 [2019-10-02 12:02:55,908 INFO L226 Difference]: Without dead ends: 604 [2019-10-02 12:02:55,913 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:02:55,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2019-10-02 12:02:55,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 602. [2019-10-02 12:02:55,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-10-02 12:02:55,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 958 transitions. [2019-10-02 12:02:55,943 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 958 transitions. Word has length 147 [2019-10-02 12:02:55,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:02:55,944 INFO L475 AbstractCegarLoop]: Abstraction has 602 states and 958 transitions. [2019-10-02 12:02:55,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 12:02:55,944 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 958 transitions. [2019-10-02 12:02:55,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-02 12:02:55,948 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:02:55,948 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:02:55,949 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:02:55,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:02:55,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1684668088, now seen corresponding path program 1 times [2019-10-02 12:02:55,950 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:02:55,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:02:55,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:02:55,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:02:55,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:02:56,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:02:56,131 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-02 12:02:56,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:02:56,131 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:56,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:02:56,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:02:56,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 3218 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:02:56,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:02:56,754 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:02:56,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:02:56,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 12:02:56,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:02:56,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:02:56,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:02:56,764 INFO L87 Difference]: Start difference. First operand 602 states and 958 transitions. Second operand 8 states. [2019-10-02 12:02:57,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:02:57,062 INFO L93 Difference]: Finished difference Result 1165 states and 1878 transitions. [2019-10-02 12:02:57,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:02:57,063 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 148 [2019-10-02 12:02:57,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:02:57,069 INFO L225 Difference]: With dead ends: 1165 [2019-10-02 12:02:57,069 INFO L226 Difference]: Without dead ends: 602 [2019-10-02 12:02:57,072 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 150 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:57,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-10-02 12:02:57,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2019-10-02 12:02:57,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-10-02 12:02:57,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 953 transitions. [2019-10-02 12:02:57,098 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 953 transitions. Word has length 148 [2019-10-02 12:02:57,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:02:57,098 INFO L475 AbstractCegarLoop]: Abstraction has 602 states and 953 transitions. [2019-10-02 12:02:57,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:02:57,099 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 953 transitions. [2019-10-02 12:02:57,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-02 12:02:57,103 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:02:57,103 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:02:57,104 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:02:57,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:02:57,104 INFO L82 PathProgramCache]: Analyzing trace with hash -988647901, now seen corresponding path program 1 times [2019-10-02 12:02:57,105 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:02:57,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:02:57,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:02:57,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:02:57,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:02:57,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:02:57,219 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 12:02:57,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:02:57,220 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:57,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:02:57,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:02:57,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 3219 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 12:02:57,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:02:57,902 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 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:57,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:02:57,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2019-10-02 12:02:57,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:02:57,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:02:57,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:02:57,922 INFO L87 Difference]: Start difference. First operand 602 states and 953 transitions. Second operand 9 states. [2019-10-02 12:02:58,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:02:58,157 INFO L93 Difference]: Finished difference Result 1162 states and 1861 transitions. [2019-10-02 12:02:58,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:02:58,158 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 150 [2019-10-02 12:02:58,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:02:58,163 INFO L225 Difference]: With dead ends: 1162 [2019-10-02 12:02:58,163 INFO L226 Difference]: Without dead ends: 601 [2019-10-02 12:02:58,167 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:02:58,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2019-10-02 12:02:58,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 598. [2019-10-02 12:02:58,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-10-02 12:02:58,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 946 transitions. [2019-10-02 12:02:58,191 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 946 transitions. Word has length 150 [2019-10-02 12:02:58,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:02:58,191 INFO L475 AbstractCegarLoop]: Abstraction has 598 states and 946 transitions. [2019-10-02 12:02:58,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:02:58,192 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 946 transitions. [2019-10-02 12:02:58,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-02 12:02:58,196 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:02:58,197 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:02:58,197 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:02:58,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:02:58,197 INFO L82 PathProgramCache]: Analyzing trace with hash 157892612, now seen corresponding path program 1 times [2019-10-02 12:02:58,198 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:02:58,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:02:58,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:02:58,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:02:58,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:02:58,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:02:58,338 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-02 12:02:58,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:02:58,339 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:58,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:02:58,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:02:58,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 3220 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:02:58,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:02:58,935 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:02:58,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:02:58,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 12:02:58,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:02:58,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:02:58,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:02:58,958 INFO L87 Difference]: Start difference. First operand 598 states and 946 transitions. Second operand 8 states. [2019-10-02 12:02:59,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:02:59,234 INFO L93 Difference]: Finished difference Result 1161 states and 1859 transitions. [2019-10-02 12:02:59,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:02:59,235 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 150 [2019-10-02 12:02:59,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:02:59,241 INFO L225 Difference]: With dead ends: 1161 [2019-10-02 12:02:59,241 INFO L226 Difference]: Without dead ends: 598 [2019-10-02 12:02:59,245 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 151 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,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-10-02 12:02:59,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2019-10-02 12:02:59,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-10-02 12:02:59,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 941 transitions. [2019-10-02 12:02:59,275 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 941 transitions. Word has length 150 [2019-10-02 12:02:59,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:02:59,276 INFO L475 AbstractCegarLoop]: Abstraction has 598 states and 941 transitions. [2019-10-02 12:02:59,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:02:59,276 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 941 transitions. [2019-10-02 12:02:59,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-02 12:02:59,281 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:02:59,281 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:02:59,281 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:02:59,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:02:59,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1481059154, now seen corresponding path program 1 times [2019-10-02 12:02:59,282 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:02:59,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:02:59,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:02:59,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:02:59,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:02:59,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:02:59,460 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-02 12:02:59,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:02:59,461 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:02:59,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:00,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:00,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 3222 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:03:00,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:03:00,130 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:03:00,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:03:00,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 12:03:00,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:03:00,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:03:00,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:03:00,142 INFO L87 Difference]: Start difference. First operand 598 states and 941 transitions. Second operand 8 states. [2019-10-02 12:03:00,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:00,434 INFO L93 Difference]: Finished difference Result 1182 states and 1880 transitions. [2019-10-02 12:03:00,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:03:00,435 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 152 [2019-10-02 12:03:00,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:00,440 INFO L225 Difference]: With dead ends: 1182 [2019-10-02 12:03:00,441 INFO L226 Difference]: Without dead ends: 616 [2019-10-02 12:03:00,444 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 153 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:03:00,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2019-10-02 12:03:00,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 613. [2019-10-02 12:03:00,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-10-02 12:03:00,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 954 transitions. [2019-10-02 12:03:00,474 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 954 transitions. Word has length 152 [2019-10-02 12:03:00,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:00,474 INFO L475 AbstractCegarLoop]: Abstraction has 613 states and 954 transitions. [2019-10-02 12:03:00,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:03:00,475 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 954 transitions. [2019-10-02 12:03:00,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-02 12:03:00,480 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:00,480 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:03:00,480 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:00,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:00,481 INFO L82 PathProgramCache]: Analyzing trace with hash 2098391086, now seen corresponding path program 1 times [2019-10-02 12:03:00,481 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:00,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:00,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:00,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:00,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:00,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:00,665 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-02 12:03:00,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:03:00,665 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:00,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:01,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:01,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 3218 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 12:03:01,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:03:01,302 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:03:01,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:03:01,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2019-10-02 12:03:01,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:03:01,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:03:01,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:03:01,323 INFO L87 Difference]: Start difference. First operand 613 states and 954 transitions. Second operand 14 states. [2019-10-02 12:03:01,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:01,695 INFO L93 Difference]: Finished difference Result 1172 states and 1845 transitions. [2019-10-02 12:03:01,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:03:01,695 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 152 [2019-10-02 12:03:01,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:01,702 INFO L225 Difference]: With dead ends: 1172 [2019-10-02 12:03:01,702 INFO L226 Difference]: Without dead ends: 607 [2019-10-02 12:03:01,706 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 148 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:01,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-10-02 12:03:01,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 602. [2019-10-02 12:03:01,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-10-02 12:03:01,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 934 transitions. [2019-10-02 12:03:01,732 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 934 transitions. Word has length 152 [2019-10-02 12:03:01,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:01,732 INFO L475 AbstractCegarLoop]: Abstraction has 602 states and 934 transitions. [2019-10-02 12:03:01,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 12:03:01,733 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 934 transitions. [2019-10-02 12:03:01,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-02 12:03:01,738 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:01,738 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,738 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:01,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:01,739 INFO L82 PathProgramCache]: Analyzing trace with hash 506208147, now seen corresponding path program 1 times [2019-10-02 12:03:01,739 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:01,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:01,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:01,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:01,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:01,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:01,887 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-02 12:03:01,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:03:01,888 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:01,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:02,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:02,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 3225 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:03:02,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:03:02,519 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:03:02,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:03:02,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 12:03:02,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:03:02,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:03:02,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:03:02,536 INFO L87 Difference]: Start difference. First operand 602 states and 934 transitions. Second operand 8 states. [2019-10-02 12:03:02,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:02,762 INFO L93 Difference]: Finished difference Result 1154 states and 1814 transitions. [2019-10-02 12:03:02,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:03:02,763 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 155 [2019-10-02 12:03:02,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:02,770 INFO L225 Difference]: With dead ends: 1154 [2019-10-02 12:03:02,771 INFO L226 Difference]: Without dead ends: 602 [2019-10-02 12:03:02,776 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 157 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,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-10-02 12:03:02,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2019-10-02 12:03:02,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-10-02 12:03:02,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 933 transitions. [2019-10-02 12:03:02,812 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 933 transitions. Word has length 155 [2019-10-02 12:03:02,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:02,814 INFO L475 AbstractCegarLoop]: Abstraction has 602 states and 933 transitions. [2019-10-02 12:03:02,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:03:02,814 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 933 transitions. [2019-10-02 12:03:02,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-02 12:03:02,821 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:02,821 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,822 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:02,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:02,822 INFO L82 PathProgramCache]: Analyzing trace with hash 752041134, now seen corresponding path program 1 times [2019-10-02 12:03:02,823 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:02,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:02,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:02,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:02,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:02,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:03,008 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-02 12:03:03,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:03:03,009 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:03,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:03,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:03,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 3226 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:03:03,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:03:03,714 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:03:03,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:03:03,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 12:03:03,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:03:03,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:03:03,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:03:03,724 INFO L87 Difference]: Start difference. First operand 602 states and 933 transitions. Second operand 8 states. [2019-10-02 12:03:03,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:03,910 INFO L93 Difference]: Finished difference Result 1154 states and 1813 transitions. [2019-10-02 12:03:03,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:03:03,911 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 156 [2019-10-02 12:03:03,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:03,916 INFO L225 Difference]: With dead ends: 1154 [2019-10-02 12:03:03,916 INFO L226 Difference]: Without dead ends: 602 [2019-10-02 12:03:03,919 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 158 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:03,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-10-02 12:03:03,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2019-10-02 12:03:03,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-10-02 12:03:03,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 932 transitions. [2019-10-02 12:03:03,940 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 932 transitions. Word has length 156 [2019-10-02 12:03:03,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:03,940 INFO L475 AbstractCegarLoop]: Abstraction has 602 states and 932 transitions. [2019-10-02 12:03:03,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:03:03,941 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 932 transitions. [2019-10-02 12:03:03,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-02 12:03:03,945 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:03,945 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03,945 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:03,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:03,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1466784908, now seen corresponding path program 1 times [2019-10-02 12:03:03,946 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:03,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:03,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:03,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:03,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:03,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:04,067 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:03:04,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:03:04,068 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:04,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:04,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:04,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 3224 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 12:03:04,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:03:04,963 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (15)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:03:04,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:03:04,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2019-10-02 12:03:04,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:03:04,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:03:04,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:03:04,986 INFO L87 Difference]: Start difference. First operand 602 states and 932 transitions. Second operand 8 states. [2019-10-02 12:03:05,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:05,342 INFO L93 Difference]: Finished difference Result 1172 states and 1849 transitions. [2019-10-02 12:03:05,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:03:05,343 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 157 [2019-10-02 12:03:05,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:05,350 INFO L225 Difference]: With dead ends: 1172 [2019-10-02 12:03:05,350 INFO L226 Difference]: Without dead ends: 618 [2019-10-02 12:03:05,355 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:03:05,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-10-02 12:03:05,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 616. [2019-10-02 12:03:05,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2019-10-02 12:03:05,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 948 transitions. [2019-10-02 12:03:05,389 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 948 transitions. Word has length 157 [2019-10-02 12:03:05,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:05,389 INFO L475 AbstractCegarLoop]: Abstraction has 616 states and 948 transitions. [2019-10-02 12:03:05,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:03:05,390 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 948 transitions. [2019-10-02 12:03:05,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-02 12:03:05,396 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:05,397 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:03:05,397 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:05,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:05,398 INFO L82 PathProgramCache]: Analyzing trace with hash -2041057842, now seen corresponding path program 1 times [2019-10-02 12:03:05,398 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:05,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:05,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:05,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:05,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:05,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:05,645 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-02 12:03:05,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:03:05,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:03:05,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:03:05,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:03:05,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:03:05,648 INFO L87 Difference]: Start difference. First operand 616 states and 948 transitions. Second operand 9 states. [2019-10-02 12:03:05,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:05,893 INFO L93 Difference]: Finished difference Result 1104 states and 1743 transitions. [2019-10-02 12:03:05,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:03:05,894 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 158 [2019-10-02 12:03:05,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:05,901 INFO L225 Difference]: With dead ends: 1104 [2019-10-02 12:03:05,901 INFO L226 Difference]: Without dead ends: 613 [2019-10-02 12:03:05,908 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,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-10-02 12:03:05,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 613. [2019-10-02 12:03:05,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-10-02 12:03:05,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 943 transitions. [2019-10-02 12:03:05,940 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 943 transitions. Word has length 158 [2019-10-02 12:03:05,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:05,940 INFO L475 AbstractCegarLoop]: Abstraction has 613 states and 943 transitions. [2019-10-02 12:03:05,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:03:05,941 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 943 transitions. [2019-10-02 12:03:05,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-02 12:03:05,946 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:05,947 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,947 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:05,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:05,948 INFO L82 PathProgramCache]: Analyzing trace with hash 187244878, now seen corresponding path program 1 times [2019-10-02 12:03:05,948 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:05,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:05,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:05,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:05,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:06,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:06,179 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-02 12:03:06,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:03:06,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:03:06,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:03:06,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:03:06,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:03:06,188 INFO L87 Difference]: Start difference. First operand 613 states and 943 transitions. Second operand 7 states. [2019-10-02 12:03:06,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:06,303 INFO L93 Difference]: Finished difference Result 1101 states and 1738 transitions. [2019-10-02 12:03:06,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:03:06,304 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 158 [2019-10-02 12:03:06,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:06,309 INFO L225 Difference]: With dead ends: 1101 [2019-10-02 12:03:06,310 INFO L226 Difference]: Without dead ends: 587 [2019-10-02 12:03:06,314 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:06,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-10-02 12:03:06,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2019-10-02 12:03:06,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-10-02 12:03:06,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 904 transitions. [2019-10-02 12:03:06,340 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 904 transitions. Word has length 158 [2019-10-02 12:03:06,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:06,341 INFO L475 AbstractCegarLoop]: Abstraction has 587 states and 904 transitions. [2019-10-02 12:03:06,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:03:06,341 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 904 transitions. [2019-10-02 12:03:06,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-02 12:03:06,346 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:06,346 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,346 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:06,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:06,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1116862689, now seen corresponding path program 1 times [2019-10-02 12:03:06,347 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:06,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:06,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:06,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:06,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:06,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:06,665 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 12:03:06,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:03:06,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 12:03:06,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 12:03:06,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 12:03:06,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:03:06,667 INFO L87 Difference]: Start difference. First operand 587 states and 904 transitions. Second operand 13 states. [2019-10-02 12:03:06,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:06,976 INFO L93 Difference]: Finished difference Result 1080 states and 1703 transitions. [2019-10-02 12:03:06,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 12:03:06,976 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 159 [2019-10-02 12:03:06,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:06,984 INFO L225 Difference]: With dead ends: 1080 [2019-10-02 12:03:06,984 INFO L226 Difference]: Without dead ends: 591 [2019-10-02 12:03:06,988 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,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-10-02 12:03:07,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 589. [2019-10-02 12:03:07,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-10-02 12:03:07,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 905 transitions. [2019-10-02 12:03:07,011 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 905 transitions. Word has length 159 [2019-10-02 12:03:07,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:07,012 INFO L475 AbstractCegarLoop]: Abstraction has 589 states and 905 transitions. [2019-10-02 12:03:07,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 12:03:07,012 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 905 transitions. [2019-10-02 12:03:07,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-02 12:03:07,016 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:07,016 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:03:07,016 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:07,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:07,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1274032325, now seen corresponding path program 1 times [2019-10-02 12:03:07,017 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:07,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:07,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:07,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:07,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:07,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:07,271 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 12:03:07,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:03:07,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 12:03:07,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 12:03:07,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 12:03:07,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:03:07,272 INFO L87 Difference]: Start difference. First operand 589 states and 905 transitions. Second operand 13 states. [2019-10-02 12:03:07,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:07,653 INFO L93 Difference]: Finished difference Result 1145 states and 1787 transitions. [2019-10-02 12:03:07,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 12:03:07,653 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 160 [2019-10-02 12:03:07,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:07,659 INFO L225 Difference]: With dead ends: 1145 [2019-10-02 12:03:07,659 INFO L226 Difference]: Without dead ends: 594 [2019-10-02 12:03:07,664 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 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:07,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-10-02 12:03:07,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 592. [2019-10-02 12:03:07,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-10-02 12:03:07,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 910 transitions. [2019-10-02 12:03:07,691 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 910 transitions. Word has length 160 [2019-10-02 12:03:07,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:07,691 INFO L475 AbstractCegarLoop]: Abstraction has 592 states and 910 transitions. [2019-10-02 12:03:07,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 12:03:07,692 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 910 transitions. [2019-10-02 12:03:07,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-02 12:03:07,695 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:07,696 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,696 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:07,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:07,697 INFO L82 PathProgramCache]: Analyzing trace with hash -41042908, now seen corresponding path program 1 times [2019-10-02 12:03:07,697 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:07,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:07,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:07,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:07,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:07,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:07,901 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 12:03:07,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:03:07,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:03:07,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:03:07,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:03:07,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:03:07,904 INFO L87 Difference]: Start difference. First operand 592 states and 910 transitions. Second operand 11 states. [2019-10-02 12:03:08,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:08,132 INFO L93 Difference]: Finished difference Result 1081 states and 1704 transitions. [2019-10-02 12:03:08,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:03:08,133 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 161 [2019-10-02 12:03:08,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:08,138 INFO L225 Difference]: With dead ends: 1081 [2019-10-02 12:03:08,138 INFO L226 Difference]: Without dead ends: 592 [2019-10-02 12:03:08,141 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:08,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-10-02 12:03:08,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-10-02 12:03:08,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-10-02 12:03:08,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 909 transitions. [2019-10-02 12:03:08,161 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 909 transitions. Word has length 161 [2019-10-02 12:03:08,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:08,164 INFO L475 AbstractCegarLoop]: Abstraction has 592 states and 909 transitions. [2019-10-02 12:03:08,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:03:08,165 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 909 transitions. [2019-10-02 12:03:08,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-02 12:03:08,169 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:08,169 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08,169 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:08,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:08,170 INFO L82 PathProgramCache]: Analyzing trace with hash 43049690, now seen corresponding path program 1 times [2019-10-02 12:03:08,170 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:08,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:08,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:08,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:08,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:08,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:08,370 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 12:03:08,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:03:08,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:03:08,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:03:08,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:03:08,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:03:08,372 INFO L87 Difference]: Start difference. First operand 592 states and 909 transitions. Second operand 11 states. [2019-10-02 12:03:08,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:08,615 INFO L93 Difference]: Finished difference Result 1127 states and 1757 transitions. [2019-10-02 12:03:08,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:03:08,618 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 162 [2019-10-02 12:03:08,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:08,622 INFO L225 Difference]: With dead ends: 1127 [2019-10-02 12:03:08,622 INFO L226 Difference]: Without dead ends: 589 [2019-10-02 12:03:08,625 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 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:08,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-10-02 12:03:08,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2019-10-02 12:03:08,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-10-02 12:03:08,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 901 transitions. [2019-10-02 12:03:08,644 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 901 transitions. Word has length 162 [2019-10-02 12:03:08,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:08,645 INFO L475 AbstractCegarLoop]: Abstraction has 589 states and 901 transitions. [2019-10-02 12:03:08,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:03:08,645 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 901 transitions. [2019-10-02 12:03:08,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-02 12:03:08,649 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:08,649 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08,649 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:08,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:08,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1407680321, now seen corresponding path program 1 times [2019-10-02 12:03:08,650 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:08,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:08,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:08,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:08,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:08,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:08,836 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-02 12:03:08,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:03:08,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:03:08,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:03:08,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:03:08,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:03:08,838 INFO L87 Difference]: Start difference. First operand 589 states and 901 transitions. Second operand 9 states. [2019-10-02 12:03:12,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:12,536 INFO L93 Difference]: Finished difference Result 1075 states and 1710 transitions. [2019-10-02 12:03:12,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:03:12,537 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 163 [2019-10-02 12:03:12,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:12,542 INFO L225 Difference]: With dead ends: 1075 [2019-10-02 12:03:12,542 INFO L226 Difference]: Without dead ends: 595 [2019-10-02 12:03:12,546 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 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:03:12,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2019-10-02 12:03:12,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 593. [2019-10-02 12:03:12,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2019-10-02 12:03:12,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 920 transitions. [2019-10-02 12:03:12,579 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 920 transitions. Word has length 163 [2019-10-02 12:03:12,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:12,579 INFO L475 AbstractCegarLoop]: Abstraction has 593 states and 920 transitions. [2019-10-02 12:03:12,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:03:12,579 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 920 transitions. [2019-10-02 12:03:12,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-02 12:03:12,583 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:12,584 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,584 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:12,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:12,584 INFO L82 PathProgramCache]: Analyzing trace with hash -715352702, now seen corresponding path program 1 times [2019-10-02 12:03:12,584 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:12,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:12,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:12,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:12,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:12,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:12,761 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-02 12:03:12,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:03:12,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:03:12,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:03:12,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:03:12,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:03:12,763 INFO L87 Difference]: Start difference. First operand 593 states and 920 transitions. Second operand 8 states. [2019-10-02 12:03:18,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:18,626 INFO L93 Difference]: Finished difference Result 1969 states and 3237 transitions. [2019-10-02 12:03:18,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 12:03:18,629 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 164 [2019-10-02 12:03:18,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:18,642 INFO L225 Difference]: With dead ends: 1969 [2019-10-02 12:03:18,642 INFO L226 Difference]: Without dead ends: 1485 [2019-10-02 12:03:18,648 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-10-02 12:03:18,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1485 states. [2019-10-02 12:03:18,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1485 to 1446. [2019-10-02 12:03:18,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1446 states. [2019-10-02 12:03:18,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1446 states and 2299 transitions. [2019-10-02 12:03:18,730 INFO L78 Accepts]: Start accepts. Automaton has 1446 states and 2299 transitions. Word has length 164 [2019-10-02 12:03:18,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:18,731 INFO L475 AbstractCegarLoop]: Abstraction has 1446 states and 2299 transitions. [2019-10-02 12:03:18,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:03:18,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1446 states and 2299 transitions. [2019-10-02 12:03:18,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-02 12:03:18,773 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:18,773 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18,774 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:18,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:18,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1252794223, now seen corresponding path program 1 times [2019-10-02 12:03:18,775 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:18,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:18,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:18,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:18,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:18,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:18,978 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-02 12:03:18,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:03:18,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:03:18,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:03:18,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:03:18,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:03:18,980 INFO L87 Difference]: Start difference. First operand 1446 states and 2299 transitions. Second operand 9 states. [2019-10-02 12:03:25,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:25,988 INFO L93 Difference]: Finished difference Result 4466 states and 7341 transitions. [2019-10-02 12:03:25,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 12:03:25,989 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 170 [2019-10-02 12:03:25,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:26,007 INFO L225 Difference]: With dead ends: 4466 [2019-10-02 12:03:26,008 INFO L226 Difference]: Without dead ends: 3129 [2019-10-02 12:03:26,016 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-10-02 12:03:26,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3129 states. [2019-10-02 12:03:26,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3129 to 2906. [2019-10-02 12:03:26,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2906 states. [2019-10-02 12:03:26,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2906 states to 2906 states and 4672 transitions. [2019-10-02 12:03:26,156 INFO L78 Accepts]: Start accepts. Automaton has 2906 states and 4672 transitions. Word has length 170 [2019-10-02 12:03:26,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:26,156 INFO L475 AbstractCegarLoop]: Abstraction has 2906 states and 4672 transitions. [2019-10-02 12:03:26,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:03:26,156 INFO L276 IsEmpty]: Start isEmpty. Operand 2906 states and 4672 transitions. [2019-10-02 12:03:26,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-02 12:03:26,160 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:26,161 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26,161 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:26,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:26,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1245034864, now seen corresponding path program 1 times [2019-10-02 12:03:26,161 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:26,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:26,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:26,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:26,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:26,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:26,301 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-02 12:03:26,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:03:26,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:03:26,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:03:26,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:03:26,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:03:26,303 INFO L87 Difference]: Start difference. First operand 2906 states and 4672 transitions. Second operand 7 states. [2019-10-02 12:03:30,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:30,499 INFO L93 Difference]: Finished difference Result 7432 states and 12212 transitions. [2019-10-02 12:03:30,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 12:03:30,499 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 170 [2019-10-02 12:03:30,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:30,547 INFO L225 Difference]: With dead ends: 7432 [2019-10-02 12:03:30,547 INFO L226 Difference]: Without dead ends: 5368 [2019-10-02 12:03:30,562 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:03:30,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5368 states. [2019-10-02 12:03:30,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5368 to 5275. [2019-10-02 12:03:30,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5275 states. [2019-10-02 12:03:30,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5275 states to 5275 states and 8580 transitions. [2019-10-02 12:03:30,848 INFO L78 Accepts]: Start accepts. Automaton has 5275 states and 8580 transitions. Word has length 170 [2019-10-02 12:03:30,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:30,848 INFO L475 AbstractCegarLoop]: Abstraction has 5275 states and 8580 transitions. [2019-10-02 12:03:30,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:03:30,849 INFO L276 IsEmpty]: Start isEmpty. Operand 5275 states and 8580 transitions. [2019-10-02 12:03:30,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-02 12:03:30,853 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:30,856 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30,856 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:30,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:30,857 INFO L82 PathProgramCache]: Analyzing trace with hash 391396649, now seen corresponding path program 1 times [2019-10-02 12:03:30,857 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:30,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:30,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:30,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:30,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:30,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:30,984 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-02 12:03:30,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:03:30,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:03:30,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:03:30,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:03:30,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:03:30,986 INFO L87 Difference]: Start difference. First operand 5275 states and 8580 transitions. Second operand 5 states. [2019-10-02 12:03:31,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:31,205 INFO L93 Difference]: Finished difference Result 9716 states and 15914 transitions. [2019-10-02 12:03:31,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:03:31,205 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 175 [2019-10-02 12:03:31,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:31,244 INFO L225 Difference]: With dead ends: 9716 [2019-10-02 12:03:31,244 INFO L226 Difference]: Without dead ends: 5393 [2019-10-02 12:03:31,267 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:03:31,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5393 states. [2019-10-02 12:03:31,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5393 to 5327. [2019-10-02 12:03:31,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5327 states. [2019-10-02 12:03:31,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5327 states to 5327 states and 8653 transitions. [2019-10-02 12:03:31,596 INFO L78 Accepts]: Start accepts. Automaton has 5327 states and 8653 transitions. Word has length 175 [2019-10-02 12:03:31,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:31,597 INFO L475 AbstractCegarLoop]: Abstraction has 5327 states and 8653 transitions. [2019-10-02 12:03:31,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:03:31,597 INFO L276 IsEmpty]: Start isEmpty. Operand 5327 states and 8653 transitions. [2019-10-02 12:03:31,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-10-02 12:03:31,600 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:31,601 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31,601 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:31,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:31,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1938363188, now seen corresponding path program 1 times [2019-10-02 12:03:31,601 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:31,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:31,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:31,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:31,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:31,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:31,745 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-02 12:03:31,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:03:31,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:03:31,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:03:31,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:03:31,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:03:31,747 INFO L87 Difference]: Start difference. First operand 5327 states and 8653 transitions. Second operand 7 states. [2019-10-02 12:03:32,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:32,048 INFO L93 Difference]: Finished difference Result 10292 states and 17030 transitions. [2019-10-02 12:03:32,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:03:32,049 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 182 [2019-10-02 12:03:32,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:32,091 INFO L225 Difference]: With dead ends: 10292 [2019-10-02 12:03:32,091 INFO L226 Difference]: Without dead ends: 5327 [2019-10-02 12:03:32,111 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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:32,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5327 states. [2019-10-02 12:03:32,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5327 to 5327. [2019-10-02 12:03:32,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5327 states. [2019-10-02 12:03:32,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5327 states to 5327 states and 8561 transitions. [2019-10-02 12:03:32,353 INFO L78 Accepts]: Start accepts. Automaton has 5327 states and 8561 transitions. Word has length 182 [2019-10-02 12:03:32,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:32,353 INFO L475 AbstractCegarLoop]: Abstraction has 5327 states and 8561 transitions. [2019-10-02 12:03:32,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:03:32,354 INFO L276 IsEmpty]: Start isEmpty. Operand 5327 states and 8561 transitions. [2019-10-02 12:03:32,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-10-02 12:03:32,358 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:32,358 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,358 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:32,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:32,359 INFO L82 PathProgramCache]: Analyzing trace with hash 950856004, now seen corresponding path program 1 times [2019-10-02 12:03:32,359 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:32,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:32,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:32,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:32,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:32,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:32,520 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 12:03:32,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:03:32,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:03:32,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:03:32,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:03:32,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:03:32,523 INFO L87 Difference]: Start difference. First operand 5327 states and 8561 transitions. Second operand 7 states. [2019-10-02 12:03:38,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:38,278 INFO L93 Difference]: Finished difference Result 10032 states and 16209 transitions. [2019-10-02 12:03:38,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 12:03:38,279 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 187 [2019-10-02 12:03:38,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:38,325 INFO L225 Difference]: With dead ends: 10032 [2019-10-02 12:03:38,326 INFO L226 Difference]: Without dead ends: 5674 [2019-10-02 12:03:38,347 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:03:38,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5674 states. [2019-10-02 12:03:38,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5674 to 5559. [2019-10-02 12:03:38,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5559 states. [2019-10-02 12:03:38,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5559 states to 5559 states and 8875 transitions. [2019-10-02 12:03:38,703 INFO L78 Accepts]: Start accepts. Automaton has 5559 states and 8875 transitions. Word has length 187 [2019-10-02 12:03:38,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:38,704 INFO L475 AbstractCegarLoop]: Abstraction has 5559 states and 8875 transitions. [2019-10-02 12:03:38,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:03:38,704 INFO L276 IsEmpty]: Start isEmpty. Operand 5559 states and 8875 transitions. [2019-10-02 12:03:38,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-10-02 12:03:38,712 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:38,713 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38,713 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:38,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:38,714 INFO L82 PathProgramCache]: Analyzing trace with hash -222224296, now seen corresponding path program 1 times [2019-10-02 12:03:38,714 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:38,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:38,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:38,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:38,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:38,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:39,020 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:03:39,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:03:39,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:03:39,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:03:39,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:03:39,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:03:39,023 INFO L87 Difference]: Start difference. First operand 5559 states and 8875 transitions. Second operand 11 states. [2019-10-02 12:03:46,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:46,534 INFO L93 Difference]: Finished difference Result 11579 states and 18485 transitions. [2019-10-02 12:03:46,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 12:03:46,535 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 194 [2019-10-02 12:03:46,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:46,572 INFO L225 Difference]: With dead ends: 11579 [2019-10-02 12:03:46,573 INFO L226 Difference]: Without dead ends: 6868 [2019-10-02 12:03:46,590 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2019-10-02 12:03:46,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6868 states. [2019-10-02 12:03:46,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6868 to 6719. [2019-10-02 12:03:46,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6719 states. [2019-10-02 12:03:46,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6719 states to 6719 states and 10567 transitions. [2019-10-02 12:03:46,919 INFO L78 Accepts]: Start accepts. Automaton has 6719 states and 10567 transitions. Word has length 194 [2019-10-02 12:03:46,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:46,920 INFO L475 AbstractCegarLoop]: Abstraction has 6719 states and 10567 transitions. [2019-10-02 12:03:46,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:03:46,920 INFO L276 IsEmpty]: Start isEmpty. Operand 6719 states and 10567 transitions. [2019-10-02 12:03:46,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-02 12:03:46,925 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:46,926 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46,926 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:46,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:46,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1813399962, now seen corresponding path program 1 times [2019-10-02 12:03:46,927 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:46,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:47,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:47,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:47,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:47,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:47,155 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:03:47,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:03:47,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:03:47,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:03:47,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:03:47,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:03:47,161 INFO L87 Difference]: Start difference. First operand 6719 states and 10567 transitions. Second operand 4 states. [2019-10-02 12:03:47,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:47,889 INFO L93 Difference]: Finished difference Result 13280 states and 21057 transitions. [2019-10-02 12:03:47,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:03:47,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-10-02 12:03:47,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:47,923 INFO L225 Difference]: With dead ends: 13280 [2019-10-02 12:03:47,923 INFO L226 Difference]: Without dead ends: 6670 [2019-10-02 12:03:47,944 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:03:47,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6670 states. [2019-10-02 12:03:48,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6670 to 6670. [2019-10-02 12:03:48,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6670 states. [2019-10-02 12:03:48,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6670 states to 6670 states and 10469 transitions. [2019-10-02 12:03:48,246 INFO L78 Accepts]: Start accepts. Automaton has 6670 states and 10469 transitions. Word has length 192 [2019-10-02 12:03:48,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:48,247 INFO L475 AbstractCegarLoop]: Abstraction has 6670 states and 10469 transitions. [2019-10-02 12:03:48,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:03:48,247 INFO L276 IsEmpty]: Start isEmpty. Operand 6670 states and 10469 transitions. [2019-10-02 12:03:48,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-10-02 12:03:48,251 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:48,252 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,252 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:48,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:48,252 INFO L82 PathProgramCache]: Analyzing trace with hash -224839307, now seen corresponding path program 1 times [2019-10-02 12:03:48,253 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:48,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:48,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:48,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:48,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:48,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:48,466 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:03:48,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:03:48,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:03:48,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:03:48,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:03:48,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:03:48,467 INFO L87 Difference]: Start difference. First operand 6670 states and 10469 transitions. Second operand 6 states. [2019-10-02 12:03:49,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:49,128 INFO L93 Difference]: Finished difference Result 6736 states and 10576 transitions. [2019-10-02 12:03:49,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:03:49,128 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 195 [2019-10-02 12:03:49,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:49,161 INFO L225 Difference]: With dead ends: 6736 [2019-10-02 12:03:49,162 INFO L226 Difference]: Without dead ends: 6720 [2019-10-02 12:03:49,167 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:03:49,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6720 states. [2019-10-02 12:03:49,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6720 to 6682. [2019-10-02 12:03:49,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6682 states. [2019-10-02 12:03:49,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6682 states to 6682 states and 10481 transitions. [2019-10-02 12:03:49,595 INFO L78 Accepts]: Start accepts. Automaton has 6682 states and 10481 transitions. Word has length 195 [2019-10-02 12:03:49,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:49,596 INFO L475 AbstractCegarLoop]: Abstraction has 6682 states and 10481 transitions. [2019-10-02 12:03:49,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:03:49,596 INFO L276 IsEmpty]: Start isEmpty. Operand 6682 states and 10481 transitions. [2019-10-02 12:03:49,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-10-02 12:03:49,600 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:49,601 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,602 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:49,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:49,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1253615642, now seen corresponding path program 1 times [2019-10-02 12:03:49,606 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:49,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:49,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:49,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:49,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:49,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:49,794 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:03:49,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:03:49,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:03:49,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:03:49,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:03:49,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:03:49,799 INFO L87 Difference]: Start difference. First operand 6682 states and 10481 transitions. Second operand 8 states. [2019-10-02 12:03:49,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:49,993 INFO L93 Difference]: Finished difference Result 6706 states and 10511 transitions. [2019-10-02 12:03:49,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:03:49,993 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 201 [2019-10-02 12:03:49,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:50,015 INFO L225 Difference]: With dead ends: 6706 [2019-10-02 12:03:50,016 INFO L226 Difference]: Without dead ends: 6690 [2019-10-02 12:03:50,020 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:50,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6690 states. [2019-10-02 12:03:50,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6690 to 6682. [2019-10-02 12:03:50,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6682 states. [2019-10-02 12:03:50,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6682 states to 6682 states and 10471 transitions. [2019-10-02 12:03:50,303 INFO L78 Accepts]: Start accepts. Automaton has 6682 states and 10471 transitions. Word has length 201 [2019-10-02 12:03:50,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:50,303 INFO L475 AbstractCegarLoop]: Abstraction has 6682 states and 10471 transitions. [2019-10-02 12:03:50,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:03:50,304 INFO L276 IsEmpty]: Start isEmpty. Operand 6682 states and 10471 transitions. [2019-10-02 12:03:50,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-10-02 12:03:50,308 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:50,308 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50,309 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:50,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:50,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1414740554, now seen corresponding path program 1 times [2019-10-02 12:03:50,309 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:50,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:50,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:50,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:50,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:50,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:50,499 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 12:03:50,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:03:50,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:03:50,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:03:50,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:03:50,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:03:50,501 INFO L87 Difference]: Start difference. First operand 6682 states and 10471 transitions. Second operand 9 states. [2019-10-02 12:03:53,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:53,829 INFO L93 Difference]: Finished difference Result 13267 states and 20923 transitions. [2019-10-02 12:03:53,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:03:53,830 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 219 [2019-10-02 12:03:53,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:53,850 INFO L225 Difference]: With dead ends: 13267 [2019-10-02 12:03:53,850 INFO L226 Difference]: Without dead ends: 6710 [2019-10-02 12:03:53,864 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:03:53,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6710 states. [2019-10-02 12:03:54,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6710 to 6682. [2019-10-02 12:03:54,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6682 states. [2019-10-02 12:03:54,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6682 states to 6682 states and 10461 transitions. [2019-10-02 12:03:54,167 INFO L78 Accepts]: Start accepts. Automaton has 6682 states and 10461 transitions. Word has length 219 [2019-10-02 12:03:54,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:54,168 INFO L475 AbstractCegarLoop]: Abstraction has 6682 states and 10461 transitions. [2019-10-02 12:03:54,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:03:54,168 INFO L276 IsEmpty]: Start isEmpty. Operand 6682 states and 10461 transitions. [2019-10-02 12:03:54,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-10-02 12:03:54,173 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:54,173 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54,174 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:54,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:54,174 INFO L82 PathProgramCache]: Analyzing trace with hash 115499131, now seen corresponding path program 1 times [2019-10-02 12:03:54,174 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:54,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:54,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:54,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:54,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:54,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:54,406 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:03:54,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:03:54,407 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:54,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:54,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:55,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 3429 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-02 12:03:55,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:03:55,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 12:03:55,106 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 12:03:55,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:03:55,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2019-10-02 12:03:55,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 12:03:55,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 12:03:55,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:03:55,114 INFO L87 Difference]: Start difference. First operand 6682 states and 10461 transitions. Second operand 16 states. [2019-10-02 12:04:04,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:04,287 INFO L93 Difference]: Finished difference Result 14938 states and 23573 transitions. [2019-10-02 12:04:04,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-02 12:04:04,288 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 228 [2019-10-02 12:04:04,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:04,319 INFO L225 Difference]: With dead ends: 14938 [2019-10-02 12:04:04,319 INFO L226 Difference]: Without dead ends: 9118 [2019-10-02 12:04:04,337 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=214, Invalid=1426, Unknown=0, NotChecked=0, Total=1640 [2019-10-02 12:04:04,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9118 states. [2019-10-02 12:04:04,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9118 to 8711. [2019-10-02 12:04:04,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8711 states. [2019-10-02 12:04:04,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8711 states to 8711 states and 13346 transitions. [2019-10-02 12:04:04,840 INFO L78 Accepts]: Start accepts. Automaton has 8711 states and 13346 transitions. Word has length 228 [2019-10-02 12:04:04,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:04,840 INFO L475 AbstractCegarLoop]: Abstraction has 8711 states and 13346 transitions. [2019-10-02 12:04:04,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 12:04:04,841 INFO L276 IsEmpty]: Start isEmpty. Operand 8711 states and 13346 transitions. [2019-10-02 12:04:04,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-10-02 12:04:04,847 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:04,848 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 5, 5, 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] [2019-10-02 12:04:04,848 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:04,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:04,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1658604172, now seen corresponding path program 1 times [2019-10-02 12:04:04,849 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:04,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:04,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:04,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:04,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:04,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:05,093 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-10-02 12:04:05,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:05,094 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:04:05,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:05,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:05,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 3481 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-02 12:04:05,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:05,889 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 62 proven. 10 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-02 12:04:05,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:04:05,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2019-10-02 12:04:05,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 12:04:05,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 12:04:05,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-10-02 12:04:05,902 INFO L87 Difference]: Start difference. First operand 8711 states and 13346 transitions. Second operand 19 states. [2019-10-02 12:04:18,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:18,019 INFO L93 Difference]: Finished difference Result 26910 states and 41825 transitions. [2019-10-02 12:04:18,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 12:04:18,020 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 254 [2019-10-02 12:04:18,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:18,105 INFO L225 Difference]: With dead ends: 26910 [2019-10-02 12:04:18,105 INFO L226 Difference]: Without dead ends: 18322 [2019-10-02 12:04:18,143 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 261 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:18,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18322 states. [2019-10-02 12:04:18,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18322 to 18134. [2019-10-02 12:04:18,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18134 states. [2019-10-02 12:04:19,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18134 states to 18134 states and 28113 transitions. [2019-10-02 12:04:19,058 INFO L78 Accepts]: Start accepts. Automaton has 18134 states and 28113 transitions. Word has length 254 [2019-10-02 12:04:19,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:19,059 INFO L475 AbstractCegarLoop]: Abstraction has 18134 states and 28113 transitions. [2019-10-02 12:04:19,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 12:04:19,059 INFO L276 IsEmpty]: Start isEmpty. Operand 18134 states and 28113 transitions. [2019-10-02 12:04:19,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-10-02 12:04:19,066 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:19,067 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 5, 4, 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:19,067 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:19,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:19,067 INFO L82 PathProgramCache]: Analyzing trace with hash -567748161, now seen corresponding path program 1 times [2019-10-02 12:04:19,067 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:19,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:19,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:19,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:19,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:19,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:19,238 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-10-02 12:04:19,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:19,239 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:04:19,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:19,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:19,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 3482 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:04:19,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:19,932 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-02 12:04:19,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:04:19,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:04:19,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:04:19,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:04:19,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:04:19,943 INFO L87 Difference]: Start difference. First operand 18134 states and 28113 transitions. Second operand 6 states. [2019-10-02 12:04:21,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:21,684 INFO L93 Difference]: Finished difference Result 36897 states and 57840 transitions. [2019-10-02 12:04:21,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:04:21,685 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 255 [2019-10-02 12:04:21,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:21,760 INFO L225 Difference]: With dead ends: 36897 [2019-10-02 12:04:21,760 INFO L226 Difference]: Without dead ends: 18474 [2019-10-02 12:04:21,795 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 256 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:04:21,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18474 states. [2019-10-02 12:04:22,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18474 to 18460. [2019-10-02 12:04:22,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18460 states. [2019-10-02 12:04:22,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18460 states to 18460 states and 28122 transitions. [2019-10-02 12:04:22,466 INFO L78 Accepts]: Start accepts. Automaton has 18460 states and 28122 transitions. Word has length 255 [2019-10-02 12:04:22,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:22,467 INFO L475 AbstractCegarLoop]: Abstraction has 18460 states and 28122 transitions. [2019-10-02 12:04:22,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:04:22,467 INFO L276 IsEmpty]: Start isEmpty. Operand 18460 states and 28122 transitions. [2019-10-02 12:04:22,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-10-02 12:04:22,478 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:22,479 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 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, 2, 2, 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] [2019-10-02 12:04:22,479 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:22,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:22,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1482539434, now seen corresponding path program 1 times [2019-10-02 12:04:22,479 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:22,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:22,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:22,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:22,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:22,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:22,650 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-10-02 12:04:22,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:22,651 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:04:22,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:23,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:23,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 4170 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:04:23,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:23,505 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-10-02 12:04:23,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:04:23,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-10-02 12:04:23,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:04:23,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:04:23,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:04:23,525 INFO L87 Difference]: Start difference. First operand 18460 states and 28122 transitions. Second operand 7 states. [2019-10-02 12:04:24,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:24,566 INFO L93 Difference]: Finished difference Result 37683 states and 58063 transitions. [2019-10-02 12:04:24,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:04:24,567 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 336 [2019-10-02 12:04:24,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:24,642 INFO L225 Difference]: With dead ends: 37683 [2019-10-02 12:04:24,642 INFO L226 Difference]: Without dead ends: 19340 [2019-10-02 12:04:24,681 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 336 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:04:24,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19340 states. [2019-10-02 12:04:25,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19340 to 19320. [2019-10-02 12:04:25,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19320 states. [2019-10-02 12:04:25,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19320 states to 19320 states and 29670 transitions. [2019-10-02 12:04:25,311 INFO L78 Accepts]: Start accepts. Automaton has 19320 states and 29670 transitions. Word has length 336 [2019-10-02 12:04:25,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:25,312 INFO L475 AbstractCegarLoop]: Abstraction has 19320 states and 29670 transitions. [2019-10-02 12:04:25,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:04:25,312 INFO L276 IsEmpty]: Start isEmpty. Operand 19320 states and 29670 transitions. [2019-10-02 12:04:25,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2019-10-02 12:04:25,325 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:25,325 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 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, 2, 2, 2, 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] [2019-10-02 12:04:25,325 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:25,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:25,326 INFO L82 PathProgramCache]: Analyzing trace with hash -604458981, now seen corresponding path program 1 times [2019-10-02 12:04:25,326 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:25,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:25,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:25,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:25,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:25,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:25,561 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2019-10-02 12:04:25,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:25,562 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:25,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:26,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:26,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 4175 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-02 12:04:26,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:26,682 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2019-10-02 12:04:26,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:04:26,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-10-02 12:04:26,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 12:04:26,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 12:04:26,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:04:26,691 INFO L87 Difference]: Start difference. First operand 19320 states and 29670 transitions. Second operand 15 states. [2019-10-02 12:04:40,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:40,652 INFO L93 Difference]: Finished difference Result 65331 states and 102863 transitions. [2019-10-02 12:04:40,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-02 12:04:40,653 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 343 [2019-10-02 12:04:40,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:40,856 INFO L225 Difference]: With dead ends: 65331 [2019-10-02 12:04:40,856 INFO L226 Difference]: Without dead ends: 45965 [2019-10-02 12:04:40,932 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=407, Invalid=1573, Unknown=0, NotChecked=0, Total=1980 [2019-10-02 12:04:40,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45965 states. [2019-10-02 12:04:42,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45965 to 45338. [2019-10-02 12:04:42,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45338 states. [2019-10-02 12:04:42,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45338 states to 45338 states and 69657 transitions. [2019-10-02 12:04:42,670 INFO L78 Accepts]: Start accepts. Automaton has 45338 states and 69657 transitions. Word has length 343 [2019-10-02 12:04:42,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:42,671 INFO L475 AbstractCegarLoop]: Abstraction has 45338 states and 69657 transitions. [2019-10-02 12:04:42,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 12:04:42,671 INFO L276 IsEmpty]: Start isEmpty. Operand 45338 states and 69657 transitions. [2019-10-02 12:04:42,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-10-02 12:04:42,677 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:42,678 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42,678 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:42,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:42,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1214905313, now seen corresponding path program 1 times [2019-10-02 12:04:42,679 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:42,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:42,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:42,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:42,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:42,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:42,860 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-10-02 12:04:42,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:04:42,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:04:42,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:04:42,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:04:42,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:04:42,861 INFO L87 Difference]: Start difference. First operand 45338 states and 69657 transitions. Second operand 8 states. [2019-10-02 12:04:44,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:44,689 INFO L93 Difference]: Finished difference Result 87399 states and 135367 transitions. [2019-10-02 12:04:44,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:04:44,689 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 292 [2019-10-02 12:04:44,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:44,873 INFO L225 Difference]: With dead ends: 87399 [2019-10-02 12:04:44,874 INFO L226 Difference]: Without dead ends: 42314 [2019-10-02 12:04:44,969 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:04:45,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42314 states. [2019-10-02 12:04:46,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42314 to 42138. [2019-10-02 12:04:46,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42138 states. [2019-10-02 12:04:46,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42138 states to 42138 states and 65157 transitions. [2019-10-02 12:04:46,293 INFO L78 Accepts]: Start accepts. Automaton has 42138 states and 65157 transitions. Word has length 292 [2019-10-02 12:04:46,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:46,294 INFO L475 AbstractCegarLoop]: Abstraction has 42138 states and 65157 transitions. [2019-10-02 12:04:46,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:04:46,294 INFO L276 IsEmpty]: Start isEmpty. Operand 42138 states and 65157 transitions. [2019-10-02 12:04:46,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-10-02 12:04:46,300 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:46,300 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46,300 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:46,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:46,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1649670873, now seen corresponding path program 1 times [2019-10-02 12:04:46,301 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:46,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:46,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:46,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:46,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:46,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:46,526 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 23 proven. 19 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-10-02 12:04:46,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:46,526 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:47,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:47,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:47,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 3839 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:04:47,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:47,710 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 20 proven. 65 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-02 12:04:47,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:04:47,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2019-10-02 12:04:47,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 12:04:47,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 12:04:47,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:04:47,720 INFO L87 Difference]: Start difference. First operand 42138 states and 65157 transitions. Second operand 15 states. [2019-10-02 12:05:04,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:05:04,716 INFO L93 Difference]: Finished difference Result 106113 states and 166680 transitions. [2019-10-02 12:05:04,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-02 12:05:04,717 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 303 [2019-10-02 12:05:04,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:05:07,431 INFO L225 Difference]: With dead ends: 106113 [2019-10-02 12:05:07,432 INFO L226 Difference]: Without dead ends: 64198 [2019-10-02 12:05:07,524 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 622 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=372, Invalid=2280, Unknown=0, NotChecked=0, Total=2652 [2019-10-02 12:05:07,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64198 states. [2019-10-02 12:05:09,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64198 to 62326. [2019-10-02 12:05:09,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62326 states. [2019-10-02 12:05:09,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62326 states to 62326 states and 95140 transitions. [2019-10-02 12:05:09,773 INFO L78 Accepts]: Start accepts. Automaton has 62326 states and 95140 transitions. Word has length 303 [2019-10-02 12:05:09,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:05:09,774 INFO L475 AbstractCegarLoop]: Abstraction has 62326 states and 95140 transitions. [2019-10-02 12:05:09,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 12:05:09,774 INFO L276 IsEmpty]: Start isEmpty. Operand 62326 states and 95140 transitions. [2019-10-02 12:05:09,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-10-02 12:05:09,784 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:05:09,785 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09,785 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:05:09,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:05:10,242 INFO L82 PathProgramCache]: Analyzing trace with hash 159363248, now seen corresponding path program 1 times [2019-10-02 12:05:10,243 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:05:10,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:05:10,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:10,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:10,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:10,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:10,481 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 19 proven. 15 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-10-02 12:05:10,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:05:10,481 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:05:10,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:11,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:11,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 3837 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:05:11,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:05:11,259 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-10-02 12:05:11,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:05:11,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2019-10-02 12:05:11,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 12:05:11,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 12:05:11,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:05:11,268 INFO L87 Difference]: Start difference. First operand 62326 states and 95140 transitions. Second operand 15 states. [2019-10-02 12:05:41,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:05:41,646 INFO L93 Difference]: Finished difference Result 272722 states and 438639 transitions. [2019-10-02 12:05:41,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-02 12:05:41,647 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 304 [2019-10-02 12:05:41,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:05:42,772 INFO L225 Difference]: With dead ends: 272722 [2019-10-02 12:05:42,772 INFO L226 Difference]: Without dead ends: 210023 [2019-10-02 12:05:42,998 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 332 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=337, Invalid=2015, Unknown=0, NotChecked=0, Total=2352 [2019-10-02 12:05:43,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210023 states. [2019-10-02 12:05:55,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210023 to 206681. [2019-10-02 12:05:55,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206681 states. [2019-10-02 12:05:57,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206681 states to 206681 states and 328773 transitions. [2019-10-02 12:05:57,077 INFO L78 Accepts]: Start accepts. Automaton has 206681 states and 328773 transitions. Word has length 304 [2019-10-02 12:05:57,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:05:57,078 INFO L475 AbstractCegarLoop]: Abstraction has 206681 states and 328773 transitions. [2019-10-02 12:05:57,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 12:05:57,078 INFO L276 IsEmpty]: Start isEmpty. Operand 206681 states and 328773 transitions. [2019-10-02 12:05:57,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-10-02 12:05:57,118 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:05:57,118 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57,119 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:05:57,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:05:57,119 INFO L82 PathProgramCache]: Analyzing trace with hash 170591701, now seen corresponding path program 1 times [2019-10-02 12:05:57,119 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:05:57,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:05:57,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:57,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:57,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:57,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:57,310 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-10-02 12:05:57,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:05:57,311 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:06:01,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:02,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:02,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 3838 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 12:06:02,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:06:02,461 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-10-02 12:06:02,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:06:02,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2019-10-02 12:06:02,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 12:06:02,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 12:06:02,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:06:02,472 INFO L87 Difference]: Start difference. First operand 206681 states and 328773 transitions. Second operand 15 states. [2019-10-02 12:06:26,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:26,973 INFO L93 Difference]: Finished difference Result 517231 states and 832595 transitions. [2019-10-02 12:06:26,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 12:06:26,974 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 306 [2019-10-02 12:06:26,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:35,321 INFO L225 Difference]: With dead ends: 517231 [2019-10-02 12:06:35,321 INFO L226 Difference]: Without dead ends: 305476 [2019-10-02 12:06:35,820 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2019-10-02 12:06:36,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305476 states. [2019-10-02 12:06:57,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305476 to 301080. [2019-10-02 12:06:57,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301080 states. [2019-10-02 12:06:59,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301080 states to 301080 states and 479013 transitions. [2019-10-02 12:06:59,971 INFO L78 Accepts]: Start accepts. Automaton has 301080 states and 479013 transitions. Word has length 306 [2019-10-02 12:06:59,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:59,972 INFO L475 AbstractCegarLoop]: Abstraction has 301080 states and 479013 transitions. [2019-10-02 12:06:59,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 12:06:59,972 INFO L276 IsEmpty]: Start isEmpty. Operand 301080 states and 479013 transitions. [2019-10-02 12:07:00,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-10-02 12:07:00,026 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:07:00,026 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00,026 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:07:00,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:07:00,027 INFO L82 PathProgramCache]: Analyzing trace with hash -698729957, now seen corresponding path program 1 times [2019-10-02 12:07:00,027 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:07:00,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:07:00,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:00,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:00,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:00,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:00,211 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-10-02 12:07:00,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:07:00,212 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:07:00,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:00,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:00,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 3844 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 12:07:00,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:07:01,942 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-10-02 12:07:01,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:07:01,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-10-02 12:07:01,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:07:01,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:07:01,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:07:01,953 INFO L87 Difference]: Start difference. First operand 301080 states and 479013 transitions. Second operand 6 states. [2019-10-02 12:07:32,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:07:32,357 INFO L93 Difference]: Finished difference Result 651528 states and 1034967 transitions. [2019-10-02 12:07:32,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:07:32,358 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 308 [2019-10-02 12:07:32,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:07:34,389 INFO L225 Difference]: With dead ends: 651528 [2019-10-02 12:07:34,389 INFO L226 Difference]: Without dead ends: 350946 [2019-10-02 12:07:44,286 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 319 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:07:44,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350946 states. [2019-10-02 12:08:10,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350946 to 348444. [2019-10-02 12:08:10,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348444 states. [2019-10-02 12:08:12,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348444 states to 348444 states and 543994 transitions. [2019-10-02 12:08:12,566 INFO L78 Accepts]: Start accepts. Automaton has 348444 states and 543994 transitions. Word has length 308 [2019-10-02 12:08:12,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:08:12,566 INFO L475 AbstractCegarLoop]: Abstraction has 348444 states and 543994 transitions. [2019-10-02 12:08:12,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:08:12,566 INFO L276 IsEmpty]: Start isEmpty. Operand 348444 states and 543994 transitions. [2019-10-02 12:08:12,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-10-02 12:08:12,594 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:08:12,595 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:08:12,595 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:08:12,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:08:12,595 INFO L82 PathProgramCache]: Analyzing trace with hash -807977072, now seen corresponding path program 1 times [2019-10-02 12:08:12,595 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:08:12,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:08:12,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:12,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:08:12,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:12,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:08:14,216 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-02 12:08:14,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:08:14,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:08:14,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:08:14,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:08:14,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:08:14,218 INFO L87 Difference]: Start difference. First operand 348444 states and 543994 transitions. Second operand 7 states. [2019-10-02 12:08:45,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:08:45,295 INFO L93 Difference]: Finished difference Result 759857 states and 1203577 transitions. [2019-10-02 12:08:45,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 12:08:45,295 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 310 [2019-10-02 12:08:45,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:08:48,523 INFO L225 Difference]: With dead ends: 759857 [2019-10-02 12:08:48,523 INFO L226 Difference]: Without dead ends: 411055 [2019-10-02 12:08:49,338 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:08:49,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411055 states. [2019-10-02 12:09:32,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411055 to 407257. [2019-10-02 12:09:32,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407257 states. [2019-10-02 12:09:36,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407257 states to 407257 states and 639784 transitions. [2019-10-02 12:09:36,453 INFO L78 Accepts]: Start accepts. Automaton has 407257 states and 639784 transitions. Word has length 310 [2019-10-02 12:09:36,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:09:36,454 INFO L475 AbstractCegarLoop]: Abstraction has 407257 states and 639784 transitions. [2019-10-02 12:09:36,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:09:36,454 INFO L276 IsEmpty]: Start isEmpty. Operand 407257 states and 639784 transitions. [2019-10-02 12:09:36,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-10-02 12:09:36,487 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:09:36,487 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:09:36,488 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:09:36,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:09:36,488 INFO L82 PathProgramCache]: Analyzing trace with hash -765255183, now seen corresponding path program 1 times [2019-10-02 12:09:36,488 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:09:36,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:09:36,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:09:36,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:09:36,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:09:36,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:09:36,691 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-02 12:09:36,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:09:36,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:09:36,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:09:36,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:09:36,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:09:36,693 INFO L87 Difference]: Start difference. First operand 407257 states and 639784 transitions. Second operand 7 states. [2019-10-02 12:10:26,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:10:26,580 INFO L93 Difference]: Finished difference Result 891149 states and 1428055 transitions. [2019-10-02 12:10:26,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 12:10:26,581 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 311 [2019-10-02 12:10:26,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:10:29,094 INFO L225 Difference]: With dead ends: 891149 [2019-10-02 12:10:29,094 INFO L226 Difference]: Without dead ends: 483066 [2019-10-02 12:10:31,613 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:10:31,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483066 states. [2019-10-02 12:11:10,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483066 to 479487. [2019-10-02 12:11:10,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479487 states. [2019-10-02 12:11:26,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479487 states to 479487 states and 751094 transitions. [2019-10-02 12:11:26,887 INFO L78 Accepts]: Start accepts. Automaton has 479487 states and 751094 transitions. Word has length 311 [2019-10-02 12:11:26,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:11:26,888 INFO L475 AbstractCegarLoop]: Abstraction has 479487 states and 751094 transitions. [2019-10-02 12:11:26,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:11:26,888 INFO L276 IsEmpty]: Start isEmpty. Operand 479487 states and 751094 transitions. [2019-10-02 12:11:26,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-10-02 12:11:26,932 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:11:26,932 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:11:26,932 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:11:26,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:11:26,933 INFO L82 PathProgramCache]: Analyzing trace with hash -546775420, now seen corresponding path program 1 times [2019-10-02 12:11:26,933 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:11:26,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:11:26,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:11:26,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:11:26,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:11:26,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:11:27,092 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-10-02 12:11:27,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:11:27,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:11:27,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:11:27,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:11:27,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:11:27,094 INFO L87 Difference]: Start difference. First operand 479487 states and 751094 transitions. Second operand 9 states. [2019-10-02 12:12:03,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:12:03,602 INFO L93 Difference]: Finished difference Result 701775 states and 1084781 transitions. [2019-10-02 12:12:03,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:12:03,603 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 311 [2019-10-02 12:12:03,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:12:07,219 INFO L225 Difference]: With dead ends: 701775 [2019-10-02 12:12:07,219 INFO L226 Difference]: Without dead ends: 474741 [2019-10-02 12:12:07,715 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 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:12:08,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474741 states. [2019-10-02 12:12:48,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474741 to 474741. [2019-10-02 12:12:48,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474741 states. [2019-10-02 12:12:52,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474741 states to 474741 states and 738734 transitions. [2019-10-02 12:12:52,142 INFO L78 Accepts]: Start accepts. Automaton has 474741 states and 738734 transitions. Word has length 311 [2019-10-02 12:12:52,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:12:52,142 INFO L475 AbstractCegarLoop]: Abstraction has 474741 states and 738734 transitions. [2019-10-02 12:12:52,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:12:52,142 INFO L276 IsEmpty]: Start isEmpty. Operand 474741 states and 738734 transitions. [2019-10-02 12:12:52,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-10-02 12:12:52,166 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:12:52,167 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:12:52,167 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:12:52,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:12:52,167 INFO L82 PathProgramCache]: Analyzing trace with hash 699416876, now seen corresponding path program 1 times [2019-10-02 12:12:52,167 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:12:52,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:12:52,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:12:52,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:12:52,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:12:52,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:12:52,376 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-10-02 12:12:52,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:12:52,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:12:52,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:12:52,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:12:52,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:12:52,378 INFO L87 Difference]: Start difference. First operand 474741 states and 738734 transitions. Second operand 7 states.