java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/product-lines/elevator_spec1_product27.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 03:54:27,277 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 03:54:27,279 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 03:54:27,290 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 03:54:27,291 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 03:54:27,292 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 03:54:27,293 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 03:54:27,295 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 03:54:27,297 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 03:54:27,298 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 03:54:27,299 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 03:54:27,300 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 03:54:27,300 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 03:54:27,301 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 03:54:27,302 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 03:54:27,303 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 03:54:27,304 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 03:54:27,305 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 03:54:27,307 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 03:54:27,309 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 03:54:27,310 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 03:54:27,311 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 03:54:27,313 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 03:54:27,313 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 03:54:27,316 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 03:54:27,316 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 03:54:27,316 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 03:54:27,317 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 03:54:27,317 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 03:54:27,319 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 03:54:27,320 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 03:54:27,321 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 03:54:27,323 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 03:54:27,324 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 03:54:27,325 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 03:54:27,325 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 03:54:27,326 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 03:54:27,326 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 03:54:27,326 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 03:54:27,327 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 03:54:27,331 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 03:54:27,332 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 03:54:27,348 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 03:54:27,349 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 03:54:27,350 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 03:54:27,350 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 03:54:27,350 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 03:54:27,351 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 03:54:27,351 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 03:54:27,351 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 03:54:27,351 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 03:54:27,351 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 03:54:27,352 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 03:54:27,352 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 03:54:27,352 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 03:54:27,352 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 03:54:27,352 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 03:54:27,353 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 03:54:27,353 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 03:54:27,353 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 03:54:27,353 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 03:54:27,353 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 03:54:27,354 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 03:54:27,354 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 03:54:27,354 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 03:54:27,354 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 03:54:27,354 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 03:54:27,355 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 03:54:27,355 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 03:54:27,355 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 03:54:27,355 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 03:54:27,395 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 03:54:27,408 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 03:54:27,411 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 03:54:27,413 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 03:54:27,413 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 03:54:27,414 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec1_product27.cil.c [2019-09-08 03:54:27,475 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1caadd186/9c84d6522eeb4d73a95cadba6b97376a/FLAG2c477c9a4 [2019-09-08 03:54:28,217 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 03:54:28,218 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec1_product27.cil.c [2019-09-08 03:54:28,251 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1caadd186/9c84d6522eeb4d73a95cadba6b97376a/FLAG2c477c9a4 [2019-09-08 03:54:28,332 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1caadd186/9c84d6522eeb4d73a95cadba6b97376a [2019-09-08 03:54:28,345 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 03:54:28,347 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 03:54:28,348 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 03:54:28,348 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 03:54:28,352 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 03:54:28,353 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 03:54:28" (1/1) ... [2019-09-08 03:54:28,356 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12089796 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:54:28, skipping insertion in model container [2019-09-08 03:54:28,356 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 03:54:28" (1/1) ... [2019-09-08 03:54:28,364 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 03:54:28,450 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 03:54:29,125 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 03:54:29,148 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 03:54:29,289 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 03:54:29,368 INFO L192 MainTranslator]: Completed translation [2019-09-08 03:54:29,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:54:29 WrapperNode [2019-09-08 03:54:29,370 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 03:54:29,371 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 03:54:29,371 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 03:54:29,371 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 03:54:29,382 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:54:29" (1/1) ... [2019-09-08 03:54:29,383 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:54:29" (1/1) ... [2019-09-08 03:54:29,415 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:54:29" (1/1) ... [2019-09-08 03:54:29,415 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:54:29" (1/1) ... [2019-09-08 03:54:29,476 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:54:29" (1/1) ... [2019-09-08 03:54:29,525 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:54:29" (1/1) ... [2019-09-08 03:54:29,535 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:54:29" (1/1) ... [2019-09-08 03:54:29,551 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 03:54:29,551 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 03:54:29,551 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 03:54:29,552 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 03:54:29,553 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:54:29" (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 03:54:29,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 03:54:29,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 03:54:29,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 03:54:29,607 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-09-08 03:54:29,608 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-09-08 03:54:29,608 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-09-08 03:54:29,609 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-09-08 03:54:29,609 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-09-08 03:54:29,610 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-09-08 03:54:29,610 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-09-08 03:54:29,610 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-09-08 03:54:29,610 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-09-08 03:54:29,611 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-09-08 03:54:29,611 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-09-08 03:54:29,612 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-09-08 03:54:29,612 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-09-08 03:54:29,613 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-09-08 03:54:29,613 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 03:54:29,614 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-09-08 03:54:29,614 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 03:54:29,614 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 03:54:29,614 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 03:54:29,615 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 03:54:29,615 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 03:54:29,615 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-09-08 03:54:29,615 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-09-08 03:54:29,615 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-09-08 03:54:29,616 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-09-08 03:54:29,616 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-09-08 03:54:29,616 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-09-08 03:54:29,616 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-09-08 03:54:29,616 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-09-08 03:54:29,617 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-09-08 03:54:29,617 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-09-08 03:54:29,617 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-09-08 03:54:29,617 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 03:54:29,617 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 03:54:29,618 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 03:54:29,618 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 03:54:29,618 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 03:54:29,618 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 03:54:29,618 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 03:54:29,618 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 03:54:29,619 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__1 [2019-09-08 03:54:29,619 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__2 [2019-09-08 03:54:29,619 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__3 [2019-09-08 03:54:29,619 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__4 [2019-09-08 03:54:29,619 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-09-08 03:54:29,620 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-09-08 03:54:29,620 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-09-08 03:54:29,620 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-09-08 03:54:29,620 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-09-08 03:54:29,620 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-09-08 03:54:29,620 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-09-08 03:54:29,621 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-09-08 03:54:29,621 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-09-08 03:54:29,621 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-09-08 03:54:29,621 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-09-08 03:54:29,621 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-09-08 03:54:29,621 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-09-08 03:54:29,622 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-09-08 03:54:29,622 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-09-08 03:54:29,622 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-09-08 03:54:29,622 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-09-08 03:54:29,622 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-09-08 03:54:29,623 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-09-08 03:54:29,623 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-09-08 03:54:29,623 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-09-08 03:54:29,623 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-09-08 03:54:29,623 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-09-08 03:54:29,624 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-09-08 03:54:29,624 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-09-08 03:54:29,624 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-09-08 03:54:29,624 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-09-08 03:54:29,624 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-09-08 03:54:29,624 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-09-08 03:54:29,625 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-09-08 03:54:29,625 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-09-08 03:54:29,625 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-09-08 03:54:29,625 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 03:54:29,625 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 03:54:29,626 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-08 03:54:29,626 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-09-08 03:54:29,626 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-09-08 03:54:29,626 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-09-08 03:54:29,626 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-09-08 03:54:29,627 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-09-08 03:54:29,627 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-09-08 03:54:29,627 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-09-08 03:54:29,627 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-09-08 03:54:29,627 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-09-08 03:54:29,627 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-09-08 03:54:29,628 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-09-08 03:54:29,628 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-09-08 03:54:29,628 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-09-08 03:54:29,628 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-09-08 03:54:29,628 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-09-08 03:54:29,629 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-09-08 03:54:29,629 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-09-08 03:54:29,629 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-09-08 03:54:29,629 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-09-08 03:54:29,629 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-09-08 03:54:29,629 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-09-08 03:54:29,630 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 03:54:29,630 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__1 [2019-09-08 03:54:29,630 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__4 [2019-09-08 03:54:29,630 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 03:54:29,630 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-09-08 03:54:29,631 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 03:54:29,631 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 03:54:29,631 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 03:54:29,631 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 03:54:29,631 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 03:54:29,631 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-09-08 03:54:29,632 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-09-08 03:54:29,632 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-09-08 03:54:29,632 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-09-08 03:54:29,632 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-09-08 03:54:29,632 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-09-08 03:54:29,633 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-09-08 03:54:29,633 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-09-08 03:54:29,633 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-09-08 03:54:29,633 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__2 [2019-09-08 03:54:29,633 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 03:54:29,633 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 03:54:29,634 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 03:54:29,634 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 03:54:29,634 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 03:54:29,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 03:54:29,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 03:54:29,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 03:54:29,634 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 03:54:29,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 03:54:29,635 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 03:54:29,635 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 03:54:29,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 03:54:29,635 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 03:54:29,635 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 03:54:29,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 03:54:29,636 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 03:54:29,636 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 03:54:29,636 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-09-08 03:54:29,636 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-09-08 03:54:29,636 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__3 [2019-09-08 03:54:29,636 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-09-08 03:54:29,637 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-09-08 03:54:29,637 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-09-08 03:54:29,637 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 03:54:29,637 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-09-08 03:54:29,637 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-09-08 03:54:29,637 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-09-08 03:54:29,638 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-09-08 03:54:29,638 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-09-08 03:54:29,638 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-09-08 03:54:29,638 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-09-08 03:54:29,638 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-09-08 03:54:29,638 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-09-08 03:54:29,638 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-09-08 03:54:29,638 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-09-08 03:54:29,639 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-09-08 03:54:29,639 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-09-08 03:54:29,639 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-09-08 03:54:29,639 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-09-08 03:54:29,639 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-09-08 03:54:29,639 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-09-08 03:54:29,639 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-09-08 03:54:29,640 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-09-08 03:54:29,640 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-09-08 03:54:29,640 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-09-08 03:54:29,640 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-09-08 03:54:29,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 03:54:29,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 03:54:29,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 03:54:31,929 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 03:54:31,929 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-09-08 03:54:31,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 03:54:31 BoogieIcfgContainer [2019-09-08 03:54:31,932 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 03:54:31,933 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 03:54:31,933 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 03:54:31,936 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 03:54:31,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 03:54:28" (1/3) ... [2019-09-08 03:54:31,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@108b2a7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 03:54:31, skipping insertion in model container [2019-09-08 03:54:31,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:54:29" (2/3) ... [2019-09-08 03:54:31,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@108b2a7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 03:54:31, skipping insertion in model container [2019-09-08 03:54:31,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 03:54:31" (3/3) ... [2019-09-08 03:54:31,940 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec1_product27.cil.c [2019-09-08 03:54:31,952 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 03:54:31,970 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 03:54:31,988 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 03:54:32,049 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 03:54:32,050 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 03:54:32,050 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 03:54:32,050 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 03:54:32,050 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 03:54:32,051 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 03:54:32,051 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 03:54:32,051 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 03:54:32,051 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 03:54:32,095 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states. [2019-09-08 03:54:32,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-08 03:54:32,129 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:54:32,130 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:54:32,133 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:54:32,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:54:32,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1141636338, now seen corresponding path program 1 times [2019-09-08 03:54:32,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:54:32,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:54:32,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:32,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:32,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:32,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:32,774 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 03:54:32,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:54:32,777 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) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:54:32,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:33,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:33,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 3286 conjuncts, 1 conjunts are in the unsatisfiable core [2019-09-08 03:54:33,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:54:33,457 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-08 03:54:33,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:54:33,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 4 [2019-09-08 03:54:33,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:54:33,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:54:33,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:54:33,489 INFO L87 Difference]: Start difference. First operand 787 states. Second operand 4 states. [2019-09-08 03:54:33,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:54:33,655 INFO L93 Difference]: Finished difference Result 1258 states and 2023 transitions. [2019-09-08 03:54:33,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 03:54:33,657 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-09-08 03:54:33,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:54:33,690 INFO L225 Difference]: With dead ends: 1258 [2019-09-08 03:54:33,690 INFO L226 Difference]: Without dead ends: 633 [2019-09-08 03:54:33,702 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 165 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 03:54:33,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2019-09-08 03:54:33,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 633. [2019-09-08 03:54:33,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2019-09-08 03:54:33,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 1005 transitions. [2019-09-08 03:54:33,855 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 1005 transitions. Word has length 164 [2019-09-08 03:54:33,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:54:33,856 INFO L475 AbstractCegarLoop]: Abstraction has 633 states and 1005 transitions. [2019-09-08 03:54:33,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:54:33,856 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 1005 transitions. [2019-09-08 03:54:33,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-08 03:54:33,863 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:54:33,863 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:54:33,864 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:54:33,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:54:33,864 INFO L82 PathProgramCache]: Analyzing trace with hash 41360599, now seen corresponding path program 1 times [2019-09-08 03:54:33,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:54:33,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:54:33,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:33,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:33,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:33,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:34,047 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 03:54:34,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:54:34,048 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:54:34,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:34,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:34,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 3291 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:54:34,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:54:34,655 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Stream Closed [2019-09-08 03:54:34,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:54:34,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 03:54:34,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:54:34,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:54:34,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:54:34,674 INFO L87 Difference]: Start difference. First operand 633 states and 1005 transitions. Second operand 6 states. [2019-09-08 03:54:34,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:54:34,764 INFO L93 Difference]: Finished difference Result 1238 states and 1983 transitions. [2019-09-08 03:54:34,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 03:54:34,765 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 168 [2019-09-08 03:54:34,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:54:34,770 INFO L225 Difference]: With dead ends: 1238 [2019-09-08 03:54:34,771 INFO L226 Difference]: Without dead ends: 633 [2019-09-08 03:54:34,774 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:54:34,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2019-09-08 03:54:34,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 633. [2019-09-08 03:54:34,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2019-09-08 03:54:34,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 1004 transitions. [2019-09-08 03:54:34,806 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 1004 transitions. Word has length 168 [2019-09-08 03:54:34,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:54:34,807 INFO L475 AbstractCegarLoop]: Abstraction has 633 states and 1004 transitions. [2019-09-08 03:54:34,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:54:34,807 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 1004 transitions. [2019-09-08 03:54:34,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-08 03:54:34,812 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:54:34,812 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:54:34,813 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:54:34,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:54:34,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1984965257, now seen corresponding path program 1 times [2019-09-08 03:54:34,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:54:34,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:54:34,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:34,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:34,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:34,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:34,985 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 03:54:34,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:54:34,986 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 03:54:35,000 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 03:54:35,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:35,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 3293 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:54:35,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:54:35,557 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:54:35,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:54:35,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 03:54:35,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:54:35,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:54:35,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:54:35,577 INFO L87 Difference]: Start difference. First operand 633 states and 1004 transitions. Second operand 6 states. [2019-09-08 03:54:35,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:54:35,658 INFO L93 Difference]: Finished difference Result 1242 states and 1986 transitions. [2019-09-08 03:54:35,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 03:54:35,659 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 170 [2019-09-08 03:54:35,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:54:35,664 INFO L225 Difference]: With dead ends: 1242 [2019-09-08 03:54:35,664 INFO L226 Difference]: Without dead ends: 639 [2019-09-08 03:54:35,667 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:54:35,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2019-09-08 03:54:35,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2019-09-08 03:54:35,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 03:54:35,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 1009 transitions. [2019-09-08 03:54:35,700 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 1009 transitions. Word has length 170 [2019-09-08 03:54:35,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:54:35,702 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 1009 transitions. [2019-09-08 03:54:35,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:54:35,703 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 1009 transitions. [2019-09-08 03:54:35,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-08 03:54:35,710 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:54:35,710 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:54:35,711 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:54:35,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:54:35,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1663399092, now seen corresponding path program 1 times [2019-09-08 03:54:35,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:54:35,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:54:35,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:35,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:35,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:35,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:35,910 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 03:54:35,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:54:35,911 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) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:54:35,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:36,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:36,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 3294 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:54:36,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:54:36,463 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:54:36,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:54:36,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 03:54:36,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:54:36,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:54:36,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:54:36,472 INFO L87 Difference]: Start difference. First operand 639 states and 1009 transitions. Second operand 6 states. [2019-09-08 03:54:36,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:54:36,569 INFO L93 Difference]: Finished difference Result 1241 states and 1977 transitions. [2019-09-08 03:54:36,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:54:36,569 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 171 [2019-09-08 03:54:36,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:54:36,574 INFO L225 Difference]: With dead ends: 1241 [2019-09-08 03:54:36,574 INFO L226 Difference]: Without dead ends: 639 [2019-09-08 03:54:36,578 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 171 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 03:54:36,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2019-09-08 03:54:36,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2019-09-08 03:54:36,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 03:54:36,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 1008 transitions. [2019-09-08 03:54:36,603 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 1008 transitions. Word has length 171 [2019-09-08 03:54:36,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:54:36,603 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 1008 transitions. [2019-09-08 03:54:36,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:54:36,604 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 1008 transitions. [2019-09-08 03:54:36,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-08 03:54:36,608 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:54:36,609 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:54:36,609 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:54:36,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:54:36,609 INFO L82 PathProgramCache]: Analyzing trace with hash 424078317, now seen corresponding path program 1 times [2019-09-08 03:54:36,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:54:36,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:54:36,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:36,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:36,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:36,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:36,722 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 03:54:36,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:54:36,723 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 03:54:36,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:37,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:37,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 3295 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:54:37,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:54:37,269 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 33 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 03:54:37,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:54:37,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 03:54:37,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:54:37,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:54:37,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:54:37,283 INFO L87 Difference]: Start difference. First operand 639 states and 1008 transitions. Second operand 6 states. [2019-09-08 03:54:37,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:54:37,378 INFO L93 Difference]: Finished difference Result 1241 states and 1976 transitions. [2019-09-08 03:54:37,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:54:37,383 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 172 [2019-09-08 03:54:37,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:54:37,390 INFO L225 Difference]: With dead ends: 1241 [2019-09-08 03:54:37,390 INFO L226 Difference]: Without dead ends: 639 [2019-09-08 03:54:37,394 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 172 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 03:54:37,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2019-09-08 03:54:37,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2019-09-08 03:54:37,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 03:54:37,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 1007 transitions. [2019-09-08 03:54:37,433 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 1007 transitions. Word has length 172 [2019-09-08 03:54:37,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:54:37,433 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 1007 transitions. [2019-09-08 03:54:37,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:54:37,434 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 1007 transitions. [2019-09-08 03:54:37,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 03:54:37,444 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:54:37,445 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:54:37,445 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:54:37,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:54:37,446 INFO L82 PathProgramCache]: Analyzing trace with hash 799135704, now seen corresponding path program 1 times [2019-09-08 03:54:37,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:54:37,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:54:37,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:37,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:37,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:37,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:37,719 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 03:54:37,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:54:37,719 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 03:54:37,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:38,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:38,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 3296 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:54:38,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:54:38,368 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 03:54:38,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:54:38,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2019-09-08 03:54:38,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 03:54:38,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 03:54:38,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-08 03:54:38,388 INFO L87 Difference]: Start difference. First operand 639 states and 1007 transitions. Second operand 12 states. [2019-09-08 03:54:39,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:54:39,032 INFO L93 Difference]: Finished difference Result 1252 states and 1996 transitions. [2019-09-08 03:54:39,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 03:54:39,033 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 173 [2019-09-08 03:54:39,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:54:39,038 INFO L225 Difference]: With dead ends: 1252 [2019-09-08 03:54:39,038 INFO L226 Difference]: Without dead ends: 648 [2019-09-08 03:54:39,042 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-09-08 03:54:39,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2019-09-08 03:54:39,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 646. [2019-09-08 03:54:39,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 03:54:39,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 1012 transitions. [2019-09-08 03:54:39,079 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 1012 transitions. Word has length 173 [2019-09-08 03:54:39,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:54:39,080 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 1012 transitions. [2019-09-08 03:54:39,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 03:54:39,080 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 1012 transitions. [2019-09-08 03:54:39,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 03:54:39,086 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:54:39,086 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:54:39,086 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:54:39,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:54:39,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1622185050, now seen corresponding path program 1 times [2019-09-08 03:54:39,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:54:39,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:54:39,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:39,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:39,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:39,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:39,242 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-08 03:54:39,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:54:39,242 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 03:54:39,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:39,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:39,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 3299 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:54:39,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:54:39,730 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:54:39,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:54:39,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-09-08 03:54:39,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:54:39,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:54:39,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:54:39,740 INFO L87 Difference]: Start difference. First operand 646 states and 1012 transitions. Second operand 8 states. [2019-09-08 03:54:40,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:54:40,025 INFO L93 Difference]: Finished difference Result 1253 states and 1986 transitions. [2019-09-08 03:54:40,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:54:40,025 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 176 [2019-09-08 03:54:40,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:54:40,031 INFO L225 Difference]: With dead ends: 1253 [2019-09-08 03:54:40,031 INFO L226 Difference]: Without dead ends: 646 [2019-09-08 03:54:40,034 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:54:40,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2019-09-08 03:54:40,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 646. [2019-09-08 03:54:40,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 03:54:40,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 1007 transitions. [2019-09-08 03:54:40,061 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 1007 transitions. Word has length 176 [2019-09-08 03:54:40,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:54:40,061 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 1007 transitions. [2019-09-08 03:54:40,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 03:54:40,061 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 1007 transitions. [2019-09-08 03:54:40,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-08 03:54:40,066 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:54:40,066 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:54:40,067 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:54:40,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:54:40,067 INFO L82 PathProgramCache]: Analyzing trace with hash -166382232, now seen corresponding path program 1 times [2019-09-08 03:54:40,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:54:40,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:54:40,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:40,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:40,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:40,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:40,210 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-08 03:54:40,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:54:40,210 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) [2019-09-08 03:54:40,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:54:40,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:40,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 3301 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:54:40,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:54:40,735 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 18 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 03:54:40,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:54:40,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-09-08 03:54:40,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:54:40,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:54:40,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:54:40,745 INFO L87 Difference]: Start difference. First operand 646 states and 1007 transitions. Second operand 8 states. [2019-09-08 03:54:41,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:54:41,013 INFO L93 Difference]: Finished difference Result 1274 states and 2007 transitions. [2019-09-08 03:54:41,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:54:41,014 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 178 [2019-09-08 03:54:41,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:54:41,020 INFO L225 Difference]: With dead ends: 1274 [2019-09-08 03:54:41,020 INFO L226 Difference]: Without dead ends: 673 [2019-09-08 03:54:41,023 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:54:41,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2019-09-08 03:54:41,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 670. [2019-09-08 03:54:41,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-09-08 03:54:41,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1034 transitions. [2019-09-08 03:54:41,051 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1034 transitions. Word has length 178 [2019-09-08 03:54:41,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:54:41,052 INFO L475 AbstractCegarLoop]: Abstraction has 670 states and 1034 transitions. [2019-09-08 03:54:41,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 03:54:41,052 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1034 transitions. [2019-09-08 03:54:41,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-08 03:54:41,057 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:54:41,058 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:54:41,058 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:54:41,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:54:41,059 INFO L82 PathProgramCache]: Analyzing trace with hash 464906472, now seen corresponding path program 1 times [2019-09-08 03:54:41,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:54:41,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:54:41,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:41,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:41,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:41,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:41,232 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 03:54:41,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:54:41,233 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) [2019-09-08 03:54:41,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:54:41,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:41,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 3297 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 03:54:41,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:54:41,878 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 03:54:41,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:54:41,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2019-09-08 03:54:41,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 03:54:41,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 03:54:41,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:54:41,888 INFO L87 Difference]: Start difference. First operand 670 states and 1034 transitions. Second operand 14 states. [2019-09-08 03:54:42,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:54:42,193 INFO L93 Difference]: Finished difference Result 1275 states and 1988 transitions. [2019-09-08 03:54:42,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 03:54:42,194 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 178 [2019-09-08 03:54:42,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:54:42,199 INFO L225 Difference]: With dead ends: 1275 [2019-09-08 03:54:42,200 INFO L226 Difference]: Without dead ends: 692 [2019-09-08 03:54:42,203 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-09-08 03:54:42,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2019-09-08 03:54:42,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 681. [2019-09-08 03:54:42,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 681 states. [2019-09-08 03:54:42,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 1055 transitions. [2019-09-08 03:54:42,230 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 1055 transitions. Word has length 178 [2019-09-08 03:54:42,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:54:42,231 INFO L475 AbstractCegarLoop]: Abstraction has 681 states and 1055 transitions. [2019-09-08 03:54:42,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 03:54:42,231 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 1055 transitions. [2019-09-08 03:54:42,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-08 03:54:42,235 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:54:42,236 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:54:42,236 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:54:42,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:54:42,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1170743800, now seen corresponding path program 1 times [2019-09-08 03:54:42,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:54:42,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:54:42,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:42,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:42,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:42,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:42,347 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 03:54:42,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:54:42,347 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) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:54:42,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:42,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:42,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 3300 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:54:42,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:54:42,855 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 03:54:42,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:54:42,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 03:54:42,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:54:42,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:54:42,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:54:42,869 INFO L87 Difference]: Start difference. First operand 681 states and 1055 transitions. Second operand 6 states. [2019-09-08 03:54:43,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:54:43,200 INFO L93 Difference]: Finished difference Result 1324 states and 2072 transitions. [2019-09-08 03:54:43,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:54:43,201 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 178 [2019-09-08 03:54:43,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:54:43,206 INFO L225 Difference]: With dead ends: 1324 [2019-09-08 03:54:43,206 INFO L226 Difference]: Without dead ends: 646 [2019-09-08 03:54:43,209 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 178 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 03:54:43,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2019-09-08 03:54:43,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 646. [2019-09-08 03:54:43,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 03:54:43,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 992 transitions. [2019-09-08 03:54:43,235 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 992 transitions. Word has length 178 [2019-09-08 03:54:43,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:54:43,235 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 992 transitions. [2019-09-08 03:54:43,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:54:43,235 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 992 transitions. [2019-09-08 03:54:43,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-08 03:54:43,242 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:54:43,243 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:54:43,243 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:54:43,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:54:43,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1500778226, now seen corresponding path program 1 times [2019-09-08 03:54:43,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:54:43,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:54:43,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:43,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:43,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:43,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:43,385 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-08 03:54:43,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:54:43,386 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:54:43,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:44,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:44,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 3305 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:54:44,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:54:44,136 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (12)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:54:44,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:54:44,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-09-08 03:54:44,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:54:44,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:54:44,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:54:44,149 INFO L87 Difference]: Start difference. First operand 646 states and 992 transitions. Second operand 8 states. [2019-09-08 03:54:44,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:54:44,401 INFO L93 Difference]: Finished difference Result 1242 states and 1931 transitions. [2019-09-08 03:54:44,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:54:44,402 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 182 [2019-09-08 03:54:44,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:54:44,409 INFO L225 Difference]: With dead ends: 1242 [2019-09-08 03:54:44,409 INFO L226 Difference]: Without dead ends: 646 [2019-09-08 03:54:44,413 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:54:44,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2019-09-08 03:54:44,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 646. [2019-09-08 03:54:44,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 03:54:44,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 991 transitions. [2019-09-08 03:54:44,442 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 991 transitions. Word has length 182 [2019-09-08 03:54:44,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:54:44,446 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 991 transitions. [2019-09-08 03:54:44,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 03:54:44,446 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 991 transitions. [2019-09-08 03:54:44,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-08 03:54:44,451 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:54:44,451 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:54:44,451 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:54:44,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:54:44,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1170913615, now seen corresponding path program 1 times [2019-09-08 03:54:44,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:54:44,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:54:44,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:44,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:44,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:44,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:44,688 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-08 03:54:44,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:54:44,688 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:54:44,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:45,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:45,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 3306 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 03:54:45,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:54:45,449 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (13)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:54:45,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:54:45,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 18 [2019-09-08 03:54:45,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 03:54:45,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 03:54:45,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-09-08 03:54:45,466 INFO L87 Difference]: Start difference. First operand 646 states and 991 transitions. Second operand 18 states. [2019-09-08 03:54:46,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:54:46,011 INFO L93 Difference]: Finished difference Result 1258 states and 1958 transitions. [2019-09-08 03:54:46,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 03:54:46,014 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 183 [2019-09-08 03:54:46,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:54:46,019 INFO L225 Difference]: With dead ends: 1258 [2019-09-08 03:54:46,019 INFO L226 Difference]: Without dead ends: 661 [2019-09-08 03:54:46,023 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-09-08 03:54:46,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2019-09-08 03:54:46,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 657. [2019-09-08 03:54:46,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-09-08 03:54:46,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 999 transitions. [2019-09-08 03:54:46,049 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 999 transitions. Word has length 183 [2019-09-08 03:54:46,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:54:46,050 INFO L475 AbstractCegarLoop]: Abstraction has 657 states and 999 transitions. [2019-09-08 03:54:46,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 03:54:46,050 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 999 transitions. [2019-09-08 03:54:46,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-08 03:54:46,057 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:54:46,057 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:54:46,058 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:54:46,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:54:46,058 INFO L82 PathProgramCache]: Analyzing trace with hash -144437338, now seen corresponding path program 1 times [2019-09-08 03:54:46,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:54:46,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:54:46,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:46,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:46,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:46,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:46,280 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-08 03:54:46,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:54:46,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:54:46,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:54:46,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:54:46,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:54:46,283 INFO L87 Difference]: Start difference. First operand 657 states and 999 transitions. Second operand 9 states. [2019-09-08 03:54:46,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:54:46,517 INFO L93 Difference]: Finished difference Result 1189 states and 1854 transitions. [2019-09-08 03:54:46,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:54:46,518 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 184 [2019-09-08 03:54:46,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:54:46,525 INFO L225 Difference]: With dead ends: 1189 [2019-09-08 03:54:46,526 INFO L226 Difference]: Without dead ends: 654 [2019-09-08 03:54:46,530 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-08 03:54:46,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2019-09-08 03:54:46,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 654. [2019-09-08 03:54:46,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2019-09-08 03:54:46,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 994 transitions. [2019-09-08 03:54:46,566 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 994 transitions. Word has length 184 [2019-09-08 03:54:46,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:54:46,569 INFO L475 AbstractCegarLoop]: Abstraction has 654 states and 994 transitions. [2019-09-08 03:54:46,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:54:46,570 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 994 transitions. [2019-09-08 03:54:46,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-08 03:54:46,577 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:54:46,578 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:54:46,578 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:54:46,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:54:46,579 INFO L82 PathProgramCache]: Analyzing trace with hash 746559157, now seen corresponding path program 1 times [2019-09-08 03:54:46,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:54:46,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:54:46,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:46,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:46,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:46,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:46,760 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-08 03:54:46,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:54:46,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:54:46,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:54:46,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:54:46,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:54:46,763 INFO L87 Difference]: Start difference. First operand 654 states and 994 transitions. Second operand 7 states. [2019-09-08 03:54:46,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:54:46,858 INFO L93 Difference]: Finished difference Result 1186 states and 1849 transitions. [2019-09-08 03:54:46,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:54:46,859 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 185 [2019-09-08 03:54:46,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:54:46,864 INFO L225 Difference]: With dead ends: 1186 [2019-09-08 03:54:46,864 INFO L226 Difference]: Without dead ends: 633 [2019-09-08 03:54:46,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:54:46,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2019-09-08 03:54:46,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 631. [2019-09-08 03:54:46,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2019-09-08 03:54:46,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 964 transitions. [2019-09-08 03:54:46,892 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 964 transitions. Word has length 185 [2019-09-08 03:54:46,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:54:46,893 INFO L475 AbstractCegarLoop]: Abstraction has 631 states and 964 transitions. [2019-09-08 03:54:46,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:54:46,893 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 964 transitions. [2019-09-08 03:54:46,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-08 03:54:46,897 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:54:46,899 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:54:46,899 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:54:46,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:54:46,900 INFO L82 PathProgramCache]: Analyzing trace with hash -349533483, now seen corresponding path program 1 times [2019-09-08 03:54:46,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:54:46,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:54:46,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:46,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:46,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:46,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:47,181 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 03:54:47,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:54:47,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 03:54:47,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 03:54:47,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 03:54:47,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:54:47,185 INFO L87 Difference]: Start difference. First operand 631 states and 964 transitions. Second operand 13 states. [2019-09-08 03:54:47,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:54:47,638 INFO L93 Difference]: Finished difference Result 1229 states and 1905 transitions. [2019-09-08 03:54:47,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 03:54:47,639 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 186 [2019-09-08 03:54:47,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:54:47,645 INFO L225 Difference]: With dead ends: 1229 [2019-09-08 03:54:47,646 INFO L226 Difference]: Without dead ends: 645 [2019-09-08 03:54:47,652 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-09-08 03:54:47,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2019-09-08 03:54:47,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 643. [2019-09-08 03:54:47,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-09-08 03:54:47,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 979 transitions. [2019-09-08 03:54:47,673 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 979 transitions. Word has length 186 [2019-09-08 03:54:47,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:54:47,674 INFO L475 AbstractCegarLoop]: Abstraction has 643 states and 979 transitions. [2019-09-08 03:54:47,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 03:54:47,674 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 979 transitions. [2019-09-08 03:54:47,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-08 03:54:47,678 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:54:47,679 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:54:47,679 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:54:47,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:54:47,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1142297850, now seen corresponding path program 1 times [2019-09-08 03:54:47,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:54:47,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:54:47,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:47,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:47,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:47,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:47,956 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 03:54:47,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:54:47,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 03:54:47,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 03:54:47,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 03:54:47,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:54:47,958 INFO L87 Difference]: Start difference. First operand 643 states and 979 transitions. Second operand 13 states. [2019-09-08 03:54:48,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:54:48,294 INFO L93 Difference]: Finished difference Result 1176 states and 1832 transitions. [2019-09-08 03:54:48,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 03:54:48,295 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 185 [2019-09-08 03:54:48,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:54:48,302 INFO L225 Difference]: With dead ends: 1176 [2019-09-08 03:54:48,302 INFO L226 Difference]: Without dead ends: 636 [2019-09-08 03:54:48,307 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-09-08 03:54:48,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2019-09-08 03:54:48,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 636. [2019-09-08 03:54:48,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2019-09-08 03:54:48,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 970 transitions. [2019-09-08 03:54:48,343 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 970 transitions. Word has length 185 [2019-09-08 03:54:48,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:54:48,344 INFO L475 AbstractCegarLoop]: Abstraction has 636 states and 970 transitions. [2019-09-08 03:54:48,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 03:54:48,344 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 970 transitions. [2019-09-08 03:54:48,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-08 03:54:48,351 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:54:48,352 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:54:48,352 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:54:48,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:54:48,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1835931413, now seen corresponding path program 1 times [2019-09-08 03:54:48,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:54:48,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:54:48,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:48,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:48,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:48,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:48,648 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 03:54:48,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:54:48,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 03:54:48,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 03:54:48,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 03:54:48,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:54:48,650 INFO L87 Difference]: Start difference. First operand 636 states and 970 transitions. Second operand 11 states. [2019-09-08 03:54:48,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:54:48,983 INFO L93 Difference]: Finished difference Result 1169 states and 1823 transitions. [2019-09-08 03:54:48,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 03:54:48,984 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 187 [2019-09-08 03:54:48,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:54:48,991 INFO L225 Difference]: With dead ends: 1169 [2019-09-08 03:54:48,991 INFO L226 Difference]: Without dead ends: 636 [2019-09-08 03:54:49,005 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-09-08 03:54:49,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2019-09-08 03:54:49,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 636. [2019-09-08 03:54:49,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2019-09-08 03:54:49,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 969 transitions. [2019-09-08 03:54:49,028 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 969 transitions. Word has length 187 [2019-09-08 03:54:49,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:54:49,028 INFO L475 AbstractCegarLoop]: Abstraction has 636 states and 969 transitions. [2019-09-08 03:54:49,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 03:54:49,029 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 969 transitions. [2019-09-08 03:54:49,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-08 03:54:49,033 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:54:49,034 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:54:49,034 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:54:49,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:54:49,034 INFO L82 PathProgramCache]: Analyzing trace with hash -333328108, now seen corresponding path program 1 times [2019-09-08 03:54:49,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:54:49,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:54:49,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:49,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:49,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:49,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:49,267 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 03:54:49,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:54:49,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 03:54:49,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 03:54:49,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 03:54:49,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:54:49,269 INFO L87 Difference]: Start difference. First operand 636 states and 969 transitions. Second operand 11 states. [2019-09-08 03:54:49,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:54:49,502 INFO L93 Difference]: Finished difference Result 1215 states and 1876 transitions. [2019-09-08 03:54:49,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 03:54:49,503 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 188 [2019-09-08 03:54:49,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:54:49,508 INFO L225 Difference]: With dead ends: 1215 [2019-09-08 03:54:49,508 INFO L226 Difference]: Without dead ends: 633 [2019-09-08 03:54:49,511 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-09-08 03:54:49,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2019-09-08 03:54:49,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 633. [2019-09-08 03:54:49,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2019-09-08 03:54:49,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 961 transitions. [2019-09-08 03:54:49,532 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 961 transitions. Word has length 188 [2019-09-08 03:54:49,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:54:49,532 INFO L475 AbstractCegarLoop]: Abstraction has 633 states and 961 transitions. [2019-09-08 03:54:49,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 03:54:49,532 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 961 transitions. [2019-09-08 03:54:49,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-08 03:54:49,537 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:54:49,537 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:54:49,537 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:54:49,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:54:49,538 INFO L82 PathProgramCache]: Analyzing trace with hash -749735898, now seen corresponding path program 1 times [2019-09-08 03:54:49,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:54:49,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:54:49,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:49,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:49,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:49,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:49,723 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-08 03:54:49,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:54:49,723 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:54:49,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:50,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:50,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 3312 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 03:54:50,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:54:50,389 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (14)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:54:50,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:54:50,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-08 03:54:50,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:54:50,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:54:50,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:54:50,408 INFO L87 Difference]: Start difference. First operand 633 states and 961 transitions. Second operand 9 states. [2019-09-08 03:54:51,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:54:51,838 INFO L93 Difference]: Finished difference Result 1161 states and 1835 transitions. [2019-09-08 03:54:51,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:54:51,839 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 189 [2019-09-08 03:54:51,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:54:51,846 INFO L225 Difference]: With dead ends: 1161 [2019-09-08 03:54:51,846 INFO L226 Difference]: Without dead ends: 637 [2019-09-08 03:54:51,850 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 187 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-08 03:54:51,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-09-08 03:54:51,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 637. [2019-09-08 03:54:51,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2019-09-08 03:54:51,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 965 transitions. [2019-09-08 03:54:51,881 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 965 transitions. Word has length 189 [2019-09-08 03:54:51,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:54:51,883 INFO L475 AbstractCegarLoop]: Abstraction has 637 states and 965 transitions. [2019-09-08 03:54:51,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:54:51,884 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 965 transitions. [2019-09-08 03:54:51,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-08 03:54:51,891 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:54:51,892 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:54:51,892 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:54:51,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:54:51,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1040404922, now seen corresponding path program 1 times [2019-09-08 03:54:51,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:54:51,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:54:51,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:51,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:51,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:51,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:52,132 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-08 03:54:52,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:54:52,133 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:54:52,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:52,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:52,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 3314 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 03:54:52,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:54:52,936 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-08 03:54:52,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:54:52,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-08 03:54:52,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:54:52,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:54:52,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:54:52,952 INFO L87 Difference]: Start difference. First operand 637 states and 965 transitions. Second operand 9 states. [2019-09-08 03:54:54,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:54:54,449 INFO L93 Difference]: Finished difference Result 1170 states and 1842 transitions. [2019-09-08 03:54:54,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:54:54,450 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 191 [2019-09-08 03:54:54,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:54:54,454 INFO L225 Difference]: With dead ends: 1170 [2019-09-08 03:54:54,454 INFO L226 Difference]: Without dead ends: 642 [2019-09-08 03:54:54,457 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 190 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:54:54,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-09-08 03:54:54,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2019-09-08 03:54:54,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-08 03:54:54,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 970 transitions. [2019-09-08 03:54:54,477 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 970 transitions. Word has length 191 [2019-09-08 03:54:54,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:54:54,478 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 970 transitions. [2019-09-08 03:54:54,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:54:54,478 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 970 transitions. [2019-09-08 03:54:54,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-08 03:54:54,482 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:54:54,483 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:54:54,483 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:54:54,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:54:54,483 INFO L82 PathProgramCache]: Analyzing trace with hash -307040730, now seen corresponding path program 1 times [2019-09-08 03:54:54,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:54:54,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:54:54,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:54,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:54,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:54,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:54,637 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-08 03:54:54,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:54:54,637 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:54:54,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:54:55,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:55,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 3316 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 03:54:55,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:54:55,143 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (16)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:54:55,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:54:55,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-08 03:54:55,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:54:55,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:54:55,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:54:55,153 INFO L87 Difference]: Start difference. First operand 642 states and 970 transitions. Second operand 9 states. [2019-09-08 03:54:56,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:54:56,347 INFO L93 Difference]: Finished difference Result 1181 states and 1851 transitions. [2019-09-08 03:54:56,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:54:56,347 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 193 [2019-09-08 03:54:56,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:54:56,353 INFO L225 Difference]: With dead ends: 1181 [2019-09-08 03:54:56,353 INFO L226 Difference]: Without dead ends: 648 [2019-09-08 03:54:56,357 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 192 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:54:56,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2019-09-08 03:54:56,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 648. [2019-09-08 03:54:56,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-09-08 03:54:56,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 976 transitions. [2019-09-08 03:54:56,379 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 976 transitions. Word has length 193 [2019-09-08 03:54:56,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:54:56,379 INFO L475 AbstractCegarLoop]: Abstraction has 648 states and 976 transitions. [2019-09-08 03:54:56,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:54:56,379 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 976 transitions. [2019-09-08 03:54:56,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 03:54:56,384 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:54:56,384 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:54:56,384 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:54:56,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:54:56,385 INFO L82 PathProgramCache]: Analyzing trace with hash 2139572274, now seen corresponding path program 1 times [2019-09-08 03:54:56,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:54:56,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:54:56,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:56,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:56,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:56,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:56,530 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-08 03:54:56,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:54:56,530 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:54:56,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:54:57,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:57,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 3318 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 03:54:57,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:54:57,132 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (17)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:54:57,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:54:57,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-08 03:54:57,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:54:57,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:54:57,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:54:57,149 INFO L87 Difference]: Start difference. First operand 648 states and 976 transitions. Second operand 9 states. [2019-09-08 03:54:58,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:54:58,465 INFO L93 Difference]: Finished difference Result 1194 states and 1862 transitions. [2019-09-08 03:54:58,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:54:58,467 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 195 [2019-09-08 03:54:58,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:54:58,472 INFO L225 Difference]: With dead ends: 1194 [2019-09-08 03:54:58,473 INFO L226 Difference]: Without dead ends: 655 [2019-09-08 03:54:58,476 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 194 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:54:58,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2019-09-08 03:54:58,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2019-09-08 03:54:58,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-09-08 03:54:58,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 983 transitions. [2019-09-08 03:54:58,500 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 983 transitions. Word has length 195 [2019-09-08 03:54:58,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:54:58,500 INFO L475 AbstractCegarLoop]: Abstraction has 655 states and 983 transitions. [2019-09-08 03:54:58,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:54:58,501 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 983 transitions. [2019-09-08 03:54:58,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-09-08 03:54:58,504 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:54:58,505 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:54:58,505 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:54:58,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:54:58,505 INFO L82 PathProgramCache]: Analyzing trace with hash 711223846, now seen corresponding path program 1 times [2019-09-08 03:54:58,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:54:58,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:54:58,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:58,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:58,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:58,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:58,716 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-08 03:54:58,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:54:58,717 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:54:58,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:59,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:59,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 3320 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 03:54:59,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:54:59,337 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-08 03:54:59,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:54:59,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-09-08 03:54:59,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 03:54:59,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 03:54:59,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:54:59,346 INFO L87 Difference]: Start difference. First operand 655 states and 983 transitions. Second operand 14 states. [2019-09-08 03:55:11,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:55:11,658 INFO L93 Difference]: Finished difference Result 1875 states and 2927 transitions. [2019-09-08 03:55:11,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 03:55:11,658 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 197 [2019-09-08 03:55:11,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:55:11,669 INFO L225 Difference]: With dead ends: 1875 [2019-09-08 03:55:11,670 INFO L226 Difference]: Without dead ends: 1329 [2019-09-08 03:55:11,674 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 215 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=196, Invalid=994, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 03:55:11,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2019-09-08 03:55:11,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1273. [2019-09-08 03:55:11,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1273 states. [2019-09-08 03:55:11,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1273 states to 1273 states and 1968 transitions. [2019-09-08 03:55:11,750 INFO L78 Accepts]: Start accepts. Automaton has 1273 states and 1968 transitions. Word has length 197 [2019-09-08 03:55:11,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:55:11,751 INFO L475 AbstractCegarLoop]: Abstraction has 1273 states and 1968 transitions. [2019-09-08 03:55:11,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 03:55:11,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1273 states and 1968 transitions. [2019-09-08 03:55:11,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-08 03:55:11,759 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:55:11,760 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:55:11,760 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:55:11,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:55:11,761 INFO L82 PathProgramCache]: Analyzing trace with hash -797956773, now seen corresponding path program 1 times [2019-09-08 03:55:11,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:55:11,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:55:11,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:11,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:55:11,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:11,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:11,933 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-08 03:55:11,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:55:11,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:55:11,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:55:11,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:55:11,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:55:11,934 INFO L87 Difference]: Start difference. First operand 1273 states and 1968 transitions. Second operand 9 states. [2019-09-08 03:55:12,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:55:12,126 INFO L93 Difference]: Finished difference Result 1826 states and 2837 transitions. [2019-09-08 03:55:12,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 03:55:12,127 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 205 [2019-09-08 03:55:12,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:55:12,131 INFO L225 Difference]: With dead ends: 1826 [2019-09-08 03:55:12,132 INFO L226 Difference]: Without dead ends: 651 [2019-09-08 03:55:12,138 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 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 03:55:12,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-09-08 03:55:12,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2019-09-08 03:55:12,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-09-08 03:55:12,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 972 transitions. [2019-09-08 03:55:12,169 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 972 transitions. Word has length 205 [2019-09-08 03:55:12,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:55:12,170 INFO L475 AbstractCegarLoop]: Abstraction has 651 states and 972 transitions. [2019-09-08 03:55:12,170 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:55:12,170 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 972 transitions. [2019-09-08 03:55:12,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-09-08 03:55:12,175 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:55:12,175 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:55:12,175 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:55:12,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:55:12,176 INFO L82 PathProgramCache]: Analyzing trace with hash -236683140, now seen corresponding path program 1 times [2019-09-08 03:55:12,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:55:12,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:55:12,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:12,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:55:12,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:12,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:12,372 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-09-08 03:55:12,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:55:12,372 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:55:12,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:55:12,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:12,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 3355 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 03:55:12,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:55:12,941 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 03:55:12,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:55:12,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2019-09-08 03:55:12,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 03:55:12,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 03:55:12,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:55:12,961 INFO L87 Difference]: Start difference. First operand 651 states and 972 transitions. Second operand 14 states. [2019-09-08 03:55:18,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:55:18,820 INFO L93 Difference]: Finished difference Result 1243 states and 1917 transitions. [2019-09-08 03:55:18,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 03:55:18,821 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 209 [2019-09-08 03:55:18,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:55:18,825 INFO L225 Difference]: With dead ends: 1243 [2019-09-08 03:55:18,825 INFO L226 Difference]: Without dead ends: 699 [2019-09-08 03:55:18,828 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2019-09-08 03:55:18,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2019-09-08 03:55:18,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 662. [2019-09-08 03:55:18,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2019-09-08 03:55:18,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 987 transitions. [2019-09-08 03:55:18,860 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 987 transitions. Word has length 209 [2019-09-08 03:55:18,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:55:18,861 INFO L475 AbstractCegarLoop]: Abstraction has 662 states and 987 transitions. [2019-09-08 03:55:18,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 03:55:18,861 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 987 transitions. [2019-09-08 03:55:18,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-09-08 03:55:18,864 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:55:18,864 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:55:18,865 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:55:18,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:55:18,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1782908158, now seen corresponding path program 1 times [2019-09-08 03:55:18,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:55:18,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:55:18,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:18,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:55:18,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:18,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:19,013 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-09-08 03:55:19,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:55:19,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 03:55:19,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 03:55:19,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 03:55:19,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 03:55:19,015 INFO L87 Difference]: Start difference. First operand 662 states and 987 transitions. Second operand 5 states. [2019-09-08 03:55:21,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:55:21,669 INFO L93 Difference]: Finished difference Result 1646 states and 2495 transitions. [2019-09-08 03:55:21,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:55:21,670 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 216 [2019-09-08 03:55:21,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:55:21,676 INFO L225 Difference]: With dead ends: 1646 [2019-09-08 03:55:21,676 INFO L226 Difference]: Without dead ends: 1091 [2019-09-08 03:55:21,679 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:55:21,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states. [2019-09-08 03:55:21,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 1059. [2019-09-08 03:55:21,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1059 states. [2019-09-08 03:55:21,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1573 transitions. [2019-09-08 03:55:21,728 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 1573 transitions. Word has length 216 [2019-09-08 03:55:21,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:55:21,729 INFO L475 AbstractCegarLoop]: Abstraction has 1059 states and 1573 transitions. [2019-09-08 03:55:21,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 03:55:21,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1573 transitions. [2019-09-08 03:55:21,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-09-08 03:55:21,732 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:55:21,733 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:55:21,733 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:55:21,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:55:21,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1290281984, now seen corresponding path program 1 times [2019-09-08 03:55:21,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:55:21,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:55:21,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:21,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:55:21,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:21,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:22,079 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-08 03:55:22,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:55:22,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 03:55:22,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 03:55:22,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 03:55:22,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:55:22,081 INFO L87 Difference]: Start difference. First operand 1059 states and 1573 transitions. Second operand 11 states. [2019-09-08 03:55:26,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:55:26,952 INFO L93 Difference]: Finished difference Result 2003 states and 3030 transitions. [2019-09-08 03:55:26,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 03:55:26,953 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 216 [2019-09-08 03:55:26,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:55:26,959 INFO L225 Difference]: With dead ends: 2003 [2019-09-08 03:55:26,959 INFO L226 Difference]: Without dead ends: 1055 [2019-09-08 03:55:26,964 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-09-08 03:55:26,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2019-09-08 03:55:27,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 1055. [2019-09-08 03:55:27,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1055 states. [2019-09-08 03:55:27,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 1565 transitions. [2019-09-08 03:55:27,013 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 1565 transitions. Word has length 216 [2019-09-08 03:55:27,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:55:27,013 INFO L475 AbstractCegarLoop]: Abstraction has 1055 states and 1565 transitions. [2019-09-08 03:55:27,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 03:55:27,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1565 transitions. [2019-09-08 03:55:27,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-08 03:55:27,017 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:55:27,017 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:55:27,018 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:55:27,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:55:27,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1913498149, now seen corresponding path program 1 times [2019-09-08 03:55:27,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:55:27,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:55:27,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:27,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:55:27,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:27,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:27,193 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-08 03:55:27,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:55:27,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:55:27,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:55:27,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:55:27,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:55:27,195 INFO L87 Difference]: Start difference. First operand 1055 states and 1565 transitions. Second operand 9 states. [2019-09-08 03:55:32,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:55:32,935 INFO L93 Difference]: Finished difference Result 3331 states and 5092 transitions. [2019-09-08 03:55:32,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 03:55:32,935 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 218 [2019-09-08 03:55:32,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:55:32,951 INFO L225 Difference]: With dead ends: 3331 [2019-09-08 03:55:32,951 INFO L226 Difference]: Without dead ends: 2387 [2019-09-08 03:55:32,956 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2019-09-08 03:55:32,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2387 states. [2019-09-08 03:55:33,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2387 to 2326. [2019-09-08 03:55:33,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2326 states. [2019-09-08 03:55:33,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 3524 transitions. [2019-09-08 03:55:33,070 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 3524 transitions. Word has length 218 [2019-09-08 03:55:33,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:55:33,070 INFO L475 AbstractCegarLoop]: Abstraction has 2326 states and 3524 transitions. [2019-09-08 03:55:33,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:55:33,070 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 3524 transitions. [2019-09-08 03:55:33,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-09-08 03:55:33,074 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:55:33,074 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:55:33,075 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:55:33,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:55:33,075 INFO L82 PathProgramCache]: Analyzing trace with hash -826821457, now seen corresponding path program 1 times [2019-09-08 03:55:33,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:55:33,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:55:33,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:33,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:55:33,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:33,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:33,313 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-08 03:55:33,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:55:33,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:55:33,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:55:33,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:55:33,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:55:33,316 INFO L87 Difference]: Start difference. First operand 2326 states and 3524 transitions. Second operand 7 states. [2019-09-08 03:55:33,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:55:33,463 INFO L93 Difference]: Finished difference Result 4627 states and 7061 transitions. [2019-09-08 03:55:33,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:55:33,464 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 223 [2019-09-08 03:55:33,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:55:33,491 INFO L225 Difference]: With dead ends: 4627 [2019-09-08 03:55:33,491 INFO L226 Difference]: Without dead ends: 2412 [2019-09-08 03:55:33,501 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:55:33,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2412 states. [2019-09-08 03:55:33,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2412 to 2368. [2019-09-08 03:55:33,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2368 states. [2019-09-08 03:55:33,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2368 states to 2368 states and 3572 transitions. [2019-09-08 03:55:33,628 INFO L78 Accepts]: Start accepts. Automaton has 2368 states and 3572 transitions. Word has length 223 [2019-09-08 03:55:33,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:55:33,629 INFO L475 AbstractCegarLoop]: Abstraction has 2368 states and 3572 transitions. [2019-09-08 03:55:33,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:55:33,629 INFO L276 IsEmpty]: Start isEmpty. Operand 2368 states and 3572 transitions. [2019-09-08 03:55:33,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-09-08 03:55:33,633 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:55:33,635 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:55:33,635 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:55:33,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:55:33,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1590684439, now seen corresponding path program 1 times [2019-09-08 03:55:33,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:55:33,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:55:33,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:33,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:55:33,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:33,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:33,859 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-08 03:55:33,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:55:33,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 03:55:33,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:55:33,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:55:33,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:55:33,861 INFO L87 Difference]: Start difference. First operand 2368 states and 3572 transitions. Second operand 8 states. [2019-09-08 03:55:38,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:55:38,649 INFO L93 Difference]: Finished difference Result 7185 states and 11040 transitions. [2019-09-08 03:55:38,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:55:38,649 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 227 [2019-09-08 03:55:38,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:55:38,672 INFO L225 Difference]: With dead ends: 7185 [2019-09-08 03:55:38,672 INFO L226 Difference]: Without dead ends: 4918 [2019-09-08 03:55:38,683 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:55:38,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4918 states. [2019-09-08 03:55:38,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4918 to 4882. [2019-09-08 03:55:38,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4882 states. [2019-09-08 03:55:38,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4882 states to 4882 states and 7383 transitions. [2019-09-08 03:55:38,906 INFO L78 Accepts]: Start accepts. Automaton has 4882 states and 7383 transitions. Word has length 227 [2019-09-08 03:55:38,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:55:38,907 INFO L475 AbstractCegarLoop]: Abstraction has 4882 states and 7383 transitions. [2019-09-08 03:55:38,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 03:55:38,908 INFO L276 IsEmpty]: Start isEmpty. Operand 4882 states and 7383 transitions. [2019-09-08 03:55:38,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-08 03:55:38,912 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:55:38,912 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:55:38,912 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:55:38,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:55:38,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1619216279, now seen corresponding path program 1 times [2019-09-08 03:55:38,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:55:38,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:55:38,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:38,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:55:38,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:38,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:39,100 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-08 03:55:39,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:55:39,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:55:39,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:55:39,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:55:39,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:55:39,104 INFO L87 Difference]: Start difference. First operand 4882 states and 7383 transitions. Second operand 9 states. [2019-09-08 03:55:39,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:55:39,497 INFO L93 Difference]: Finished difference Result 9787 states and 15174 transitions. [2019-09-08 03:55:39,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:55:39,498 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 230 [2019-09-08 03:55:39,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:55:39,532 INFO L225 Difference]: With dead ends: 9787 [2019-09-08 03:55:39,533 INFO L226 Difference]: Without dead ends: 4882 [2019-09-08 03:55:39,550 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 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 03:55:39,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4882 states. [2019-09-08 03:55:39,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4882 to 4882. [2019-09-08 03:55:39,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4882 states. [2019-09-08 03:55:39,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4882 states to 4882 states and 7295 transitions. [2019-09-08 03:55:39,748 INFO L78 Accepts]: Start accepts. Automaton has 4882 states and 7295 transitions. Word has length 230 [2019-09-08 03:55:39,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:55:39,749 INFO L475 AbstractCegarLoop]: Abstraction has 4882 states and 7295 transitions. [2019-09-08 03:55:39,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:55:39,749 INFO L276 IsEmpty]: Start isEmpty. Operand 4882 states and 7295 transitions. [2019-09-08 03:55:39,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-09-08 03:55:39,753 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:55:39,753 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:55:39,754 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:55:39,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:55:39,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1095513292, now seen corresponding path program 1 times [2019-09-08 03:55:39,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:55:39,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:55:39,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:39,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:55:39,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:39,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:39,915 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-09-08 03:55:39,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:55:39,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:55:39,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:55:39,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:55:39,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:55:39,916 INFO L87 Difference]: Start difference. First operand 4882 states and 7295 transitions. Second operand 7 states. [2019-09-08 03:55:44,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:55:44,328 INFO L93 Difference]: Finished difference Result 9494 states and 14311 transitions. [2019-09-08 03:55:44,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 03:55:44,329 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 235 [2019-09-08 03:55:44,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:55:44,356 INFO L225 Difference]: With dead ends: 9494 [2019-09-08 03:55:44,357 INFO L226 Difference]: Without dead ends: 5229 [2019-09-08 03:55:44,370 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-09-08 03:55:44,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5229 states. [2019-09-08 03:55:44,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5229 to 5114. [2019-09-08 03:55:44,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5114 states. [2019-09-08 03:55:44,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5114 states to 5114 states and 7608 transitions. [2019-09-08 03:55:44,602 INFO L78 Accepts]: Start accepts. Automaton has 5114 states and 7608 transitions. Word has length 235 [2019-09-08 03:55:44,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:55:44,603 INFO L475 AbstractCegarLoop]: Abstraction has 5114 states and 7608 transitions. [2019-09-08 03:55:44,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:55:44,603 INFO L276 IsEmpty]: Start isEmpty. Operand 5114 states and 7608 transitions. [2019-09-08 03:55:44,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 03:55:44,609 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:55:44,610 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:55:44,610 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:55:44,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:55:44,611 INFO L82 PathProgramCache]: Analyzing trace with hash -567335861, now seen corresponding path program 1 times [2019-09-08 03:55:44,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:55:44,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:55:44,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:44,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:55:44,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:44,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:44,770 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-09-08 03:55:44,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:55:44,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:55:44,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:55:44,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:55:44,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:55:44,772 INFO L87 Difference]: Start difference. First operand 5114 states and 7608 transitions. Second operand 6 states. [2019-09-08 03:55:45,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:55:45,024 INFO L93 Difference]: Finished difference Result 11325 states and 16991 transitions. [2019-09-08 03:55:45,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:55:45,025 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 240 [2019-09-08 03:55:45,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:55:45,057 INFO L225 Difference]: With dead ends: 11325 [2019-09-08 03:55:45,058 INFO L226 Difference]: Without dead ends: 6828 [2019-09-08 03:55:45,070 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:55:45,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6828 states. [2019-09-08 03:55:45,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6828 to 6251. [2019-09-08 03:55:45,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6251 states. [2019-09-08 03:55:45,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6251 states to 6251 states and 9306 transitions. [2019-09-08 03:55:45,438 INFO L78 Accepts]: Start accepts. Automaton has 6251 states and 9306 transitions. Word has length 240 [2019-09-08 03:55:45,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:55:45,439 INFO L475 AbstractCegarLoop]: Abstraction has 6251 states and 9306 transitions. [2019-09-08 03:55:45,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:55:45,439 INFO L276 IsEmpty]: Start isEmpty. Operand 6251 states and 9306 transitions. [2019-09-08 03:55:45,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 03:55:45,443 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:55:45,443 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:55:45,444 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:55:45,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:55:45,444 INFO L82 PathProgramCache]: Analyzing trace with hash 92195661, now seen corresponding path program 1 times [2019-09-08 03:55:45,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:55:45,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:55:45,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:45,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:55:45,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:45,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:45,627 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-09-08 03:55:45,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:55:45,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 03:55:45,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:55:45,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:55:45,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:55:45,629 INFO L87 Difference]: Start difference. First operand 6251 states and 9306 transitions. Second operand 8 states. [2019-09-08 03:55:45,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:55:45,872 INFO L93 Difference]: Finished difference Result 6274 states and 9335 transitions. [2019-09-08 03:55:45,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:55:45,873 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 240 [2019-09-08 03:55:45,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:55:45,904 INFO L225 Difference]: With dead ends: 6274 [2019-09-08 03:55:45,905 INFO L226 Difference]: Without dead ends: 6257 [2019-09-08 03:55:45,909 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:55:45,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6257 states. [2019-09-08 03:55:46,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6257 to 6251. [2019-09-08 03:55:46,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6251 states. [2019-09-08 03:55:46,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6251 states to 6251 states and 9295 transitions. [2019-09-08 03:55:46,183 INFO L78 Accepts]: Start accepts. Automaton has 6251 states and 9295 transitions. Word has length 240 [2019-09-08 03:55:46,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:55:46,183 INFO L475 AbstractCegarLoop]: Abstraction has 6251 states and 9295 transitions. [2019-09-08 03:55:46,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 03:55:46,184 INFO L276 IsEmpty]: Start isEmpty. Operand 6251 states and 9295 transitions. [2019-09-08 03:55:46,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-08 03:55:46,189 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:55:46,189 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:55:46,189 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:55:46,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:55:46,190 INFO L82 PathProgramCache]: Analyzing trace with hash 972373987, now seen corresponding path program 1 times [2019-09-08 03:55:46,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:55:46,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:55:46,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:46,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:55:46,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:46,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:46,428 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-09-08 03:55:46,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:55:46,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:55:46,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:55:46,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:55:46,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:55:46,430 INFO L87 Difference]: Start difference. First operand 6251 states and 9295 transitions. Second operand 9 states. [2019-09-08 03:55:49,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:55:49,917 INFO L93 Difference]: Finished difference Result 12407 states and 18527 transitions. [2019-09-08 03:55:49,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:55:49,918 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 258 [2019-09-08 03:55:49,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:55:49,947 INFO L225 Difference]: With dead ends: 12407 [2019-09-08 03:55:49,947 INFO L226 Difference]: Without dead ends: 6275 [2019-09-08 03:55:49,963 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:55:49,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6275 states. [2019-09-08 03:55:50,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6275 to 6251. [2019-09-08 03:55:50,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6251 states. [2019-09-08 03:55:50,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6251 states to 6251 states and 9284 transitions. [2019-09-08 03:55:50,237 INFO L78 Accepts]: Start accepts. Automaton has 6251 states and 9284 transitions. Word has length 258 [2019-09-08 03:55:50,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:55:50,238 INFO L475 AbstractCegarLoop]: Abstraction has 6251 states and 9284 transitions. [2019-09-08 03:55:50,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:55:50,238 INFO L276 IsEmpty]: Start isEmpty. Operand 6251 states and 9284 transitions. [2019-09-08 03:55:50,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-09-08 03:55:50,242 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:55:50,242 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:55:50,243 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:55:50,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:55:50,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1016479574, now seen corresponding path program 1 times [2019-09-08 03:55:50,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:55:50,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:55:50,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:50,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:55:50,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:50,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:50,417 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-08 03:55:50,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:55:50,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:55:50,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:55:50,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:55:50,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:55:50,419 INFO L87 Difference]: Start difference. First operand 6251 states and 9284 transitions. Second operand 6 states. [2019-09-08 03:55:54,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:55:54,809 INFO L93 Difference]: Finished difference Result 19421 states and 29903 transitions. [2019-09-08 03:55:54,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:55:54,809 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 259 [2019-09-08 03:55:54,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:55:54,872 INFO L225 Difference]: With dead ends: 19421 [2019-09-08 03:55:54,872 INFO L226 Difference]: Without dead ends: 13289 [2019-09-08 03:55:54,894 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:55:54,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13289 states. [2019-09-08 03:55:55,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13289 to 12772. [2019-09-08 03:55:55,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12772 states. [2019-09-08 03:55:55,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12772 states to 12772 states and 19220 transitions. [2019-09-08 03:55:55,541 INFO L78 Accepts]: Start accepts. Automaton has 12772 states and 19220 transitions. Word has length 259 [2019-09-08 03:55:55,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:55:55,541 INFO L475 AbstractCegarLoop]: Abstraction has 12772 states and 19220 transitions. [2019-09-08 03:55:55,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:55:55,541 INFO L276 IsEmpty]: Start isEmpty. Operand 12772 states and 19220 transitions. [2019-09-08 03:55:55,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-09-08 03:55:55,547 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:55:55,547 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:55:55,548 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:55:55,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:55:55,548 INFO L82 PathProgramCache]: Analyzing trace with hash 904736067, now seen corresponding path program 1 times [2019-09-08 03:55:55,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:55:55,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:55:55,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:55,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:55:55,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:55,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:55,724 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-08 03:55:55,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:55:55,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:55:55,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:55:55,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:55:55,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:55:55,726 INFO L87 Difference]: Start difference. First operand 12772 states and 19220 transitions. Second operand 4 states. [2019-09-08 03:55:57,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:55:57,399 INFO L93 Difference]: Finished difference Result 25328 states and 38505 transitions. [2019-09-08 03:55:57,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 03:55:57,399 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 267 [2019-09-08 03:55:57,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:55:57,443 INFO L225 Difference]: With dead ends: 25328 [2019-09-08 03:55:57,444 INFO L226 Difference]: Without dead ends: 12663 [2019-09-08 03:55:57,480 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 03:55:57,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12663 states. [2019-09-08 03:55:57,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12663 to 12663. [2019-09-08 03:55:57,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12663 states. [2019-09-08 03:55:58,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12663 states to 12663 states and 19002 transitions. [2019-09-08 03:55:58,005 INFO L78 Accepts]: Start accepts. Automaton has 12663 states and 19002 transitions. Word has length 267 [2019-09-08 03:55:58,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:55:58,006 INFO L475 AbstractCegarLoop]: Abstraction has 12663 states and 19002 transitions. [2019-09-08 03:55:58,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:55:58,006 INFO L276 IsEmpty]: Start isEmpty. Operand 12663 states and 19002 transitions. [2019-09-08 03:55:58,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-09-08 03:55:58,012 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:55:58,012 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:55:58,012 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:55:58,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:55:58,013 INFO L82 PathProgramCache]: Analyzing trace with hash -2018258180, now seen corresponding path program 1 times [2019-09-08 03:55:58,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:55:58,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:55:58,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:58,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:55:58,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:58,336 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-09-08 03:55:58,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:55:58,336 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:55:58,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:55:58,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:58,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 3524 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-08 03:55:58,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:55:58,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:55:58,940 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-08 03:55:58,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:55:58,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 18 [2019-09-08 03:55:58,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 03:55:58,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 03:55:58,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2019-09-08 03:55:58,949 INFO L87 Difference]: Start difference. First operand 12663 states and 19002 transitions. Second operand 18 states. [2019-09-08 03:56:08,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:56:08,540 INFO L93 Difference]: Finished difference Result 25457 states and 38202 transitions. [2019-09-08 03:56:08,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-08 03:56:08,540 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 268 [2019-09-08 03:56:08,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:56:08,580 INFO L225 Difference]: With dead ends: 25457 [2019-09-08 03:56:08,581 INFO L226 Difference]: Without dead ends: 12899 [2019-09-08 03:56:08,605 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=257, Invalid=1723, Unknown=0, NotChecked=0, Total=1980 [2019-09-08 03:56:08,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12899 states. [2019-09-08 03:56:09,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12899 to 12826. [2019-09-08 03:56:09,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12826 states. [2019-09-08 03:56:09,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12826 states to 12826 states and 19134 transitions. [2019-09-08 03:56:09,097 INFO L78 Accepts]: Start accepts. Automaton has 12826 states and 19134 transitions. Word has length 268 [2019-09-08 03:56:09,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:56:09,098 INFO L475 AbstractCegarLoop]: Abstraction has 12826 states and 19134 transitions. [2019-09-08 03:56:09,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 03:56:09,098 INFO L276 IsEmpty]: Start isEmpty. Operand 12826 states and 19134 transitions. [2019-09-08 03:56:09,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2019-09-08 03:56:09,105 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:56:09,105 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 03:56:09,105 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:56:09,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:56:09,106 INFO L82 PathProgramCache]: Analyzing trace with hash -820026441, now seen corresponding path program 1 times [2019-09-08 03:56:09,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:56:09,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:56:09,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:56:09,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:56:09,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:56:09,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:56:09,377 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2019-09-08 03:56:09,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:56:09,378 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:56:09,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:56:09,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:56:09,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 4338 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:56:09,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:56:10,252 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-09-08 03:56:10,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:56:10,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2019-09-08 03:56:10,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 03:56:10,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 03:56:10,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:56:10,261 INFO L87 Difference]: Start difference. First operand 12826 states and 19134 transitions. Second operand 11 states. [2019-09-08 03:56:20,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:56:20,043 INFO L93 Difference]: Finished difference Result 26633 states and 40592 transitions. [2019-09-08 03:56:20,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 03:56:20,043 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 399 [2019-09-08 03:56:20,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:56:20,088 INFO L225 Difference]: With dead ends: 26633 [2019-09-08 03:56:20,088 INFO L226 Difference]: Without dead ends: 13918 [2019-09-08 03:56:20,111 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 413 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2019-09-08 03:56:20,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13918 states. [2019-09-08 03:56:20,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13918 to 13382. [2019-09-08 03:56:20,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13382 states. [2019-09-08 03:56:20,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13382 states to 13382 states and 20098 transitions. [2019-09-08 03:56:20,598 INFO L78 Accepts]: Start accepts. Automaton has 13382 states and 20098 transitions. Word has length 399 [2019-09-08 03:56:20,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:56:20,598 INFO L475 AbstractCegarLoop]: Abstraction has 13382 states and 20098 transitions. [2019-09-08 03:56:20,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 03:56:20,598 INFO L276 IsEmpty]: Start isEmpty. Operand 13382 states and 20098 transitions. [2019-09-08 03:56:20,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2019-09-08 03:56:20,603 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:56:20,603 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 03:56:20,603 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:56:20,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:56:20,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1344665476, now seen corresponding path program 1 times [2019-09-08 03:56:20,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:56:20,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:56:20,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:56:20,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:56:20,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:56:20,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:56:20,889 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2019-09-08 03:56:20,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:56:20,890 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:56:20,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:56:21,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:56:21,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 4344 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:56:21,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:56:21,779 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-09-08 03:56:21,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:56:21,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2019-09-08 03:56:21,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:56:21,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:56:21,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:56:21,788 INFO L87 Difference]: Start difference. First operand 13382 states and 20098 transitions. Second operand 9 states. [2019-09-08 03:56:22,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:56:22,577 INFO L93 Difference]: Finished difference Result 27121 states and 41126 transitions. [2019-09-08 03:56:22,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 03:56:22,577 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 404 [2019-09-08 03:56:22,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:56:22,635 INFO L225 Difference]: With dead ends: 27121 [2019-09-08 03:56:22,635 INFO L226 Difference]: Without dead ends: 13850 [2019-09-08 03:56:22,668 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 404 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:56:22,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13850 states. [2019-09-08 03:56:23,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13850 to 13850. [2019-09-08 03:56:23,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13850 states. [2019-09-08 03:56:23,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13850 states to 13850 states and 20952 transitions. [2019-09-08 03:56:23,115 INFO L78 Accepts]: Start accepts. Automaton has 13850 states and 20952 transitions. Word has length 404 [2019-09-08 03:56:23,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:56:23,116 INFO L475 AbstractCegarLoop]: Abstraction has 13850 states and 20952 transitions. [2019-09-08 03:56:23,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:56:23,116 INFO L276 IsEmpty]: Start isEmpty. Operand 13850 states and 20952 transitions. [2019-09-08 03:56:23,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-08 03:56:23,120 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:56:23,120 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 7, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:56:23,121 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:56:23,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:56:23,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1808361886, now seen corresponding path program 1 times [2019-09-08 03:56:23,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:56:23,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:56:23,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:56:23,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:56:23,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:56:23,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:56:23,338 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-09-08 03:56:23,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:56:23,339 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:56:23,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:56:23,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:56:23,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 3605 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-08 03:56:23,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:56:24,214 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 108 proven. 10 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-09-08 03:56:24,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:56:24,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2019-09-08 03:56:24,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 03:56:24,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 03:56:24,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-09-08 03:56:24,223 INFO L87 Difference]: Start difference. First operand 13850 states and 20952 transitions. Second operand 19 states. [2019-09-08 03:56:34,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:56:34,492 INFO L93 Difference]: Finished difference Result 42172 states and 64326 transitions. [2019-09-08 03:56:34,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 03:56:34,493 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 302 [2019-09-08 03:56:34,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:56:34,636 INFO L225 Difference]: With dead ends: 42172 [2019-09-08 03:56:34,637 INFO L226 Difference]: Without dead ends: 28435 [2019-09-08 03:56:34,668 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=777, Unknown=0, NotChecked=0, Total=930 [2019-09-08 03:56:34,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28435 states. [2019-09-08 03:56:35,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28435 to 28337. [2019-09-08 03:56:35,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28337 states. [2019-09-08 03:56:35,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28337 states to 28337 states and 43270 transitions. [2019-09-08 03:56:35,684 INFO L78 Accepts]: Start accepts. Automaton has 28337 states and 43270 transitions. Word has length 302 [2019-09-08 03:56:35,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:56:35,685 INFO L475 AbstractCegarLoop]: Abstraction has 28337 states and 43270 transitions. [2019-09-08 03:56:35,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 03:56:35,685 INFO L276 IsEmpty]: Start isEmpty. Operand 28337 states and 43270 transitions. [2019-09-08 03:56:35,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2019-09-08 03:56:35,694 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:56:35,695 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 03:56:35,695 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:56:35,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:56:35,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1033858215, now seen corresponding path program 1 times [2019-09-08 03:56:35,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:56:35,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:56:35,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:56:35,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:56:35,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:56:36,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:56:36,249 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2019-09-08 03:56:36,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:56:36,251 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:56:36,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:56:36,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:56:36,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 4348 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-08 03:56:36,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:56:37,072 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2019-09-08 03:56:37,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:56:37,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-09-08 03:56:37,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 03:56:37,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 03:56:37,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-09-08 03:56:37,080 INFO L87 Difference]: Start difference. First operand 28337 states and 43270 transitions. Second operand 15 states. [2019-09-08 03:56:52,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:56:52,401 INFO L93 Difference]: Finished difference Result 89096 states and 141542 transitions. [2019-09-08 03:56:52,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-08 03:56:52,402 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 409 [2019-09-08 03:56:52,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:56:52,651 INFO L225 Difference]: With dead ends: 89096 [2019-09-08 03:56:52,651 INFO L226 Difference]: Without dead ends: 60392 [2019-09-08 03:56:52,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 431 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=407, Invalid=1573, Unknown=0, NotChecked=0, Total=1980 [2019-09-08 03:56:52,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60392 states. [2019-09-08 03:56:56,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60392 to 59010. [2019-09-08 03:56:56,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59010 states. [2019-09-08 03:56:57,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59010 states to 59010 states and 91100 transitions. [2019-09-08 03:56:57,152 INFO L78 Accepts]: Start accepts. Automaton has 59010 states and 91100 transitions. Word has length 409 [2019-09-08 03:56:57,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:56:57,152 INFO L475 AbstractCegarLoop]: Abstraction has 59010 states and 91100 transitions. [2019-09-08 03:56:57,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 03:56:57,153 INFO L276 IsEmpty]: Start isEmpty. Operand 59010 states and 91100 transitions. [2019-09-08 03:56:57,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2019-09-08 03:56:57,158 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:56:57,158 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:56:57,158 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:56:57,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:56:57,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1766120199, now seen corresponding path program 1 times [2019-09-08 03:56:57,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:56:57,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:56:57,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:56:57,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:56:57,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:56:57,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:56:57,441 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 44 proven. 15 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-08 03:56:57,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:56:57,442 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:56:57,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:56:57,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:56:57,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 4072 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 03:56:57,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:56:58,059 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2019-09-08 03:56:58,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:56:58,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2019-09-08 03:56:58,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 03:56:58,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 03:56:58,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-08 03:56:58,069 INFO L87 Difference]: Start difference. First operand 59010 states and 91100 transitions. Second operand 12 states. [2019-09-08 03:57:17,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:57:17,483 INFO L93 Difference]: Finished difference Result 205747 states and 334430 transitions. [2019-09-08 03:57:17,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 03:57:17,484 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 387 [2019-09-08 03:57:17,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:57:18,231 INFO L225 Difference]: With dead ends: 205747 [2019-09-08 03:57:18,231 INFO L226 Difference]: Without dead ends: 146476 [2019-09-08 03:57:18,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 399 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=1195, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 03:57:18,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146476 states. [2019-09-08 03:57:26,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146476 to 134610. [2019-09-08 03:57:26,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134610 states. [2019-09-08 03:57:27,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134610 states to 134610 states and 211310 transitions. [2019-09-08 03:57:27,164 INFO L78 Accepts]: Start accepts. Automaton has 134610 states and 211310 transitions. Word has length 387 [2019-09-08 03:57:27,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:57:27,164 INFO L475 AbstractCegarLoop]: Abstraction has 134610 states and 211310 transitions. [2019-09-08 03:57:27,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 03:57:27,165 INFO L276 IsEmpty]: Start isEmpty. Operand 134610 states and 211310 transitions. [2019-09-08 03:57:27,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2019-09-08 03:57:27,172 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:57:27,172 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 03:57:27,172 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:57:27,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:57:27,172 INFO L82 PathProgramCache]: Analyzing trace with hash -2137264294, now seen corresponding path program 1 times [2019-09-08 03:57:27,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:57:27,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:57:27,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:57:27,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:57:27,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:57:27,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:57:27,406 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 49 proven. 16 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-08 03:57:27,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:57:27,406 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:57:27,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:57:27,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:57:27,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 4075 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 03:57:27,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:57:28,070 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2019-09-08 03:57:28,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:57:28,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2019-09-08 03:57:28,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 03:57:28,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 03:57:28,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-08 03:57:28,079 INFO L87 Difference]: Start difference. First operand 134610 states and 211310 transitions. Second operand 12 states. [2019-09-08 03:57:52,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:57:52,819 INFO L93 Difference]: Finished difference Result 367449 states and 605833 transitions. [2019-09-08 03:57:52,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 03:57:52,819 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 390 [2019-09-08 03:57:52,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:57:53,801 INFO L225 Difference]: With dead ends: 367449 [2019-09-08 03:57:53,801 INFO L226 Difference]: Without dead ends: 232544 [2019-09-08 03:57:54,119 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 401 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=1195, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 03:57:54,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232544 states. [2019-09-08 03:58:12,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232544 to 220250. [2019-09-08 03:58:12,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220250 states. [2019-09-08 03:58:14,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220250 states to 220250 states and 351621 transitions. [2019-09-08 03:58:14,184 INFO L78 Accepts]: Start accepts. Automaton has 220250 states and 351621 transitions. Word has length 390 [2019-09-08 03:58:14,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:58:14,185 INFO L475 AbstractCegarLoop]: Abstraction has 220250 states and 351621 transitions. [2019-09-08 03:58:14,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 03:58:14,185 INFO L276 IsEmpty]: Start isEmpty. Operand 220250 states and 351621 transitions. [2019-09-08 03:58:14,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2019-09-08 03:58:14,210 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:58:14,211 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 8, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:58:14,211 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:58:14,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:58:14,212 INFO L82 PathProgramCache]: Analyzing trace with hash -638166197, now seen corresponding path program 1 times [2019-09-08 03:58:14,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:58:14,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:58:14,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:58:14,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:58:14,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:58:14,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:58:14,507 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 51 proven. 22 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2019-09-08 03:58:14,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:58:14,507 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:58:14,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:58:15,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:58:15,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 4206 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 03:58:15,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:58:15,222 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 401 trivial. 0 not checked. [2019-09-08 03:58:15,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:58:15,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2019-09-08 03:58:15,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 03:58:15,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 03:58:15,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-08 03:58:15,231 INFO L87 Difference]: Start difference. First operand 220250 states and 351621 transitions. Second operand 12 states. [2019-09-08 03:58:49,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:58:49,171 INFO L93 Difference]: Finished difference Result 510189 states and 841018 transitions. [2019-09-08 03:58:49,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 03:58:49,171 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 433 [2019-09-08 03:58:49,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:58:50,695 INFO L225 Difference]: With dead ends: 510189 [2019-09-08 03:58:50,695 INFO L226 Difference]: Without dead ends: 289584 [2019-09-08 03:58:51,206 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 443 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=1195, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 03:58:51,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289584 states. [2019-09-08 03:59:11,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289584 to 277414. [2019-09-08 03:59:11,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277414 states. [2019-09-08 03:59:13,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277414 states to 277414 states and 441755 transitions. [2019-09-08 03:59:13,463 INFO L78 Accepts]: Start accepts. Automaton has 277414 states and 441755 transitions. Word has length 433 [2019-09-08 03:59:13,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:59:13,464 INFO L475 AbstractCegarLoop]: Abstraction has 277414 states and 441755 transitions. [2019-09-08 03:59:13,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 03:59:13,464 INFO L276 IsEmpty]: Start isEmpty. Operand 277414 states and 441755 transitions. [2019-09-08 03:59:13,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2019-09-08 03:59:13,495 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:59:13,495 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:59:13,495 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:59:13,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:59:13,496 INFO L82 PathProgramCache]: Analyzing trace with hash -591223879, now seen corresponding path program 1 times [2019-09-08 03:59:13,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:59:13,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:59:13,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:59:13,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:59:13,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:59:13,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:59:13,715 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2019-09-08 03:59:13,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:59:13,715 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:59:13,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:59:14,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:59:14,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 4096 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-08 03:59:14,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:59:14,500 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2019-09-08 03:59:14,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:59:14,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2019-09-08 03:59:14,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 03:59:14,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 03:59:14,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-09-08 03:59:14,520 INFO L87 Difference]: Start difference. First operand 277414 states and 441755 transitions. Second operand 12 states. [2019-09-08 03:59:59,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:59:59,198 INFO L93 Difference]: Finished difference Result 834776 states and 1336878 transitions. [2019-09-08 03:59:59,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:59:59,199 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 396 [2019-09-08 03:59:59,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:00:02,143 INFO L225 Difference]: With dead ends: 834776 [2019-09-08 04:00:02,143 INFO L226 Difference]: Without dead ends: 557651 [2019-09-08 04:00:11,325 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 409 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2019-09-08 04:00:11,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557651 states. [2019-09-08 04:00:50,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557651 to 555902. [2019-09-08 04:00:50,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555902 states. [2019-09-08 04:00:54,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555902 states to 555902 states and 888999 transitions. [2019-09-08 04:00:54,075 INFO L78 Accepts]: Start accepts. Automaton has 555902 states and 888999 transitions. Word has length 396 [2019-09-08 04:00:54,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:00:54,076 INFO L475 AbstractCegarLoop]: Abstraction has 555902 states and 888999 transitions. [2019-09-08 04:00:54,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 04:00:54,076 INFO L276 IsEmpty]: Start isEmpty. Operand 555902 states and 888999 transitions. [2019-09-08 04:01:03,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2019-09-08 04:01:03,592 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:01:03,592 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 9, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:01:03,592 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:01:03,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:01:03,593 INFO L82 PathProgramCache]: Analyzing trace with hash 760803943, now seen corresponding path program 1 times [2019-09-08 04:01:03,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:01:03,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:01:03,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:01:03,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:01:03,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:01:03,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:01:03,982 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 54 proven. 29 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2019-09-08 04:01:03,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:01:03,982 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 04:01:03,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:01:04,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:01:04,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 4223 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 04:01:04,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:01:04,722 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 51 proven. 200 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2019-09-08 04:01:04,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 04:01:04,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 14 [2019-09-08 04:01:04,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 04:01:04,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 04:01:04,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-08 04:01:04,731 INFO L87 Difference]: Start difference. First operand 555902 states and 888999 transitions. Second operand 14 states. [2019-09-08 04:02:03,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:02:03,930 INFO L93 Difference]: Finished difference Result 1152868 states and 1874986 transitions. [2019-09-08 04:02:03,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-08 04:02:03,931 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 437 [2019-09-08 04:02:03,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:02:07,422 INFO L225 Difference]: With dead ends: 1152868 [2019-09-08 04:02:07,422 INFO L226 Difference]: Without dead ends: 596531 [2019-09-08 04:02:09,443 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 455 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=506, Invalid=2916, Unknown=0, NotChecked=0, Total=3422 [2019-09-08 04:02:09,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596531 states. [2019-09-08 04:03:08,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596531 to 571926. [2019-09-08 04:03:08,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571926 states. [2019-09-08 04:03:12,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571926 states to 571926 states and 892495 transitions. [2019-09-08 04:03:12,074 INFO L78 Accepts]: Start accepts. Automaton has 571926 states and 892495 transitions. Word has length 437 [2019-09-08 04:03:12,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:03:12,075 INFO L475 AbstractCegarLoop]: Abstraction has 571926 states and 892495 transitions. [2019-09-08 04:03:12,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 04:03:12,075 INFO L276 IsEmpty]: Start isEmpty. Operand 571926 states and 892495 transitions. [2019-09-08 04:03:12,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2019-09-08 04:03:12,101 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:03:12,101 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:03:12,101 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:03:12,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:03:12,101 INFO L82 PathProgramCache]: Analyzing trace with hash -20631851, now seen corresponding path program 1 times [2019-09-08 04:03:12,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:03:12,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:03:12,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:03:12,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:03:12,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:03:12,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:03:12,303 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-08 04:03:12,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:03:12,304 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:03:12,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:03:12,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:03:12,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 4106 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-08 04:03:12,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:03:14,336 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 196 proven. 8 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-09-08 04:03:14,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 04:03:14,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 14 [2019-09-08 04:03:14,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 04:03:14,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 04:03:14,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-09-08 04:03:14,346 INFO L87 Difference]: Start difference. First operand 571926 states and 892495 transitions. Second operand 14 states.