java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/product-lines/elevator_spec13_product29.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 11:48:13,242 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 11:48:13,244 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 11:48:13,255 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 11:48:13,255 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 11:48:13,256 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 11:48:13,257 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 11:48:13,259 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 11:48:13,261 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 11:48:13,262 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 11:48:13,262 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 11:48:13,263 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 11:48:13,264 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 11:48:13,265 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 11:48:13,265 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 11:48:13,267 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 11:48:13,267 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 11:48:13,268 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 11:48:13,270 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 11:48:13,272 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 11:48:13,273 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 11:48:13,274 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 11:48:13,275 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 11:48:13,276 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 11:48:13,278 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 11:48:13,278 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 11:48:13,279 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 11:48:13,279 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 11:48:13,280 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 11:48:13,281 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 11:48:13,281 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 11:48:13,282 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 11:48:13,282 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 11:48:13,283 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 11:48:13,284 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 11:48:13,284 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 11:48:13,285 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 11:48:13,285 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 11:48:13,285 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 11:48:13,286 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 11:48:13,287 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 11:48:13,287 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 11:48:13,301 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 11:48:13,301 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 11:48:13,306 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 11:48:13,306 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 11:48:13,306 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 11:48:13,306 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 11:48:13,306 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 11:48:13,307 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 11:48:13,307 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 11:48:13,307 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 11:48:13,307 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 11:48:13,307 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 11:48:13,308 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 11:48:13,308 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 11:48:13,308 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 11:48:13,308 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 11:48:13,308 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 11:48:13,309 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 11:48:13,309 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 11:48:13,309 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 11:48:13,309 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 11:48:13,309 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:48:13,310 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 11:48:13,310 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 11:48:13,310 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 11:48:13,311 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 11:48:13,311 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 11:48:13,311 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 11:48:13,312 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 11:48:13,344 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 11:48:13,356 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 11:48:13,361 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 11:48:13,362 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 11:48:13,363 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 11:48:13,363 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec13_product29.cil.c [2019-10-02 11:48:13,426 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/968bc3fcc/c93fb8be102f4fad993b87d6a362669a/FLAG276963135 [2019-10-02 11:48:14,076 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 11:48:14,076 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec13_product29.cil.c [2019-10-02 11:48:14,095 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/968bc3fcc/c93fb8be102f4fad993b87d6a362669a/FLAG276963135 [2019-10-02 11:48:14,239 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/968bc3fcc/c93fb8be102f4fad993b87d6a362669a [2019-10-02 11:48:14,249 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 11:48:14,251 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 11:48:14,252 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 11:48:14,252 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 11:48:14,255 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 11:48:14,255 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:48:14" (1/1) ... [2019-10-02 11:48:14,258 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f77762e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:48:14, skipping insertion in model container [2019-10-02 11:48:14,258 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:48:14" (1/1) ... [2019-10-02 11:48:14,264 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 11:48:14,334 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 11:48:15,039 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:48:15,059 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 11:48:15,209 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:48:15,283 INFO L192 MainTranslator]: Completed translation [2019-10-02 11:48:15,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:48:15 WrapperNode [2019-10-02 11:48:15,284 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 11:48:15,285 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 11:48:15,285 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 11:48:15,285 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 11:48:15,298 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:48:15" (1/1) ... [2019-10-02 11:48:15,299 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:48:15" (1/1) ... [2019-10-02 11:48:15,332 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:48:15" (1/1) ... [2019-10-02 11:48:15,333 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:48:15" (1/1) ... [2019-10-02 11:48:15,393 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:48:15" (1/1) ... [2019-10-02 11:48:15,450 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:48:15" (1/1) ... [2019-10-02 11:48:15,471 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:48:15" (1/1) ... [2019-10-02 11:48:15,484 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 11:48:15,485 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 11:48:15,485 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 11:48:15,485 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 11:48:15,486 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:48:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:48:15,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 11:48:15,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 11:48:15,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 11:48:15,558 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-02 11:48:15,559 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-02 11:48:15,559 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-02 11:48:15,559 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-02 11:48:15,559 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-02 11:48:15,559 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-02 11:48:15,560 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-02 11:48:15,560 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-02 11:48:15,560 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 11:48:15,560 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-02 11:48:15,561 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-02 11:48:15,561 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-02 11:48:15,561 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-02 11:48:15,561 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-02 11:48:15,562 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-02 11:48:15,562 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-02 11:48:15,562 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-02 11:48:15,562 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-02 11:48:15,562 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-10-02 11:48:15,563 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-02 11:48:15,563 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-02 11:48:15,563 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-02 11:48:15,563 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-02 11:48:15,563 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-02 11:48:15,564 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-02 11:48:15,564 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-02 11:48:15,564 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-02 11:48:15,564 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-02 11:48:15,564 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-02 11:48:15,564 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-10-02 11:48:15,565 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-02 11:48:15,565 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-02 11:48:15,565 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-02 11:48:15,565 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-02 11:48:15,565 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-02 11:48:15,566 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-02 11:48:15,566 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-02 11:48:15,566 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-02 11:48:15,566 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-02 11:48:15,566 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-02 11:48:15,566 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification13_spec__1 [2019-10-02 11:48:15,567 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification13_spec__2 [2019-10-02 11:48:15,567 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 11:48:15,567 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-02 11:48:15,567 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-02 11:48:15,567 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-02 11:48:15,568 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-02 11:48:15,568 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-02 11:48:15,568 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-02 11:48:15,568 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-02 11:48:15,568 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-02 11:48:15,568 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-02 11:48:15,568 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-02 11:48:15,569 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-02 11:48:15,569 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-02 11:48:15,569 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-02 11:48:15,569 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-02 11:48:15,569 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-02 11:48:15,569 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-02 11:48:15,570 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 11:48:15,570 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-02 11:48:15,570 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 11:48:15,570 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 11:48:15,570 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 11:48:15,570 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 11:48:15,571 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 11:48:15,571 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 11:48:15,571 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 11:48:15,571 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 11:48:15,571 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 11:48:15,571 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 11:48:15,571 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 11:48:15,572 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 11:48:15,572 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 11:48:15,572 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-02 11:48:15,572 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-02 11:48:15,572 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-02 11:48:15,573 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-02 11:48:15,574 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-02 11:48:15,574 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-02 11:48:15,574 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-02 11:48:15,574 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-02 11:48:15,574 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-02 11:48:15,575 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-02 11:48:15,576 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-02 11:48:15,576 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-02 11:48:15,576 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-02 11:48:15,576 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 11:48:15,577 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-02 11:48:15,577 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-02 11:48:15,577 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-02 11:48:15,578 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 11:48:15,578 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-02 11:48:15,578 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-02 11:48:15,578 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-02 11:48:15,578 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-02 11:48:15,578 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-02 11:48:15,578 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-02 11:48:15,579 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-02 11:48:15,579 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-02 11:48:15,579 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-02 11:48:15,579 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-02 11:48:15,579 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-02 11:48:15,579 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-02 11:48:15,580 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-02 11:48:15,580 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-02 11:48:15,580 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-10-02 11:48:15,580 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-02 11:48:15,580 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-02 11:48:15,580 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-02 11:48:15,580 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-02 11:48:15,581 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-02 11:48:15,581 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-10-02 11:48:15,581 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-02 11:48:15,581 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-02 11:48:15,581 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-02 11:48:15,582 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-02 11:48:15,582 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-02 11:48:15,582 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-02 11:48:15,582 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification13_spec__1 [2019-10-02 11:48:15,582 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification13_spec__2 [2019-10-02 11:48:15,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 11:48:15,583 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-02 11:48:15,584 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 11:48:15,584 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-02 11:48:15,584 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-02 11:48:15,584 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 11:48:15,584 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-02 11:48:15,585 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-02 11:48:15,585 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-02 11:48:15,585 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-02 11:48:15,586 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-02 11:48:15,586 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-02 11:48:15,586 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-02 11:48:15,587 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-02 11:48:15,587 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-02 11:48:15,588 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 11:48:15,591 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-02 11:48:15,591 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 11:48:15,591 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 11:48:15,592 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 11:48:15,598 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 11:48:15,599 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 11:48:15,599 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 11:48:15,599 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 11:48:15,599 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 11:48:15,599 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 11:48:15,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 11:48:15,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 11:48:15,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 11:48:15,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 11:48:15,600 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 11:48:15,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 11:48:15,601 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 11:48:15,601 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 11:48:15,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 11:48:15,601 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 11:48:15,601 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 11:48:15,601 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 11:48:15,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 11:48:15,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 11:48:15,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 11:48:17,662 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 11:48:17,662 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-02 11:48:17,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:48:17 BoogieIcfgContainer [2019-10-02 11:48:17,664 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 11:48:17,665 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 11:48:17,665 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 11:48:17,668 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 11:48:17,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 11:48:14" (1/3) ... [2019-10-02 11:48:17,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44a9d25d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:48:17, skipping insertion in model container [2019-10-02 11:48:17,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:48:15" (2/3) ... [2019-10-02 11:48:17,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44a9d25d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:48:17, skipping insertion in model container [2019-10-02 11:48:17,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:48:17" (3/3) ... [2019-10-02 11:48:17,672 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec13_product29.cil.c [2019-10-02 11:48:17,683 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 11:48:17,699 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 11:48:17,719 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 11:48:17,773 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 11:48:17,774 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 11:48:17,774 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 11:48:17,774 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 11:48:17,775 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 11:48:17,775 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 11:48:17,775 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 11:48:17,775 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 11:48:17,775 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 11:48:17,817 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states. [2019-10-02 11:48:17,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-02 11:48:17,851 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:48:17,853 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] [2019-10-02 11:48:17,857 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:48:17,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:48:17,863 INFO L82 PathProgramCache]: Analyzing trace with hash -332119901, now seen corresponding path program 1 times [2019-10-02 11:48:17,865 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:48:17,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:48:17,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:17,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:48:17,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:18,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:48:18,513 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-02 11:48:18,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:48:18,516 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:48:18,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:48:19,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:48:19,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 2987 conjuncts, 1 conjunts are in the unsatisfiable core [2019-10-02 11:48:19,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:48:19,261 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:48:19,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:48:19,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 7 [2019-10-02 11:48:19,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:48:19,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:48:19,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:48:19,290 INFO L87 Difference]: Start difference. First operand 804 states. Second operand 7 states. [2019-10-02 11:48:19,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:48:19,582 INFO L93 Difference]: Finished difference Result 1318 states and 2138 transitions. [2019-10-02 11:48:19,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:48:19,584 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 152 [2019-10-02 11:48:19,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:48:19,621 INFO L225 Difference]: With dead ends: 1318 [2019-10-02 11:48:19,621 INFO L226 Difference]: Without dead ends: 662 [2019-10-02 11:48:19,633 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:48:19,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2019-10-02 11:48:19,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2019-10-02 11:48:19,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2019-10-02 11:48:19,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1050 transitions. [2019-10-02 11:48:19,793 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1050 transitions. Word has length 152 [2019-10-02 11:48:19,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:48:19,793 INFO L475 AbstractCegarLoop]: Abstraction has 662 states and 1050 transitions. [2019-10-02 11:48:19,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:48:19,794 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1050 transitions. [2019-10-02 11:48:19,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-02 11:48:19,807 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:48:19,807 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:48:19,809 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:48:19,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:48:19,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1998614119, now seen corresponding path program 1 times [2019-10-02 11:48:19,810 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:48:19,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:48:19,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:19,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:48:19,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:19,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:48:20,094 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-02 11:48:20,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:48:20,095 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:48:20,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:48:20,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:48:20,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 2983 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 11:48:20,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:48:20,802 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-02 11:48:20,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:48:20,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-10-02 11:48:20,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 11:48:20,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 11:48:20,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:48:20,817 INFO L87 Difference]: Start difference. First operand 662 states and 1050 transitions. Second operand 12 states. [2019-10-02 11:48:21,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:48:21,057 INFO L93 Difference]: Finished difference Result 1305 states and 2085 transitions. [2019-10-02 11:48:21,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:48:21,058 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 154 [2019-10-02 11:48:21,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:48:21,065 INFO L225 Difference]: With dead ends: 1305 [2019-10-02 11:48:21,065 INFO L226 Difference]: Without dead ends: 671 [2019-10-02 11:48:21,069 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-10-02 11:48:21,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2019-10-02 11:48:21,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 669. [2019-10-02 11:48:21,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 669 states. [2019-10-02 11:48:21,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 1062 transitions. [2019-10-02 11:48:21,110 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 1062 transitions. Word has length 154 [2019-10-02 11:48:21,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:48:21,111 INFO L475 AbstractCegarLoop]: Abstraction has 669 states and 1062 transitions. [2019-10-02 11:48:21,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 11:48:21,111 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 1062 transitions. [2019-10-02 11:48:21,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-02 11:48:21,117 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:48:21,117 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 11:48:21,118 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:48:21,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:48:21,118 INFO L82 PathProgramCache]: Analyzing trace with hash -118777742, now seen corresponding path program 1 times [2019-10-02 11:48:21,118 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:48:21,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:48:21,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:21,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:48:21,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:48:21,348 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-02 11:48:21,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:48:21,349 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:48:21,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:48:21,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:48:21,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 2984 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 11:48:21,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:48:21,916 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 19 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 11:48:21,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:48:21,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 11:48:21,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:48:21,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:48:21,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:48:21,934 INFO L87 Difference]: Start difference. First operand 669 states and 1062 transitions. Second operand 6 states. [2019-10-02 11:48:22,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:48:22,066 INFO L93 Difference]: Finished difference Result 1317 states and 2105 transitions. [2019-10-02 11:48:22,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:48:22,067 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 155 [2019-10-02 11:48:22,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:48:22,073 INFO L225 Difference]: With dead ends: 1317 [2019-10-02 11:48:22,073 INFO L226 Difference]: Without dead ends: 670 [2019-10-02 11:48:22,076 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:48:22,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2019-10-02 11:48:22,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 670. [2019-10-02 11:48:22,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-10-02 11:48:22,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1058 transitions. [2019-10-02 11:48:22,133 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1058 transitions. Word has length 155 [2019-10-02 11:48:22,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:48:22,134 INFO L475 AbstractCegarLoop]: Abstraction has 670 states and 1058 transitions. [2019-10-02 11:48:22,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:48:22,134 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1058 transitions. [2019-10-02 11:48:22,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-02 11:48:22,142 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:48:22,142 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] [2019-10-02 11:48:22,142 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:48:22,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:48:22,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1407116543, now seen corresponding path program 1 times [2019-10-02 11:48:22,143 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:48:22,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:48:22,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:22,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:48:22,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:22,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:48:22,389 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-02 11:48:22,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:48:22,390 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:48:22,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:48:23,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:48:23,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 2985 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 11:48:23,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:48:23,181 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-02 11:48:23,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:48:23,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-10-02 11:48:23,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 11:48:23,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 11:48:23,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:48:23,199 INFO L87 Difference]: Start difference. First operand 670 states and 1058 transitions. Second operand 12 states. [2019-10-02 11:48:23,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:48:23,466 INFO L93 Difference]: Finished difference Result 1310 states and 2087 transitions. [2019-10-02 11:48:23,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:48:23,467 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 156 [2019-10-02 11:48:23,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:48:23,478 INFO L225 Difference]: With dead ends: 1310 [2019-10-02 11:48:23,478 INFO L226 Difference]: Without dead ends: 673 [2019-10-02 11:48:23,484 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:48:23,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2019-10-02 11:48:23,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 670. [2019-10-02 11:48:23,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-10-02 11:48:23,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1058 transitions. [2019-10-02 11:48:23,516 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1058 transitions. Word has length 156 [2019-10-02 11:48:23,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:48:23,517 INFO L475 AbstractCegarLoop]: Abstraction has 670 states and 1058 transitions. [2019-10-02 11:48:23,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 11:48:23,518 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1058 transitions. [2019-10-02 11:48:23,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-02 11:48:23,526 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:48:23,527 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] [2019-10-02 11:48:23,527 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:48:23,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:48:23,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1641192568, now seen corresponding path program 1 times [2019-10-02 11:48:23,527 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:48:23,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:48:23,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:23,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:48:23,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:23,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:48:23,706 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-02 11:48:23,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:48:23,706 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:48:23,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:48:24,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:48:24,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 2986 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 11:48:24,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:48:24,385 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-02 11:48:24,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:48:24,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-10-02 11:48:24,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 11:48:24,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 11:48:24,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:48:24,403 INFO L87 Difference]: Start difference. First operand 670 states and 1058 transitions. Second operand 12 states. [2019-10-02 11:48:24,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:48:24,584 INFO L93 Difference]: Finished difference Result 1310 states and 2087 transitions. [2019-10-02 11:48:24,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:48:24,584 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 157 [2019-10-02 11:48:24,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:48:24,590 INFO L225 Difference]: With dead ends: 1310 [2019-10-02 11:48:24,590 INFO L226 Difference]: Without dead ends: 673 [2019-10-02 11:48:24,594 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:48:24,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2019-10-02 11:48:24,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 670. [2019-10-02 11:48:24,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-10-02 11:48:24,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1058 transitions. [2019-10-02 11:48:24,619 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1058 transitions. Word has length 157 [2019-10-02 11:48:24,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:48:24,619 INFO L475 AbstractCegarLoop]: Abstraction has 670 states and 1058 transitions. [2019-10-02 11:48:24,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 11:48:24,620 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1058 transitions. [2019-10-02 11:48:24,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-02 11:48:24,625 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:48:24,625 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] [2019-10-02 11:48:24,625 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:48:24,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:48:24,626 INFO L82 PathProgramCache]: Analyzing trace with hash -838069955, now seen corresponding path program 1 times [2019-10-02 11:48:24,626 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:48:24,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:48:24,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:24,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:48:24,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:24,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:48:24,761 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-02 11:48:24,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:48:24,762 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:48:24,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:48:25,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:48:25,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 2987 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 11:48:25,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:48:25,381 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-02 11:48:25,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:48:25,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2019-10-02 11:48:25,397 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:48:25,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:48:25,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:48:25,398 INFO L87 Difference]: Start difference. First operand 670 states and 1058 transitions. Second operand 9 states. [2019-10-02 11:48:25,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:48:25,832 INFO L93 Difference]: Finished difference Result 1324 states and 2115 transitions. [2019-10-02 11:48:25,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:48:25,833 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 158 [2019-10-02 11:48:25,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:48:25,839 INFO L225 Difference]: With dead ends: 1324 [2019-10-02 11:48:25,839 INFO L226 Difference]: Without dead ends: 687 [2019-10-02 11:48:25,844 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:48:25,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2019-10-02 11:48:25,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 684. [2019-10-02 11:48:25,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 684 states. [2019-10-02 11:48:25,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 1076 transitions. [2019-10-02 11:48:25,870 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 1076 transitions. Word has length 158 [2019-10-02 11:48:25,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:48:25,870 INFO L475 AbstractCegarLoop]: Abstraction has 684 states and 1076 transitions. [2019-10-02 11:48:25,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:48:25,871 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 1076 transitions. [2019-10-02 11:48:25,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-02 11:48:25,876 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:48:25,876 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] [2019-10-02 11:48:25,876 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:48:25,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:48:25,877 INFO L82 PathProgramCache]: Analyzing trace with hash 85271240, now seen corresponding path program 1 times [2019-10-02 11:48:25,877 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:48:25,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:48:25,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:25,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:48:25,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:25,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:48:26,004 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-02 11:48:26,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:48:26,005 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:48:26,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:48:26,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:48:26,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 2984 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 11:48:26,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:48:26,621 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-02 11:48:26,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:48:26,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2019-10-02 11:48:26,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 11:48:26,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 11:48:26,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:48:26,636 INFO L87 Difference]: Start difference. First operand 684 states and 1076 transitions. Second operand 14 states. [2019-10-02 11:48:26,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:48:26,945 INFO L93 Difference]: Finished difference Result 1357 states and 2154 transitions. [2019-10-02 11:48:26,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 11:48:26,946 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 159 [2019-10-02 11:48:26,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:48:26,954 INFO L225 Difference]: With dead ends: 1357 [2019-10-02 11:48:26,955 INFO L226 Difference]: Without dead ends: 706 [2019-10-02 11:48:26,959 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-10-02 11:48:26,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2019-10-02 11:48:26,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 694. [2019-10-02 11:48:26,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2019-10-02 11:48:26,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1095 transitions. [2019-10-02 11:48:26,988 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1095 transitions. Word has length 159 [2019-10-02 11:48:26,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:48:26,989 INFO L475 AbstractCegarLoop]: Abstraction has 694 states and 1095 transitions. [2019-10-02 11:48:26,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 11:48:26,989 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1095 transitions. [2019-10-02 11:48:26,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-02 11:48:26,994 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:48:26,994 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 11:48:26,995 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:48:26,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:48:26,995 INFO L82 PathProgramCache]: Analyzing trace with hash 718066636, now seen corresponding path program 1 times [2019-10-02 11:48:26,995 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:48:26,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:48:26,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:26,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:48:26,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:27,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:48:27,185 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-02 11:48:27,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:48:27,186 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:48:27,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:48:27,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:48:27,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 2990 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 11:48:27,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:48:27,760 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 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 11:48:27,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:48:27,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-10-02 11:48:27,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:48:27,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:48:27,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:48:27,771 INFO L87 Difference]: Start difference. First operand 694 states and 1095 transitions. Second operand 8 states. [2019-10-02 11:48:27,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:48:27,910 INFO L93 Difference]: Finished difference Result 1373 states and 2195 transitions. [2019-10-02 11:48:27,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:48:27,911 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 161 [2019-10-02 11:48:27,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:48:27,917 INFO L225 Difference]: With dead ends: 1373 [2019-10-02 11:48:27,917 INFO L226 Difference]: Without dead ends: 710 [2019-10-02 11:48:27,922 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:48:27,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2019-10-02 11:48:27,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 702. [2019-10-02 11:48:27,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2019-10-02 11:48:27,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 1109 transitions. [2019-10-02 11:48:27,971 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 1109 transitions. Word has length 161 [2019-10-02 11:48:27,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:48:27,972 INFO L475 AbstractCegarLoop]: Abstraction has 702 states and 1109 transitions. [2019-10-02 11:48:27,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:48:27,972 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 1109 transitions. [2019-10-02 11:48:27,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-02 11:48:27,978 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:48:27,978 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, 1] [2019-10-02 11:48:27,979 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:48:27,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:48:27,979 INFO L82 PathProgramCache]: Analyzing trace with hash -151935702, now seen corresponding path program 1 times [2019-10-02 11:48:27,979 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:48:27,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:48:27,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:27,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:48:27,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:28,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:48:28,123 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-02 11:48:28,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:48:28,124 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:48:28,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:48:28,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:48:28,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 2991 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 11:48:28,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:48:28,712 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:48:28,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:48:28,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-10-02 11:48:28,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:48:28,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:48:28,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:48:28,723 INFO L87 Difference]: Start difference. First operand 702 states and 1109 transitions. Second operand 8 states. [2019-10-02 11:48:28,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:48:28,841 INFO L93 Difference]: Finished difference Result 1385 states and 2216 transitions. [2019-10-02 11:48:28,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:48:28,842 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 162 [2019-10-02 11:48:28,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:48:28,847 INFO L225 Difference]: With dead ends: 1385 [2019-10-02 11:48:28,848 INFO L226 Difference]: Without dead ends: 714 [2019-10-02 11:48:28,852 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:48:28,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2019-10-02 11:48:28,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 706. [2019-10-02 11:48:28,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-10-02 11:48:28,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 1117 transitions. [2019-10-02 11:48:28,879 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 1117 transitions. Word has length 162 [2019-10-02 11:48:28,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:48:28,880 INFO L475 AbstractCegarLoop]: Abstraction has 706 states and 1117 transitions. [2019-10-02 11:48:28,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:48:28,880 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 1117 transitions. [2019-10-02 11:48:28,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-02 11:48:28,886 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:48:28,886 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, 1, 1] [2019-10-02 11:48:28,887 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:48:28,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:48:28,887 INFO L82 PathProgramCache]: Analyzing trace with hash 484057255, now seen corresponding path program 1 times [2019-10-02 11:48:28,887 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:48:28,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:48:28,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:28,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:48:28,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:28,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:48:29,044 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 11:48:29,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:48:29,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:48:29,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:48:29,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:48:29,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:48:29,046 INFO L87 Difference]: Start difference. First operand 706 states and 1117 transitions. Second operand 9 states. [2019-10-02 11:48:29,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:48:29,264 INFO L93 Difference]: Finished difference Result 1327 states and 2099 transitions. [2019-10-02 11:48:29,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 11:48:29,265 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 163 [2019-10-02 11:48:29,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:48:29,270 INFO L225 Difference]: With dead ends: 1327 [2019-10-02 11:48:29,271 INFO L226 Difference]: Without dead ends: 716 [2019-10-02 11:48:29,275 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:48:29,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2019-10-02 11:48:29,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 712. [2019-10-02 11:48:29,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2019-10-02 11:48:29,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1124 transitions. [2019-10-02 11:48:29,303 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1124 transitions. Word has length 163 [2019-10-02 11:48:29,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:48:29,303 INFO L475 AbstractCegarLoop]: Abstraction has 712 states and 1124 transitions. [2019-10-02 11:48:29,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:48:29,303 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1124 transitions. [2019-10-02 11:48:29,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-02 11:48:29,309 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:48:29,309 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 11:48:29,309 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:48:29,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:48:29,310 INFO L82 PathProgramCache]: Analyzing trace with hash -2016915488, now seen corresponding path program 1 times [2019-10-02 11:48:29,310 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:48:29,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:48:29,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:29,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:48:29,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:29,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:48:29,460 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 11:48:29,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:48:29,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:48:29,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:48:29,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:48:29,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:48:29,462 INFO L87 Difference]: Start difference. First operand 712 states and 1124 transitions. Second operand 9 states. [2019-10-02 11:48:29,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:48:29,705 INFO L93 Difference]: Finished difference Result 1329 states and 2100 transitions. [2019-10-02 11:48:29,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 11:48:29,706 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 164 [2019-10-02 11:48:29,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:48:29,714 INFO L225 Difference]: With dead ends: 1329 [2019-10-02 11:48:29,715 INFO L226 Difference]: Without dead ends: 718 [2019-10-02 11:48:29,719 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:48:29,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2019-10-02 11:48:29,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 712. [2019-10-02 11:48:29,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2019-10-02 11:48:29,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1124 transitions. [2019-10-02 11:48:29,747 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1124 transitions. Word has length 164 [2019-10-02 11:48:29,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:48:29,748 INFO L475 AbstractCegarLoop]: Abstraction has 712 states and 1124 transitions. [2019-10-02 11:48:29,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:48:29,748 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1124 transitions. [2019-10-02 11:48:29,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-02 11:48:29,753 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:48:29,754 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, 1, 1, 1] [2019-10-02 11:48:29,754 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:48:29,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:48:29,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1774724528, now seen corresponding path program 1 times [2019-10-02 11:48:29,755 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:48:29,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:48:29,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:29,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:48:29,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:29,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:48:29,916 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-02 11:48:29,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:48:29,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:48:29,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:48:29,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:48:29,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:48:29,918 INFO L87 Difference]: Start difference. First operand 712 states and 1124 transitions. Second operand 4 states. [2019-10-02 11:48:29,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:48:29,976 INFO L93 Difference]: Finished difference Result 1371 states and 2185 transitions. [2019-10-02 11:48:29,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:48:29,977 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-10-02 11:48:29,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:48:29,982 INFO L225 Difference]: With dead ends: 1371 [2019-10-02 11:48:29,982 INFO L226 Difference]: Without dead ends: 689 [2019-10-02 11:48:29,986 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:48:29,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2019-10-02 11:48:30,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 689. [2019-10-02 11:48:30,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 689 states. [2019-10-02 11:48:30,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1076 transitions. [2019-10-02 11:48:30,011 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1076 transitions. Word has length 164 [2019-10-02 11:48:30,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:48:30,011 INFO L475 AbstractCegarLoop]: Abstraction has 689 states and 1076 transitions. [2019-10-02 11:48:30,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:48:30,011 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1076 transitions. [2019-10-02 11:48:30,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-02 11:48:30,016 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:48:30,016 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, 1, 1, 1] [2019-10-02 11:48:30,016 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:48:30,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:48:30,017 INFO L82 PathProgramCache]: Analyzing trace with hash 811816939, now seen corresponding path program 1 times [2019-10-02 11:48:30,017 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:48:30,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:48:30,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:30,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:48:30,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:30,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:48:30,140 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 11:48:30,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:48:30,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:48:30,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:48:30,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:48:30,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:48:30,142 INFO L87 Difference]: Start difference. First operand 689 states and 1076 transitions. Second operand 6 states. [2019-10-02 11:48:30,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:48:30,367 INFO L93 Difference]: Finished difference Result 1365 states and 2156 transitions. [2019-10-02 11:48:30,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:48:30,368 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 165 [2019-10-02 11:48:30,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:48:30,374 INFO L225 Difference]: With dead ends: 1365 [2019-10-02 11:48:30,374 INFO L226 Difference]: Without dead ends: 699 [2019-10-02 11:48:30,378 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:48:30,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2019-10-02 11:48:30,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 696. [2019-10-02 11:48:30,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2019-10-02 11:48:30,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1080 transitions. [2019-10-02 11:48:30,402 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1080 transitions. Word has length 165 [2019-10-02 11:48:30,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:48:30,402 INFO L475 AbstractCegarLoop]: Abstraction has 696 states and 1080 transitions. [2019-10-02 11:48:30,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:48:30,403 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1080 transitions. [2019-10-02 11:48:30,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-02 11:48:30,407 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:48:30,407 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:48:30,408 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:48:30,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:48:30,408 INFO L82 PathProgramCache]: Analyzing trace with hash 111297517, now seen corresponding path program 1 times [2019-10-02 11:48:30,408 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:48:30,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:48:30,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:30,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:48:30,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:48:30,544 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-02 11:48:30,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:48:30,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 11:48:30,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:48:30,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:48:30,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:48:30,546 INFO L87 Difference]: Start difference. First operand 696 states and 1080 transitions. Second operand 7 states. [2019-10-02 11:48:30,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:48:30,655 INFO L93 Difference]: Finished difference Result 1311 states and 2053 transitions. [2019-10-02 11:48:30,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:48:30,655 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 165 [2019-10-02 11:48:30,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:48:30,660 INFO L225 Difference]: With dead ends: 1311 [2019-10-02 11:48:30,661 INFO L226 Difference]: Without dead ends: 682 [2019-10-02 11:48:30,664 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:48:30,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2019-10-02 11:48:30,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 680. [2019-10-02 11:48:30,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2019-10-02 11:48:30,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 1047 transitions. [2019-10-02 11:48:30,686 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 1047 transitions. Word has length 165 [2019-10-02 11:48:30,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:48:30,686 INFO L475 AbstractCegarLoop]: Abstraction has 680 states and 1047 transitions. [2019-10-02 11:48:30,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:48:30,686 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 1047 transitions. [2019-10-02 11:48:30,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-02 11:48:30,691 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:48:30,691 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, 1, 1, 1, 1] [2019-10-02 11:48:30,692 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:48:30,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:48:30,692 INFO L82 PathProgramCache]: Analyzing trace with hash -397307674, now seen corresponding path program 1 times [2019-10-02 11:48:30,692 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:48:30,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:48:30,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:30,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:48:30,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:30,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:48:30,864 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 11:48:30,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:48:30,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 11:48:30,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 11:48:30,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 11:48:30,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:48:30,866 INFO L87 Difference]: Start difference. First operand 680 states and 1047 transitions. Second operand 11 states. [2019-10-02 11:48:31,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:48:31,172 INFO L93 Difference]: Finished difference Result 1289 states and 2015 transitions. [2019-10-02 11:48:31,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 11:48:31,172 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 166 [2019-10-02 11:48:31,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:48:31,177 INFO L225 Difference]: With dead ends: 1289 [2019-10-02 11:48:31,177 INFO L226 Difference]: Without dead ends: 676 [2019-10-02 11:48:31,180 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 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 11:48:31,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2019-10-02 11:48:31,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 674. [2019-10-02 11:48:31,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2019-10-02 11:48:31,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 1037 transitions. [2019-10-02 11:48:31,201 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 1037 transitions. Word has length 166 [2019-10-02 11:48:31,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:48:31,201 INFO L475 AbstractCegarLoop]: Abstraction has 674 states and 1037 transitions. [2019-10-02 11:48:31,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 11:48:31,202 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 1037 transitions. [2019-10-02 11:48:31,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-02 11:48:31,206 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:48:31,206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:48:31,206 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:48:31,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:48:31,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1719921697, now seen corresponding path program 1 times [2019-10-02 11:48:31,207 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:48:31,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:48:31,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:31,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:48:31,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:31,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:48:31,351 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 11:48:31,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:48:31,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:48:31,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:48:31,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:48:31,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:48:31,353 INFO L87 Difference]: Start difference. First operand 674 states and 1037 transitions. Second operand 4 states. [2019-10-02 11:48:32,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:48:32,848 INFO L93 Difference]: Finished difference Result 1856 states and 2969 transitions. [2019-10-02 11:48:32,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:48:32,849 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2019-10-02 11:48:32,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:48:32,862 INFO L225 Difference]: With dead ends: 1856 [2019-10-02 11:48:32,862 INFO L226 Difference]: Without dead ends: 1255 [2019-10-02 11:48:32,869 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:48:32,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2019-10-02 11:48:32,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1251. [2019-10-02 11:48:32,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1251 states. [2019-10-02 11:48:32,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 1251 states and 1964 transitions. [2019-10-02 11:48:32,952 INFO L78 Accepts]: Start accepts. Automaton has 1251 states and 1964 transitions. Word has length 168 [2019-10-02 11:48:32,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:48:32,956 INFO L475 AbstractCegarLoop]: Abstraction has 1251 states and 1964 transitions. [2019-10-02 11:48:32,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:48:32,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 1964 transitions. [2019-10-02 11:48:32,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-10-02 11:48:32,962 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:48:32,962 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:48:32,963 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:48:32,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:48:32,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1393388395, now seen corresponding path program 1 times [2019-10-02 11:48:32,964 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:48:32,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:48:32,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:32,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:48:32,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:33,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:48:33,172 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 11:48:33,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:48:33,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:48:33,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:48:33,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:48:33,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:48:33,175 INFO L87 Difference]: Start difference. First operand 1251 states and 1964 transitions. Second operand 4 states. [2019-10-02 11:48:34,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:48:34,330 INFO L93 Difference]: Finished difference Result 3592 states and 5836 transitions. [2019-10-02 11:48:34,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:48:34,331 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2019-10-02 11:48:34,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:48:34,349 INFO L225 Difference]: With dead ends: 3592 [2019-10-02 11:48:34,349 INFO L226 Difference]: Without dead ends: 2414 [2019-10-02 11:48:34,357 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:48:34,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2414 states. [2019-10-02 11:48:34,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2414 to 2410. [2019-10-02 11:48:34,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2410 states. [2019-10-02 11:48:34,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2410 states to 2410 states and 3852 transitions. [2019-10-02 11:48:34,474 INFO L78 Accepts]: Start accepts. Automaton has 2410 states and 3852 transitions. Word has length 169 [2019-10-02 11:48:34,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:48:34,475 INFO L475 AbstractCegarLoop]: Abstraction has 2410 states and 3852 transitions. [2019-10-02 11:48:34,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:48:34,475 INFO L276 IsEmpty]: Start isEmpty. Operand 2410 states and 3852 transitions. [2019-10-02 11:48:34,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-02 11:48:34,479 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:48:34,481 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:48:34,481 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:48:34,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:48:34,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1766047909, now seen corresponding path program 1 times [2019-10-02 11:48:34,482 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:48:34,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:48:34,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:34,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:48:34,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:34,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:48:34,651 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 11:48:34,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:48:34,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:48:34,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:48:34,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:48:34,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:48:34,653 INFO L87 Difference]: Start difference. First operand 2410 states and 3852 transitions. Second operand 4 states. [2019-10-02 11:48:35,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:48:35,779 INFO L93 Difference]: Finished difference Result 7074 states and 11761 transitions. [2019-10-02 11:48:35,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:48:35,780 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2019-10-02 11:48:35,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:48:35,814 INFO L225 Difference]: With dead ends: 7074 [2019-10-02 11:48:35,814 INFO L226 Difference]: Without dead ends: 4737 [2019-10-02 11:48:35,830 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:48:35,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4737 states. [2019-10-02 11:48:36,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4737 to 4733. [2019-10-02 11:48:36,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4733 states. [2019-10-02 11:48:36,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4733 states to 4733 states and 7737 transitions. [2019-10-02 11:48:36,080 INFO L78 Accepts]: Start accepts. Automaton has 4733 states and 7737 transitions. Word has length 170 [2019-10-02 11:48:36,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:48:36,082 INFO L475 AbstractCegarLoop]: Abstraction has 4733 states and 7737 transitions. [2019-10-02 11:48:36,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:48:36,082 INFO L276 IsEmpty]: Start isEmpty. Operand 4733 states and 7737 transitions. [2019-10-02 11:48:36,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-02 11:48:36,087 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:48:36,087 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:48:36,087 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:48:36,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:48:36,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1812126873, now seen corresponding path program 1 times [2019-10-02 11:48:36,088 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:48:36,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:48:36,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:36,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:48:36,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:36,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:48:36,257 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 11:48:36,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:48:36,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:48:36,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:48:36,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:48:36,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:48:36,267 INFO L87 Difference]: Start difference. First operand 4733 states and 7737 transitions. Second operand 4 states. [2019-10-02 11:48:37,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:48:37,781 INFO L93 Difference]: Finished difference Result 14048 states and 24319 transitions. [2019-10-02 11:48:37,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:48:37,781 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2019-10-02 11:48:37,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:48:37,986 INFO L225 Difference]: With dead ends: 14048 [2019-10-02 11:48:37,986 INFO L226 Difference]: Without dead ends: 9388 [2019-10-02 11:48:38,011 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:48:38,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9388 states. [2019-10-02 11:48:38,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9388 to 9384. [2019-10-02 11:48:38,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9384 states. [2019-10-02 11:48:38,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9384 states to 9384 states and 15914 transitions. [2019-10-02 11:48:38,446 INFO L78 Accepts]: Start accepts. Automaton has 9384 states and 15914 transitions. Word has length 171 [2019-10-02 11:48:38,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:48:38,446 INFO L475 AbstractCegarLoop]: Abstraction has 9384 states and 15914 transitions. [2019-10-02 11:48:38,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:48:38,447 INFO L276 IsEmpty]: Start isEmpty. Operand 9384 states and 15914 transitions. [2019-10-02 11:48:38,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-02 11:48:38,452 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:48:38,452 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:48:38,452 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:48:38,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:48:38,453 INFO L82 PathProgramCache]: Analyzing trace with hash -2092124502, now seen corresponding path program 1 times [2019-10-02 11:48:38,453 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:48:38,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:48:38,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:38,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:48:38,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:38,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:48:38,601 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 11:48:38,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:48:38,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 11:48:38,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:48:38,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:48:38,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:48:38,602 INFO L87 Difference]: Start difference. First operand 9384 states and 15914 transitions. Second operand 7 states. [2019-10-02 11:48:39,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:48:39,333 INFO L93 Difference]: Finished difference Result 28120 states and 47634 transitions. [2019-10-02 11:48:39,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 11:48:39,333 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 172 [2019-10-02 11:48:39,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:48:39,468 INFO L225 Difference]: With dead ends: 28120 [2019-10-02 11:48:39,468 INFO L226 Difference]: Without dead ends: 18824 [2019-10-02 11:48:39,512 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-10-02 11:48:39,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18824 states. [2019-10-02 11:48:41,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18824 to 18628. [2019-10-02 11:48:41,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18628 states. [2019-10-02 11:48:41,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18628 states to 18628 states and 31491 transitions. [2019-10-02 11:48:41,220 INFO L78 Accepts]: Start accepts. Automaton has 18628 states and 31491 transitions. Word has length 172 [2019-10-02 11:48:41,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:48:41,220 INFO L475 AbstractCegarLoop]: Abstraction has 18628 states and 31491 transitions. [2019-10-02 11:48:41,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:48:41,221 INFO L276 IsEmpty]: Start isEmpty. Operand 18628 states and 31491 transitions. [2019-10-02 11:48:41,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-02 11:48:41,228 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:48:41,228 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:48:41,228 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:48:41,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:48:41,229 INFO L82 PathProgramCache]: Analyzing trace with hash -28168012, now seen corresponding path program 1 times [2019-10-02 11:48:41,229 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:48:41,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:48:41,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:41,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:48:41,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:41,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:48:41,360 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 11:48:41,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:48:41,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:48:41,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:48:41,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:48:41,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:48:41,363 INFO L87 Difference]: Start difference. First operand 18628 states and 31491 transitions. Second operand 5 states. [2019-10-02 11:48:41,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:48:41,938 INFO L93 Difference]: Finished difference Result 37279 states and 62787 transitions. [2019-10-02 11:48:41,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:48:41,938 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 178 [2019-10-02 11:48:41,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:48:42,080 INFO L225 Difference]: With dead ends: 37279 [2019-10-02 11:48:42,080 INFO L226 Difference]: Without dead ends: 18739 [2019-10-02 11:48:42,422 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:48:42,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18739 states. [2019-10-02 11:48:43,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18739 to 18638. [2019-10-02 11:48:43,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18638 states. [2019-10-02 11:48:43,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18638 states to 18638 states and 31503 transitions. [2019-10-02 11:48:43,155 INFO L78 Accepts]: Start accepts. Automaton has 18638 states and 31503 transitions. Word has length 178 [2019-10-02 11:48:43,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:48:43,156 INFO L475 AbstractCegarLoop]: Abstraction has 18638 states and 31503 transitions. [2019-10-02 11:48:43,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:48:43,156 INFO L276 IsEmpty]: Start isEmpty. Operand 18638 states and 31503 transitions. [2019-10-02 11:48:43,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-10-02 11:48:43,162 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:48:43,163 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:48:43,163 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:48:43,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:48:43,163 INFO L82 PathProgramCache]: Analyzing trace with hash 706335816, now seen corresponding path program 1 times [2019-10-02 11:48:43,163 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:48:43,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:48:43,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:43,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:48:43,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:43,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:48:43,309 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 11:48:43,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:48:43,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 11:48:43,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:48:43,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:48:43,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:48:43,311 INFO L87 Difference]: Start difference. First operand 18638 states and 31503 transitions. Second operand 7 states. [2019-10-02 11:48:44,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:48:44,741 INFO L93 Difference]: Finished difference Result 37588 states and 63654 transitions. [2019-10-02 11:48:44,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:48:44,742 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 177 [2019-10-02 11:48:44,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:48:44,838 INFO L225 Difference]: With dead ends: 37588 [2019-10-02 11:48:44,838 INFO L226 Difference]: Without dead ends: 19038 [2019-10-02 11:48:44,897 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:48:44,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19038 states. [2019-10-02 11:48:45,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19038 to 18958. [2019-10-02 11:48:45,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18958 states. [2019-10-02 11:48:45,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18958 states to 18958 states and 32147 transitions. [2019-10-02 11:48:45,702 INFO L78 Accepts]: Start accepts. Automaton has 18958 states and 32147 transitions. Word has length 177 [2019-10-02 11:48:45,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:48:45,703 INFO L475 AbstractCegarLoop]: Abstraction has 18958 states and 32147 transitions. [2019-10-02 11:48:45,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:48:45,703 INFO L276 IsEmpty]: Start isEmpty. Operand 18958 states and 32147 transitions. [2019-10-02 11:48:45,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-02 11:48:45,708 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:48:45,708 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:48:45,708 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:48:45,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:48:45,709 INFO L82 PathProgramCache]: Analyzing trace with hash -308517901, now seen corresponding path program 1 times [2019-10-02 11:48:45,709 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:48:45,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:48:45,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:45,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:48:45,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:45,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:48:45,855 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 11:48:45,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:48:45,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:48:45,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:48:45,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:48:45,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:48:45,857 INFO L87 Difference]: Start difference. First operand 18958 states and 32147 transitions. Second operand 4 states. [2019-10-02 11:48:47,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:48:47,819 INFO L93 Difference]: Finished difference Result 56702 states and 105402 transitions. [2019-10-02 11:48:47,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:48:47,819 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2019-10-02 11:48:47,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:48:48,083 INFO L225 Difference]: With dead ends: 56702 [2019-10-02 11:48:48,084 INFO L226 Difference]: Without dead ends: 37817 [2019-10-02 11:48:48,187 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:48:48,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37817 states. [2019-10-02 11:48:50,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37817 to 37813. [2019-10-02 11:48:50,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37813 states. [2019-10-02 11:48:50,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37813 states to 37813 states and 67885 transitions. [2019-10-02 11:48:50,854 INFO L78 Accepts]: Start accepts. Automaton has 37813 states and 67885 transitions. Word has length 178 [2019-10-02 11:48:50,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:48:50,855 INFO L475 AbstractCegarLoop]: Abstraction has 37813 states and 67885 transitions. [2019-10-02 11:48:50,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:48:50,855 INFO L276 IsEmpty]: Start isEmpty. Operand 37813 states and 67885 transitions. [2019-10-02 11:48:50,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-02 11:48:50,861 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:48:50,861 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:48:50,861 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:48:50,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:48:50,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1204587634, now seen corresponding path program 1 times [2019-10-02 11:48:50,862 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:48:50,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:48:50,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:50,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:48:50,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:50,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:48:51,006 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 11:48:51,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:48:51,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 11:48:51,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:48:51,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:48:51,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:48:51,007 INFO L87 Difference]: Start difference. First operand 37813 states and 67885 transitions. Second operand 7 states. [2019-10-02 11:48:52,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:48:52,263 INFO L93 Difference]: Finished difference Result 76002 states and 135661 transitions. [2019-10-02 11:48:52,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:48:52,263 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 178 [2019-10-02 11:48:52,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:48:52,446 INFO L225 Difference]: With dead ends: 76002 [2019-10-02 11:48:52,446 INFO L226 Difference]: Without dead ends: 38293 [2019-10-02 11:48:52,616 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:48:52,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38293 states. [2019-10-02 11:48:53,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38293 to 37877. [2019-10-02 11:48:53,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37877 states. [2019-10-02 11:48:56,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37877 states to 37877 states and 67949 transitions. [2019-10-02 11:48:56,316 INFO L78 Accepts]: Start accepts. Automaton has 37877 states and 67949 transitions. Word has length 178 [2019-10-02 11:48:56,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:48:56,316 INFO L475 AbstractCegarLoop]: Abstraction has 37877 states and 67949 transitions. [2019-10-02 11:48:56,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:48:56,316 INFO L276 IsEmpty]: Start isEmpty. Operand 37877 states and 67949 transitions. [2019-10-02 11:48:56,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-10-02 11:48:56,324 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:48:56,324 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:48:56,324 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:48:56,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:48:56,325 INFO L82 PathProgramCache]: Analyzing trace with hash 972475765, now seen corresponding path program 1 times [2019-10-02 11:48:56,325 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:48:56,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:48:56,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:56,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:48:56,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:56,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:48:56,497 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-02 11:48:56,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:48:56,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:48:56,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:48:56,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:48:56,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:48:56,499 INFO L87 Difference]: Start difference. First operand 37877 states and 67949 transitions. Second operand 9 states. [2019-10-02 11:48:58,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:48:58,361 INFO L93 Difference]: Finished difference Result 75942 states and 135471 transitions. [2019-10-02 11:48:58,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 11:48:58,362 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 212 [2019-10-02 11:48:58,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:48:58,551 INFO L225 Difference]: With dead ends: 75942 [2019-10-02 11:48:58,552 INFO L226 Difference]: Without dead ends: 38105 [2019-10-02 11:48:58,675 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2019-10-02 11:48:58,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38105 states. [2019-10-02 11:48:59,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38105 to 37877. [2019-10-02 11:48:59,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37877 states. [2019-10-02 11:49:00,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37877 states to 37877 states and 67917 transitions. [2019-10-02 11:49:00,054 INFO L78 Accepts]: Start accepts. Automaton has 37877 states and 67917 transitions. Word has length 212 [2019-10-02 11:49:00,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:49:00,054 INFO L475 AbstractCegarLoop]: Abstraction has 37877 states and 67917 transitions. [2019-10-02 11:49:00,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:49:00,054 INFO L276 IsEmpty]: Start isEmpty. Operand 37877 states and 67917 transitions. [2019-10-02 11:49:00,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-10-02 11:49:00,059 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:49:00,059 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:49:00,060 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:49:00,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:49:00,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1150266774, now seen corresponding path program 1 times [2019-10-02 11:49:00,060 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:49:00,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:49:00,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:00,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:49:00,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:00,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:49:00,206 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 11:49:00,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:49:00,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:49:00,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:49:00,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:49:00,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:49:00,208 INFO L87 Difference]: Start difference. First operand 37877 states and 67917 transitions. Second operand 4 states. [2019-10-02 11:49:03,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:49:03,371 INFO L93 Difference]: Finished difference Result 130658 states and 233966 transitions. [2019-10-02 11:49:03,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:49:03,371 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2019-10-02 11:49:03,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:49:03,861 INFO L225 Difference]: With dead ends: 130658 [2019-10-02 11:49:03,861 INFO L226 Difference]: Without dead ends: 92885 [2019-10-02 11:49:04,580 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:49:04,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92885 states. [2019-10-02 11:49:09,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92885 to 92749. [2019-10-02 11:49:09,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92749 states. [2019-10-02 11:49:10,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92749 states to 92749 states and 163273 transitions. [2019-10-02 11:49:10,372 INFO L78 Accepts]: Start accepts. Automaton has 92749 states and 163273 transitions. Word has length 186 [2019-10-02 11:49:10,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:49:10,372 INFO L475 AbstractCegarLoop]: Abstraction has 92749 states and 163273 transitions. [2019-10-02 11:49:10,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:49:10,373 INFO L276 IsEmpty]: Start isEmpty. Operand 92749 states and 163273 transitions. [2019-10-02 11:49:10,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-10-02 11:49:10,380 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:49:10,380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:49:10,380 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:49:10,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:49:10,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1163758869, now seen corresponding path program 1 times [2019-10-02 11:49:10,381 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:49:10,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:49:10,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:10,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:49:10,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:10,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:49:10,514 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 11:49:10,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:49:10,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 11:49:10,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:49:10,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:49:10,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:49:10,516 INFO L87 Difference]: Start difference. First operand 92749 states and 163273 transitions. Second operand 7 states. [2019-10-02 11:49:14,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:49:14,000 INFO L93 Difference]: Finished difference Result 184433 states and 328315 transitions. [2019-10-02 11:49:14,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:49:14,001 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 188 [2019-10-02 11:49:14,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:49:14,515 INFO L225 Difference]: With dead ends: 184433 [2019-10-02 11:49:14,515 INFO L226 Difference]: Without dead ends: 93389 [2019-10-02 11:49:19,069 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 11:49:19,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93389 states. [2019-10-02 11:49:21,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93389 to 93389. [2019-10-02 11:49:21,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93389 states. [2019-10-02 11:49:22,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93389 states to 93389 states and 163881 transitions. [2019-10-02 11:49:22,054 INFO L78 Accepts]: Start accepts. Automaton has 93389 states and 163881 transitions. Word has length 188 [2019-10-02 11:49:22,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:49:22,054 INFO L475 AbstractCegarLoop]: Abstraction has 93389 states and 163881 transitions. [2019-10-02 11:49:22,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:49:22,055 INFO L276 IsEmpty]: Start isEmpty. Operand 93389 states and 163881 transitions. [2019-10-02 11:49:22,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-10-02 11:49:22,062 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:49:22,062 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:49:22,063 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:49:22,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:49:22,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1466591245, now seen corresponding path program 1 times [2019-10-02 11:49:22,064 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:49:22,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:49:22,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:22,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:49:22,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:22,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:49:22,237 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 11:49:22,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:49:22,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 11:49:22,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:49:22,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:49:22,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:49:22,239 INFO L87 Difference]: Start difference. First operand 93389 states and 163881 transitions. Second operand 8 states. [2019-10-02 11:49:34,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:49:34,780 INFO L93 Difference]: Finished difference Result 277465 states and 512108 transitions. [2019-10-02 11:49:34,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 11:49:34,781 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 189 [2019-10-02 11:49:34,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:49:41,716 INFO L225 Difference]: With dead ends: 277465 [2019-10-02 11:49:41,717 INFO L226 Difference]: Without dead ends: 198285 [2019-10-02 11:49:42,160 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-10-02 11:49:42,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198285 states. [2019-10-02 11:49:47,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198285 to 190889. [2019-10-02 11:49:47,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190889 states. [2019-10-02 11:49:50,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190889 states to 190889 states and 348028 transitions. [2019-10-02 11:49:50,434 INFO L78 Accepts]: Start accepts. Automaton has 190889 states and 348028 transitions. Word has length 189 [2019-10-02 11:49:50,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:49:50,434 INFO L475 AbstractCegarLoop]: Abstraction has 190889 states and 348028 transitions. [2019-10-02 11:49:50,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:49:50,434 INFO L276 IsEmpty]: Start isEmpty. Operand 190889 states and 348028 transitions. [2019-10-02 11:49:50,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-10-02 11:49:50,439 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:49:50,439 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:49:50,439 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:49:50,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:49:50,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1705376793, now seen corresponding path program 1 times [2019-10-02 11:49:50,440 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:49:50,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:49:50,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:50,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:49:50,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:50,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:49:50,545 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 11:49:50,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:49:50,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:49:50,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:49:50,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:49:50,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:49:50,548 INFO L87 Difference]: Start difference. First operand 190889 states and 348028 transitions. Second operand 4 states. [2019-10-02 11:50:05,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:50:05,076 INFO L93 Difference]: Finished difference Result 380521 states and 699918 transitions. [2019-10-02 11:50:05,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:50:05,077 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 191 [2019-10-02 11:50:05,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:50:06,050 INFO L225 Difference]: With dead ends: 380521 [2019-10-02 11:50:06,050 INFO L226 Difference]: Without dead ends: 191657 [2019-10-02 11:50:07,006 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:50:07,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191657 states. [2019-10-02 11:50:19,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191657 to 191273. [2019-10-02 11:50:19,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191273 states. [2019-10-02 11:50:21,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191273 states to 191273 states and 345904 transitions. [2019-10-02 11:50:21,925 INFO L78 Accepts]: Start accepts. Automaton has 191273 states and 345904 transitions. Word has length 191 [2019-10-02 11:50:21,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:50:21,925 INFO L475 AbstractCegarLoop]: Abstraction has 191273 states and 345904 transitions. [2019-10-02 11:50:21,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:50:21,925 INFO L276 IsEmpty]: Start isEmpty. Operand 191273 states and 345904 transitions. [2019-10-02 11:50:21,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-10-02 11:50:21,929 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:50:21,929 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:50:21,930 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:50:21,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:50:21,930 INFO L82 PathProgramCache]: Analyzing trace with hash -346644609, now seen corresponding path program 1 times [2019-10-02 11:50:21,930 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:50:21,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:50:21,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:21,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:50:21,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:21,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:50:22,108 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 11:50:22,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:50:22,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 11:50:22,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 11:50:22,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 11:50:22,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:50:22,110 INFO L87 Difference]: Start difference. First operand 191273 states and 345904 transitions. Second operand 10 states. [2019-10-02 11:50:38,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:50:38,976 INFO L93 Difference]: Finished difference Result 368957 states and 669842 transitions. [2019-10-02 11:50:38,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 11:50:38,977 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 194 [2019-10-02 11:50:38,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:50:40,005 INFO L225 Difference]: With dead ends: 368957 [2019-10-02 11:50:40,005 INFO L226 Difference]: Without dead ends: 202153 [2019-10-02 11:50:41,384 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:50:41,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202153 states. [2019-10-02 11:50:48,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202153 to 201545. [2019-10-02 11:50:48,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201545 states. [2019-10-02 11:50:50,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201545 states to 201545 states and 359496 transitions. [2019-10-02 11:50:50,353 INFO L78 Accepts]: Start accepts. Automaton has 201545 states and 359496 transitions. Word has length 194 [2019-10-02 11:50:50,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:50:50,353 INFO L475 AbstractCegarLoop]: Abstraction has 201545 states and 359496 transitions. [2019-10-02 11:50:50,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 11:50:50,353 INFO L276 IsEmpty]: Start isEmpty. Operand 201545 states and 359496 transitions. [2019-10-02 11:50:50,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-10-02 11:50:50,357 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:50:50,357 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:50:50,358 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:50:50,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:50:50,358 INFO L82 PathProgramCache]: Analyzing trace with hash -729342636, now seen corresponding path program 1 times [2019-10-02 11:50:50,358 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:50:50,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:50:50,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:50,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:50:50,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:50,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:50:50,521 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 11:50:50,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:50:50,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:50:50,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:50:50,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:50:50,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:50:50,523 INFO L87 Difference]: Start difference. First operand 201545 states and 359496 transitions. Second operand 9 states. [2019-10-02 11:51:05,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:51:05,205 INFO L93 Difference]: Finished difference Result 391129 states and 699793 transitions. [2019-10-02 11:51:05,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:51:05,206 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 202 [2019-10-02 11:51:05,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:51:07,002 INFO L225 Difference]: With dead ends: 391129 [2019-10-02 11:51:07,002 INFO L226 Difference]: Without dead ends: 196317 [2019-10-02 11:51:07,935 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 11:51:08,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196317 states. [2019-10-02 11:51:21,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196317 to 196317. [2019-10-02 11:51:21,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196317 states. [2019-10-02 11:51:23,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196317 states to 196317 states and 348554 transitions. [2019-10-02 11:51:23,112 INFO L78 Accepts]: Start accepts. Automaton has 196317 states and 348554 transitions. Word has length 202 [2019-10-02 11:51:23,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:51:23,112 INFO L475 AbstractCegarLoop]: Abstraction has 196317 states and 348554 transitions. [2019-10-02 11:51:23,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:51:23,112 INFO L276 IsEmpty]: Start isEmpty. Operand 196317 states and 348554 transitions. [2019-10-02 11:51:23,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-10-02 11:51:23,116 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:51:23,116 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:51:23,117 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:51:23,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:51:23,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1225818343, now seen corresponding path program 1 times [2019-10-02 11:51:23,117 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:51:23,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:51:23,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:23,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:51:23,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:23,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:51:23,245 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 11:51:23,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:51:23,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:51:23,246 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:51:23,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:51:23,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:51:23,247 INFO L87 Difference]: Start difference. First operand 196317 states and 348554 transitions. Second operand 5 states. [2019-10-02 11:51:40,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:51:40,850 INFO L93 Difference]: Finished difference Result 359069 states and 636335 transitions. [2019-10-02 11:51:40,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:51:40,850 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 204 [2019-10-02 11:51:40,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:51:41,804 INFO L225 Difference]: With dead ends: 359069 [2019-10-02 11:51:41,804 INFO L226 Difference]: Without dead ends: 198495 [2019-10-02 11:51:43,080 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:51:43,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198495 states. [2019-10-02 11:51:56,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198495 to 197467. [2019-10-02 11:51:56,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197467 states. [2019-10-02 11:51:58,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197467 states to 197467 states and 350785 transitions. [2019-10-02 11:51:58,823 INFO L78 Accepts]: Start accepts. Automaton has 197467 states and 350785 transitions. Word has length 204 [2019-10-02 11:51:58,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:51:58,824 INFO L475 AbstractCegarLoop]: Abstraction has 197467 states and 350785 transitions. [2019-10-02 11:51:58,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:51:58,824 INFO L276 IsEmpty]: Start isEmpty. Operand 197467 states and 350785 transitions. [2019-10-02 11:51:58,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-10-02 11:51:58,828 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:51:58,828 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:51:58,828 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:51:58,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:51:58,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1472217023, now seen corresponding path program 1 times [2019-10-02 11:51:58,829 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:51:58,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:51:58,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:58,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:51:58,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:58,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:51:58,976 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 11:51:58,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:51:58,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:51:58,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:51:58,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:51:58,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:51:58,979 INFO L87 Difference]: Start difference. First operand 197467 states and 350785 transitions. Second operand 6 states. [2019-10-02 11:52:16,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:52:16,757 INFO L93 Difference]: Finished difference Result 413304 states and 727928 transitions. [2019-10-02 11:52:16,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:52:16,757 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 208 [2019-10-02 11:52:16,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:52:18,528 INFO L225 Difference]: With dead ends: 413304 [2019-10-02 11:52:18,529 INFO L226 Difference]: Without dead ends: 251642 [2019-10-02 11:52:19,421 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:52:20,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251642 states. [2019-10-02 11:52:30,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251642 to 250680. [2019-10-02 11:52:30,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250680 states. [2019-10-02 11:52:33,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250680 states to 250680 states and 439968 transitions. [2019-10-02 11:52:33,480 INFO L78 Accepts]: Start accepts. Automaton has 250680 states and 439968 transitions. Word has length 208 [2019-10-02 11:52:33,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:52:33,481 INFO L475 AbstractCegarLoop]: Abstraction has 250680 states and 439968 transitions. [2019-10-02 11:52:33,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:52:33,481 INFO L276 IsEmpty]: Start isEmpty. Operand 250680 states and 439968 transitions. [2019-10-02 11:52:33,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-10-02 11:52:33,485 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:52:33,486 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:52:33,486 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:52:33,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:52:33,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1152226537, now seen corresponding path program 1 times [2019-10-02 11:52:33,486 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:52:33,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:52:33,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:33,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:52:33,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:33,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:52:33,617 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 11:52:33,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:52:33,618 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:52:33,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:52:34,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:52:34,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 3095 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 11:52:34,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:52:34,282 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 11:52:34,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:52:34,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2019-10-02 11:52:34,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:52:34,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:52:34,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:52:34,296 INFO L87 Difference]: Start difference. First operand 250680 states and 439968 transitions. Second operand 8 states. [2019-10-02 11:52:55,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:52:55,117 INFO L93 Difference]: Finished difference Result 504808 states and 935042 transitions. [2019-10-02 11:52:55,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 11:52:55,118 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 209 [2019-10-02 11:52:55,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:53:07,391 INFO L225 Difference]: With dead ends: 504808 [2019-10-02 11:53:07,391 INFO L226 Difference]: Without dead ends: 254201 [2019-10-02 11:53:09,390 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:53:09,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254201 states. [2019-10-02 11:53:18,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254201 to 252984. [2019-10-02 11:53:18,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252984 states. [2019-10-02 11:53:21,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252984 states to 252984 states and 442144 transitions. [2019-10-02 11:53:21,146 INFO L78 Accepts]: Start accepts. Automaton has 252984 states and 442144 transitions. Word has length 209 [2019-10-02 11:53:21,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:53:21,147 INFO L475 AbstractCegarLoop]: Abstraction has 252984 states and 442144 transitions. [2019-10-02 11:53:21,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:53:21,147 INFO L276 IsEmpty]: Start isEmpty. Operand 252984 states and 442144 transitions. [2019-10-02 11:53:21,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-10-02 11:53:21,152 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:53:21,152 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 11:53:21,152 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:53:21,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:53:21,153 INFO L82 PathProgramCache]: Analyzing trace with hash 12989919, now seen corresponding path program 1 times [2019-10-02 11:53:21,153 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:53:21,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:53:21,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:53:21,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:53:21,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:53:21,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:53:21,328 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-02 11:53:21,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:53:21,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 11:53:21,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 11:53:21,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 11:53:21,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:53:21,330 INFO L87 Difference]: Start difference. First operand 252984 states and 442144 transitions. Second operand 12 states. [2019-10-02 11:53:44,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:53:44,878 INFO L93 Difference]: Finished difference Result 478267 states and 837796 transitions. [2019-10-02 11:53:44,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 11:53:44,879 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 220 [2019-10-02 11:53:44,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:53:46,357 INFO L225 Difference]: With dead ends: 478267 [2019-10-02 11:53:46,357 INFO L226 Difference]: Without dead ends: 259672 [2019-10-02 11:53:48,933 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:53:49,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259672 states. [2019-10-02 11:53:58,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259672 to 258656. [2019-10-02 11:53:58,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258656 states. [2019-10-02 11:54:01,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258656 states to 258656 states and 453285 transitions. [2019-10-02 11:54:01,317 INFO L78 Accepts]: Start accepts. Automaton has 258656 states and 453285 transitions. Word has length 220 [2019-10-02 11:54:01,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:54:01,318 INFO L475 AbstractCegarLoop]: Abstraction has 258656 states and 453285 transitions. [2019-10-02 11:54:01,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 11:54:01,318 INFO L276 IsEmpty]: Start isEmpty. Operand 258656 states and 453285 transitions. [2019-10-02 11:54:01,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-10-02 11:54:01,322 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:54:01,323 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:54:01,323 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:54:01,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:54:01,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1392760177, now seen corresponding path program 1 times [2019-10-02 11:54:01,323 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:54:01,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:54:01,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:01,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:01,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:01,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:01,448 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-02 11:54:01,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:54:01,449 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:54:01,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:11,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:11,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 3152 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 11:54:11,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:54:11,768 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 11:54:11,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:54:11,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2019-10-02 11:54:11,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 11:54:11,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 11:54:11,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:54:11,776 INFO L87 Difference]: Start difference. First operand 258656 states and 453285 transitions. Second operand 10 states. [2019-10-02 11:54:47,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:54:47,655 INFO L93 Difference]: Finished difference Result 678622 states and 1365657 transitions. [2019-10-02 11:54:47,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 11:54:47,656 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 215 [2019-10-02 11:54:47,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:55:05,936 INFO L225 Difference]: With dead ends: 678622 [2019-10-02 11:55:05,936 INFO L226 Difference]: Without dead ends: 415567 [2019-10-02 11:55:08,756 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 214 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2019-10-02 11:55:09,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415567 states. [2019-10-02 11:55:25,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415567 to 401939. [2019-10-02 11:55:25,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401939 states. [2019-10-02 11:55:50,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401939 states to 401939 states and 705012 transitions. [2019-10-02 11:55:50,603 INFO L78 Accepts]: Start accepts. Automaton has 401939 states and 705012 transitions. Word has length 215 [2019-10-02 11:55:50,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:55:50,604 INFO L475 AbstractCegarLoop]: Abstraction has 401939 states and 705012 transitions. [2019-10-02 11:55:50,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 11:55:50,604 INFO L276 IsEmpty]: Start isEmpty. Operand 401939 states and 705012 transitions. [2019-10-02 11:55:50,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-10-02 11:55:50,610 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:55:50,610 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 11:55:50,610 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:55:50,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:55:50,611 INFO L82 PathProgramCache]: Analyzing trace with hash 123238745, now seen corresponding path program 1 times [2019-10-02 11:55:50,611 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:55:50,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:55:50,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:55:50,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:55:50,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:55:50,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:55:50,772 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-02 11:55:50,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:55:50,772 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:55:50,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:55:51,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:55:51,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 3152 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-02 11:55:51,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:55:51,429 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-10-02 11:55:51,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:55:51,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-10-02 11:55:51,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 11:55:51,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 11:55:51,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:55:51,438 INFO L87 Difference]: Start difference. First operand 401939 states and 705012 transitions. Second operand 12 states.