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_spec9_product32.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 04:25:46,177 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 04:25:46,179 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 04:25:46,191 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 04:25:46,192 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 04:25:46,193 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 04:25:46,194 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 04:25:46,196 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 04:25:46,197 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 04:25:46,198 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 04:25:46,199 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 04:25:46,200 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 04:25:46,201 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 04:25:46,201 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 04:25:46,202 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 04:25:46,203 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 04:25:46,204 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 04:25:46,205 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 04:25:46,207 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 04:25:46,209 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 04:25:46,210 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 04:25:46,211 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 04:25:46,212 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 04:25:46,213 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 04:25:46,215 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 04:25:46,216 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 04:25:46,216 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 04:25:46,217 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 04:25:46,217 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 04:25:46,218 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 04:25:46,218 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 04:25:46,219 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 04:25:46,220 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 04:25:46,221 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 04:25:46,222 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 04:25:46,222 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 04:25:46,222 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 04:25:46,223 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 04:25:46,223 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 04:25:46,224 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 04:25:46,224 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 04:25:46,225 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-09-08 04:25:46,240 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 04:25:46,241 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 04:25:46,242 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 04:25:46,242 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 04:25:46,242 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 04:25:46,242 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 04:25:46,243 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 04:25:46,243 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 04:25:46,243 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 04:25:46,243 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 04:25:46,243 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 04:25:46,244 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 04:25:46,244 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 04:25:46,244 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 04:25:46,244 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 04:25:46,244 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 04:25:46,245 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 04:25:46,245 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 04:25:46,245 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 04:25:46,245 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 04:25:46,245 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 04:25:46,246 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 04:25:46,246 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 04:25:46,246 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 04:25:46,246 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 04:25:46,246 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 04:25:46,247 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 04:25:46,247 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 04:25:46,247 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 04:25:46,275 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 04:25:46,286 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 04:25:46,290 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 04:25:46,291 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 04:25:46,292 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 04:25:46,292 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec9_product32.cil.c [2019-09-08 04:25:46,353 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b4f7c8f9/0e690c25faf14a4d8343f96ef0e8230e/FLAGb1406c280 [2019-09-08 04:25:47,032 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 04:25:47,033 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec9_product32.cil.c [2019-09-08 04:25:47,059 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b4f7c8f9/0e690c25faf14a4d8343f96ef0e8230e/FLAGb1406c280 [2019-09-08 04:25:47,245 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b4f7c8f9/0e690c25faf14a4d8343f96ef0e8230e [2019-09-08 04:25:47,261 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 04:25:47,263 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 04:25:47,267 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 04:25:47,268 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 04:25:47,272 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 04:25:47,274 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:25:47" (1/1) ... [2019-09-08 04:25:47,277 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66a328d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:25:47, skipping insertion in model container [2019-09-08 04:25:47,278 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:25:47" (1/1) ... [2019-09-08 04:25:47,287 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 04:25:47,391 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 04:25:48,132 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:25:48,148 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 04:25:48,253 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:25:48,334 INFO L192 MainTranslator]: Completed translation [2019-09-08 04:25:48,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:25:48 WrapperNode [2019-09-08 04:25:48,334 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 04:25:48,335 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 04:25:48,335 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 04:25:48,335 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 04:25:48,349 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:25:48" (1/1) ... [2019-09-08 04:25:48,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:25:48" (1/1) ... [2019-09-08 04:25:48,382 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:25:48" (1/1) ... [2019-09-08 04:25:48,382 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:25:48" (1/1) ... [2019-09-08 04:25:48,457 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:25:48" (1/1) ... [2019-09-08 04:25:48,497 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:25:48" (1/1) ... [2019-09-08 04:25:48,508 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:25:48" (1/1) ... [2019-09-08 04:25:48,534 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 04:25:48,535 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 04:25:48,535 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 04:25:48,535 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 04:25:48,536 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:25:48" (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-09-08 04:25:48,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 04:25:48,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 04:25:48,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 04:25:48,608 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-09-08 04:25:48,608 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-09-08 04:25:48,608 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-09-08 04:25:48,608 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-09-08 04:25:48,609 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-09-08 04:25:48,609 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-09-08 04:25:48,609 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-09-08 04:25:48,609 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-09-08 04:25:48,610 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 04:25:48,610 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 04:25:48,610 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__1 [2019-09-08 04:25:48,610 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__2 [2019-09-08 04:25:48,610 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__3 [2019-09-08 04:25:48,611 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__4 [2019-09-08 04:25:48,611 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-09-08 04:25:48,611 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-09-08 04:25:48,611 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-09-08 04:25:48,612 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-09-08 04:25:48,612 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-09-08 04:25:48,613 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-09-08 04:25:48,613 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-09-08 04:25:48,613 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-09-08 04:25:48,614 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-09-08 04:25:48,614 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-09-08 04:25:48,614 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-09-08 04:25:48,614 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-09-08 04:25:48,614 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-09-08 04:25:48,614 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-09-08 04:25:48,615 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-09-08 04:25:48,615 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-09-08 04:25:48,615 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-09-08 04:25:48,615 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-09-08 04:25:48,615 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-09-08 04:25:48,616 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-09-08 04:25:48,616 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-09-08 04:25:48,616 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-09-08 04:25:48,616 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-09-08 04:25:48,616 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-09-08 04:25:48,617 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-09-08 04:25:48,617 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-09-08 04:25:48,617 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-09-08 04:25:48,618 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2019-09-08 04:25:48,618 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-09-08 04:25:48,618 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__executivefloor [2019-09-08 04:25:48,618 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-09-08 04:25:48,618 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-09-08 04:25:48,619 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-09-08 04:25:48,619 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-09-08 04:25:48,619 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 04:25:48,619 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 04:25:48,620 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 04:25:48,620 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 04:25:48,620 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 04:25:48,620 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 04:25:48,621 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 04:25:48,621 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 04:25:48,621 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 04:25:48,621 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 04:25:48,622 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-09-08 04:25:48,622 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-09-08 04:25:48,622 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-09-08 04:25:48,622 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-09-08 04:25:48,623 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-09-08 04:25:48,623 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-09-08 04:25:48,624 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-09-08 04:25:48,624 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-09-08 04:25:48,624 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-09-08 04:25:48,625 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-09-08 04:25:48,625 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-09-08 04:25:48,625 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-09-08 04:25:48,625 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-09-08 04:25:48,627 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-09-08 04:25:48,627 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 04:25:48,627 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-09-08 04:25:48,627 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 04:25:48,627 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-09-08 04:25:48,628 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-09-08 04:25:48,628 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-09-08 04:25:48,628 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-09-08 04:25:48,629 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-09-08 04:25:48,629 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 04:25:48,630 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 04:25:48,630 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-09-08 04:25:48,630 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-09-08 04:25:48,631 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-09-08 04:25:48,631 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-09-08 04:25:48,631 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-09-08 04:25:48,632 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-09-08 04:25:48,632 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-09-08 04:25:48,633 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-09-08 04:25:48,633 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 04:25:48,633 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-09-08 04:25:48,633 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-09-08 04:25:48,634 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 04:25:48,634 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-09-08 04:25:48,634 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-09-08 04:25:48,634 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-09-08 04:25:48,634 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__1 [2019-09-08 04:25:48,634 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__2 [2019-09-08 04:25:48,634 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__3 [2019-09-08 04:25:48,635 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__4 [2019-09-08 04:25:48,635 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 04:25:48,635 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-09-08 04:25:48,635 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-09-08 04:25:48,635 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-09-08 04:25:48,635 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-09-08 04:25:48,635 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-09-08 04:25:48,636 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-09-08 04:25:48,636 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-09-08 04:25:48,636 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-09-08 04:25:48,636 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-09-08 04:25:48,636 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-09-08 04:25:48,637 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-09-08 04:25:48,637 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-09-08 04:25:48,638 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-09-08 04:25:48,638 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-09-08 04:25:48,638 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-09-08 04:25:48,639 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-09-08 04:25:48,639 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-09-08 04:25:48,639 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-09-08 04:25:48,640 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-09-08 04:25:48,641 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-09-08 04:25:48,641 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-09-08 04:25:48,642 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-09-08 04:25:48,642 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-09-08 04:25:48,642 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-09-08 04:25:48,642 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-09-08 04:25:48,642 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-09-08 04:25:48,643 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-09-08 04:25:48,643 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-09-08 04:25:48,643 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-09-08 04:25:48,643 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-09-08 04:25:48,644 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2019-09-08 04:25:48,644 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__executivefloor [2019-09-08 04:25:48,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 04:25:48,644 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-09-08 04:25:48,645 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 04:25:48,649 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 04:25:48,649 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 04:25:48,649 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 04:25:48,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 04:25:48,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 04:25:48,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 04:25:48,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 04:25:48,660 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 04:25:48,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 04:25:48,660 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 04:25:48,661 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 04:25:48,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 04:25:48,661 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 04:25:48,661 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 04:25:48,662 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 04:25:48,662 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 04:25:48,662 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 04:25:48,662 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 04:25:48,662 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 04:25:48,662 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-08 04:25:48,662 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-09-08 04:25:48,663 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-09-08 04:25:48,663 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-09-08 04:25:48,663 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-09-08 04:25:48,663 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-09-08 04:25:48,663 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-09-08 04:25:48,663 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-09-08 04:25:48,663 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-09-08 04:25:48,664 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-09-08 04:25:48,664 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-09-08 04:25:48,664 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-09-08 04:25:48,664 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-09-08 04:25:48,664 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-09-08 04:25:48,664 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 04:25:48,664 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-09-08 04:25:48,664 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 04:25:48,665 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-09-08 04:25:48,665 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-09-08 04:25:48,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 04:25:48,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 04:25:48,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 04:25:51,323 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 04:25:51,323 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-09-08 04:25:51,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:25:51 BoogieIcfgContainer [2019-09-08 04:25:51,326 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 04:25:51,327 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 04:25:51,327 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 04:25:51,330 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 04:25:51,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 04:25:47" (1/3) ... [2019-09-08 04:25:51,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@962e3d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:25:51, skipping insertion in model container [2019-09-08 04:25:51,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:25:48" (2/3) ... [2019-09-08 04:25:51,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@962e3d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:25:51, skipping insertion in model container [2019-09-08 04:25:51,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:25:51" (3/3) ... [2019-09-08 04:25:51,334 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product32.cil.c [2019-09-08 04:25:51,344 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 04:25:51,355 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 04:25:51,373 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 04:25:51,421 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 04:25:51,422 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 04:25:51,422 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 04:25:51,422 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 04:25:51,422 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 04:25:51,422 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 04:25:51,423 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 04:25:51,423 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 04:25:51,423 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 04:25:51,469 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states. [2019-09-08 04:25:51,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 04:25:51,489 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:25:51,491 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 04:25:51,493 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:25:51,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:25:51,502 INFO L82 PathProgramCache]: Analyzing trace with hash 165755889, now seen corresponding path program 1 times [2019-09-08 04:25:51,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:25:51,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:25:51,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:51,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:25:51,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:51,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:25:52,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:25:52,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:25:52,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:25:52,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:25:52,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:25:52,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:25:52,195 INFO L87 Difference]: Start difference. First operand 824 states. Second operand 4 states. [2019-09-08 04:25:52,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:25:52,438 INFO L93 Difference]: Finished difference Result 1297 states and 2071 transitions. [2019-09-08 04:25:52,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:25:52,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-09-08 04:25:52,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:25:52,479 INFO L225 Difference]: With dead ends: 1297 [2019-09-08 04:25:52,479 INFO L226 Difference]: Without dead ends: 657 [2019-09-08 04:25:52,493 INFO L628 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-09-08 04:25:52,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-09-08 04:25:52,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2019-09-08 04:25:52,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-09-08 04:25:52,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1037 transitions. [2019-09-08 04:25:52,643 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1037 transitions. Word has length 87 [2019-09-08 04:25:52,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:25:52,643 INFO L475 AbstractCegarLoop]: Abstraction has 657 states and 1037 transitions. [2019-09-08 04:25:52,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:25:52,644 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1037 transitions. [2019-09-08 04:25:52,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 04:25:52,660 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:25:52,661 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 04:25:52,661 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:25:52,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:25:52,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1802747224, now seen corresponding path program 1 times [2019-09-08 04:25:52,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:25:52,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:25:52,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:52,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:25:52,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:52,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:25:52,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:25:52,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:25:52,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:25:52,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:25:52,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:25:52,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:25:52,899 INFO L87 Difference]: Start difference. First operand 657 states and 1037 transitions. Second operand 4 states. [2019-09-08 04:25:52,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:25:52,995 INFO L93 Difference]: Finished difference Result 1277 states and 2032 transitions. [2019-09-08 04:25:52,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:25:52,996 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-09-08 04:25:52,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:25:53,011 INFO L225 Difference]: With dead ends: 1277 [2019-09-08 04:25:53,011 INFO L226 Difference]: Without dead ends: 657 [2019-09-08 04:25:53,016 INFO L628 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-09-08 04:25:53,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-09-08 04:25:53,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2019-09-08 04:25:53,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-09-08 04:25:53,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1036 transitions. [2019-09-08 04:25:53,064 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1036 transitions. Word has length 90 [2019-09-08 04:25:53,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:25:53,065 INFO L475 AbstractCegarLoop]: Abstraction has 657 states and 1036 transitions. [2019-09-08 04:25:53,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:25:53,065 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1036 transitions. [2019-09-08 04:25:53,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 04:25:53,068 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:25:53,069 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 04:25:53,069 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:25:53,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:25:53,070 INFO L82 PathProgramCache]: Analyzing trace with hash 464088220, now seen corresponding path program 1 times [2019-09-08 04:25:53,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:25:53,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:25:53,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:53,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:25:53,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:53,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:25:53,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:25:53,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:25:53,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:25:53,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:25:53,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:25:53,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:25:53,329 INFO L87 Difference]: Start difference. First operand 657 states and 1036 transitions. Second operand 4 states. [2019-09-08 04:25:53,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:25:53,415 INFO L93 Difference]: Finished difference Result 1277 states and 2031 transitions. [2019-09-08 04:25:53,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:25:53,416 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-09-08 04:25:53,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:25:53,427 INFO L225 Difference]: With dead ends: 1277 [2019-09-08 04:25:53,428 INFO L226 Difference]: Without dead ends: 657 [2019-09-08 04:25:53,435 INFO L628 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-09-08 04:25:53,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-09-08 04:25:53,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2019-09-08 04:25:53,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-09-08 04:25:53,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1035 transitions. [2019-09-08 04:25:53,467 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1035 transitions. Word has length 91 [2019-09-08 04:25:53,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:25:53,468 INFO L475 AbstractCegarLoop]: Abstraction has 657 states and 1035 transitions. [2019-09-08 04:25:53,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:25:53,468 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1035 transitions. [2019-09-08 04:25:53,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 04:25:53,470 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:25:53,471 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 04:25:53,471 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:25:53,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:25:53,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1512177068, now seen corresponding path program 1 times [2019-09-08 04:25:53,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:25:53,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:25:53,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:53,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:25:53,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:53,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:25:53,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:25:53,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:25:53,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:25:53,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:25:53,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:25:53,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:25:53,626 INFO L87 Difference]: Start difference. First operand 657 states and 1035 transitions. Second operand 4 states. [2019-09-08 04:25:53,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:25:53,685 INFO L93 Difference]: Finished difference Result 1277 states and 2030 transitions. [2019-09-08 04:25:53,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:25:53,685 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-09-08 04:25:53,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:25:53,691 INFO L225 Difference]: With dead ends: 1277 [2019-09-08 04:25:53,691 INFO L226 Difference]: Without dead ends: 657 [2019-09-08 04:25:53,695 INFO L628 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-09-08 04:25:53,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-09-08 04:25:53,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2019-09-08 04:25:53,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-09-08 04:25:53,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1034 transitions. [2019-09-08 04:25:53,721 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1034 transitions. Word has length 92 [2019-09-08 04:25:53,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:25:53,721 INFO L475 AbstractCegarLoop]: Abstraction has 657 states and 1034 transitions. [2019-09-08 04:25:53,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:25:53,721 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1034 transitions. [2019-09-08 04:25:53,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 04:25:53,723 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:25:53,723 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 04:25:53,724 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:25:53,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:25:53,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1779400680, now seen corresponding path program 1 times [2019-09-08 04:25:53,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:25:53,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:25:53,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:53,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:25:53,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:53,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:25:53,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:25:53,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:25:53,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:25:53,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:25:53,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:25:53,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:25:53,862 INFO L87 Difference]: Start difference. First operand 657 states and 1034 transitions. Second operand 4 states. [2019-09-08 04:25:53,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:25:53,923 INFO L93 Difference]: Finished difference Result 1277 states and 2029 transitions. [2019-09-08 04:25:53,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:25:53,924 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-09-08 04:25:53,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:25:53,932 INFO L225 Difference]: With dead ends: 1277 [2019-09-08 04:25:53,933 INFO L226 Difference]: Without dead ends: 657 [2019-09-08 04:25:53,937 INFO L628 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-09-08 04:25:53,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-09-08 04:25:53,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2019-09-08 04:25:53,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-09-08 04:25:53,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1033 transitions. [2019-09-08 04:25:53,969 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1033 transitions. Word has length 93 [2019-09-08 04:25:53,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:25:53,970 INFO L475 AbstractCegarLoop]: Abstraction has 657 states and 1033 transitions. [2019-09-08 04:25:53,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:25:53,970 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1033 transitions. [2019-09-08 04:25:53,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 04:25:53,973 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:25:53,973 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 04:25:53,973 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:25:53,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:25:53,974 INFO L82 PathProgramCache]: Analyzing trace with hash -605939888, now seen corresponding path program 1 times [2019-09-08 04:25:53,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:25:53,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:25:53,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:53,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:25:53,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:54,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:25:54,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:25:54,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:25:54,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 04:25:54,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 04:25:54,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 04:25:54,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 04:25:54,358 INFO L87 Difference]: Start difference. First operand 657 states and 1033 transitions. Second operand 10 states. [2019-09-08 04:25:54,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:25:54,607 INFO L93 Difference]: Finished difference Result 1235 states and 1949 transitions. [2019-09-08 04:25:54,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:25:54,608 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2019-09-08 04:25:54,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:25:54,613 INFO L225 Difference]: With dead ends: 1235 [2019-09-08 04:25:54,613 INFO L226 Difference]: Without dead ends: 666 [2019-09-08 04:25:54,617 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-08 04:25:54,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2019-09-08 04:25:54,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 664. [2019-09-08 04:25:54,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2019-09-08 04:25:54,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 1042 transitions. [2019-09-08 04:25:54,659 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 1042 transitions. Word has length 94 [2019-09-08 04:25:54,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:25:54,660 INFO L475 AbstractCegarLoop]: Abstraction has 664 states and 1042 transitions. [2019-09-08 04:25:54,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 04:25:54,660 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 1042 transitions. [2019-09-08 04:25:54,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 04:25:54,665 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:25:54,665 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 04:25:54,665 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:25:54,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:25:54,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1758408303, now seen corresponding path program 1 times [2019-09-08 04:25:54,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:25:54,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:25:54,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:54,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:25:54,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:54,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:25:54,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:25:54,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:25:54,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:25:54,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:25:54,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:25:54,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:25:54,779 INFO L87 Difference]: Start difference. First operand 664 states and 1042 transitions. Second operand 4 states. [2019-09-08 04:25:54,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:25:54,839 INFO L93 Difference]: Finished difference Result 1283 states and 2035 transitions. [2019-09-08 04:25:54,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:25:54,840 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-09-08 04:25:54,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:25:54,846 INFO L225 Difference]: With dead ends: 1283 [2019-09-08 04:25:54,846 INFO L226 Difference]: Without dead ends: 651 [2019-09-08 04:25:54,850 INFO L628 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-09-08 04:25:54,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-09-08 04:25:54,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2019-09-08 04:25:54,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-09-08 04:25:54,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1019 transitions. [2019-09-08 04:25:54,874 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1019 transitions. Word has length 94 [2019-09-08 04:25:54,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:25:54,875 INFO L475 AbstractCegarLoop]: Abstraction has 651 states and 1019 transitions. [2019-09-08 04:25:54,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:25:54,875 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1019 transitions. [2019-09-08 04:25:54,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 04:25:54,876 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:25:54,877 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 04:25:54,877 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:25:54,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:25:54,877 INFO L82 PathProgramCache]: Analyzing trace with hash -795855418, now seen corresponding path program 1 times [2019-09-08 04:25:54,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:25:54,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:25:54,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:54,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:25:54,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:54,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:25:54,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:25:54,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:25:54,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:25:54,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:25:54,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:25:54,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:25:54,999 INFO L87 Difference]: Start difference. First operand 651 states and 1019 transitions. Second operand 6 states. [2019-09-08 04:25:55,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:25:55,293 INFO L93 Difference]: Finished difference Result 1223 states and 1927 transitions. [2019-09-08 04:25:55,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:25:55,294 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-09-08 04:25:55,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:25:55,299 INFO L225 Difference]: With dead ends: 1223 [2019-09-08 04:25:55,299 INFO L226 Difference]: Without dead ends: 651 [2019-09-08 04:25:55,303 INFO L628 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-09-08 04:25:55,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-09-08 04:25:55,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2019-09-08 04:25:55,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-09-08 04:25:55,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1015 transitions. [2019-09-08 04:25:55,328 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1015 transitions. Word has length 95 [2019-09-08 04:25:55,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:25:55,330 INFO L475 AbstractCegarLoop]: Abstraction has 651 states and 1015 transitions. [2019-09-08 04:25:55,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:25:55,330 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1015 transitions. [2019-09-08 04:25:55,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 04:25:55,332 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:25:55,332 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 04:25:55,333 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:25:55,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:25:55,333 INFO L82 PathProgramCache]: Analyzing trace with hash 26339251, now seen corresponding path program 1 times [2019-09-08 04:25:55,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:25:55,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:25:55,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:55,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:25:55,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:55,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:25:55,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:25:55,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:25:55,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:25:55,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:25:55,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:25:55,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:25:55,513 INFO L87 Difference]: Start difference. First operand 651 states and 1015 transitions. Second operand 6 states. [2019-09-08 04:25:55,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:25:55,726 INFO L93 Difference]: Finished difference Result 1223 states and 1923 transitions. [2019-09-08 04:25:55,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:25:55,727 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-09-08 04:25:55,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:25:55,732 INFO L225 Difference]: With dead ends: 1223 [2019-09-08 04:25:55,732 INFO L226 Difference]: Without dead ends: 651 [2019-09-08 04:25:55,736 INFO L628 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-09-08 04:25:55,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-09-08 04:25:55,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2019-09-08 04:25:55,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-09-08 04:25:55,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1011 transitions. [2019-09-08 04:25:55,759 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1011 transitions. Word has length 96 [2019-09-08 04:25:55,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:25:55,760 INFO L475 AbstractCegarLoop]: Abstraction has 651 states and 1011 transitions. [2019-09-08 04:25:55,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:25:55,760 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1011 transitions. [2019-09-08 04:25:55,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 04:25:55,762 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:25:55,762 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 04:25:55,762 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:25:55,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:25:55,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1115555883, now seen corresponding path program 1 times [2019-09-08 04:25:55,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:25:55,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:25:55,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:55,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:25:55,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:55,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:25:55,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:25:55,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:25:55,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:25:55,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:25:55,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:25:55,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:25:55,881 INFO L87 Difference]: Start difference. First operand 651 states and 1011 transitions. Second operand 6 states. [2019-09-08 04:25:56,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:25:56,095 INFO L93 Difference]: Finished difference Result 1223 states and 1919 transitions. [2019-09-08 04:25:56,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:25:56,096 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-09-08 04:25:56,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:25:56,101 INFO L225 Difference]: With dead ends: 1223 [2019-09-08 04:25:56,102 INFO L226 Difference]: Without dead ends: 651 [2019-09-08 04:25:56,105 INFO L628 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-09-08 04:25:56,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-09-08 04:25:56,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2019-09-08 04:25:56,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-09-08 04:25:56,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1007 transitions. [2019-09-08 04:25:56,129 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1007 transitions. Word has length 97 [2019-09-08 04:25:56,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:25:56,129 INFO L475 AbstractCegarLoop]: Abstraction has 651 states and 1007 transitions. [2019-09-08 04:25:56,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:25:56,130 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1007 transitions. [2019-09-08 04:25:56,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 04:25:56,132 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:25:56,132 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 04:25:56,132 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:25:56,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:25:56,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1213864789, now seen corresponding path program 1 times [2019-09-08 04:25:56,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:25:56,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:25:56,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:56,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:25:56,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:56,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:25:56,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:25:56,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:25:56,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:25:56,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:25:56,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:25:56,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:25:56,261 INFO L87 Difference]: Start difference. First operand 651 states and 1007 transitions. Second operand 7 states. [2019-09-08 04:25:56,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:25:56,349 INFO L93 Difference]: Finished difference Result 1223 states and 1915 transitions. [2019-09-08 04:25:56,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:25:56,350 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-09-08 04:25:56,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:25:56,355 INFO L225 Difference]: With dead ends: 1223 [2019-09-08 04:25:56,355 INFO L226 Difference]: Without dead ends: 630 [2019-09-08 04:25:56,359 INFO L628 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-09-08 04:25:56,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-09-08 04:25:56,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2019-09-08 04:25:56,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-09-08 04:25:56,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 973 transitions. [2019-09-08 04:25:56,381 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 973 transitions. Word has length 97 [2019-09-08 04:25:56,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:25:56,381 INFO L475 AbstractCegarLoop]: Abstraction has 630 states and 973 transitions. [2019-09-08 04:25:56,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:25:56,381 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 973 transitions. [2019-09-08 04:25:56,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 04:25:56,383 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:25:56,383 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 04:25:56,383 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:25:56,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:25:56,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1892518776, now seen corresponding path program 1 times [2019-09-08 04:25:56,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:25:56,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:25:56,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:56,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:25:56,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:56,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:25:56,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:25:56,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:25:56,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:25:56,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:25:56,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:25:56,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:25:56,552 INFO L87 Difference]: Start difference. First operand 630 states and 973 transitions. Second operand 6 states. [2019-09-08 04:25:56,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:25:56,647 INFO L93 Difference]: Finished difference Result 1202 states and 1881 transitions. [2019-09-08 04:25:56,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:25:56,647 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-09-08 04:25:56,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:25:56,652 INFO L225 Difference]: With dead ends: 1202 [2019-09-08 04:25:56,652 INFO L226 Difference]: Without dead ends: 630 [2019-09-08 04:25:56,655 INFO L628 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-09-08 04:25:56,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-09-08 04:25:56,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2019-09-08 04:25:56,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-09-08 04:25:56,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 972 transitions. [2019-09-08 04:25:56,676 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 972 transitions. Word has length 98 [2019-09-08 04:25:56,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:25:56,676 INFO L475 AbstractCegarLoop]: Abstraction has 630 states and 972 transitions. [2019-09-08 04:25:56,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:25:56,676 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 972 transitions. [2019-09-08 04:25:56,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 04:25:56,678 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:25:56,678 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 04:25:56,678 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:25:56,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:25:56,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1579550352, now seen corresponding path program 1 times [2019-09-08 04:25:56,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:25:56,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:25:56,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:56,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:25:56,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:56,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:25:56,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:25:56,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:25:56,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:25:56,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:25:56,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:25:56,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:25:56,801 INFO L87 Difference]: Start difference. First operand 630 states and 972 transitions. Second operand 6 states. [2019-09-08 04:25:56,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:25:56,897 INFO L93 Difference]: Finished difference Result 1202 states and 1880 transitions. [2019-09-08 04:25:56,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:25:56,897 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-09-08 04:25:56,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:25:56,902 INFO L225 Difference]: With dead ends: 1202 [2019-09-08 04:25:56,902 INFO L226 Difference]: Without dead ends: 630 [2019-09-08 04:25:56,905 INFO L628 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-09-08 04:25:56,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-09-08 04:25:56,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2019-09-08 04:25:56,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-09-08 04:25:56,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 971 transitions. [2019-09-08 04:25:56,929 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 971 transitions. Word has length 99 [2019-09-08 04:25:56,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:25:56,930 INFO L475 AbstractCegarLoop]: Abstraction has 630 states and 971 transitions. [2019-09-08 04:25:56,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:25:56,930 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 971 transitions. [2019-09-08 04:25:56,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 04:25:56,931 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:25:56,932 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 04:25:56,932 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:25:56,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:25:56,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1838449469, now seen corresponding path program 1 times [2019-09-08 04:25:56,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:25:56,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:25:56,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:56,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:25:56,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:56,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:25:57,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:25:57,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:25:57,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 04:25:57,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 04:25:57,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 04:25:57,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:25:57,110 INFO L87 Difference]: Start difference. First operand 630 states and 971 transitions. Second operand 12 states. [2019-09-08 04:25:57,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:25:57,287 INFO L93 Difference]: Finished difference Result 1203 states and 1879 transitions. [2019-09-08 04:25:57,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 04:25:57,288 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 100 [2019-09-08 04:25:57,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:25:57,293 INFO L225 Difference]: With dead ends: 1203 [2019-09-08 04:25:57,293 INFO L226 Difference]: Without dead ends: 630 [2019-09-08 04:25:57,297 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-08 04:25:57,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-09-08 04:25:57,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2019-09-08 04:25:57,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-09-08 04:25:57,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 970 transitions. [2019-09-08 04:25:57,319 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 970 transitions. Word has length 100 [2019-09-08 04:25:57,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:25:57,319 INFO L475 AbstractCegarLoop]: Abstraction has 630 states and 970 transitions. [2019-09-08 04:25:57,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 04:25:57,319 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 970 transitions. [2019-09-08 04:25:57,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 04:25:57,321 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:25:57,321 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 04:25:57,321 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:25:57,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:25:57,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1351924293, now seen corresponding path program 1 times [2019-09-08 04:25:57,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:25:57,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:25:57,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:57,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:25:57,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:57,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:25:57,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:25:57,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:25:57,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:25:57,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:25:57,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:25:57,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:25:57,567 INFO L87 Difference]: Start difference. First operand 630 states and 970 transitions. Second operand 6 states. [2019-09-08 04:26:01,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:26:01,693 INFO L93 Difference]: Finished difference Result 1863 states and 2953 transitions. [2019-09-08 04:26:01,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:26:01,694 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2019-09-08 04:26:01,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:26:01,708 INFO L225 Difference]: With dead ends: 1863 [2019-09-08 04:26:01,708 INFO L226 Difference]: Without dead ends: 1299 [2019-09-08 04:26:01,711 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:26:01,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1299 states. [2019-09-08 04:26:01,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1299 to 1172. [2019-09-08 04:26:01,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1172 states. [2019-09-08 04:26:01,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1850 transitions. [2019-09-08 04:26:01,767 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1850 transitions. Word has length 101 [2019-09-08 04:26:01,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:26:01,768 INFO L475 AbstractCegarLoop]: Abstraction has 1172 states and 1850 transitions. [2019-09-08 04:26:01,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:26:01,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1850 transitions. [2019-09-08 04:26:01,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-08 04:26:01,773 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:26:01,773 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:26:01,774 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:26:01,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:26:01,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1530865345, now seen corresponding path program 1 times [2019-09-08 04:26:01,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:26:01,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:26:01,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:26:01,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:26:01,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:26:01,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:26:01,990 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 04:26:01,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:26:01,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 04:26:01,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 04:26:01,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 04:26:01,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:26:01,998 INFO L87 Difference]: Start difference. First operand 1172 states and 1850 transitions. Second operand 12 states. [2019-09-08 04:26:14,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:26:14,577 INFO L93 Difference]: Finished difference Result 3848 states and 6081 transitions. [2019-09-08 04:26:14,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 04:26:14,578 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 159 [2019-09-08 04:26:14,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:26:14,603 INFO L225 Difference]: With dead ends: 3848 [2019-09-08 04:26:14,604 INFO L226 Difference]: Without dead ends: 2742 [2019-09-08 04:26:14,611 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2019-09-08 04:26:14,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2742 states. [2019-09-08 04:26:14,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2742 to 2684. [2019-09-08 04:26:14,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2684 states. [2019-09-08 04:26:14,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2684 states to 2684 states and 4196 transitions. [2019-09-08 04:26:14,825 INFO L78 Accepts]: Start accepts. Automaton has 2684 states and 4196 transitions. Word has length 159 [2019-09-08 04:26:14,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:26:14,825 INFO L475 AbstractCegarLoop]: Abstraction has 2684 states and 4196 transitions. [2019-09-08 04:26:14,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 04:26:14,825 INFO L276 IsEmpty]: Start isEmpty. Operand 2684 states and 4196 transitions. [2019-09-08 04:26:14,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-08 04:26:14,831 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:26:14,831 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:26:14,832 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:26:14,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:26:14,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1845349951, now seen corresponding path program 1 times [2019-09-08 04:26:14,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:26:14,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:26:14,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:26:14,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:26:14,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:26:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:26:15,121 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-08 04:26:15,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:26:15,122 INFO L223 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) [2019-09-08 04:26:15,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:26:15,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:26:15,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 3076 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 04:26:15,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:26:15,844 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 04:26:15,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:26:15,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2019-09-08 04:26:15,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 04:26:15,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 04:26:15,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:26:15,865 INFO L87 Difference]: Start difference. First operand 2684 states and 4196 transitions. Second operand 12 states. [2019-09-08 04:26:24,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:26:24,432 INFO L93 Difference]: Finished difference Result 6842 states and 11003 transitions. [2019-09-08 04:26:24,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 04:26:24,433 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 160 [2019-09-08 04:26:24,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:26:24,465 INFO L225 Difference]: With dead ends: 6842 [2019-09-08 04:26:24,465 INFO L226 Difference]: Without dead ends: 4224 [2019-09-08 04:26:24,480 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600 [2019-09-08 04:26:24,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4224 states. [2019-09-08 04:26:24,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4224 to 4189. [2019-09-08 04:26:24,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4189 states. [2019-09-08 04:26:24,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4189 states to 4189 states and 6681 transitions. [2019-09-08 04:26:24,710 INFO L78 Accepts]: Start accepts. Automaton has 4189 states and 6681 transitions. Word has length 160 [2019-09-08 04:26:24,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:26:24,711 INFO L475 AbstractCegarLoop]: Abstraction has 4189 states and 6681 transitions. [2019-09-08 04:26:24,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 04:26:24,711 INFO L276 IsEmpty]: Start isEmpty. Operand 4189 states and 6681 transitions. [2019-09-08 04:26:24,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-08 04:26:24,718 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:26:24,718 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-09-08 04:26:24,718 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:26:24,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:26:24,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1677346838, now seen corresponding path program 1 times [2019-09-08 04:26:24,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:26:24,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:26:24,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:26:24,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:26:24,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:26:24,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:26:25,007 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 04:26:25,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:26:25,007 INFO L223 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) [2019-09-08 04:26:25,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:26:25,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:26:25,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 3079 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 04:26:25,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:26:25,689 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 04:26:25,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:26:25,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [13] total 14 [2019-09-08 04:26:25,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 04:26:25,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 04:26:25,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-08 04:26:25,703 INFO L87 Difference]: Start difference. First operand 4189 states and 6681 transitions. Second operand 14 states. [2019-09-08 04:27:14,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:27:14,019 INFO L93 Difference]: Finished difference Result 48156 states and 83151 transitions. [2019-09-08 04:27:14,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2019-09-08 04:27:14,020 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 162 [2019-09-08 04:27:14,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:27:14,210 INFO L225 Difference]: With dead ends: 48156 [2019-09-08 04:27:14,210 INFO L226 Difference]: Without dead ends: 25727 [2019-09-08 04:27:14,348 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8066 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1917, Invalid=17823, Unknown=0, NotChecked=0, Total=19740 [2019-09-08 04:27:14,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25727 states. [2019-09-08 04:27:15,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25727 to 25017. [2019-09-08 04:27:15,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25017 states. [2019-09-08 04:27:17,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25017 states to 25017 states and 40139 transitions. [2019-09-08 04:27:17,357 INFO L78 Accepts]: Start accepts. Automaton has 25017 states and 40139 transitions. Word has length 162 [2019-09-08 04:27:17,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:27:17,358 INFO L475 AbstractCegarLoop]: Abstraction has 25017 states and 40139 transitions. [2019-09-08 04:27:17,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 04:27:17,358 INFO L276 IsEmpty]: Start isEmpty. Operand 25017 states and 40139 transitions. [2019-09-08 04:27:17,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-08 04:27:17,364 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:27:17,365 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:27:17,365 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:27:17,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:27:17,366 INFO L82 PathProgramCache]: Analyzing trace with hash -335151049, now seen corresponding path program 1 times [2019-09-08 04:27:17,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:27:17,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:27:17,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:27:17,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:27:17,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:27:17,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:27:17,548 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 04:27:17,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:27:17,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:27:17,550 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:27:17,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:27:17,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:27:17,550 INFO L87 Difference]: Start difference. First operand 25017 states and 40139 transitions. Second operand 6 states. [2019-09-08 04:27:18,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:27:18,967 INFO L93 Difference]: Finished difference Result 50518 states and 83594 transitions. [2019-09-08 04:27:18,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:27:18,968 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 164 [2019-09-08 04:27:18,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:27:19,189 INFO L225 Difference]: With dead ends: 50518 [2019-09-08 04:27:19,190 INFO L226 Difference]: Without dead ends: 25567 [2019-09-08 04:27:19,323 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:27:19,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25567 states. [2019-09-08 04:27:20,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25567 to 25567. [2019-09-08 04:27:20,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25567 states. [2019-09-08 04:27:21,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25567 states to 25567 states and 40564 transitions. [2019-09-08 04:27:21,141 INFO L78 Accepts]: Start accepts. Automaton has 25567 states and 40564 transitions. Word has length 164 [2019-09-08 04:27:21,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:27:21,143 INFO L475 AbstractCegarLoop]: Abstraction has 25567 states and 40564 transitions. [2019-09-08 04:27:21,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:27:21,143 INFO L276 IsEmpty]: Start isEmpty. Operand 25567 states and 40564 transitions. [2019-09-08 04:27:21,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-08 04:27:21,153 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:27:21,153 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:27:21,153 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:27:21,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:27:21,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1673278401, now seen corresponding path program 1 times [2019-09-08 04:27:21,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:27:21,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:27:21,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:27:21,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:27:21,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:27:21,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:27:21,366 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-08 04:27:21,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:27:21,366 INFO L223 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) [2019-09-08 04:27:21,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:27:21,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:27:21,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 3084 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 04:27:21,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:27:23,166 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-08 04:27:23,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:27:23,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2019-09-08 04:27:23,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 04:27:23,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 04:27:23,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:27:23,174 INFO L87 Difference]: Start difference. First operand 25567 states and 40564 transitions. Second operand 12 states. [2019-09-08 04:27:41,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:27:41,854 INFO L93 Difference]: Finished difference Result 124930 states and 213468 transitions. [2019-09-08 04:27:41,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 04:27:41,855 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 166 [2019-09-08 04:27:41,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:27:42,410 INFO L225 Difference]: With dead ends: 124930 [2019-09-08 04:27:42,410 INFO L226 Difference]: Without dead ends: 99429 [2019-09-08 04:27:42,501 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=234, Invalid=1326, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 04:27:42,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99429 states. [2019-09-08 04:27:46,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99429 to 97029. [2019-09-08 04:27:46,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97029 states. [2019-09-08 04:27:47,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97029 states to 97029 states and 163187 transitions. [2019-09-08 04:27:47,396 INFO L78 Accepts]: Start accepts. Automaton has 97029 states and 163187 transitions. Word has length 166 [2019-09-08 04:27:47,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:27:47,397 INFO L475 AbstractCegarLoop]: Abstraction has 97029 states and 163187 transitions. [2019-09-08 04:27:47,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 04:27:47,397 INFO L276 IsEmpty]: Start isEmpty. Operand 97029 states and 163187 transitions. [2019-09-08 04:27:47,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-08 04:27:47,412 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:27:47,412 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:27:47,413 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:27:47,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:27:47,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1308534504, now seen corresponding path program 1 times [2019-09-08 04:27:47,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:27:47,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:27:47,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:27:47,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:27:47,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:27:47,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:27:47,592 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-08 04:27:47,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:27:47,592 INFO L223 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) [2019-09-08 04:27:47,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:27:48,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:27:48,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 3087 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 04:27:48,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:27:48,110 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-08 04:27:48,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:27:48,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2019-09-08 04:27:48,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 04:27:48,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 04:27:48,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:27:48,127 INFO L87 Difference]: Start difference. First operand 97029 states and 163187 transitions. Second operand 12 states. [2019-09-08 04:28:18,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:28:18,571 INFO L93 Difference]: Finished difference Result 385548 states and 718371 transitions. [2019-09-08 04:28:18,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 04:28:18,571 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 168 [2019-09-08 04:28:18,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:28:19,977 INFO L225 Difference]: With dead ends: 385548 [2019-09-08 04:28:19,977 INFO L226 Difference]: Without dead ends: 288594 [2019-09-08 04:28:20,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=234, Invalid=1326, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 04:28:20,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288594 states. [2019-09-08 04:28:39,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288594 to 281107. [2019-09-08 04:28:39,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281107 states. [2019-09-08 04:28:41,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281107 states to 281107 states and 510108 transitions. [2019-09-08 04:28:41,193 INFO L78 Accepts]: Start accepts. Automaton has 281107 states and 510108 transitions. Word has length 168 [2019-09-08 04:28:41,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:28:41,193 INFO L475 AbstractCegarLoop]: Abstraction has 281107 states and 510108 transitions. [2019-09-08 04:28:41,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 04:28:41,194 INFO L276 IsEmpty]: Start isEmpty. Operand 281107 states and 510108 transitions. [2019-09-08 04:28:41,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-08 04:28:41,222 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:28:41,222 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:28:41,222 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:28:41,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:28:41,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1980407056, now seen corresponding path program 1 times [2019-09-08 04:28:41,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:28:41,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:28:41,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:28:41,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:28:41,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:28:41,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:28:41,372 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-08 04:28:41,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:28:41,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 04:28:41,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:28:41,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:28:41,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:28:41,374 INFO L87 Difference]: Start difference. First operand 281107 states and 510108 transitions. Second operand 9 states. [2019-09-08 04:28:53,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:28:53,494 INFO L93 Difference]: Finished difference Result 369999 states and 660024 transitions. [2019-09-08 04:28:53,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 04:28:53,495 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 169 [2019-09-08 04:28:53,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:28:53,903 INFO L225 Difference]: With dead ends: 369999 [2019-09-08 04:28:53,903 INFO L226 Difference]: Without dead ends: 88946 [2019-09-08 04:28:54,589 INFO L628 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-09-08 04:28:54,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88946 states. [2019-09-08 04:29:00,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88946 to 88946. [2019-09-08 04:29:00,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88946 states. [2019-09-08 04:29:00,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88946 states to 88946 states and 149971 transitions. [2019-09-08 04:29:00,616 INFO L78 Accepts]: Start accepts. Automaton has 88946 states and 149971 transitions. Word has length 169 [2019-09-08 04:29:00,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:29:00,617 INFO L475 AbstractCegarLoop]: Abstraction has 88946 states and 149971 transitions. [2019-09-08 04:29:00,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:29:00,617 INFO L276 IsEmpty]: Start isEmpty. Operand 88946 states and 149971 transitions. [2019-09-08 04:29:00,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-08 04:29:00,624 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:29:00,624 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:29:00,625 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:29:00,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:29:00,625 INFO L82 PathProgramCache]: Analyzing trace with hash 2029938087, now seen corresponding path program 1 times [2019-09-08 04:29:00,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:29:00,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:29:00,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:00,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:29:00,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:00,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:29:00,830 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-08 04:29:00,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:29:00,830 INFO L223 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-09-08 04:29:00,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:29:01,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:29:01,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 3090 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 04:29:01,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:29:01,389 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 04:29:01,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:29:01,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2019-09-08 04:29:01,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 04:29:01,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 04:29:01,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:29:01,401 INFO L87 Difference]: Start difference. First operand 88946 states and 149971 transitions. Second operand 12 states. [2019-09-08 04:29:17,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:29:17,437 INFO L93 Difference]: Finished difference Result 206382 states and 375433 transitions. [2019-09-08 04:29:17,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 04:29:17,437 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 170 [2019-09-08 04:29:17,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:29:18,092 INFO L225 Difference]: With dead ends: 206382 [2019-09-08 04:29:18,092 INFO L226 Difference]: Without dead ends: 117489 [2019-09-08 04:29:18,345 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600 [2019-09-08 04:29:18,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117489 states. [2019-09-08 04:29:24,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117489 to 113853. [2019-09-08 04:29:24,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113853 states. [2019-09-08 04:29:25,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113853 states to 113853 states and 200974 transitions. [2019-09-08 04:29:25,106 INFO L78 Accepts]: Start accepts. Automaton has 113853 states and 200974 transitions. Word has length 170 [2019-09-08 04:29:25,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:29:25,107 INFO L475 AbstractCegarLoop]: Abstraction has 113853 states and 200974 transitions. [2019-09-08 04:29:25,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 04:29:25,107 INFO L276 IsEmpty]: Start isEmpty. Operand 113853 states and 200974 transitions. [2019-09-08 04:29:25,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-08 04:29:25,135 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:29:25,135 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:29:25,135 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:29:25,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:29:25,136 INFO L82 PathProgramCache]: Analyzing trace with hash -412524440, now seen corresponding path program 1 times [2019-09-08 04:29:25,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:29:25,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:29:25,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:25,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:29:25,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:25,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:29:25,305 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-09-08 04:29:25,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:29:25,306 INFO L223 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-09-08 04:29:25,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:29:25,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:29:25,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 3839 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 04:29:25,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:29:26,102 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 04:29:26,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:29:26,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2019-09-08 04:29:26,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 04:29:26,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 04:29:26,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 04:29:26,122 INFO L87 Difference]: Start difference. First operand 113853 states and 200974 transitions. Second operand 10 states. [2019-09-08 04:29:35,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:29:35,667 INFO L93 Difference]: Finished difference Result 232593 states and 438354 transitions. [2019-09-08 04:29:35,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 04:29:35,667 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 258 [2019-09-08 04:29:35,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:29:36,708 INFO L225 Difference]: With dead ends: 232593 [2019-09-08 04:29:36,708 INFO L226 Difference]: Without dead ends: 118803 [2019-09-08 04:29:37,702 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 261 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2019-09-08 04:29:37,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118803 states. [2019-09-08 04:29:48,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118803 to 118671. [2019-09-08 04:29:48,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118671 states. [2019-09-08 04:29:50,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118671 states to 118671 states and 207871 transitions. [2019-09-08 04:29:50,047 INFO L78 Accepts]: Start accepts. Automaton has 118671 states and 207871 transitions. Word has length 258 [2019-09-08 04:29:50,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:29:50,048 INFO L475 AbstractCegarLoop]: Abstraction has 118671 states and 207871 transitions. [2019-09-08 04:29:50,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 04:29:50,048 INFO L276 IsEmpty]: Start isEmpty. Operand 118671 states and 207871 transitions. [2019-09-08 04:29:50,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-09-08 04:29:50,101 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:29:50,102 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:29:50,102 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:29:50,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:29:50,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1117128370, now seen corresponding path program 1 times [2019-09-08 04:29:50,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:29:50,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:29:50,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:50,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:29:50,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:50,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:29:50,256 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-09-08 04:29:50,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:29:50,256 INFO L223 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-09-08 04:29:50,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:29:50,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:29:50,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 3845 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 04:29:50,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:29:50,890 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-08 04:29:50,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:29:50,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2019-09-08 04:29:50,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:29:50,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:29:50,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:29:50,907 INFO L87 Difference]: Start difference. First operand 118671 states and 207871 transitions. Second operand 7 states. [2019-09-08 04:29:59,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:29:59,116 INFO L93 Difference]: Finished difference Result 242724 states and 452445 transitions. [2019-09-08 04:29:59,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 04:29:59,117 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 264 [2019-09-08 04:29:59,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:29:59,885 INFO L225 Difference]: With dead ends: 242724 [2019-09-08 04:29:59,885 INFO L226 Difference]: Without dead ends: 124116 [2019-09-08 04:30:00,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 264 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-09-08 04:30:00,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124116 states. [2019-09-08 04:30:10,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124116 to 123984. [2019-09-08 04:30:10,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123984 states. [2019-09-08 04:30:11,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123984 states to 123984 states and 215263 transitions. [2019-09-08 04:30:11,443 INFO L78 Accepts]: Start accepts. Automaton has 123984 states and 215263 transitions. Word has length 264 [2019-09-08 04:30:11,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:30:11,444 INFO L475 AbstractCegarLoop]: Abstraction has 123984 states and 215263 transitions. [2019-09-08 04:30:11,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:30:11,444 INFO L276 IsEmpty]: Start isEmpty. Operand 123984 states and 215263 transitions. [2019-09-08 04:30:11,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-09-08 04:30:11,462 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:30:11,462 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:30:11,462 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:30:11,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:30:11,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1983514023, now seen corresponding path program 1 times [2019-09-08 04:30:11,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:30:11,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:30:11,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:30:11,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:30:11,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:30:11,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:30:11,633 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-09-08 04:30:11,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:30:11,634 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:30:11,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:30:12,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:30:12,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 3850 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 04:30:12,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:30:13,222 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 04:30:13,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:30:13,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 04:30:13,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:30:13,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:30:13,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:30:13,242 INFO L87 Difference]: Start difference. First operand 123984 states and 215263 transitions. Second operand 6 states. [2019-09-08 04:30:22,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:30:22,544 INFO L93 Difference]: Finished difference Result 250280 states and 455042 transitions. [2019-09-08 04:30:22,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:30:22,545 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 269 [2019-09-08 04:30:22,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:30:23,539 INFO L225 Difference]: With dead ends: 250280 [2019-09-08 04:30:23,539 INFO L226 Difference]: Without dead ends: 126360 [2019-09-08 04:30:23,894 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:30:23,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126360 states. [2019-09-08 04:30:28,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126360 to 126360. [2019-09-08 04:30:28,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126360 states. [2019-09-08 04:30:30,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126360 states to 126360 states and 218035 transitions. [2019-09-08 04:30:30,569 INFO L78 Accepts]: Start accepts. Automaton has 126360 states and 218035 transitions. Word has length 269 [2019-09-08 04:30:30,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:30:30,569 INFO L475 AbstractCegarLoop]: Abstraction has 126360 states and 218035 transitions. [2019-09-08 04:30:30,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:30:30,570 INFO L276 IsEmpty]: Start isEmpty. Operand 126360 states and 218035 transitions. [2019-09-08 04:30:30,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-09-08 04:30:30,584 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:30:30,585 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 04:30:30,585 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:30:30,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:30:30,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1620155940, now seen corresponding path program 1 times [2019-09-08 04:30:30,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:30:30,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:30:30,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:30:30,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:30:30,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:30:30,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:30:30,799 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2019-09-08 04:30:30,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:30:30,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:30:30,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:30:30,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:30:30,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:30:30,802 INFO L87 Difference]: Start difference. First operand 126360 states and 218035 transitions. Second operand 5 states. [2019-09-08 04:30:52,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:30:52,332 INFO L93 Difference]: Finished difference Result 435509 states and 940943 transitions. [2019-09-08 04:30:52,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 04:30:52,332 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 305 [2019-09-08 04:30:52,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:30:54,342 INFO L225 Difference]: With dead ends: 435509 [2019-09-08 04:30:54,342 INFO L226 Difference]: Without dead ends: 309020 [2019-09-08 04:30:54,783 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:30:54,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309020 states. [2019-09-08 04:31:26,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309020 to 300903. [2019-09-08 04:31:26,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300903 states. [2019-09-08 04:31:28,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300903 states to 300903 states and 592825 transitions. [2019-09-08 04:31:29,006 INFO L78 Accepts]: Start accepts. Automaton has 300903 states and 592825 transitions. Word has length 305 [2019-09-08 04:31:29,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:31:29,007 INFO L475 AbstractCegarLoop]: Abstraction has 300903 states and 592825 transitions. [2019-09-08 04:31:29,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:31:29,007 INFO L276 IsEmpty]: Start isEmpty. Operand 300903 states and 592825 transitions. [2019-09-08 04:31:29,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-09-08 04:31:29,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:31:29,042 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:31:29,042 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:31:29,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:31:29,043 INFO L82 PathProgramCache]: Analyzing trace with hash 548021481, now seen corresponding path program 1 times [2019-09-08 04:31:29,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:31:29,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:31:29,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:31:29,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:31:29,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:31:29,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:31:29,264 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-09-08 04:31:29,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:31:29,264 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:31:29,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:31:29,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:31:29,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 3858 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 04:31:29,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:31:29,959 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-08 04:31:29,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:31:29,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2019-09-08 04:31:29,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 04:31:29,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 04:31:29,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 04:31:29,971 INFO L87 Difference]: Start difference. First operand 300903 states and 592825 transitions. Second operand 10 states. [2019-09-08 04:32:04,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:32:04,294 INFO L93 Difference]: Finished difference Result 620333 states and 1342806 transitions. [2019-09-08 04:32:04,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 04:32:04,294 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 277 [2019-09-08 04:32:04,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:32:06,808 INFO L225 Difference]: With dead ends: 620333 [2019-09-08 04:32:06,808 INFO L226 Difference]: Without dead ends: 322164 [2019-09-08 04:32:09,864 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2019-09-08 04:32:11,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322164 states. [2019-09-08 04:32:41,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322164 to 310242. [2019-09-08 04:32:41,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310242 states. [2019-09-08 04:32:44,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310242 states to 310242 states and 608794 transitions. [2019-09-08 04:32:44,492 INFO L78 Accepts]: Start accepts. Automaton has 310242 states and 608794 transitions. Word has length 277 [2019-09-08 04:32:44,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:32:44,493 INFO L475 AbstractCegarLoop]: Abstraction has 310242 states and 608794 transitions. [2019-09-08 04:32:44,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 04:32:44,493 INFO L276 IsEmpty]: Start isEmpty. Operand 310242 states and 608794 transitions. [2019-09-08 04:32:44,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-09-08 04:32:44,527 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:32:44,528 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:32:44,528 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:32:44,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:32:44,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1221962783, now seen corresponding path program 1 times [2019-09-08 04:32:44,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:32:44,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:32:44,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:44,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:32:44,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:44,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:32:44,675 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-08 04:32:44,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:32:44,675 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 04:32:44,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:32:45,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:32:45,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 3859 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 04:32:45,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:32:45,383 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 04:32:45,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:32:45,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 04:32:45,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:32:45,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:32:45,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:32:45,400 INFO L87 Difference]: Start difference. First operand 310242 states and 608794 transitions. Second operand 6 states. [2019-09-08 04:33:11,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:33:11,685 INFO L93 Difference]: Finished difference Result 628859 states and 1339890 transitions. [2019-09-08 04:33:11,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:33:11,685 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 278 [2019-09-08 04:33:11,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:33:15,015 INFO L225 Difference]: With dead ends: 628859 [2019-09-08 04:33:15,016 INFO L226 Difference]: Without dead ends: 318681 [2019-09-08 04:33:16,378 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:33:16,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318681 states. [2019-09-08 04:33:46,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318681 to 318681. [2019-09-08 04:33:46,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318681 states. [2019-09-08 04:33:50,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318681 states to 318681 states and 618397 transitions. [2019-09-08 04:33:50,394 INFO L78 Accepts]: Start accepts. Automaton has 318681 states and 618397 transitions. Word has length 278 [2019-09-08 04:33:50,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:33:50,395 INFO L475 AbstractCegarLoop]: Abstraction has 318681 states and 618397 transitions. [2019-09-08 04:33:50,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:33:50,395 INFO L276 IsEmpty]: Start isEmpty. Operand 318681 states and 618397 transitions. [2019-09-08 04:33:50,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-09-08 04:33:50,419 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:33:50,419 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 04:33:50,420 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:33:50,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:33:50,420 INFO L82 PathProgramCache]: Analyzing trace with hash -445228833, now seen corresponding path program 1 times [2019-09-08 04:33:50,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:33:50,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:33:50,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:33:50,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:33:50,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:33:50,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:33:50,621 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-09-08 04:33:50,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:33:50,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:33:50,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:33:50,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:33:50,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:33:50,623 INFO L87 Difference]: Start difference. First operand 318681 states and 618397 transitions. Second operand 5 states. [2019-09-08 04:35:21,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:35:21,939 INFO L93 Difference]: Finished difference Result 1158069 states and 3258952 transitions. [2019-09-08 04:35:21,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 04:35:21,940 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 313 [2019-09-08 04:35:21,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:35:34,286 INFO L225 Difference]: With dead ends: 1158069 [2019-09-08 04:35:34,286 INFO L226 Difference]: Without dead ends: 838299 [2019-09-08 04:35:36,239 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:35:37,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838299 states.