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_spec14_product23.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 11:54:22,159 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 11:54:22,161 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 11:54:22,178 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 11:54:22,179 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 11:54:22,180 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 11:54:22,181 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 11:54:22,192 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 11:54:22,194 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 11:54:22,195 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 11:54:22,196 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 11:54:22,197 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 11:54:22,197 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 11:54:22,200 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 11:54:22,201 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 11:54:22,202 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 11:54:22,202 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 11:54:22,203 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 11:54:22,205 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 11:54:22,207 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 11:54:22,208 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 11:54:22,209 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 11:54:22,210 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 11:54:22,211 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 11:54:22,213 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 11:54:22,213 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 11:54:22,213 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 11:54:22,214 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 11:54:22,214 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 11:54:22,215 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 11:54:22,215 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 11:54:22,216 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 11:54:22,217 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 11:54:22,218 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 11:54:22,219 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 11:54:22,219 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 11:54:22,219 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 11:54:22,220 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 11:54:22,220 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 11:54:22,221 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 11:54:22,221 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 11:54:22,222 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 11:54:22,236 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 11:54:22,237 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 11:54:22,238 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 11:54:22,238 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 11:54:22,238 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 11:54:22,238 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 11:54:22,239 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 11:54:22,239 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 11:54:22,239 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 11:54:22,239 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 11:54:22,239 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 11:54:22,240 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 11:54:22,240 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 11:54:22,240 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 11:54:22,240 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 11:54:22,240 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 11:54:22,240 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 11:54:22,241 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 11:54:22,241 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 11:54:22,241 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 11:54:22,241 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 11:54:22,241 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:54:22,242 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 11:54:22,242 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 11:54:22,242 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 11:54:22,242 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 11:54:22,242 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 11:54:22,243 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 11:54:22,243 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 11:54:22,273 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 11:54:22,285 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 11:54:22,289 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 11:54:22,290 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 11:54:22,290 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 11:54:22,291 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec14_product23.cil.c [2019-10-02 11:54:22,352 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64491bb73/b1394400e32b4ffbb00e321eb17b01d6/FLAGbaf7589a4 [2019-10-02 11:54:22,973 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 11:54:22,975 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec14_product23.cil.c [2019-10-02 11:54:23,013 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64491bb73/b1394400e32b4ffbb00e321eb17b01d6/FLAGbaf7589a4 [2019-10-02 11:54:23,142 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64491bb73/b1394400e32b4ffbb00e321eb17b01d6 [2019-10-02 11:54:23,156 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 11:54:23,158 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 11:54:23,159 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 11:54:23,159 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 11:54:23,166 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 11:54:23,167 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:54:23" (1/1) ... [2019-10-02 11:54:23,172 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3aceb178 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:54:23, skipping insertion in model container [2019-10-02 11:54:23,172 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:54:23" (1/1) ... [2019-10-02 11:54:23,178 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 11:54:23,260 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 11:54:24,020 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:54:24,050 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 11:54:24,171 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:54:24,291 INFO L192 MainTranslator]: Completed translation [2019-10-02 11:54:24,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:54:24 WrapperNode [2019-10-02 11:54:24,292 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 11:54:24,293 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 11:54:24,293 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 11:54:24,294 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 11:54:24,314 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:54:24" (1/1) ... [2019-10-02 11:54:24,315 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:54:24" (1/1) ... [2019-10-02 11:54:24,370 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:54:24" (1/1) ... [2019-10-02 11:54:24,370 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:54:24" (1/1) ... [2019-10-02 11:54:24,450 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:54:24" (1/1) ... [2019-10-02 11:54:24,492 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:54:24" (1/1) ... [2019-10-02 11:54:24,506 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:54:24" (1/1) ... [2019-10-02 11:54:24,521 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 11:54:24,521 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 11:54:24,522 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 11:54:24,522 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 11:54:24,523 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:54:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:54:24,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 11:54:24,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 11:54:24,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 11:54:24,603 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-02 11:54:24,603 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-02 11:54:24,603 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-02 11:54:24,603 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-02 11:54:24,604 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-02 11:54:24,604 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-02 11:54:24,604 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-02 11:54:24,604 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-02 11:54:24,604 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-02 11:54:24,605 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-02 11:54:24,605 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-02 11:54:24,605 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-02 11:54:24,605 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-02 11:54:24,606 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-02 11:54:24,606 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 11:54:24,606 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-02 11:54:24,606 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 11:54:24,606 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-02 11:54:24,607 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-02 11:54:24,607 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification14_spec__1 [2019-10-02 11:54:24,607 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 11:54:24,607 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 11:54:24,607 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 11:54:24,608 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 11:54:24,608 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 11:54:24,608 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 11:54:24,608 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 11:54:24,608 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-02 11:54:24,608 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-02 11:54:24,609 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-02 11:54:24,609 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-02 11:54:24,609 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-02 11:54:24,609 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-02 11:54:24,609 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-02 11:54:24,609 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-02 11:54:24,609 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-02 11:54:24,610 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-02 11:54:24,610 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-02 11:54:24,610 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-02 11:54:24,610 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-02 11:54:24,610 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-02 11:54:24,610 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-02 11:54:24,611 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-02 11:54:24,611 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-02 11:54:24,611 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-02 11:54:24,611 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-02 11:54:24,611 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-02 11:54:24,611 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-02 11:54:24,611 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-02 11:54:24,612 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-02 11:54:24,612 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-02 11:54:24,612 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2019-10-02 11:54:24,612 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-02 11:54:24,612 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-02 11:54:24,612 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-02 11:54:24,613 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-02 11:54:24,613 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-02 11:54:24,613 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-02 11:54:24,613 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-02 11:54:24,613 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-02 11:54:24,613 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-02 11:54:24,614 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-02 11:54:24,614 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-02 11:54:24,614 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-02 11:54:24,614 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-02 11:54:24,614 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-02 11:54:24,614 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-02 11:54:24,615 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-02 11:54:24,615 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-02 11:54:24,615 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 11:54:24,615 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 11:54:24,615 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 11:54:24,615 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 11:54:24,616 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 11:54:24,616 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 11:54:24,616 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 11:54:24,616 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 11:54:24,616 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-02 11:54:24,616 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-02 11:54:24,617 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-02 11:54:24,617 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-02 11:54:24,617 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-02 11:54:24,617 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-02 11:54:24,617 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-02 11:54:24,618 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-02 11:54:24,618 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-02 11:54:24,618 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-02 11:54:24,618 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-02 11:54:24,618 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-02 11:54:24,619 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-02 11:54:24,619 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-02 11:54:24,619 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-02 11:54:24,619 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-02 11:54:24,619 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-02 11:54:24,620 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-02 11:54:24,620 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-02 11:54:24,620 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-02 11:54:24,620 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-02 11:54:24,620 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 11:54:24,620 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 11:54:24,621 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-02 11:54:24,621 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 11:54:24,621 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 11:54:24,621 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 11:54:24,621 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 11:54:24,621 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-02 11:54:24,622 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-02 11:54:24,622 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-02 11:54:24,622 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 11:54:24,622 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-02 11:54:24,622 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-02 11:54:24,622 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-02 11:54:24,623 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-02 11:54:24,623 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification14_spec__1 [2019-10-02 11:54:24,623 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 11:54:24,623 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 11:54:24,623 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 11:54:24,624 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 11:54:24,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 11:54:24,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 11:54:24,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 11:54:24,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 11:54:24,624 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 11:54:24,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 11:54:24,625 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 11:54:24,625 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 11:54:24,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 11:54:24,625 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 11:54:24,626 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 11:54:24,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 11:54:24,626 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 11:54:24,626 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-02 11:54:24,626 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-02 11:54:24,627 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-02 11:54:24,627 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-02 11:54:24,627 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-02 11:54:24,627 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-02 11:54:24,627 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-02 11:54:24,628 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 11:54:24,628 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-02 11:54:24,628 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-02 11:54:24,628 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-02 11:54:24,628 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-02 11:54:24,628 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-02 11:54:24,629 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-02 11:54:24,629 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-02 11:54:24,629 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-02 11:54:24,629 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-02 11:54:24,629 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-02 11:54:24,630 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-02 11:54:24,630 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-02 11:54:24,630 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-02 11:54:24,630 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2019-10-02 11:54:24,630 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-02 11:54:24,630 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-02 11:54:24,630 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-02 11:54:24,631 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-02 11:54:24,631 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-02 11:54:24,631 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-02 11:54:24,631 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-02 11:54:24,631 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-02 11:54:24,631 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-02 11:54:24,631 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 11:54:24,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 11:54:24,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 11:54:24,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 11:54:26,889 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 11:54:26,889 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-02 11:54:26,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:54:26 BoogieIcfgContainer [2019-10-02 11:54:26,892 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 11:54:26,893 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 11:54:26,893 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 11:54:26,897 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 11:54:26,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 11:54:23" (1/3) ... [2019-10-02 11:54:26,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f21df14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:54:26, skipping insertion in model container [2019-10-02 11:54:26,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:54:24" (2/3) ... [2019-10-02 11:54:26,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f21df14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:54:26, skipping insertion in model container [2019-10-02 11:54:26,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:54:26" (3/3) ... [2019-10-02 11:54:26,901 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec14_product23.cil.c [2019-10-02 11:54:26,912 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 11:54:26,922 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 11:54:26,940 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 11:54:26,981 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 11:54:26,982 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 11:54:26,982 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 11:54:26,982 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 11:54:26,982 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 11:54:26,982 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 11:54:26,982 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 11:54:26,983 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 11:54:26,983 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 11:54:27,022 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states. [2019-10-02 11:54:27,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-02 11:54:27,067 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:54:27,069 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:54:27,072 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:54:27,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:54:27,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1117426819, now seen corresponding path program 1 times [2019-10-02 11:54:27,082 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:54:27,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:54:27,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:27,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:27,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:27,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:27,866 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 11:54:27,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:54:27,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:54:27,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:54:27,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:54:27,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:54:27,894 INFO L87 Difference]: Start difference. First operand 766 states. Second operand 4 states. [2019-10-02 11:54:28,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:54:28,192 INFO L93 Difference]: Finished difference Result 1230 states and 1960 transitions. [2019-10-02 11:54:28,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:54:28,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-10-02 11:54:28,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:54:28,228 INFO L225 Difference]: With dead ends: 1230 [2019-10-02 11:54:28,228 INFO L226 Difference]: Without dead ends: 618 [2019-10-02 11:54:28,241 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:54:28,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-10-02 11:54:28,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 618. [2019-10-02 11:54:28,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-10-02 11:54:28,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 971 transitions. [2019-10-02 11:54:28,353 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 971 transitions. Word has length 135 [2019-10-02 11:54:28,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:54:28,353 INFO L475 AbstractCegarLoop]: Abstraction has 618 states and 971 transitions. [2019-10-02 11:54:28,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:54:28,354 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 971 transitions. [2019-10-02 11:54:28,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-02 11:54:28,366 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:54:28,369 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:54:28,370 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:54:28,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:54:28,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1099628587, now seen corresponding path program 1 times [2019-10-02 11:54:28,371 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:54:28,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:54:28,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:28,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:28,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:28,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:28,572 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 11:54:28,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:54:28,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:54:28,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:54:28,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:54:28,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:54:28,576 INFO L87 Difference]: Start difference. First operand 618 states and 971 transitions. Second operand 4 states. [2019-10-02 11:54:28,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:54:28,665 INFO L93 Difference]: Finished difference Result 1203 states and 1903 transitions. [2019-10-02 11:54:28,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:54:28,665 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-10-02 11:54:28,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:54:28,672 INFO L225 Difference]: With dead ends: 1203 [2019-10-02 11:54:28,672 INFO L226 Difference]: Without dead ends: 618 [2019-10-02 11:54:28,677 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:54:28,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-10-02 11:54:28,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 618. [2019-10-02 11:54:28,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-10-02 11:54:28,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 970 transitions. [2019-10-02 11:54:28,718 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 970 transitions. Word has length 136 [2019-10-02 11:54:28,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:54:28,719 INFO L475 AbstractCegarLoop]: Abstraction has 618 states and 970 transitions. [2019-10-02 11:54:28,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:54:28,719 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 970 transitions. [2019-10-02 11:54:28,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-02 11:54:28,724 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:54:28,725 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:54:28,725 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:54:28,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:54:28,725 INFO L82 PathProgramCache]: Analyzing trace with hash 896519935, now seen corresponding path program 1 times [2019-10-02 11:54:28,726 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:54:28,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:54:28,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:28,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:28,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:28,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:28,866 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 11:54:28,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:54:28,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:54:28,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:54:28,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:54:28,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:54:28,868 INFO L87 Difference]: Start difference. First operand 618 states and 970 transitions. Second operand 4 states. [2019-10-02 11:54:28,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:54:28,982 INFO L93 Difference]: Finished difference Result 1203 states and 1902 transitions. [2019-10-02 11:54:28,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:54:28,983 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-10-02 11:54:28,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:54:28,988 INFO L225 Difference]: With dead ends: 1203 [2019-10-02 11:54:28,988 INFO L226 Difference]: Without dead ends: 618 [2019-10-02 11:54:28,991 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:54:28,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-10-02 11:54:29,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 618. [2019-10-02 11:54:29,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-10-02 11:54:29,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 969 transitions. [2019-10-02 11:54:29,034 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 969 transitions. Word has length 137 [2019-10-02 11:54:29,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:54:29,034 INFO L475 AbstractCegarLoop]: Abstraction has 618 states and 969 transitions. [2019-10-02 11:54:29,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:54:29,034 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 969 transitions. [2019-10-02 11:54:29,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-02 11:54:29,042 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:54:29,042 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:54:29,042 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:54:29,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:54:29,043 INFO L82 PathProgramCache]: Analyzing trace with hash -756244441, now seen corresponding path program 1 times [2019-10-02 11:54:29,043 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:54:29,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:54:29,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:29,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:29,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:29,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:29,174 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 11:54:29,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:54:29,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:54:29,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:54:29,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:54:29,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:54:29,176 INFO L87 Difference]: Start difference. First operand 618 states and 969 transitions. Second operand 4 states. [2019-10-02 11:54:29,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:54:29,245 INFO L93 Difference]: Finished difference Result 1203 states and 1901 transitions. [2019-10-02 11:54:29,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:54:29,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-10-02 11:54:29,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:54:29,251 INFO L225 Difference]: With dead ends: 1203 [2019-10-02 11:54:29,251 INFO L226 Difference]: Without dead ends: 618 [2019-10-02 11:54:29,254 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:54:29,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-10-02 11:54:29,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 618. [2019-10-02 11:54:29,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-10-02 11:54:29,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 968 transitions. [2019-10-02 11:54:29,279 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 968 transitions. Word has length 138 [2019-10-02 11:54:29,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:54:29,280 INFO L475 AbstractCegarLoop]: Abstraction has 618 states and 968 transitions. [2019-10-02 11:54:29,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:54:29,280 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 968 transitions. [2019-10-02 11:54:29,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-02 11:54:29,284 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:54:29,284 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:54:29,284 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:54:29,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:54:29,285 INFO L82 PathProgramCache]: Analyzing trace with hash -103696005, now seen corresponding path program 1 times [2019-10-02 11:54:29,285 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:54:29,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:54:29,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:29,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:29,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:29,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:29,413 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 11:54:29,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:54:29,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:54:29,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:54:29,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:54:29,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:54:29,415 INFO L87 Difference]: Start difference. First operand 618 states and 968 transitions. Second operand 4 states. [2019-10-02 11:54:29,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:54:29,480 INFO L93 Difference]: Finished difference Result 1203 states and 1900 transitions. [2019-10-02 11:54:29,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:54:29,481 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-10-02 11:54:29,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:54:29,486 INFO L225 Difference]: With dead ends: 1203 [2019-10-02 11:54:29,487 INFO L226 Difference]: Without dead ends: 618 [2019-10-02 11:54:29,490 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:54:29,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-10-02 11:54:29,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 618. [2019-10-02 11:54:29,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-10-02 11:54:29,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 967 transitions. [2019-10-02 11:54:29,516 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 967 transitions. Word has length 139 [2019-10-02 11:54:29,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:54:29,516 INFO L475 AbstractCegarLoop]: Abstraction has 618 states and 967 transitions. [2019-10-02 11:54:29,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:54:29,517 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 967 transitions. [2019-10-02 11:54:29,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-02 11:54:29,521 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:54:29,522 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:54:29,522 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:54:29,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:54:29,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1000894429, now seen corresponding path program 1 times [2019-10-02 11:54:29,523 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:54:29,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:54:29,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:29,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:29,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:29,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:29,717 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 11:54:29,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:54:29,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 11:54:29,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 11:54:29,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 11:54:29,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:54:29,719 INFO L87 Difference]: Start difference. First operand 618 states and 967 transitions. Second operand 10 states. [2019-10-02 11:54:29,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:54:29,942 INFO L93 Difference]: Finished difference Result 1208 states and 1907 transitions. [2019-10-02 11:54:29,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 11:54:29,943 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2019-10-02 11:54:29,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:54:29,949 INFO L225 Difference]: With dead ends: 1208 [2019-10-02 11:54:29,949 INFO L226 Difference]: Without dead ends: 627 [2019-10-02 11:54:29,953 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:54:29,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2019-10-02 11:54:29,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 625. [2019-10-02 11:54:29,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625 states. [2019-10-02 11:54:29,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 977 transitions. [2019-10-02 11:54:29,984 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 977 transitions. Word has length 140 [2019-10-02 11:54:29,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:54:29,985 INFO L475 AbstractCegarLoop]: Abstraction has 625 states and 977 transitions. [2019-10-02 11:54:29,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 11:54:29,985 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 977 transitions. [2019-10-02 11:54:29,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-02 11:54:29,990 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:54:29,990 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:54:29,991 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:54:29,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:54:29,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1987477118, now seen corresponding path program 1 times [2019-10-02 11:54:29,991 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:54:29,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:54:29,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:29,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:29,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:30,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:30,120 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 11:54:30,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:54:30,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:54:30,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:54:30,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:54:30,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:54:30,123 INFO L87 Difference]: Start difference. First operand 625 states and 977 transitions. Second operand 4 states. [2019-10-02 11:54:30,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:54:30,196 INFO L93 Difference]: Finished difference Result 1209 states and 1908 transitions. [2019-10-02 11:54:30,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:54:30,197 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-10-02 11:54:30,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:54:30,204 INFO L225 Difference]: With dead ends: 1209 [2019-10-02 11:54:30,205 INFO L226 Difference]: Without dead ends: 621 [2019-10-02 11:54:30,212 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:54:30,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2019-10-02 11:54:30,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 621. [2019-10-02 11:54:30,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2019-10-02 11:54:30,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 970 transitions. [2019-10-02 11:54:30,245 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 970 transitions. Word has length 140 [2019-10-02 11:54:30,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:54:30,246 INFO L475 AbstractCegarLoop]: Abstraction has 621 states and 970 transitions. [2019-10-02 11:54:30,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:54:30,246 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 970 transitions. [2019-10-02 11:54:30,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-02 11:54:30,254 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:54:30,254 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:54:30,255 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:54:30,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:54:30,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1145901007, now seen corresponding path program 1 times [2019-10-02 11:54:30,255 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:54:30,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:54:30,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:30,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:30,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:30,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:30,452 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 11:54:30,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:54:30,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:54:30,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:54:30,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:54:30,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:54:30,455 INFO L87 Difference]: Start difference. First operand 621 states and 970 transitions. Second operand 6 states. [2019-10-02 11:54:30,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:54:30,759 INFO L93 Difference]: Finished difference Result 1222 states and 1932 transitions. [2019-10-02 11:54:30,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:54:30,760 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-10-02 11:54:30,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:54:30,765 INFO L225 Difference]: With dead ends: 1222 [2019-10-02 11:54:30,765 INFO L226 Difference]: Without dead ends: 629 [2019-10-02 11:54:30,769 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:54:30,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-10-02 11:54:30,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 626. [2019-10-02 11:54:30,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 11:54:30,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 971 transitions. [2019-10-02 11:54:30,794 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 971 transitions. Word has length 141 [2019-10-02 11:54:30,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:54:30,795 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 971 transitions. [2019-10-02 11:54:30,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:54:30,795 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 971 transitions. [2019-10-02 11:54:30,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-02 11:54:30,800 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:54:30,800 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:54:30,800 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:54:30,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:54:30,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1935329146, now seen corresponding path program 1 times [2019-10-02 11:54:30,801 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:54:30,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:54:30,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:30,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:30,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:30,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:31,038 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 11:54:31,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:54:31,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:54:31,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:54:31,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:54:31,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:54:31,040 INFO L87 Difference]: Start difference. First operand 626 states and 971 transitions. Second operand 6 states. [2019-10-02 11:54:31,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:54:31,273 INFO L93 Difference]: Finished difference Result 1185 states and 1847 transitions. [2019-10-02 11:54:31,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:54:31,274 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-10-02 11:54:31,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:54:31,283 INFO L225 Difference]: With dead ends: 1185 [2019-10-02 11:54:31,284 INFO L226 Difference]: Without dead ends: 626 [2019-10-02 11:54:31,288 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:54:31,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-02 11:54:31,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-02 11:54:31,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 11:54:31,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 967 transitions. [2019-10-02 11:54:31,321 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 967 transitions. Word has length 142 [2019-10-02 11:54:31,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:54:31,321 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 967 transitions. [2019-10-02 11:54:31,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:54:31,322 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 967 transitions. [2019-10-02 11:54:31,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-02 11:54:31,327 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:54:31,328 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:54:31,328 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:54:31,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:54:31,328 INFO L82 PathProgramCache]: Analyzing trace with hash 210411572, now seen corresponding path program 1 times [2019-10-02 11:54:31,329 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:54:31,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:54:31,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:31,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:31,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:31,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:31,471 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 11:54:31,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:54:31,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:54:31,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:54:31,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:54:31,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:54:31,473 INFO L87 Difference]: Start difference. First operand 626 states and 967 transitions. Second operand 6 states. [2019-10-02 11:54:31,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:54:31,773 INFO L93 Difference]: Finished difference Result 1185 states and 1843 transitions. [2019-10-02 11:54:31,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:54:31,774 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-10-02 11:54:31,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:54:31,780 INFO L225 Difference]: With dead ends: 1185 [2019-10-02 11:54:31,780 INFO L226 Difference]: Without dead ends: 626 [2019-10-02 11:54:31,786 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:54:31,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-02 11:54:31,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-02 11:54:31,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 11:54:31,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 963 transitions. [2019-10-02 11:54:31,819 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 963 transitions. Word has length 143 [2019-10-02 11:54:31,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:54:31,820 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 963 transitions. [2019-10-02 11:54:31,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:54:31,820 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 963 transitions. [2019-10-02 11:54:31,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-02 11:54:31,827 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:54:31,827 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:54:31,827 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:54:31,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:54:31,828 INFO L82 PathProgramCache]: Analyzing trace with hash 487742644, now seen corresponding path program 1 times [2019-10-02 11:54:31,828 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:54:31,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:54:31,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:31,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:31,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:31,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:32,035 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 11:54:32,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:54:32,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 11:54:32,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:54:32,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:54:32,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:54:32,038 INFO L87 Difference]: Start difference. First operand 626 states and 963 transitions. Second operand 7 states. [2019-10-02 11:54:32,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:54:32,194 INFO L93 Difference]: Finished difference Result 1188 states and 1843 transitions. [2019-10-02 11:54:32,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:54:32,195 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-10-02 11:54:32,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:54:32,203 INFO L225 Difference]: With dead ends: 1188 [2019-10-02 11:54:32,204 INFO L226 Difference]: Without dead ends: 608 [2019-10-02 11:54:32,210 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 11:54:32,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-10-02 11:54:32,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 605. [2019-10-02 11:54:32,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-10-02 11:54:32,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 926 transitions. [2019-10-02 11:54:32,373 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 926 transitions. Word has length 143 [2019-10-02 11:54:32,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:54:32,374 INFO L475 AbstractCegarLoop]: Abstraction has 605 states and 926 transitions. [2019-10-02 11:54:32,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:54:32,375 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 926 transitions. [2019-10-02 11:54:32,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-02 11:54:32,381 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:54:32,382 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:54:32,382 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:54:32,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:54:32,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1183492043, now seen corresponding path program 1 times [2019-10-02 11:54:32,383 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:54:32,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:54:32,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:32,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:32,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:32,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:32,582 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 11:54:32,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:54:32,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:54:32,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:54:32,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:54:32,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:54:32,585 INFO L87 Difference]: Start difference. First operand 605 states and 926 transitions. Second operand 6 states. [2019-10-02 11:54:32,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:54:32,732 INFO L93 Difference]: Finished difference Result 1164 states and 1802 transitions. [2019-10-02 11:54:32,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:54:32,733 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-10-02 11:54:32,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:54:32,738 INFO L225 Difference]: With dead ends: 1164 [2019-10-02 11:54:32,738 INFO L226 Difference]: Without dead ends: 605 [2019-10-02 11:54:32,743 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:54:32,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-10-02 11:54:32,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2019-10-02 11:54:32,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-10-02 11:54:32,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 925 transitions. [2019-10-02 11:54:32,769 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 925 transitions. Word has length 144 [2019-10-02 11:54:32,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:54:32,769 INFO L475 AbstractCegarLoop]: Abstraction has 605 states and 925 transitions. [2019-10-02 11:54:32,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:54:32,770 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 925 transitions. [2019-10-02 11:54:32,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-02 11:54:32,775 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:54:32,775 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:54:32,775 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:54:32,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:54:32,776 INFO L82 PathProgramCache]: Analyzing trace with hash 163843225, now seen corresponding path program 1 times [2019-10-02 11:54:32,776 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:54:32,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:54:32,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:32,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:32,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:32,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:32,918 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 11:54:32,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:54:32,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:54:32,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:54:32,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:54:32,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:54:32,920 INFO L87 Difference]: Start difference. First operand 605 states and 925 transitions. Second operand 6 states. [2019-10-02 11:54:33,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:54:33,086 INFO L93 Difference]: Finished difference Result 1164 states and 1801 transitions. [2019-10-02 11:54:33,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:54:33,087 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-10-02 11:54:33,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:54:33,092 INFO L225 Difference]: With dead ends: 1164 [2019-10-02 11:54:33,093 INFO L226 Difference]: Without dead ends: 605 [2019-10-02 11:54:33,098 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:54:33,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-10-02 11:54:33,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2019-10-02 11:54:33,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-10-02 11:54:33,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 924 transitions. [2019-10-02 11:54:33,129 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 924 transitions. Word has length 145 [2019-10-02 11:54:33,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:54:33,130 INFO L475 AbstractCegarLoop]: Abstraction has 605 states and 924 transitions. [2019-10-02 11:54:33,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:54:33,130 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 924 transitions. [2019-10-02 11:54:33,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-02 11:54:33,137 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:54:33,138 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:54:33,138 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:54:33,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:54:33,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1794095888, now seen corresponding path program 1 times [2019-10-02 11:54:33,139 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:54:33,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:54:33,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:33,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:33,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:33,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:33,426 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 11:54:33,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:54:33,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 11:54:33,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 11:54:33,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 11:54:33,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:54:33,428 INFO L87 Difference]: Start difference. First operand 605 states and 924 transitions. Second operand 12 states. [2019-10-02 11:54:33,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:54:33,799 INFO L93 Difference]: Finished difference Result 1170 states and 1811 transitions. [2019-10-02 11:54:33,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 11:54:33,800 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 146 [2019-10-02 11:54:33,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:54:33,805 INFO L225 Difference]: With dead ends: 1170 [2019-10-02 11:54:33,805 INFO L226 Difference]: Without dead ends: 612 [2019-10-02 11:54:33,809 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:54:33,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-10-02 11:54:33,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 610. [2019-10-02 11:54:33,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-10-02 11:54:33,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 930 transitions. [2019-10-02 11:54:33,847 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 930 transitions. Word has length 146 [2019-10-02 11:54:33,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:54:33,849 INFO L475 AbstractCegarLoop]: Abstraction has 610 states and 930 transitions. [2019-10-02 11:54:33,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 11:54:33,849 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 930 transitions. [2019-10-02 11:54:33,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-02 11:54:33,854 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:54:33,854 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:54:33,854 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:54:33,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:54:33,855 INFO L82 PathProgramCache]: Analyzing trace with hash 114192712, now seen corresponding path program 1 times [2019-10-02 11:54:33,855 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:54:33,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:54:33,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:33,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:33,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:33,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:34,076 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 11:54:34,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:54:34,076 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:54:34,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:34,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:34,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 2631 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 11:54:34,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:54:34,882 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:54:34,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:54:34,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2019-10-02 11:54:34,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 11:54:34,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 11:54:34,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-10-02 11:54:34,894 INFO L87 Difference]: Start difference. First operand 610 states and 930 transitions. Second operand 13 states. [2019-10-02 11:54:46,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:54:46,856 INFO L93 Difference]: Finished difference Result 1782 states and 2859 transitions. [2019-10-02 11:54:46,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 11:54:46,857 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 147 [2019-10-02 11:54:46,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:54:46,866 INFO L225 Difference]: With dead ends: 1782 [2019-10-02 11:54:46,867 INFO L226 Difference]: Without dead ends: 1225 [2019-10-02 11:54:46,872 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 162 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=702, Unknown=0, NotChecked=0, Total=870 [2019-10-02 11:54:46,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2019-10-02 11:54:46,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1208. [2019-10-02 11:54:46,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1208 states. [2019-10-02 11:54:46,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 1904 transitions. [2019-10-02 11:54:46,940 INFO L78 Accepts]: Start accepts. Automaton has 1208 states and 1904 transitions. Word has length 147 [2019-10-02 11:54:46,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:54:46,941 INFO L475 AbstractCegarLoop]: Abstraction has 1208 states and 1904 transitions. [2019-10-02 11:54:46,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 11:54:46,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 1904 transitions. [2019-10-02 11:54:46,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-02 11:54:46,945 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:54:46,946 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 11:54:46,946 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:54:46,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:54:46,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1159837229, now seen corresponding path program 1 times [2019-10-02 11:54:46,947 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:54:46,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:54:46,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:46,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:46,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:47,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:47,131 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 11:54:47,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:54:47,132 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:54:47,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:47,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:47,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 2638 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 11:54:47,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:54:47,831 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 11:54:47,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:54:47,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2019-10-02 11:54:47,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 11:54:47,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 11:54:47,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:54:47,842 INFO L87 Difference]: Start difference. First operand 1208 states and 1904 transitions. Second operand 10 states. [2019-10-02 11:54:49,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:54:49,185 INFO L93 Difference]: Finished difference Result 2400 states and 3875 transitions. [2019-10-02 11:54:49,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 11:54:49,185 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 156 [2019-10-02 11:54:49,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:54:49,197 INFO L225 Difference]: With dead ends: 2400 [2019-10-02 11:54:49,198 INFO L226 Difference]: Without dead ends: 1245 [2019-10-02 11:54:49,206 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-10-02 11:54:49,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1245 states. [2019-10-02 11:54:49,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1245 to 1237. [2019-10-02 11:54:49,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1237 states. [2019-10-02 11:54:49,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1956 transitions. [2019-10-02 11:54:49,275 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1956 transitions. Word has length 156 [2019-10-02 11:54:49,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:54:49,276 INFO L475 AbstractCegarLoop]: Abstraction has 1237 states and 1956 transitions. [2019-10-02 11:54:49,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 11:54:49,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1956 transitions. [2019-10-02 11:54:49,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-02 11:54:49,281 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:54:49,281 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 11:54:49,282 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:54:49,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:54:49,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1113293167, now seen corresponding path program 1 times [2019-10-02 11:54:49,282 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:54:49,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:54:49,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:49,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:49,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:49,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:49,511 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 11:54:49,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:54:49,512 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:54:49,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:50,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:50,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 2638 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 11:54:50,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:54:50,246 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:54:50,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:54:50,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2019-10-02 11:54:50,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 11:54:50,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 11:54:50,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-10-02 11:54:50,265 INFO L87 Difference]: Start difference. First operand 1237 states and 1956 transitions. Second operand 13 states. [2019-10-02 11:55:01,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:55:01,801 INFO L93 Difference]: Finished difference Result 3871 states and 6321 transitions. [2019-10-02 11:55:01,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 11:55:01,802 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 155 [2019-10-02 11:55:01,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:55:01,824 INFO L225 Difference]: With dead ends: 3871 [2019-10-02 11:55:01,824 INFO L226 Difference]: Without dead ends: 2687 [2019-10-02 11:55:01,834 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=702, Unknown=0, NotChecked=0, Total=870 [2019-10-02 11:55:01,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2687 states. [2019-10-02 11:55:01,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2687 to 2629. [2019-10-02 11:55:01,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2629 states. [2019-10-02 11:55:01,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2629 states to 2629 states and 4219 transitions. [2019-10-02 11:55:01,965 INFO L78 Accepts]: Start accepts. Automaton has 2629 states and 4219 transitions. Word has length 155 [2019-10-02 11:55:01,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:55:01,966 INFO L475 AbstractCegarLoop]: Abstraction has 2629 states and 4219 transitions. [2019-10-02 11:55:01,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 11:55:01,966 INFO L276 IsEmpty]: Start isEmpty. Operand 2629 states and 4219 transitions. [2019-10-02 11:55:01,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-02 11:55:01,974 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:55:01,974 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 11:55:01,974 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:55:01,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:55:01,975 INFO L82 PathProgramCache]: Analyzing trace with hash -80605107, now seen corresponding path program 1 times [2019-10-02 11:55:01,975 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:55:01,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:55:01,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:55:01,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:55:01,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:55:02,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:55:02,132 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 11:55:02,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:55:02,132 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:55:02,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:55:02,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:55:02,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 2640 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 11:55:02,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:55:02,780 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 11:55:02,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:55:02,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2019-10-02 11:55:02,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 11:55:02,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 11:55:02,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-10-02 11:55:02,792 INFO L87 Difference]: Start difference. First operand 2629 states and 4219 transitions. Second operand 13 states. [2019-10-02 11:55:14,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:55:14,085 INFO L93 Difference]: Finished difference Result 7474 states and 12264 transitions. [2019-10-02 11:55:14,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 11:55:14,086 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 157 [2019-10-02 11:55:14,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:55:14,132 INFO L225 Difference]: With dead ends: 7474 [2019-10-02 11:55:14,132 INFO L226 Difference]: Without dead ends: 4904 [2019-10-02 11:55:14,157 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 170 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=702, Unknown=0, NotChecked=0, Total=870 [2019-10-02 11:55:14,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4904 states. [2019-10-02 11:55:14,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4904 to 4789. [2019-10-02 11:55:14,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4789 states. [2019-10-02 11:55:14,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4789 states to 4789 states and 7733 transitions. [2019-10-02 11:55:14,467 INFO L78 Accepts]: Start accepts. Automaton has 4789 states and 7733 transitions. Word has length 157 [2019-10-02 11:55:14,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:55:14,468 INFO L475 AbstractCegarLoop]: Abstraction has 4789 states and 7733 transitions. [2019-10-02 11:55:14,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 11:55:14,468 INFO L276 IsEmpty]: Start isEmpty. Operand 4789 states and 7733 transitions. [2019-10-02 11:55:14,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-02 11:55:14,480 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:55:14,481 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 11:55:14,481 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:55:14,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:55:14,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1389283025, now seen corresponding path program 1 times [2019-10-02 11:55:14,482 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:55:14,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:55:14,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:55:14,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:55:14,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:55:14,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:55:14,690 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 11:55:14,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:55:14,691 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:55:14,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:55:15,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:55:15,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 2642 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-02 11:55:15,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:55:15,212 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 11:55:15,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:55:15,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2019-10-02 11:55:15,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 11:55:15,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 11:55:15,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-02 11:55:15,226 INFO L87 Difference]: Start difference. First operand 4789 states and 7733 transitions. Second operand 13 states. [2019-10-02 11:55:33,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:55:33,213 INFO L93 Difference]: Finished difference Result 20216 states and 33307 transitions. [2019-10-02 11:55:33,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-02 11:55:33,214 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 159 [2019-10-02 11:55:33,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:55:33,375 INFO L225 Difference]: With dead ends: 20216 [2019-10-02 11:55:33,376 INFO L226 Difference]: Without dead ends: 15492 [2019-10-02 11:55:33,416 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=279, Invalid=1883, Unknown=0, NotChecked=0, Total=2162 [2019-10-02 11:55:33,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15492 states. [2019-10-02 11:55:34,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15492 to 15091. [2019-10-02 11:55:34,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15091 states. [2019-10-02 11:55:34,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15091 states to 15091 states and 24616 transitions. [2019-10-02 11:55:34,451 INFO L78 Accepts]: Start accepts. Automaton has 15091 states and 24616 transitions. Word has length 159 [2019-10-02 11:55:34,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:55:34,454 INFO L475 AbstractCegarLoop]: Abstraction has 15091 states and 24616 transitions. [2019-10-02 11:55:34,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 11:55:34,454 INFO L276 IsEmpty]: Start isEmpty. Operand 15091 states and 24616 transitions. [2019-10-02 11:55:34,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-02 11:55:34,470 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:55:34,470 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:55:34,471 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:55:34,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:55:34,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1286530666, now seen corresponding path program 1 times [2019-10-02 11:55:34,471 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:55:34,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:55:34,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:55:34,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:55:34,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:55:34,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:55:34,622 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-02 11:55:34,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:55:34,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:55:34,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:55:34,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:55:34,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:55:34,624 INFO L87 Difference]: Start difference. First operand 15091 states and 24616 transitions. Second operand 9 states. [2019-10-02 11:55:35,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:55:35,209 INFO L93 Difference]: Finished difference Result 21238 states and 34540 transitions. [2019-10-02 11:55:35,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 11:55:35,210 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 167 [2019-10-02 11:55:35,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:55:35,268 INFO L225 Difference]: With dead ends: 21238 [2019-10-02 11:55:35,268 INFO L226 Difference]: Without dead ends: 6194 [2019-10-02 11:55:35,345 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:55:35,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6194 states. [2019-10-02 11:55:35,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6194 to 6190. [2019-10-02 11:55:35,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6190 states. [2019-10-02 11:55:35,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6190 states to 6190 states and 9961 transitions. [2019-10-02 11:55:35,781 INFO L78 Accepts]: Start accepts. Automaton has 6190 states and 9961 transitions. Word has length 167 [2019-10-02 11:55:35,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:55:35,782 INFO L475 AbstractCegarLoop]: Abstraction has 6190 states and 9961 transitions. [2019-10-02 11:55:35,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:55:35,782 INFO L276 IsEmpty]: Start isEmpty. Operand 6190 states and 9961 transitions. [2019-10-02 11:55:35,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-02 11:55:35,788 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:55:35,789 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:55:35,789 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:55:35,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:55:35,789 INFO L82 PathProgramCache]: Analyzing trace with hash -2011002107, now seen corresponding path program 1 times [2019-10-02 11:55:35,790 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:55:35,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:55:35,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:55:35,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:55:35,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:55:35,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:55:36,796 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 11:55:36,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:55:36,797 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:55:36,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:55:37,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:55:37,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 2696 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 11:55:37,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:55:37,301 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:55:37,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:55:37,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2019-10-02 11:55:37,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 11:55:37,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 11:55:37,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:55:37,328 INFO L87 Difference]: Start difference. First operand 6190 states and 9961 transitions. Second operand 11 states. [2019-10-02 11:55:52,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:55:52,132 INFO L93 Difference]: Finished difference Result 15477 states and 25201 transitions. [2019-10-02 11:55:52,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-02 11:55:52,132 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 175 [2019-10-02 11:55:52,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:55:52,187 INFO L225 Difference]: With dead ends: 15477 [2019-10-02 11:55:52,187 INFO L226 Difference]: Without dead ends: 9340 [2019-10-02 11:55:52,208 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=209, Invalid=1123, Unknown=0, NotChecked=0, Total=1332 [2019-10-02 11:55:52,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9340 states. [2019-10-02 11:55:52,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9340 to 6118. [2019-10-02 11:55:52,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6118 states. [2019-10-02 11:55:52,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6118 states to 6118 states and 9818 transitions. [2019-10-02 11:55:52,619 INFO L78 Accepts]: Start accepts. Automaton has 6118 states and 9818 transitions. Word has length 175 [2019-10-02 11:55:52,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:55:52,622 INFO L475 AbstractCegarLoop]: Abstraction has 6118 states and 9818 transitions. [2019-10-02 11:55:52,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 11:55:52,625 INFO L276 IsEmpty]: Start isEmpty. Operand 6118 states and 9818 transitions. [2019-10-02 11:55:52,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-10-02 11:55:52,630 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:55:52,631 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:55:52,631 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:55:52,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:55:52,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1902038756, now seen corresponding path program 1 times [2019-10-02 11:55:52,632 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:55:52,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:55:52,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:55:52,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:55:52,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:55:52,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:55:52,793 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 11:55:52,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:55:52,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:55:52,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:55:52,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:55:52,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:55:52,795 INFO L87 Difference]: Start difference. First operand 6118 states and 9818 transitions. Second operand 4 states. [2019-10-02 11:55:54,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:55:54,474 INFO L93 Difference]: Finished difference Result 18047 states and 29443 transitions. [2019-10-02 11:55:54,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:55:54,475 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 189 [2019-10-02 11:55:54,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:55:54,568 INFO L225 Difference]: With dead ends: 18047 [2019-10-02 11:55:54,569 INFO L226 Difference]: Without dead ends: 11982 [2019-10-02 11:55:54,600 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:55:54,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11982 states. [2019-10-02 11:55:55,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11982 to 11979. [2019-10-02 11:55:55,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11979 states. [2019-10-02 11:55:55,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11979 states to 11979 states and 19325 transitions. [2019-10-02 11:55:55,252 INFO L78 Accepts]: Start accepts. Automaton has 11979 states and 19325 transitions. Word has length 189 [2019-10-02 11:55:55,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:55:55,253 INFO L475 AbstractCegarLoop]: Abstraction has 11979 states and 19325 transitions. [2019-10-02 11:55:55,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:55:55,253 INFO L276 IsEmpty]: Start isEmpty. Operand 11979 states and 19325 transitions. [2019-10-02 11:55:55,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-10-02 11:55:55,259 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:55:55,259 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:55:55,259 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:55:55,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:55:55,260 INFO L82 PathProgramCache]: Analyzing trace with hash 952692259, now seen corresponding path program 1 times [2019-10-02 11:55:55,260 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:55:55,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:55:55,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:55:55,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:55:55,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:55:55,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:55:55,387 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 11:55:55,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:55:55,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:55:55,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:55:55,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:55:55,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:55:55,389 INFO L87 Difference]: Start difference. First operand 11979 states and 19325 transitions. Second operand 4 states. [2019-10-02 11:55:57,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:55:57,173 INFO L93 Difference]: Finished difference Result 35679 states and 58628 transitions. [2019-10-02 11:55:57,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:55:57,173 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 190 [2019-10-02 11:55:57,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:55:57,365 INFO L225 Difference]: With dead ends: 35679 [2019-10-02 11:55:57,366 INFO L226 Difference]: Without dead ends: 23754 [2019-10-02 11:55:57,428 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:55:57,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23754 states. [2019-10-02 11:55:58,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23754 to 23751. [2019-10-02 11:55:58,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23751 states. [2019-10-02 11:55:59,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23751 states to 23751 states and 38756 transitions. [2019-10-02 11:55:59,843 INFO L78 Accepts]: Start accepts. Automaton has 23751 states and 38756 transitions. Word has length 190 [2019-10-02 11:55:59,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:55:59,844 INFO L475 AbstractCegarLoop]: Abstraction has 23751 states and 38756 transitions. [2019-10-02 11:55:59,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:55:59,844 INFO L276 IsEmpty]: Start isEmpty. Operand 23751 states and 38756 transitions. [2019-10-02 11:55:59,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-10-02 11:55:59,852 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:55:59,852 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:55:59,853 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:55:59,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:55:59,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1162920824, now seen corresponding path program 1 times [2019-10-02 11:55:59,853 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:55:59,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:55:59,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:55:59,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:55:59,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:55:59,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:55:59,983 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 11:55:59,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:55:59,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:55:59,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:55:59,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:55:59,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:55:59,985 INFO L87 Difference]: Start difference. First operand 23751 states and 38756 transitions. Second operand 4 states. [2019-10-02 11:56:02,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:56:02,421 INFO L93 Difference]: Finished difference Result 71043 states and 118453 transitions. [2019-10-02 11:56:02,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:56:02,422 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 191 [2019-10-02 11:56:02,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:56:02,740 INFO L225 Difference]: With dead ends: 71043 [2019-10-02 11:56:02,740 INFO L226 Difference]: Without dead ends: 47348 [2019-10-02 11:56:02,834 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:56:02,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47348 states. [2019-10-02 11:56:05,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47348 to 47345. [2019-10-02 11:56:05,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47345 states. [2019-10-02 11:56:06,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47345 states to 47345 states and 78661 transitions. [2019-10-02 11:56:06,106 INFO L78 Accepts]: Start accepts. Automaton has 47345 states and 78661 transitions. Word has length 191 [2019-10-02 11:56:06,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:56:06,107 INFO L475 AbstractCegarLoop]: Abstraction has 47345 states and 78661 transitions. [2019-10-02 11:56:06,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:56:06,107 INFO L276 IsEmpty]: Start isEmpty. Operand 47345 states and 78661 transitions. [2019-10-02 11:56:06,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-02 11:56:06,114 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:56:06,115 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:56:06,115 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:56:06,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:56:06,115 INFO L82 PathProgramCache]: Analyzing trace with hash 997952063, now seen corresponding path program 1 times [2019-10-02 11:56:06,115 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:56:06,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:56:06,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:56:06,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:56:06,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:56:06,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:56:06,235 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 11:56:06,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:56:06,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:56:06,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:56:06,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:56:06,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:56:06,237 INFO L87 Difference]: Start difference. First operand 47345 states and 78661 transitions. Second operand 4 states. [2019-10-02 11:56:11,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:56:11,806 INFO L93 Difference]: Finished difference Result 141871 states and 242120 transitions. [2019-10-02 11:56:11,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:56:11,807 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-10-02 11:56:11,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:56:12,557 INFO L225 Difference]: With dead ends: 141871 [2019-10-02 11:56:12,557 INFO L226 Difference]: Without dead ends: 94586 [2019-10-02 11:56:12,725 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:56:12,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94586 states. [2019-10-02 11:56:19,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94586 to 94583. [2019-10-02 11:56:19,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94583 states. [2019-10-02 11:56:20,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94583 states to 94583 states and 161462 transitions. [2019-10-02 11:56:20,488 INFO L78 Accepts]: Start accepts. Automaton has 94583 states and 161462 transitions. Word has length 192 [2019-10-02 11:56:20,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:56:20,489 INFO L475 AbstractCegarLoop]: Abstraction has 94583 states and 161462 transitions. [2019-10-02 11:56:20,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:56:20,489 INFO L276 IsEmpty]: Start isEmpty. Operand 94583 states and 161462 transitions. [2019-10-02 11:56:20,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-10-02 11:56:20,495 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:56:20,496 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:56:20,496 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:56:20,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:56:20,496 INFO L82 PathProgramCache]: Analyzing trace with hash 2086768084, now seen corresponding path program 1 times [2019-10-02 11:56:20,496 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:56:20,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:56:20,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:56:20,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:56:20,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:56:20,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:56:20,616 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 11:56:20,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:56:20,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:56:20,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:56:20,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:56:20,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:56:20,618 INFO L87 Difference]: Start difference. First operand 94583 states and 161462 transitions. Second operand 4 states. [2019-10-02 11:56:33,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:56:33,291 INFO L93 Difference]: Finished difference Result 283627 states and 501511 transitions. [2019-10-02 11:56:33,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:56:33,292 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 193 [2019-10-02 11:56:33,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:56:34,650 INFO L225 Difference]: With dead ends: 283627 [2019-10-02 11:56:34,650 INFO L226 Difference]: Without dead ends: 189112 [2019-10-02 11:56:35,072 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:56:35,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189112 states. [2019-10-02 11:56:49,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189112 to 189109. [2019-10-02 11:56:49,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189109 states. [2019-10-02 11:56:51,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189109 states to 189109 states and 336187 transitions. [2019-10-02 11:56:51,223 INFO L78 Accepts]: Start accepts. Automaton has 189109 states and 336187 transitions. Word has length 193 [2019-10-02 11:56:51,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:56:51,224 INFO L475 AbstractCegarLoop]: Abstraction has 189109 states and 336187 transitions. [2019-10-02 11:56:51,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:56:51,224 INFO L276 IsEmpty]: Start isEmpty. Operand 189109 states and 336187 transitions. [2019-10-02 11:56:51,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-10-02 11:56:51,230 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:56:51,230 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:56:51,230 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:56:51,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:56:51,231 INFO L82 PathProgramCache]: Analyzing trace with hash 416254515, now seen corresponding path program 1 times [2019-10-02 11:56:51,231 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:56:51,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:56:51,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:56:51,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:56:51,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:56:51,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:56:51,424 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 11:56:51,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:56:51,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:56:51,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:56:51,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:56:51,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:56:51,426 INFO L87 Difference]: Start difference. First operand 189109 states and 336187 transitions. Second operand 9 states. [2019-10-02 11:57:05,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:05,463 INFO L93 Difference]: Finished difference Result 381817 states and 677659 transitions. [2019-10-02 11:57:05,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 11:57:05,464 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 193 [2019-10-02 11:57:05,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:06,639 INFO L225 Difference]: With dead ends: 381817 [2019-10-02 11:57:06,639 INFO L226 Difference]: Without dead ends: 192792 [2019-10-02 11:57:07,493 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2019-10-02 11:57:07,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192792 states. [2019-10-02 11:57:23,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192792 to 190709. [2019-10-02 11:57:23,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190709 states. [2019-10-02 11:57:25,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190709 states to 190709 states and 338107 transitions. [2019-10-02 11:57:25,533 INFO L78 Accepts]: Start accepts. Automaton has 190709 states and 338107 transitions. Word has length 193 [2019-10-02 11:57:25,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:25,534 INFO L475 AbstractCegarLoop]: Abstraction has 190709 states and 338107 transitions. [2019-10-02 11:57:25,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:57:25,534 INFO L276 IsEmpty]: Start isEmpty. Operand 190709 states and 338107 transitions. [2019-10-02 11:57:25,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-10-02 11:57:25,543 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:25,543 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:57:25,544 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:25,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:25,544 INFO L82 PathProgramCache]: Analyzing trace with hash -2033649945, now seen corresponding path program 1 times [2019-10-02 11:57:25,544 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:25,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:25,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:25,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:25,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:25,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:25,665 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-02 11:57:25,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:57:25,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:57:25,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:57:25,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:57:25,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:57:25,667 INFO L87 Difference]: Start difference. First operand 190709 states and 338107 transitions. Second operand 5 states. [2019-10-02 11:57:40,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:40,599 INFO L93 Difference]: Finished difference Result 382239 states and 676427 transitions. [2019-10-02 11:57:40,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:57:40,600 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 199 [2019-10-02 11:57:40,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:42,596 INFO L225 Difference]: With dead ends: 382239 [2019-10-02 11:57:42,596 INFO L226 Difference]: Without dead ends: 191614 [2019-10-02 11:57:43,401 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:57:43,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191614 states. [2019-10-02 11:57:58,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191614 to 190684. [2019-10-02 11:57:58,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190684 states. [2019-10-02 11:58:00,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190684 states to 190684 states and 338057 transitions. [2019-10-02 11:58:00,616 INFO L78 Accepts]: Start accepts. Automaton has 190684 states and 338057 transitions. Word has length 199 [2019-10-02 11:58:00,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:58:00,616 INFO L475 AbstractCegarLoop]: Abstraction has 190684 states and 338057 transitions. [2019-10-02 11:58:00,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:58:00,617 INFO L276 IsEmpty]: Start isEmpty. Operand 190684 states and 338057 transitions. [2019-10-02 11:58:00,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-10-02 11:58:00,622 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:58:00,623 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:58:00,623 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:58:00,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:58:00,623 INFO L82 PathProgramCache]: Analyzing trace with hash 812731640, now seen corresponding path program 1 times [2019-10-02 11:58:00,623 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:58:00,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:58:00,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:00,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:58:00,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:00,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:58:00,788 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-02 11:58:00,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:58:00,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:58:00,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:58:00,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:58:00,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:58:00,790 INFO L87 Difference]: Start difference. First operand 190684 states and 338057 transitions. Second operand 9 states. [2019-10-02 11:58:18,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:58:18,010 INFO L93 Difference]: Finished difference Result 386724 states and 685324 transitions. [2019-10-02 11:58:18,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:58:18,011 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 198 [2019-10-02 11:58:18,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:58:19,908 INFO L225 Difference]: With dead ends: 386724 [2019-10-02 11:58:19,909 INFO L226 Difference]: Without dead ends: 196124 [2019-10-02 11:58:20,636 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:58:20,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196124 states. [2019-10-02 11:58:34,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196124 to 194844. [2019-10-02 11:58:34,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194844 states. [2019-10-02 11:58:35,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194844 states to 194844 states and 344643 transitions. [2019-10-02 11:58:35,830 INFO L78 Accepts]: Start accepts. Automaton has 194844 states and 344643 transitions. Word has length 198 [2019-10-02 11:58:35,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:58:35,831 INFO L475 AbstractCegarLoop]: Abstraction has 194844 states and 344643 transitions. [2019-10-02 11:58:35,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:58:35,831 INFO L276 IsEmpty]: Start isEmpty. Operand 194844 states and 344643 transitions. [2019-10-02 11:58:35,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-10-02 11:58:35,836 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:58:35,836 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:58:35,836 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:58:35,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:58:35,837 INFO L82 PathProgramCache]: Analyzing trace with hash 506455913, now seen corresponding path program 1 times [2019-10-02 11:58:35,837 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:58:35,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:58:35,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:35,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:58:35,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:35,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:58:35,991 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-02 11:58:35,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:58:35,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:58:35,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:58:35,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:58:35,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:58:35,993 INFO L87 Difference]: Start difference. First operand 194844 states and 344643 transitions. Second operand 9 states. [2019-10-02 11:58:55,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:58:55,757 INFO L93 Difference]: Finished difference Result 393444 states and 694726 transitions. [2019-10-02 11:58:55,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:58:55,757 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 199 [2019-10-02 11:58:55,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:58:57,474 INFO L225 Difference]: With dead ends: 393444 [2019-10-02 11:58:57,474 INFO L226 Difference]: Without dead ends: 198684 [2019-10-02 11:58:58,243 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:58:58,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198684 states. [2019-10-02 11:59:12,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198684 to 195164. [2019-10-02 11:59:12,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195164 states. [2019-10-02 11:59:14,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195164 states to 195164 states and 344963 transitions. [2019-10-02 11:59:14,244 INFO L78 Accepts]: Start accepts. Automaton has 195164 states and 344963 transitions. Word has length 199 [2019-10-02 11:59:14,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:59:14,244 INFO L475 AbstractCegarLoop]: Abstraction has 195164 states and 344963 transitions. [2019-10-02 11:59:14,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:59:14,244 INFO L276 IsEmpty]: Start isEmpty. Operand 195164 states and 344963 transitions. [2019-10-02 11:59:14,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-10-02 11:59:14,248 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:59:14,249 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:59:14,249 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:59:14,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:59:14,249 INFO L82 PathProgramCache]: Analyzing trace with hash -60102686, now seen corresponding path program 1 times [2019-10-02 11:59:14,249 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:59:14,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:59:14,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:59:14,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:59:14,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:59:14,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:59:14,989 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-02 11:59:14,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:59:14,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:59:14,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:59:14,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:59:14,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:59:14,990 INFO L87 Difference]: Start difference. First operand 195164 states and 344963 transitions. Second operand 4 states. [2019-10-02 11:59:46,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:59:46,558 INFO L93 Difference]: Finished difference Result 681553 states and 1216459 transitions. [2019-10-02 11:59:46,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:59:46,558 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 208 [2019-10-02 11:59:46,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:59:49,425 INFO L225 Difference]: With dead ends: 681553 [2019-10-02 11:59:49,425 INFO L226 Difference]: Without dead ends: 486153 [2019-10-02 11:59:52,007 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:59:52,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486153 states. [2019-10-02 12:00:33,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486153 to 484547. [2019-10-02 12:00:33,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484547 states. [2019-10-02 12:00:50,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484547 states to 484547 states and 852577 transitions. [2019-10-02 12:00:51,008 INFO L78 Accepts]: Start accepts. Automaton has 484547 states and 852577 transitions. Word has length 208 [2019-10-02 12:00:51,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:00:51,009 INFO L475 AbstractCegarLoop]: Abstraction has 484547 states and 852577 transitions. [2019-10-02 12:00:51,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:00:51,009 INFO L276 IsEmpty]: Start isEmpty. Operand 484547 states and 852577 transitions. [2019-10-02 12:00:51,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-10-02 12:00:51,013 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:00:51,014 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:00:51,014 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:00:51,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:00:51,014 INFO L82 PathProgramCache]: Analyzing trace with hash -110719519, now seen corresponding path program 1 times [2019-10-02 12:00:51,014 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:00:51,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:00:51,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:51,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:00:51,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:52,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:00:52,225 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-10-02 12:00:52,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:00:52,225 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:00:52,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:00:52,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:00:52,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 2998 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:00:52,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:00:52,798 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:00:52,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:00:52,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2019-10-02 12:00:52,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:00:52,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:00:52,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:00:52,810 INFO L87 Difference]: Start difference. First operand 484547 states and 852577 transitions. Second operand 9 states. [2019-10-02 12:01:48,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:01:48,901 INFO L93 Difference]: Finished difference Result 980237 states and 1803318 transitions. [2019-10-02 12:01:48,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:01:48,902 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 203 [2019-10-02 12:01:48,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:01:54,163 INFO L225 Difference]: With dead ends: 980237 [2019-10-02 12:01:54,163 INFO L226 Difference]: Without dead ends: 495747 [2019-10-02 12:02:10,681 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:02:11,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495747 states.