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_spec3_product19.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 12:28:09,081 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 12:28:09,083 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 12:28:09,097 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 12:28:09,098 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 12:28:09,099 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 12:28:09,101 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 12:28:09,114 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 12:28:09,117 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 12:28:09,118 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 12:28:09,119 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 12:28:09,121 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 12:28:09,122 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 12:28:09,124 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 12:28:09,126 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 12:28:09,128 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 12:28:09,129 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 12:28:09,129 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 12:28:09,134 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 12:28:09,137 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 12:28:09,140 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 12:28:09,141 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 12:28:09,145 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 12:28:09,146 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 12:28:09,149 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 12:28:09,149 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 12:28:09,149 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 12:28:09,151 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 12:28:09,152 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 12:28:09,155 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 12:28:09,155 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 12:28:09,156 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 12:28:09,157 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 12:28:09,158 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 12:28:09,159 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 12:28:09,159 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 12:28:09,160 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 12:28:09,160 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 12:28:09,161 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 12:28:09,161 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 12:28:09,162 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 12:28:09,163 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 12:28:09,177 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 12:28:09,177 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 12:28:09,179 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 12:28:09,179 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 12:28:09,179 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 12:28:09,179 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 12:28:09,180 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 12:28:09,180 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 12:28:09,180 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 12:28:09,180 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 12:28:09,180 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 12:28:09,181 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 12:28:09,181 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 12:28:09,181 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 12:28:09,181 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 12:28:09,181 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 12:28:09,182 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 12:28:09,182 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 12:28:09,182 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 12:28:09,182 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 12:28:09,182 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 12:28:09,183 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:28:09,183 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 12:28:09,183 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 12:28:09,183 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 12:28:09,183 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 12:28:09,184 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 12:28:09,184 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 12:28:09,184 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 12:28:09,226 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 12:28:09,245 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 12:28:09,250 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 12:28:09,251 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 12:28:09,251 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 12:28:09,252 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec3_product19.cil.c [2019-10-02 12:28:09,323 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6efe601b8/3e24bd943b9b4ff886edf796ffbbafa1/FLAGd1e3dd3b6 [2019-10-02 12:28:10,004 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 12:28:10,005 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec3_product19.cil.c [2019-10-02 12:28:10,028 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6efe601b8/3e24bd943b9b4ff886edf796ffbbafa1/FLAGd1e3dd3b6 [2019-10-02 12:28:10,177 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6efe601b8/3e24bd943b9b4ff886edf796ffbbafa1 [2019-10-02 12:28:10,193 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 12:28:10,195 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 12:28:10,196 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 12:28:10,197 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 12:28:10,201 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 12:28:10,202 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:28:10" (1/1) ... [2019-10-02 12:28:10,205 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@416e3bfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:28:10, skipping insertion in model container [2019-10-02 12:28:10,206 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:28:10" (1/1) ... [2019-10-02 12:28:10,215 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 12:28:10,313 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 12:28:11,097 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:28:11,113 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 12:28:11,279 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:28:11,354 INFO L192 MainTranslator]: Completed translation [2019-10-02 12:28:11,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:28:11 WrapperNode [2019-10-02 12:28:11,355 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 12:28:11,356 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 12:28:11,356 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 12:28:11,356 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 12:28:11,371 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:28:11" (1/1) ... [2019-10-02 12:28:11,371 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:28:11" (1/1) ... [2019-10-02 12:28:11,407 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:28:11" (1/1) ... [2019-10-02 12:28:11,411 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:28:11" (1/1) ... [2019-10-02 12:28:11,486 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:28:11" (1/1) ... [2019-10-02 12:28:11,509 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:28:11" (1/1) ... [2019-10-02 12:28:11,519 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:28:11" (1/1) ... [2019-10-02 12:28:11,537 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 12:28:11,537 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 12:28:11,538 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 12:28:11,538 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 12:28:11,539 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:28:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:28:11,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 12:28:11,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 12:28:11,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 12:28:11,647 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-02 12:28:11,648 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-02 12:28:11,648 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-02 12:28:11,648 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-02 12:28:11,648 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-02 12:28:11,648 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-02 12:28:11,649 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-02 12:28:11,649 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-02 12:28:11,649 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-02 12:28:11,650 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-02 12:28:11,650 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-02 12:28:11,651 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-02 12:28:11,651 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-02 12:28:11,654 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-02 12:28:11,654 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 12:28:11,656 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-02 12:28:11,656 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 12:28:11,656 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 12:28:11,657 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 12:28:11,657 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 12:28:11,657 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 12:28:11,658 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 12:28:11,658 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 12:28:11,658 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 12:28:11,658 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-02 12:28:11,658 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-02 12:28:11,659 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-02 12:28:11,659 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-02 12:28:11,659 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-02 12:28:11,660 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-02 12:28:11,660 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-02 12:28:11,660 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-02 12:28:11,661 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-02 12:28:11,661 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-02 12:28:11,661 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-02 12:28:11,661 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-02 12:28:11,661 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-02 12:28:11,662 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-02 12:28:11,662 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-02 12:28:11,662 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-02 12:28:11,663 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2019-10-02 12:28:11,663 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-02 12:28:11,663 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-02 12:28:11,663 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-02 12:28:11,663 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-02 12:28:11,664 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-02 12:28:11,664 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-02 12:28:11,664 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-02 12:28:11,664 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-02 12:28:11,664 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-02 12:28:11,664 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-02 12:28:11,665 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-02 12:28:11,665 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-02 12:28:11,665 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-02 12:28:11,665 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-02 12:28:11,665 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-02 12:28:11,666 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 12:28:11,666 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 12:28:11,666 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 12:28:11,666 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 12:28:11,666 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__1 [2019-10-02 12:28:11,666 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__2 [2019-10-02 12:28:11,667 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 12:28:11,667 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-02 12:28:11,668 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-02 12:28:11,668 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-02 12:28:11,668 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-02 12:28:11,669 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-02 12:28:11,669 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-02 12:28:11,669 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-02 12:28:11,669 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-02 12:28:11,670 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-02 12:28:11,671 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-02 12:28:11,671 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 12:28:11,671 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 12:28:11,671 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 12:28:11,672 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-02 12:28:11,672 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-02 12:28:11,672 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-02 12:28:11,673 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-02 12:28:11,673 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-02 12:28:11,674 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-02 12:28:11,674 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-02 12:28:11,674 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-02 12:28:11,675 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-02 12:28:11,675 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-02 12:28:11,675 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-02 12:28:11,676 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-02 12:28:11,676 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-02 12:28:11,676 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-02 12:28:11,677 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-02 12:28:11,677 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-02 12:28:11,677 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-02 12:28:11,677 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-02 12:28:11,677 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-02 12:28:11,678 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-02 12:28:11,678 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-02 12:28:11,678 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 12:28:11,678 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 12:28:11,678 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-02 12:28:11,679 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 12:28:11,679 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 12:28:11,679 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 12:28:11,679 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 12:28:11,679 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 12:28:11,680 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 12:28:11,680 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 12:28:11,680 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 12:28:11,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 12:28:11,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 12:28:11,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 12:28:11,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 12:28:11,681 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 12:28:11,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 12:28:11,681 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 12:28:11,682 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 12:28:11,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 12:28:11,682 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 12:28:11,683 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 12:28:11,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 12:28:11,683 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 12:28:11,684 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 12:28:11,684 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-02 12:28:11,684 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-02 12:28:11,684 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-02 12:28:11,684 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-02 12:28:11,684 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-02 12:28:11,684 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-02 12:28:11,685 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-02 12:28:11,685 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-02 12:28:11,685 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-02 12:28:11,685 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-02 12:28:11,686 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-02 12:28:11,686 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-02 12:28:11,686 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-02 12:28:11,686 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-02 12:28:11,687 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-02 12:28:11,690 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-02 12:28:11,691 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-02 12:28:11,691 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-02 12:28:11,691 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-02 12:28:11,697 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-02 12:28:11,698 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-02 12:28:11,698 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-02 12:28:11,698 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-02 12:28:11,698 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-02 12:28:11,698 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2019-10-02 12:28:11,698 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-02 12:28:11,699 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-02 12:28:11,699 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-02 12:28:11,699 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-02 12:28:11,699 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-02 12:28:11,699 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-02 12:28:11,699 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__1 [2019-10-02 12:28:11,699 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__2 [2019-10-02 12:28:11,700 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-02 12:28:11,700 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 12:28:11,700 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 12:28:11,700 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-02 12:28:11,701 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-02 12:28:11,701 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-02 12:28:11,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 12:28:11,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 12:28:11,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 12:28:14,053 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 12:28:14,053 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-02 12:28:14,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:28:14 BoogieIcfgContainer [2019-10-02 12:28:14,056 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 12:28:14,057 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 12:28:14,057 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 12:28:14,061 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 12:28:14,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:28:10" (1/3) ... [2019-10-02 12:28:14,062 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2facf485 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:28:14, skipping insertion in model container [2019-10-02 12:28:14,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:28:11" (2/3) ... [2019-10-02 12:28:14,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2facf485 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:28:14, skipping insertion in model container [2019-10-02 12:28:14,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:28:14" (3/3) ... [2019-10-02 12:28:14,066 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product19.cil.c [2019-10-02 12:28:14,077 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 12:28:14,090 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 12:28:14,111 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 12:28:14,158 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 12:28:14,159 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 12:28:14,159 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 12:28:14,159 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 12:28:14,159 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 12:28:14,159 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 12:28:14,159 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 12:28:14,160 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 12:28:14,160 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 12:28:14,205 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states. [2019-10-02 12:28:14,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-02 12:28:14,239 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:28:14,241 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:28:14,244 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:28:14,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:28:14,251 INFO L82 PathProgramCache]: Analyzing trace with hash 756079389, now seen corresponding path program 1 times [2019-10-02 12:28:14,253 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:28:14,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:28:14,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:14,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:28:14,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:14,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:28:15,030 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 12:28:15,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:28:15,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:28:15,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:28:15,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:28:15,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:28:15,062 INFO L87 Difference]: Start difference. First operand 790 states. Second operand 7 states. [2019-10-02 12:28:15,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:28:15,381 INFO L93 Difference]: Finished difference Result 1259 states and 2034 transitions. [2019-10-02 12:28:15,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:28:15,383 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 141 [2019-10-02 12:28:15,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:28:15,422 INFO L225 Difference]: With dead ends: 1259 [2019-10-02 12:28:15,423 INFO L226 Difference]: Without dead ends: 638 [2019-10-02 12:28:15,436 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:28:15,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-10-02 12:28:15,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 636. [2019-10-02 12:28:15,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2019-10-02 12:28:15,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 1012 transitions. [2019-10-02 12:28:15,590 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 1012 transitions. Word has length 141 [2019-10-02 12:28:15,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:28:15,591 INFO L475 AbstractCegarLoop]: Abstraction has 636 states and 1012 transitions. [2019-10-02 12:28:15,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:28:15,591 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 1012 transitions. [2019-10-02 12:28:15,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-02 12:28:15,614 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:28:15,615 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:28:15,615 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:28:15,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:28:15,617 INFO L82 PathProgramCache]: Analyzing trace with hash -742821217, now seen corresponding path program 1 times [2019-10-02 12:28:15,618 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:28:15,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:28:15,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:15,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:28:15,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:15,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:28:15,891 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 12:28:15,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:28:15,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:28:15,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:28:15,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:28:15,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:28:15,894 INFO L87 Difference]: Start difference. First operand 636 states and 1012 transitions. Second operand 4 states. [2019-10-02 12:28:15,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:28:15,963 INFO L93 Difference]: Finished difference Result 1238 states and 1989 transitions. [2019-10-02 12:28:15,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:28:15,964 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-10-02 12:28:15,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:28:15,969 INFO L225 Difference]: With dead ends: 1238 [2019-10-02 12:28:15,970 INFO L226 Difference]: Without dead ends: 618 [2019-10-02 12:28:15,973 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:28:15,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-10-02 12:28:16,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 618. [2019-10-02 12:28:16,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-10-02 12:28:16,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 979 transitions. [2019-10-02 12:28:16,014 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 979 transitions. Word has length 142 [2019-10-02 12:28:16,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:28:16,014 INFO L475 AbstractCegarLoop]: Abstraction has 618 states and 979 transitions. [2019-10-02 12:28:16,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:28:16,015 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 979 transitions. [2019-10-02 12:28:16,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-02 12:28:16,020 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:28:16,020 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:28:16,021 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:28:16,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:28:16,021 INFO L82 PathProgramCache]: Analyzing trace with hash 841451639, now seen corresponding path program 1 times [2019-10-02 12:28:16,021 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:28:16,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:28:16,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:16,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:28:16,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:16,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:28:16,243 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 12:28:16,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:28:16,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:28:16,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:28:16,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:28:16,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:28:16,246 INFO L87 Difference]: Start difference. First operand 618 states and 979 transitions. Second operand 7 states. [2019-10-02 12:28:16,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:28:16,372 INFO L93 Difference]: Finished difference Result 1207 states and 1931 transitions. [2019-10-02 12:28:16,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:28:16,373 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 142 [2019-10-02 12:28:16,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:28:16,380 INFO L225 Difference]: With dead ends: 1207 [2019-10-02 12:28:16,381 INFO L226 Difference]: Without dead ends: 612 [2019-10-02 12:28:16,384 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:28:16,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-10-02 12:28:16,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2019-10-02 12:28:16,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-10-02 12:28:16,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 966 transitions. [2019-10-02 12:28:16,425 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 966 transitions. Word has length 142 [2019-10-02 12:28:16,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:28:16,428 INFO L475 AbstractCegarLoop]: Abstraction has 612 states and 966 transitions. [2019-10-02 12:28:16,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:28:16,428 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 966 transitions. [2019-10-02 12:28:16,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-02 12:28:16,441 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:28:16,441 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:28:16,441 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:28:16,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:28:16,442 INFO L82 PathProgramCache]: Analyzing trace with hash 571891073, now seen corresponding path program 1 times [2019-10-02 12:28:16,442 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:28:16,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:28:16,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:16,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:28:16,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:16,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:28:16,623 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 12:28:16,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:28:16,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:28:16,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:28:16,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:28:16,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:28:16,625 INFO L87 Difference]: Start difference. First operand 612 states and 966 transitions. Second operand 7 states. [2019-10-02 12:28:16,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:28:16,730 INFO L93 Difference]: Finished difference Result 1195 states and 1905 transitions. [2019-10-02 12:28:16,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:28:16,730 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-10-02 12:28:16,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:28:16,735 INFO L225 Difference]: With dead ends: 1195 [2019-10-02 12:28:16,736 INFO L226 Difference]: Without dead ends: 606 [2019-10-02 12:28:16,739 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:28:16,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2019-10-02 12:28:16,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2019-10-02 12:28:16,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2019-10-02 12:28:16,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 953 transitions. [2019-10-02 12:28:16,765 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 953 transitions. Word has length 143 [2019-10-02 12:28:16,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:28:16,765 INFO L475 AbstractCegarLoop]: Abstraction has 606 states and 953 transitions. [2019-10-02 12:28:16,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:28:16,765 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 953 transitions. [2019-10-02 12:28:16,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-02 12:28:16,769 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:28:16,769 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:28:16,770 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:28:16,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:28:16,770 INFO L82 PathProgramCache]: Analyzing trace with hash -2110652197, now seen corresponding path program 1 times [2019-10-02 12:28:16,770 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:28:16,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:28:16,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:16,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:28:16,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:16,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:28:16,996 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 12:28:16,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:28:16,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:28:16,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:28:16,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:28:16,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:28:16,999 INFO L87 Difference]: Start difference. First operand 606 states and 953 transitions. Second operand 7 states. [2019-10-02 12:28:17,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:28:17,196 INFO L93 Difference]: Finished difference Result 1183 states and 1879 transitions. [2019-10-02 12:28:17,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:28:17,197 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 144 [2019-10-02 12:28:17,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:28:17,202 INFO L225 Difference]: With dead ends: 1183 [2019-10-02 12:28:17,202 INFO L226 Difference]: Without dead ends: 600 [2019-10-02 12:28:17,206 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:28:17,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-10-02 12:28:17,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2019-10-02 12:28:17,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-10-02 12:28:17,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 940 transitions. [2019-10-02 12:28:17,244 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 940 transitions. Word has length 144 [2019-10-02 12:28:17,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:28:17,245 INFO L475 AbstractCegarLoop]: Abstraction has 600 states and 940 transitions. [2019-10-02 12:28:17,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:28:17,246 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 940 transitions. [2019-10-02 12:28:17,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-02 12:28:17,252 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:28:17,253 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:28:17,253 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:28:17,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:28:17,254 INFO L82 PathProgramCache]: Analyzing trace with hash 945368284, now seen corresponding path program 1 times [2019-10-02 12:28:17,254 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:28:17,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:28:17,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:17,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:28:17,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:17,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:28:17,497 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 12:28:17,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:28:17,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:28:17,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:28:17,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:28:17,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:28:17,499 INFO L87 Difference]: Start difference. First operand 600 states and 940 transitions. Second operand 7 states. [2019-10-02 12:28:17,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:28:17,585 INFO L93 Difference]: Finished difference Result 1171 states and 1853 transitions. [2019-10-02 12:28:17,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:28:17,586 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 144 [2019-10-02 12:28:17,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:28:17,591 INFO L225 Difference]: With dead ends: 1171 [2019-10-02 12:28:17,591 INFO L226 Difference]: Without dead ends: 600 [2019-10-02 12:28:17,595 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:28:17,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-10-02 12:28:17,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2019-10-02 12:28:17,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-10-02 12:28:17,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 939 transitions. [2019-10-02 12:28:17,621 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 939 transitions. Word has length 144 [2019-10-02 12:28:17,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:28:17,621 INFO L475 AbstractCegarLoop]: Abstraction has 600 states and 939 transitions. [2019-10-02 12:28:17,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:28:17,621 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 939 transitions. [2019-10-02 12:28:17,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-02 12:28:17,625 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:28:17,626 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:28:17,626 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:28:17,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:28:17,626 INFO L82 PathProgramCache]: Analyzing trace with hash 2008719333, now seen corresponding path program 1 times [2019-10-02 12:28:17,627 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:28:17,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:28:17,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:17,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:28:17,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:17,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:28:17,779 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 12:28:17,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:28:17,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:28:17,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:28:17,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:28:17,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:28:17,780 INFO L87 Difference]: Start difference. First operand 600 states and 939 transitions. Second operand 5 states. [2019-10-02 12:28:17,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:28:17,858 INFO L93 Difference]: Finished difference Result 1170 states and 1850 transitions. [2019-10-02 12:28:17,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:28:17,858 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 145 [2019-10-02 12:28:17,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:28:17,864 INFO L225 Difference]: With dead ends: 1170 [2019-10-02 12:28:17,865 INFO L226 Difference]: Without dead ends: 600 [2019-10-02 12:28:17,869 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:28:17,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-10-02 12:28:17,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2019-10-02 12:28:17,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-10-02 12:28:17,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 938 transitions. [2019-10-02 12:28:17,897 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 938 transitions. Word has length 145 [2019-10-02 12:28:17,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:28:17,898 INFO L475 AbstractCegarLoop]: Abstraction has 600 states and 938 transitions. [2019-10-02 12:28:17,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:28:17,898 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 938 transitions. [2019-10-02 12:28:17,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-02 12:28:17,902 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:28:17,903 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:28:17,903 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:28:17,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:28:17,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1557988425, now seen corresponding path program 1 times [2019-10-02 12:28:17,904 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:28:17,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:28:17,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:17,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:28:17,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:17,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:28:18,099 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 12:28:18,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:28:18,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:28:18,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:28:18,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:28:18,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:28:18,102 INFO L87 Difference]: Start difference. First operand 600 states and 938 transitions. Second operand 5 states. [2019-10-02 12:28:18,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:28:18,181 INFO L93 Difference]: Finished difference Result 1170 states and 1848 transitions. [2019-10-02 12:28:18,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:28:18,181 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 146 [2019-10-02 12:28:18,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:28:18,187 INFO L225 Difference]: With dead ends: 1170 [2019-10-02 12:28:18,187 INFO L226 Difference]: Without dead ends: 600 [2019-10-02 12:28:18,190 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:28:18,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-10-02 12:28:18,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2019-10-02 12:28:18,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-10-02 12:28:18,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 937 transitions. [2019-10-02 12:28:18,216 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 937 transitions. Word has length 146 [2019-10-02 12:28:18,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:28:18,216 INFO L475 AbstractCegarLoop]: Abstraction has 600 states and 937 transitions. [2019-10-02 12:28:18,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:28:18,217 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 937 transitions. [2019-10-02 12:28:18,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-02 12:28:18,220 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:28:18,221 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:28:18,221 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:28:18,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:28:18,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1196360064, now seen corresponding path program 1 times [2019-10-02 12:28:18,222 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:28:18,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:28:18,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:18,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:28:18,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:18,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:28:18,362 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 12:28:18,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:28:18,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:28:18,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:28:18,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:28:18,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:28:18,364 INFO L87 Difference]: Start difference. First operand 600 states and 937 transitions. Second operand 5 states. [2019-10-02 12:28:18,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:28:18,435 INFO L93 Difference]: Finished difference Result 1170 states and 1846 transitions. [2019-10-02 12:28:18,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:28:18,436 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2019-10-02 12:28:18,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:28:18,441 INFO L225 Difference]: With dead ends: 1170 [2019-10-02 12:28:18,441 INFO L226 Difference]: Without dead ends: 600 [2019-10-02 12:28:18,445 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:28:18,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-10-02 12:28:18,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2019-10-02 12:28:18,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-10-02 12:28:18,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 936 transitions. [2019-10-02 12:28:18,470 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 936 transitions. Word has length 147 [2019-10-02 12:28:18,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:28:18,470 INFO L475 AbstractCegarLoop]: Abstraction has 600 states and 936 transitions. [2019-10-02 12:28:18,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:28:18,470 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 936 transitions. [2019-10-02 12:28:18,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-02 12:28:18,474 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:28:18,474 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:28:18,475 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:28:18,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:28:18,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1960010702, now seen corresponding path program 1 times [2019-10-02 12:28:18,475 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:28:18,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:28:18,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:18,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:28:18,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:18,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:28:18,610 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 12:28:18,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:28:18,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:28:18,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:28:18,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:28:18,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:28:18,612 INFO L87 Difference]: Start difference. First operand 600 states and 936 transitions. Second operand 5 states. [2019-10-02 12:28:18,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:28:18,682 INFO L93 Difference]: Finished difference Result 1170 states and 1844 transitions. [2019-10-02 12:28:18,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:28:18,683 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-10-02 12:28:18,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:28:18,688 INFO L225 Difference]: With dead ends: 1170 [2019-10-02 12:28:18,688 INFO L226 Difference]: Without dead ends: 600 [2019-10-02 12:28:18,693 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:28:18,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-10-02 12:28:18,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2019-10-02 12:28:18,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-10-02 12:28:18,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 935 transitions. [2019-10-02 12:28:18,725 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 935 transitions. Word has length 148 [2019-10-02 12:28:18,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:28:18,725 INFO L475 AbstractCegarLoop]: Abstraction has 600 states and 935 transitions. [2019-10-02 12:28:18,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:28:18,726 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 935 transitions. [2019-10-02 12:28:18,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-02 12:28:18,731 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:28:18,731 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:28:18,732 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:28:18,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:28:18,732 INFO L82 PathProgramCache]: Analyzing trace with hash 629882651, now seen corresponding path program 1 times [2019-10-02 12:28:18,733 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:28:18,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:28:18,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:18,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:28:18,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:18,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:28:18,980 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-02 12:28:18,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:28:18,981 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:28:19,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:28:19,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:28:19,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 3069 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 12:28:19,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:28:19,808 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:28:19,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:28:19,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-10-02 12:28:19,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:28:19,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:28:19,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:28:19,820 INFO L87 Difference]: Start difference. First operand 600 states and 935 transitions. Second operand 9 states. [2019-10-02 12:28:25,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:28:25,676 INFO L93 Difference]: Finished difference Result 3651 states and 5857 transitions. [2019-10-02 12:28:25,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-02 12:28:25,677 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 149 [2019-10-02 12:28:25,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:28:25,703 INFO L225 Difference]: With dead ends: 3651 [2019-10-02 12:28:25,704 INFO L226 Difference]: Without dead ends: 3085 [2019-10-02 12:28:25,710 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2019-10-02 12:28:25,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3085 states. [2019-10-02 12:28:25,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3085 to 2959. [2019-10-02 12:28:25,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2959 states. [2019-10-02 12:28:25,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2959 states to 2959 states and 4668 transitions. [2019-10-02 12:28:25,850 INFO L78 Accepts]: Start accepts. Automaton has 2959 states and 4668 transitions. Word has length 149 [2019-10-02 12:28:25,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:28:25,851 INFO L475 AbstractCegarLoop]: Abstraction has 2959 states and 4668 transitions. [2019-10-02 12:28:25,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:28:25,851 INFO L276 IsEmpty]: Start isEmpty. Operand 2959 states and 4668 transitions. [2019-10-02 12:28:25,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-02 12:28:25,856 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:28:25,856 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:28:25,857 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:28:25,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:28:25,857 INFO L82 PathProgramCache]: Analyzing trace with hash -955106131, now seen corresponding path program 1 times [2019-10-02 12:28:25,857 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:28:25,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:28:25,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:25,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:28:25,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:25,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:28:26,079 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 12:28:26,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:28:26,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:28:26,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:28:26,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:28:26,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:28:26,081 INFO L87 Difference]: Start difference. First operand 2959 states and 4668 transitions. Second operand 7 states. [2019-10-02 12:28:28,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:28:28,739 INFO L93 Difference]: Finished difference Result 8781 states and 14139 transitions. [2019-10-02 12:28:28,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:28:28,740 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 153 [2019-10-02 12:28:28,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:28:28,806 INFO L225 Difference]: With dead ends: 8781 [2019-10-02 12:28:28,807 INFO L226 Difference]: Without dead ends: 5856 [2019-10-02 12:28:28,840 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:28:28,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5856 states. [2019-10-02 12:28:29,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5856 to 5772. [2019-10-02 12:28:29,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5772 states. [2019-10-02 12:28:29,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5772 states to 5772 states and 9207 transitions. [2019-10-02 12:28:29,344 INFO L78 Accepts]: Start accepts. Automaton has 5772 states and 9207 transitions. Word has length 153 [2019-10-02 12:28:29,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:28:29,344 INFO L475 AbstractCegarLoop]: Abstraction has 5772 states and 9207 transitions. [2019-10-02 12:28:29,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:28:29,345 INFO L276 IsEmpty]: Start isEmpty. Operand 5772 states and 9207 transitions. [2019-10-02 12:28:29,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-02 12:28:29,349 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:28:29,350 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:28:29,350 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:28:29,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:28:29,350 INFO L82 PathProgramCache]: Analyzing trace with hash -482695708, now seen corresponding path program 1 times [2019-10-02 12:28:29,351 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:28:29,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:28:29,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:29,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:28:29,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:29,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:28:29,512 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 12:28:29,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:28:29,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:28:29,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:28:29,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:28:29,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:28:29,515 INFO L87 Difference]: Start difference. First operand 5772 states and 9207 transitions. Second operand 4 states. [2019-10-02 12:28:29,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:28:29,817 INFO L93 Difference]: Finished difference Result 11498 states and 18507 transitions. [2019-10-02 12:28:29,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:28:29,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-10-02 12:28:29,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:28:29,876 INFO L225 Difference]: With dead ends: 11498 [2019-10-02 12:28:29,877 INFO L226 Difference]: Without dead ends: 5760 [2019-10-02 12:28:29,915 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:28:29,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5760 states. [2019-10-02 12:28:30,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5760 to 5742. [2019-10-02 12:28:30,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5742 states. [2019-10-02 12:28:30,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5742 states to 5742 states and 9119 transitions. [2019-10-02 12:28:30,166 INFO L78 Accepts]: Start accepts. Automaton has 5742 states and 9119 transitions. Word has length 154 [2019-10-02 12:28:30,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:28:30,166 INFO L475 AbstractCegarLoop]: Abstraction has 5742 states and 9119 transitions. [2019-10-02 12:28:30,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:28:30,167 INFO L276 IsEmpty]: Start isEmpty. Operand 5742 states and 9119 transitions. [2019-10-02 12:28:30,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-02 12:28:30,176 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:28:30,176 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:28:30,176 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:28:30,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:28:30,177 INFO L82 PathProgramCache]: Analyzing trace with hash 853035472, now seen corresponding path program 1 times [2019-10-02 12:28:30,177 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:28:30,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:28:30,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:30,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:28:30,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:30,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:28:30,378 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-02 12:28:30,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:28:30,378 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:28:30,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:28:30,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:28:30,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 3068 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 12:28:30,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:28:31,548 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:28:31,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:28:31,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2019-10-02 12:28:31,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:28:31,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:28:31,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:28:31,567 INFO L87 Difference]: Start difference. First operand 5742 states and 9119 transitions. Second operand 12 states. [2019-10-02 12:28:37,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:28:37,295 INFO L93 Difference]: Finished difference Result 18489 states and 30168 transitions. [2019-10-02 12:28:37,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-02 12:28:37,296 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 150 [2019-10-02 12:28:37,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:28:37,398 INFO L225 Difference]: With dead ends: 18489 [2019-10-02 12:28:37,398 INFO L226 Difference]: Without dead ends: 12763 [2019-10-02 12:28:37,430 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=790, Unknown=0, NotChecked=0, Total=930 [2019-10-02 12:28:37,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12763 states. [2019-10-02 12:28:37,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12763 to 8537. [2019-10-02 12:28:37,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8537 states. [2019-10-02 12:28:37,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8537 states to 8537 states and 13525 transitions. [2019-10-02 12:28:37,860 INFO L78 Accepts]: Start accepts. Automaton has 8537 states and 13525 transitions. Word has length 150 [2019-10-02 12:28:37,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:28:37,861 INFO L475 AbstractCegarLoop]: Abstraction has 8537 states and 13525 transitions. [2019-10-02 12:28:37,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:28:37,861 INFO L276 IsEmpty]: Start isEmpty. Operand 8537 states and 13525 transitions. [2019-10-02 12:28:37,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-02 12:28:37,865 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:28:37,866 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 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 12:28:37,866 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:28:37,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:28:37,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1000654446, now seen corresponding path program 1 times [2019-10-02 12:28:37,867 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:28:37,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:28:37,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:37,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:28:37,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:37,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:28:38,121 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-02 12:28:38,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:28:38,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:28:38,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:28:38,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:28:38,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:28:38,127 INFO L87 Difference]: Start difference. First operand 8537 states and 13525 transitions. Second operand 7 states. [2019-10-02 12:28:41,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:28:41,057 INFO L93 Difference]: Finished difference Result 25519 states and 41316 transitions. [2019-10-02 12:28:41,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:28:41,058 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 161 [2019-10-02 12:28:41,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:28:41,208 INFO L225 Difference]: With dead ends: 25519 [2019-10-02 12:28:41,209 INFO L226 Difference]: Without dead ends: 17016 [2019-10-02 12:28:41,250 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:28:41,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17016 states. [2019-10-02 12:28:42,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17016 to 16884. [2019-10-02 12:28:42,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16884 states. [2019-10-02 12:28:42,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16884 states to 16884 states and 27053 transitions. [2019-10-02 12:28:42,204 INFO L78 Accepts]: Start accepts. Automaton has 16884 states and 27053 transitions. Word has length 161 [2019-10-02 12:28:42,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:28:42,205 INFO L475 AbstractCegarLoop]: Abstraction has 16884 states and 27053 transitions. [2019-10-02 12:28:42,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:28:42,205 INFO L276 IsEmpty]: Start isEmpty. Operand 16884 states and 27053 transitions. [2019-10-02 12:28:42,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-02 12:28:42,210 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:28:42,210 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 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 12:28:42,210 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:28:42,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:28:42,211 INFO L82 PathProgramCache]: Analyzing trace with hash 799516287, now seen corresponding path program 1 times [2019-10-02 12:28:42,211 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:28:42,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:28:42,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:42,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:28:42,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:42,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:28:42,366 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-02 12:28:42,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:28:42,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:28:42,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:28:42,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:28:42,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:28:42,367 INFO L87 Difference]: Start difference. First operand 16884 states and 27053 transitions. Second operand 4 states. [2019-10-02 12:28:42,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:28:42,966 INFO L93 Difference]: Finished difference Result 33443 states and 54253 transitions. [2019-10-02 12:28:42,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:28:42,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-10-02 12:28:42,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:28:43,110 INFO L225 Difference]: With dead ends: 33443 [2019-10-02 12:28:43,111 INFO L226 Difference]: Without dead ends: 16581 [2019-10-02 12:28:43,186 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 12:28:43,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16581 states. [2019-10-02 12:28:44,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16581 to 16497. [2019-10-02 12:28:44,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16497 states. [2019-10-02 12:28:44,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16497 states to 16497 states and 26383 transitions. [2019-10-02 12:28:44,719 INFO L78 Accepts]: Start accepts. Automaton has 16497 states and 26383 transitions. Word has length 162 [2019-10-02 12:28:44,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:28:44,719 INFO L475 AbstractCegarLoop]: Abstraction has 16497 states and 26383 transitions. [2019-10-02 12:28:44,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:28:44,719 INFO L276 IsEmpty]: Start isEmpty. Operand 16497 states and 26383 transitions. [2019-10-02 12:28:44,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-02 12:28:44,725 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:28:44,726 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:28:44,726 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:28:44,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:28:44,726 INFO L82 PathProgramCache]: Analyzing trace with hash 833473413, now seen corresponding path program 1 times [2019-10-02 12:28:44,726 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:28:44,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:28:44,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:44,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:28:44,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:44,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:28:44,881 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:28:44,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:28:44,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:28:44,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:28:44,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:28:44,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:28:44,884 INFO L87 Difference]: Start difference. First operand 16497 states and 26383 transitions. Second operand 7 states. [2019-10-02 12:28:48,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:28:48,412 INFO L93 Difference]: Finished difference Result 49531 states and 81271 transitions. [2019-10-02 12:28:48,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:28:48,412 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 171 [2019-10-02 12:28:48,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:28:48,653 INFO L225 Difference]: With dead ends: 49531 [2019-10-02 12:28:48,653 INFO L226 Difference]: Without dead ends: 33068 [2019-10-02 12:28:48,739 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:28:48,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33068 states. [2019-10-02 12:28:50,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33068 to 32868. [2019-10-02 12:28:50,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32868 states. [2019-10-02 12:28:50,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32868 states to 32868 states and 53495 transitions. [2019-10-02 12:28:50,278 INFO L78 Accepts]: Start accepts. Automaton has 32868 states and 53495 transitions. Word has length 171 [2019-10-02 12:28:50,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:28:50,278 INFO L475 AbstractCegarLoop]: Abstraction has 32868 states and 53495 transitions. [2019-10-02 12:28:50,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:28:50,279 INFO L276 IsEmpty]: Start isEmpty. Operand 32868 states and 53495 transitions. [2019-10-02 12:28:50,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-02 12:28:50,283 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:28:50,283 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:28:50,284 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:28:50,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:28:50,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1631393648, now seen corresponding path program 1 times [2019-10-02 12:28:50,284 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:28:50,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:28:50,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:50,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:28:50,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:50,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:28:50,408 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 12:28:50,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:28:50,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:28:50,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:28:50,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:28:50,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:28:50,410 INFO L87 Difference]: Start difference. First operand 32868 states and 53495 transitions. Second operand 4 states. [2019-10-02 12:28:51,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:28:51,341 INFO L93 Difference]: Finished difference Result 65469 states and 108272 transitions. [2019-10-02 12:28:51,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:28:51,341 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2019-10-02 12:28:51,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:28:51,572 INFO L225 Difference]: With dead ends: 65469 [2019-10-02 12:28:51,573 INFO L226 Difference]: Without dead ends: 32623 [2019-10-02 12:28:51,806 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 12:28:51,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32623 states. [2019-10-02 12:28:54,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32623 to 32491. [2019-10-02 12:28:54,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32491 states. [2019-10-02 12:28:54,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32491 states to 32491 states and 52778 transitions. [2019-10-02 12:28:54,325 INFO L78 Accepts]: Start accepts. Automaton has 32491 states and 52778 transitions. Word has length 172 [2019-10-02 12:28:54,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:28:54,326 INFO L475 AbstractCegarLoop]: Abstraction has 32491 states and 52778 transitions. [2019-10-02 12:28:54,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:28:54,326 INFO L276 IsEmpty]: Start isEmpty. Operand 32491 states and 52778 transitions. [2019-10-02 12:28:54,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-10-02 12:28:54,330 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:28:54,330 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:28:54,331 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:28:54,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:28:54,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1919145433, now seen corresponding path program 1 times [2019-10-02 12:28:54,331 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:28:54,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:28:54,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:54,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:28:54,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:54,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:28:54,497 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-10-02 12:28:54,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:28:54,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:28:54,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:28:54,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:28:54,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:28:54,500 INFO L87 Difference]: Start difference. First operand 32491 states and 52778 transitions. Second operand 7 states. [2019-10-02 12:28:58,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:28:58,704 INFO L93 Difference]: Finished difference Result 97709 states and 163975 transitions. [2019-10-02 12:28:58,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:28:58,705 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 182 [2019-10-02 12:28:58,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:28:59,235 INFO L225 Difference]: With dead ends: 97709 [2019-10-02 12:28:59,235 INFO L226 Difference]: Without dead ends: 65252 [2019-10-02 12:28:59,387 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:28:59,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65252 states. [2019-10-02 12:29:02,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65252 to 64936. [2019-10-02 12:29:02,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64936 states. [2019-10-02 12:29:03,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64936 states to 64936 states and 108331 transitions. [2019-10-02 12:29:03,183 INFO L78 Accepts]: Start accepts. Automaton has 64936 states and 108331 transitions. Word has length 182 [2019-10-02 12:29:03,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:29:03,184 INFO L475 AbstractCegarLoop]: Abstraction has 64936 states and 108331 transitions. [2019-10-02 12:29:03,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:29:03,184 INFO L276 IsEmpty]: Start isEmpty. Operand 64936 states and 108331 transitions. [2019-10-02 12:29:03,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-10-02 12:29:03,187 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:29:03,187 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:29:03,188 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:29:03,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:29:03,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1688470134, now seen corresponding path program 1 times [2019-10-02 12:29:03,188 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:29:03,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:29:03,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:29:03,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:29:03,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:29:03,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:29:03,733 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-02 12:29:03,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:29:03,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:29:03,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:29:03,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:29:03,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:29:03,736 INFO L87 Difference]: Start difference. First operand 64936 states and 108331 transitions. Second operand 4 states. [2019-10-02 12:29:05,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:29:05,625 INFO L93 Difference]: Finished difference Result 128954 states and 219897 transitions. [2019-10-02 12:29:05,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:29:05,626 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2019-10-02 12:29:05,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:29:06,111 INFO L225 Difference]: With dead ends: 128954 [2019-10-02 12:29:06,111 INFO L226 Difference]: Without dead ends: 64034 [2019-10-02 12:29:06,403 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:29:06,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64034 states. [2019-10-02 12:29:10,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64034 to 63766. [2019-10-02 12:29:10,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63766 states. [2019-10-02 12:29:11,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63766 states to 63766 states and 106014 transitions. [2019-10-02 12:29:11,246 INFO L78 Accepts]: Start accepts. Automaton has 63766 states and 106014 transitions. Word has length 183 [2019-10-02 12:29:11,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:29:11,246 INFO L475 AbstractCegarLoop]: Abstraction has 63766 states and 106014 transitions. [2019-10-02 12:29:11,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:29:11,246 INFO L276 IsEmpty]: Start isEmpty. Operand 63766 states and 106014 transitions. [2019-10-02 12:29:11,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2019-10-02 12:29:11,271 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:29:11,272 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:29:11,272 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:29:11,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:29:11,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1225865445, now seen corresponding path program 1 times [2019-10-02 12:29:11,273 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:29:11,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:29:11,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:29:11,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:29:11,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:29:11,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:29:12,056 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 23 proven. 43 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2019-10-02 12:29:12,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:29:12,056 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:29:12,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:29:12,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:29:12,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 4472 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:29:12,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:29:13,009 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 359 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:29:13,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:29:13,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2019-10-02 12:29:13,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 12:29:13,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 12:29:13,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:29:13,033 INFO L87 Difference]: Start difference. First operand 63766 states and 106014 transitions. Second operand 15 states. [2019-10-02 12:29:16,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:29:16,974 INFO L93 Difference]: Finished difference Result 127942 states and 220989 transitions. [2019-10-02 12:29:16,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:29:16,975 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 433 [2019-10-02 12:29:16,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:29:17,310 INFO L225 Difference]: With dead ends: 127942 [2019-10-02 12:29:17,310 INFO L226 Difference]: Without dead ends: 64210 [2019-10-02 12:29:17,574 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 433 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2019-10-02 12:29:17,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64210 states. [2019-10-02 12:29:22,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64210 to 64210. [2019-10-02 12:29:22,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64210 states. [2019-10-02 12:29:23,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64210 states to 64210 states and 106267 transitions. [2019-10-02 12:29:23,056 INFO L78 Accepts]: Start accepts. Automaton has 64210 states and 106267 transitions. Word has length 433 [2019-10-02 12:29:23,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:29:23,056 INFO L475 AbstractCegarLoop]: Abstraction has 64210 states and 106267 transitions. [2019-10-02 12:29:23,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 12:29:23,057 INFO L276 IsEmpty]: Start isEmpty. Operand 64210 states and 106267 transitions. [2019-10-02 12:29:23,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2019-10-02 12:29:23,085 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:29:23,086 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:29:23,086 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:29:23,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:29:23,086 INFO L82 PathProgramCache]: Analyzing trace with hash 993993171, now seen corresponding path program 1 times [2019-10-02 12:29:23,087 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:29:23,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:29:23,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:29:23,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:29:23,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:29:23,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:29:23,401 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 23 proven. 47 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2019-10-02 12:29:23,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:29:23,402 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:29:23,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:29:24,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:29:24,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 4477 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:29:24,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:29:24,300 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2019-10-02 12:29:24,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:29:24,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2019-10-02 12:29:24,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 12:29:24,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 12:29:24,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:29:24,311 INFO L87 Difference]: Start difference. First operand 64210 states and 106267 transitions. Second operand 15 states. [2019-10-02 12:29:28,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:29:28,240 INFO L93 Difference]: Finished difference Result 128973 states and 221318 transitions. [2019-10-02 12:29:28,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 12:29:28,243 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 438 [2019-10-02 12:29:28,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:29:28,659 INFO L225 Difference]: With dead ends: 128973 [2019-10-02 12:29:28,659 INFO L226 Difference]: Without dead ends: 64797 [2019-10-02 12:29:28,943 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 439 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2019-10-02 12:29:29,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64797 states. [2019-10-02 12:29:31,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64797 to 64797. [2019-10-02 12:29:31,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64797 states. [2019-10-02 12:29:31,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64797 states to 64797 states and 106759 transitions. [2019-10-02 12:29:31,573 INFO L78 Accepts]: Start accepts. Automaton has 64797 states and 106759 transitions. Word has length 438 [2019-10-02 12:29:31,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:29:31,573 INFO L475 AbstractCegarLoop]: Abstraction has 64797 states and 106759 transitions. [2019-10-02 12:29:31,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 12:29:31,574 INFO L276 IsEmpty]: Start isEmpty. Operand 64797 states and 106759 transitions. [2019-10-02 12:29:31,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2019-10-02 12:29:31,603 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:29:31,603 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:29:31,604 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:29:31,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:29:31,604 INFO L82 PathProgramCache]: Analyzing trace with hash 637046088, now seen corresponding path program 1 times [2019-10-02 12:29:31,604 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:29:31,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:29:31,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:29:31,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:29:31,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:29:31,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:29:31,838 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 14 proven. 31 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2019-10-02 12:29:31,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:29:31,838 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:29:31,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:29:32,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:29:32,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 3635 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:29:32,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:29:32,594 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2019-10-02 12:29:32,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:29:32,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2019-10-02 12:29:32,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 12:29:32,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 12:29:32,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:29:32,605 INFO L87 Difference]: Start difference. First operand 64797 states and 106759 transitions. Second operand 15 states. [2019-10-02 12:29:39,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:29:39,123 INFO L93 Difference]: Finished difference Result 130258 states and 222205 transitions. [2019-10-02 12:29:39,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 12:29:39,123 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 285 [2019-10-02 12:29:39,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:29:39,488 INFO L225 Difference]: With dead ends: 130258 [2019-10-02 12:29:39,488 INFO L226 Difference]: Without dead ends: 65495 [2019-10-02 12:29:39,759 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 286 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2019-10-02 12:29:39,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65495 states. [2019-10-02 12:29:41,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65495 to 65495. [2019-10-02 12:29:41,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65495 states. [2019-10-02 12:29:42,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65495 states to 65495 states and 107410 transitions. [2019-10-02 12:29:42,102 INFO L78 Accepts]: Start accepts. Automaton has 65495 states and 107410 transitions. Word has length 285 [2019-10-02 12:29:42,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:29:42,102 INFO L475 AbstractCegarLoop]: Abstraction has 65495 states and 107410 transitions. [2019-10-02 12:29:42,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 12:29:42,103 INFO L276 IsEmpty]: Start isEmpty. Operand 65495 states and 107410 transitions. [2019-10-02 12:29:42,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-10-02 12:29:42,128 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:29:42,128 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:29:42,129 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:29:42,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:29:42,129 INFO L82 PathProgramCache]: Analyzing trace with hash -968423480, now seen corresponding path program 1 times [2019-10-02 12:29:42,129 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:29:42,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:29:42,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:29:42,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:29:42,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:29:42,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:29:42,412 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 14 proven. 34 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2019-10-02 12:29:42,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:29:42,413 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:29:42,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:29:43,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:29:43,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 3639 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:29:43,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:29:43,140 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-10-02 12:29:43,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:29:43,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2019-10-02 12:29:43,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 12:29:43,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 12:29:43,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:29:43,150 INFO L87 Difference]: Start difference. First operand 65495 states and 107410 transitions. Second operand 15 states. [2019-10-02 12:29:47,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:29:47,386 INFO L93 Difference]: Finished difference Result 131757 states and 223466 transitions. [2019-10-02 12:29:47,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 12:29:47,388 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 289 [2019-10-02 12:29:47,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:29:48,034 INFO L225 Difference]: With dead ends: 131757 [2019-10-02 12:29:48,034 INFO L226 Difference]: Without dead ends: 66296 [2019-10-02 12:29:48,504 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 290 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2019-10-02 12:29:48,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66296 states. [2019-10-02 12:29:51,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66296 to 66296. [2019-10-02 12:29:51,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66296 states. [2019-10-02 12:29:51,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66296 states to 66296 states and 108188 transitions. [2019-10-02 12:29:51,701 INFO L78 Accepts]: Start accepts. Automaton has 66296 states and 108188 transitions. Word has length 289 [2019-10-02 12:29:51,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:29:51,702 INFO L475 AbstractCegarLoop]: Abstraction has 66296 states and 108188 transitions. [2019-10-02 12:29:51,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 12:29:51,702 INFO L276 IsEmpty]: Start isEmpty. Operand 66296 states and 108188 transitions. [2019-10-02 12:29:51,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2019-10-02 12:29:51,720 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:29:51,720 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:29:51,721 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:29:51,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:29:51,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1740864861, now seen corresponding path program 1 times [2019-10-02 12:29:51,721 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:29:51,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:29:51,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:29:51,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:29:51,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:29:51,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:29:52,083 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 25 proven. 28 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2019-10-02 12:29:52,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:29:52,084 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:29:52,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:29:52,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:29:52,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 4492 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-02 12:29:52,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:29:53,122 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 264 proven. 20 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2019-10-02 12:29:53,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:29:53,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2019-10-02 12:29:53,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 12:29:53,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 12:29:53,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2019-10-02 12:29:53,133 INFO L87 Difference]: Start difference. First operand 66296 states and 108188 transitions. Second operand 19 states. [2019-10-02 12:30:47,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:30:47,528 INFO L93 Difference]: Finished difference Result 411185 states and 829734 transitions. [2019-10-02 12:30:47,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-10-02 12:30:47,529 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 453 [2019-10-02 12:30:47,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:30:57,131 INFO L225 Difference]: With dead ends: 411185 [2019-10-02 12:30:57,131 INFO L226 Difference]: Without dead ends: 327183 [2019-10-02 12:30:57,897 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 573 GetRequests, 487 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2513 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1141, Invalid=6515, Unknown=0, NotChecked=0, Total=7656 [2019-10-02 12:30:58,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327183 states. [2019-10-02 12:31:24,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327183 to 308172. [2019-10-02 12:31:24,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308172 states. [2019-10-02 12:31:29,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308172 states to 308172 states and 526161 transitions. [2019-10-02 12:31:29,261 INFO L78 Accepts]: Start accepts. Automaton has 308172 states and 526161 transitions. Word has length 453 [2019-10-02 12:31:29,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:31:29,262 INFO L475 AbstractCegarLoop]: Abstraction has 308172 states and 526161 transitions. [2019-10-02 12:31:29,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 12:31:29,262 INFO L276 IsEmpty]: Start isEmpty. Operand 308172 states and 526161 transitions. [2019-10-02 12:31:29,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2019-10-02 12:31:29,272 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:31:29,272 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:31:29,272 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:31:29,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:31:29,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1388635053, now seen corresponding path program 1 times [2019-10-02 12:31:29,273 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:31:29,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:31:29,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:29,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:31:29,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:29,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:31:30,597 INFO L134 CoverageAnalysis]: Checked inductivity of 609 backedges. 23 proven. 42 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-10-02 12:31:30,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:31:30,598 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:31:30,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:31:31,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:31:31,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 4532 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-02 12:31:31,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:31:31,581 INFO L134 CoverageAnalysis]: Checked inductivity of 609 backedges. 271 proven. 2 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2019-10-02 12:31:31,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:31:31,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2019-10-02 12:31:31,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 12:31:31,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 12:31:31,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=496, Unknown=0, NotChecked=0, Total=552 [2019-10-02 12:31:31,593 INFO L87 Difference]: Start difference. First operand 308172 states and 526161 transitions. Second operand 24 states. [2019-10-02 12:33:03,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:33:03,968 INFO L93 Difference]: Finished difference Result 983681 states and 1847385 transitions. [2019-10-02 12:33:03,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 12:33:03,969 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 471 [2019-10-02 12:33:03,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:33:09,747 INFO L225 Difference]: With dead ends: 983681 [2019-10-02 12:33:09,747 INFO L226 Difference]: Without dead ends: 675543 [2019-10-02 12:33:32,252 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 469 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=214, Invalid=1346, Unknown=0, NotChecked=0, Total=1560 [2019-10-02 12:33:32,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675543 states.