java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/product-lines/elevator_spec13_product24.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 11:44:50,341 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 11:44:50,343 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 11:44:50,357 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 11:44:50,358 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 11:44:50,359 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 11:44:50,360 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 11:44:50,362 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 11:44:50,364 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 11:44:50,364 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 11:44:50,365 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 11:44:50,366 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 11:44:50,367 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 11:44:50,368 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 11:44:50,369 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 11:44:50,370 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 11:44:50,370 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 11:44:50,371 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 11:44:50,373 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 11:44:50,375 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 11:44:50,376 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 11:44:50,377 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 11:44:50,378 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 11:44:50,379 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 11:44:50,381 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 11:44:50,382 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 11:44:50,382 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 11:44:50,383 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 11:44:50,383 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 11:44:50,384 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 11:44:50,384 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 11:44:50,385 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 11:44:50,386 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 11:44:50,386 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 11:44:50,387 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 11:44:50,388 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 11:44:50,388 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 11:44:50,388 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 11:44:50,389 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 11:44:50,389 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 11:44:50,390 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 11:44:50,391 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 11:44:50,414 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 11:44:50,414 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 11:44:50,416 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 11:44:50,417 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 11:44:50,417 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 11:44:50,417 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 11:44:50,417 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 11:44:50,417 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 11:44:50,418 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 11:44:50,418 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 11:44:50,419 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 11:44:50,419 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 11:44:50,419 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 11:44:50,420 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 11:44:50,420 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 11:44:50,420 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 11:44:50,420 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 11:44:50,421 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 11:44:50,421 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 11:44:50,421 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 11:44:50,421 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 11:44:50,422 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:44:50,422 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 11:44:50,422 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 11:44:50,422 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 11:44:50,423 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 11:44:50,423 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 11:44:50,423 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 11:44:50,423 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 11:44:50,472 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 11:44:50,485 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 11:44:50,488 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 11:44:50,490 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 11:44:50,490 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 11:44:50,491 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec13_product24.cil.c [2019-10-02 11:44:50,554 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb23066e8/561c7ff26abf4f6e806ee13c5054c2d8/FLAGdbe576b12 [2019-10-02 11:44:51,271 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 11:44:51,272 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec13_product24.cil.c [2019-10-02 11:44:51,292 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb23066e8/561c7ff26abf4f6e806ee13c5054c2d8/FLAGdbe576b12 [2019-10-02 11:44:51,376 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb23066e8/561c7ff26abf4f6e806ee13c5054c2d8 [2019-10-02 11:44:51,387 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 11:44:51,388 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 11:44:51,390 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 11:44:51,390 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 11:44:51,394 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 11:44:51,395 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:44:51" (1/1) ... [2019-10-02 11:44:51,398 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f77762e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:44:51, skipping insertion in model container [2019-10-02 11:44:51,398 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:44:51" (1/1) ... [2019-10-02 11:44:51,406 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 11:44:51,498 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 11:44:52,251 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:44:52,276 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 11:44:52,420 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:44:52,500 INFO L192 MainTranslator]: Completed translation [2019-10-02 11:44:52,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:44:52 WrapperNode [2019-10-02 11:44:52,500 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 11:44:52,501 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 11:44:52,501 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 11:44:52,501 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 11:44:52,513 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:44:52" (1/1) ... [2019-10-02 11:44:52,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:44:52" (1/1) ... [2019-10-02 11:44:52,551 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:44:52" (1/1) ... [2019-10-02 11:44:52,552 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:44:52" (1/1) ... [2019-10-02 11:44:52,641 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:44:52" (1/1) ... [2019-10-02 11:44:52,682 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:44:52" (1/1) ... [2019-10-02 11:44:52,692 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:44:52" (1/1) ... [2019-10-02 11:44:52,714 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 11:44:52,715 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 11:44:52,715 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 11:44:52,718 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 11:44:52,719 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:44:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:44:52,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 11:44:52,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 11:44:52,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 11:44:52,784 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 11:44:52,785 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 11:44:52,785 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 11:44:52,785 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 11:44:52,785 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 11:44:52,785 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 11:44:52,786 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 11:44:52,786 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-02 11:44:52,786 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-02 11:44:52,786 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-02 11:44:52,787 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-02 11:44:52,787 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-02 11:44:52,787 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-02 11:44:52,787 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-02 11:44:52,788 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-02 11:44:52,788 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-02 11:44:52,788 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-02 11:44:52,788 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-02 11:44:52,789 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-02 11:44:52,789 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-02 11:44:52,789 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-02 11:44:52,790 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-02 11:44:52,790 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-02 11:44:52,790 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2019-10-02 11:44:52,790 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-02 11:44:52,790 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-02 11:44:52,790 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-02 11:44:52,791 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-02 11:44:52,791 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-02 11:44:52,791 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-02 11:44:52,791 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-02 11:44:52,791 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-02 11:44:52,792 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-02 11:44:52,792 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2019-10-02 11:44:52,792 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-02 11:44:52,792 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__executivefloor [2019-10-02 11:44:52,792 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-02 11:44:52,792 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-02 11:44:52,793 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-02 11:44:52,793 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-02 11:44:52,793 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-02 11:44:52,793 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-02 11:44:52,793 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-02 11:44:52,794 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-02 11:44:52,794 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-02 11:44:52,794 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-02 11:44:52,794 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-02 11:44:52,794 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-02 11:44:52,794 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-02 11:44:52,795 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-02 11:44:52,795 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-02 11:44:52,795 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-02 11:44:52,795 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-02 11:44:52,795 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-02 11:44:52,796 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 11:44:52,796 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-02 11:44:52,796 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 11:44:52,796 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 11:44:52,796 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-02 11:44:52,796 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-02 11:44:52,797 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-02 11:44:52,797 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-02 11:44:52,797 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-02 11:44:52,797 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-02 11:44:52,797 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-02 11:44:52,798 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-02 11:44:52,798 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-02 11:44:52,798 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-02 11:44:52,798 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification13_spec__1 [2019-10-02 11:44:52,798 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification13_spec__2 [2019-10-02 11:44:52,799 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-02 11:44:52,799 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-02 11:44:52,799 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-02 11:44:52,799 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 11:44:52,799 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 11:44:52,800 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 11:44:52,800 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 11:44:52,800 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 11:44:52,800 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 11:44:52,800 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 11:44:52,800 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 11:44:52,801 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 11:44:52,801 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 11:44:52,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 11:44:52,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 11:44:52,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 11:44:52,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 11:44:52,802 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 11:44:52,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 11:44:52,802 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 11:44:52,802 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 11:44:52,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 11:44:52,802 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 11:44:52,802 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 11:44:52,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 11:44:52,803 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 11:44:52,803 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-02 11:44:52,803 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-02 11:44:52,803 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-02 11:44:52,803 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-02 11:44:52,803 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-02 11:44:52,804 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 11:44:52,804 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 11:44:52,804 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-02 11:44:52,804 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-02 11:44:52,804 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-02 11:44:52,804 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-02 11:44:52,804 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-02 11:44:52,805 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-02 11:44:52,805 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-02 11:44:52,805 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-02 11:44:52,805 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-02 11:44:52,805 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-02 11:44:52,805 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-02 11:44:52,806 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-02 11:44:52,806 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-02 11:44:52,806 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-02 11:44:52,806 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-02 11:44:52,806 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-02 11:44:52,806 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-02 11:44:52,806 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-02 11:44:52,807 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-02 11:44:52,807 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-02 11:44:52,807 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-02 11:44:52,807 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-02 11:44:52,807 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-02 11:44:52,807 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-02 11:44:52,807 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-02 11:44:52,808 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-02 11:44:52,808 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-02 11:44:52,808 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-02 11:44:52,808 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-02 11:44:52,808 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2019-10-02 11:44:52,808 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-02 11:44:52,809 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-02 11:44:52,809 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-02 11:44:52,809 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-02 11:44:52,809 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-02 11:44:52,809 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-02 11:44:52,809 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-02 11:44:52,810 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-02 11:44:52,810 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2019-10-02 11:44:52,810 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification13_spec__1 [2019-10-02 11:44:52,810 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification13_spec__2 [2019-10-02 11:44:52,810 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__executivefloor [2019-10-02 11:44:52,810 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-02 11:44:52,810 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 11:44:52,811 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-02 11:44:52,811 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-02 11:44:52,811 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-02 11:44:52,811 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-02 11:44:52,811 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-02 11:44:52,811 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-02 11:44:52,811 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-02 11:44:52,812 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-02 11:44:52,812 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-02 11:44:52,812 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-02 11:44:52,812 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-02 11:44:52,812 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 11:44:52,812 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-02 11:44:52,812 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 11:44:52,813 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 11:44:52,813 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 11:44:52,813 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 11:44:52,813 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 11:44:52,813 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-02 11:44:52,813 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-02 11:44:52,813 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-02 11:44:52,813 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 11:44:52,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 11:44:52,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 11:44:52,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 11:44:55,416 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 11:44:55,417 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-02 11:44:55,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:44:55 BoogieIcfgContainer [2019-10-02 11:44:55,419 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 11:44:55,423 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 11:44:55,423 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 11:44:55,426 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 11:44:55,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 11:44:51" (1/3) ... [2019-10-02 11:44:55,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e4f525f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:44:55, skipping insertion in model container [2019-10-02 11:44:55,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:44:52" (2/3) ... [2019-10-02 11:44:55,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e4f525f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:44:55, skipping insertion in model container [2019-10-02 11:44:55,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:44:55" (3/3) ... [2019-10-02 11:44:55,431 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec13_product24.cil.c [2019-10-02 11:44:55,442 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 11:44:55,454 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 11:44:55,474 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 11:44:55,523 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 11:44:55,524 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 11:44:55,524 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 11:44:55,525 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 11:44:55,525 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 11:44:55,525 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 11:44:55,525 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 11:44:55,525 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 11:44:55,525 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 11:44:55,568 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states. [2019-10-02 11:44:55,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-02 11:44:55,605 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:55,607 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:44:55,610 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:55,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:55,617 INFO L82 PathProgramCache]: Analyzing trace with hash -270219278, now seen corresponding path program 1 times [2019-10-02 11:44:55,618 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:55,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:55,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:55,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:55,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:56,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:56,500 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-02 11:44:56,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:44:56,502 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:44:56,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:57,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:57,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 2890 conjuncts, 1 conjunts are in the unsatisfiable core [2019-10-02 11:44:57,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:44:57,264 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-02 11:44:57,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:44:57,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 7 [2019-10-02 11:44:57,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:44:57,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:44:57,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:44:57,299 INFO L87 Difference]: Start difference. First operand 835 states. Second operand 7 states. [2019-10-02 11:44:57,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:57,597 INFO L93 Difference]: Finished difference Result 1366 states and 2194 transitions. [2019-10-02 11:44:57,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:44:57,599 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2019-10-02 11:44:57,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:57,635 INFO L225 Difference]: With dead ends: 1366 [2019-10-02 11:44:57,635 INFO L226 Difference]: Without dead ends: 686 [2019-10-02 11:44:57,648 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:44:57,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2019-10-02 11:44:57,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 686. [2019-10-02 11:44:57,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2019-10-02 11:44:57,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 1078 transitions. [2019-10-02 11:44:57,792 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 1078 transitions. Word has length 113 [2019-10-02 11:44:57,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:44:57,793 INFO L475 AbstractCegarLoop]: Abstraction has 686 states and 1078 transitions. [2019-10-02 11:44:57,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:44:57,795 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 1078 transitions. [2019-10-02 11:44:57,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-02 11:44:57,801 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:57,801 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:44:57,802 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:57,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:57,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1841317292, now seen corresponding path program 1 times [2019-10-02 11:44:57,803 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:57,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:57,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:57,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:57,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:57,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:58,023 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-02 11:44:58,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:44:58,023 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:44:58,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:58,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:58,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 2886 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 11:44:58,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:44:58,738 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-02 11:44:58,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:44:58,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-10-02 11:44:58,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 11:44:58,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 11:44:58,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:44:58,757 INFO L87 Difference]: Start difference. First operand 686 states and 1078 transitions. Second operand 12 states. [2019-10-02 11:44:59,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:59,008 INFO L93 Difference]: Finished difference Result 1353 states and 2141 transitions. [2019-10-02 11:44:59,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:44:59,016 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 115 [2019-10-02 11:44:59,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:59,026 INFO L225 Difference]: With dead ends: 1353 [2019-10-02 11:44:59,026 INFO L226 Difference]: Without dead ends: 695 [2019-10-02 11:44:59,033 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-10-02 11:44:59,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2019-10-02 11:44:59,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 693. [2019-10-02 11:44:59,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 693 states. [2019-10-02 11:44:59,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 1090 transitions. [2019-10-02 11:44:59,113 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 1090 transitions. Word has length 115 [2019-10-02 11:44:59,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:44:59,114 INFO L475 AbstractCegarLoop]: Abstraction has 693 states and 1090 transitions. [2019-10-02 11:44:59,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 11:44:59,114 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 1090 transitions. [2019-10-02 11:44:59,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-02 11:44:59,117 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:59,117 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:44:59,117 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:59,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:59,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1924153805, now seen corresponding path program 1 times [2019-10-02 11:44:59,118 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:59,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:59,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:59,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:59,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:59,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:59,300 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-02 11:44:59,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:44:59,301 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:44:59,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:59,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:59,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 2887 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 11:44:59,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:44:59,915 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-02 11:44:59,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:44:59,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 11:44:59,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:44:59,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:44:59,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:44:59,926 INFO L87 Difference]: Start difference. First operand 693 states and 1090 transitions. Second operand 6 states. [2019-10-02 11:45:00,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:00,084 INFO L93 Difference]: Finished difference Result 1365 states and 2161 transitions. [2019-10-02 11:45:00,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:45:00,084 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 116 [2019-10-02 11:45:00,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:00,091 INFO L225 Difference]: With dead ends: 1365 [2019-10-02 11:45:00,092 INFO L226 Difference]: Without dead ends: 694 [2019-10-02 11:45:00,096 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:45:00,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2019-10-02 11:45:00,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 694. [2019-10-02 11:45:00,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2019-10-02 11:45:00,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1086 transitions. [2019-10-02 11:45:00,128 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1086 transitions. Word has length 116 [2019-10-02 11:45:00,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:00,129 INFO L475 AbstractCegarLoop]: Abstraction has 694 states and 1086 transitions. [2019-10-02 11:45:00,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:45:00,129 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1086 transitions. [2019-10-02 11:45:00,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-02 11:45:00,132 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:00,132 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:45:00,132 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:00,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:00,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1282814176, now seen corresponding path program 1 times [2019-10-02 11:45:00,133 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:00,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:00,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:00,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:00,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:00,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:00,267 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-02 11:45:00,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:45:00,268 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:45:00,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:00,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:00,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 2888 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 11:45:00,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:45:00,929 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-02 11:45:00,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:45:00,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-10-02 11:45:00,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 11:45:00,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 11:45:00,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:45:00,941 INFO L87 Difference]: Start difference. First operand 694 states and 1086 transitions. Second operand 12 states. [2019-10-02 11:45:01,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:01,166 INFO L93 Difference]: Finished difference Result 1358 states and 2143 transitions. [2019-10-02 11:45:01,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:45:01,166 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 117 [2019-10-02 11:45:01,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:01,174 INFO L225 Difference]: With dead ends: 1358 [2019-10-02 11:45:01,174 INFO L226 Difference]: Without dead ends: 697 [2019-10-02 11:45:01,178 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:45:01,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2019-10-02 11:45:01,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 694. [2019-10-02 11:45:01,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2019-10-02 11:45:01,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1086 transitions. [2019-10-02 11:45:01,213 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1086 transitions. Word has length 117 [2019-10-02 11:45:01,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:01,214 INFO L475 AbstractCegarLoop]: Abstraction has 694 states and 1086 transitions. [2019-10-02 11:45:01,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 11:45:01,214 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1086 transitions. [2019-10-02 11:45:01,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-02 11:45:01,216 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:01,217 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:45:01,217 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:01,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:01,217 INFO L82 PathProgramCache]: Analyzing trace with hash 434685461, now seen corresponding path program 1 times [2019-10-02 11:45:01,218 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:01,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:01,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:01,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:01,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:01,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:01,360 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-02 11:45:01,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:45:01,361 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:45:01,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:01,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:01,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 2889 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 11:45:01,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:45:01,944 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:45:01,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:45:01,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-10-02 11:45:01,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 11:45:01,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 11:45:01,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:45:01,956 INFO L87 Difference]: Start difference. First operand 694 states and 1086 transitions. Second operand 12 states. [2019-10-02 11:45:02,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:02,157 INFO L93 Difference]: Finished difference Result 1358 states and 2143 transitions. [2019-10-02 11:45:02,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:45:02,158 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 118 [2019-10-02 11:45:02,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:02,164 INFO L225 Difference]: With dead ends: 1358 [2019-10-02 11:45:02,164 INFO L226 Difference]: Without dead ends: 697 [2019-10-02 11:45:02,168 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:45:02,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2019-10-02 11:45:02,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 694. [2019-10-02 11:45:02,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2019-10-02 11:45:02,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1086 transitions. [2019-10-02 11:45:02,226 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1086 transitions. Word has length 118 [2019-10-02 11:45:02,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:02,228 INFO L475 AbstractCegarLoop]: Abstraction has 694 states and 1086 transitions. [2019-10-02 11:45:02,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 11:45:02,228 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1086 transitions. [2019-10-02 11:45:02,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-02 11:45:02,233 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:02,233 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:45:02,234 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:02,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:02,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1948717148, now seen corresponding path program 1 times [2019-10-02 11:45:02,234 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:02,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:02,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:02,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:02,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:02,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:02,364 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-02 11:45:02,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:45:02,365 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:45:02,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:02,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:02,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 2890 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 11:45:02,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:45:02,910 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Stream closed [2019-10-02 11:45:02,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:45:02,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2019-10-02 11:45:02,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:45:02,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:45:02,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:45:02,922 INFO L87 Difference]: Start difference. First operand 694 states and 1086 transitions. Second operand 9 states. [2019-10-02 11:45:03,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:03,263 INFO L93 Difference]: Finished difference Result 1372 states and 2171 transitions. [2019-10-02 11:45:03,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:45:03,264 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-10-02 11:45:03,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:03,269 INFO L225 Difference]: With dead ends: 1372 [2019-10-02 11:45:03,269 INFO L226 Difference]: Without dead ends: 711 [2019-10-02 11:45:03,274 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:45:03,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-10-02 11:45:03,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 708. [2019-10-02 11:45:03,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2019-10-02 11:45:03,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1104 transitions. [2019-10-02 11:45:03,299 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 1104 transitions. Word has length 119 [2019-10-02 11:45:03,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:03,300 INFO L475 AbstractCegarLoop]: Abstraction has 708 states and 1104 transitions. [2019-10-02 11:45:03,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:45:03,300 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 1104 transitions. [2019-10-02 11:45:03,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-02 11:45:03,302 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:03,302 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:45:03,303 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:03,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:03,303 INFO L82 PathProgramCache]: Analyzing trace with hash -2002088779, now seen corresponding path program 1 times [2019-10-02 11:45:03,303 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:03,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:03,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:03,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:03,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:03,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:03,451 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-02 11:45:03,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:45:03,452 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:45:03,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:04,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:04,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 2887 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 11:45:04,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:45:04,262 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-02 11:45:04,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:45:04,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2019-10-02 11:45:04,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 11:45:04,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 11:45:04,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:45:04,280 INFO L87 Difference]: Start difference. First operand 708 states and 1104 transitions. Second operand 14 states. [2019-10-02 11:45:04,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:04,648 INFO L93 Difference]: Finished difference Result 1405 states and 2210 transitions. [2019-10-02 11:45:04,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 11:45:04,649 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 120 [2019-10-02 11:45:04,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:04,655 INFO L225 Difference]: With dead ends: 1405 [2019-10-02 11:45:04,655 INFO L226 Difference]: Without dead ends: 730 [2019-10-02 11:45:04,659 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-10-02 11:45:04,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2019-10-02 11:45:04,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 718. [2019-10-02 11:45:04,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 718 states. [2019-10-02 11:45:04,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1123 transitions. [2019-10-02 11:45:04,685 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1123 transitions. Word has length 120 [2019-10-02 11:45:04,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:04,685 INFO L475 AbstractCegarLoop]: Abstraction has 718 states and 1123 transitions. [2019-10-02 11:45:04,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 11:45:04,686 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1123 transitions. [2019-10-02 11:45:04,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-02 11:45:04,688 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:04,688 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:45:04,689 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:04,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:04,689 INFO L82 PathProgramCache]: Analyzing trace with hash -286992483, now seen corresponding path program 1 times [2019-10-02 11:45:04,689 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:04,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:04,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:04,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:04,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:04,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:04,809 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-02 11:45:04,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:45:04,810 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:45:04,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:05,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:05,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 2893 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 11:45:05,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:45:05,415 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-02 11:45:05,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:45:05,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-10-02 11:45:05,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:45:05,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:45:05,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:45:05,426 INFO L87 Difference]: Start difference. First operand 718 states and 1123 transitions. Second operand 8 states. [2019-10-02 11:45:05,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:05,575 INFO L93 Difference]: Finished difference Result 1421 states and 2251 transitions. [2019-10-02 11:45:05,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:45:05,576 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 122 [2019-10-02 11:45:05,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:05,582 INFO L225 Difference]: With dead ends: 1421 [2019-10-02 11:45:05,582 INFO L226 Difference]: Without dead ends: 734 [2019-10-02 11:45:05,586 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:45:05,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2019-10-02 11:45:05,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 726. [2019-10-02 11:45:05,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2019-10-02 11:45:05,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1137 transitions. [2019-10-02 11:45:05,621 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1137 transitions. Word has length 122 [2019-10-02 11:45:05,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:05,622 INFO L475 AbstractCegarLoop]: Abstraction has 726 states and 1137 transitions. [2019-10-02 11:45:05,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:45:05,622 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1137 transitions. [2019-10-02 11:45:05,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-02 11:45:05,624 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:05,624 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:45:05,625 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:05,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:05,625 INFO L82 PathProgramCache]: Analyzing trace with hash -157239993, now seen corresponding path program 1 times [2019-10-02 11:45:05,625 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:05,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:05,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:05,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:05,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:05,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:05,780 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-02 11:45:05,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:45:05,783 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:45:05,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:06,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:06,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 2894 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 11:45:06,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:45:06,357 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-02 11:45:06,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:45:06,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-10-02 11:45:06,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:45:06,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:45:06,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:45:06,375 INFO L87 Difference]: Start difference. First operand 726 states and 1137 transitions. Second operand 8 states. [2019-10-02 11:45:06,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:06,520 INFO L93 Difference]: Finished difference Result 1433 states and 2272 transitions. [2019-10-02 11:45:06,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:45:06,520 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 123 [2019-10-02 11:45:06,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:06,527 INFO L225 Difference]: With dead ends: 1433 [2019-10-02 11:45:06,527 INFO L226 Difference]: Without dead ends: 738 [2019-10-02 11:45:06,531 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:45:06,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2019-10-02 11:45:06,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 730. [2019-10-02 11:45:06,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2019-10-02 11:45:06,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1145 transitions. [2019-10-02 11:45:06,558 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1145 transitions. Word has length 123 [2019-10-02 11:45:06,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:06,558 INFO L475 AbstractCegarLoop]: Abstraction has 730 states and 1145 transitions. [2019-10-02 11:45:06,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:45:06,559 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1145 transitions. [2019-10-02 11:45:06,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-02 11:45:06,561 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:06,561 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:45:06,561 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:06,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:06,562 INFO L82 PathProgramCache]: Analyzing trace with hash 170719266, now seen corresponding path program 1 times [2019-10-02 11:45:06,562 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:06,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:06,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:06,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:06,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:06,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:06,752 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 11:45:06,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:45:06,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:45:06,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:45:06,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:45:06,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:45:06,755 INFO L87 Difference]: Start difference. First operand 730 states and 1145 transitions. Second operand 9 states. [2019-10-02 11:45:07,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:07,003 INFO L93 Difference]: Finished difference Result 1375 states and 2155 transitions. [2019-10-02 11:45:07,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 11:45:07,004 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 124 [2019-10-02 11:45:07,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:07,010 INFO L225 Difference]: With dead ends: 1375 [2019-10-02 11:45:07,010 INFO L226 Difference]: Without dead ends: 740 [2019-10-02 11:45:07,014 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:45:07,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2019-10-02 11:45:07,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 736. [2019-10-02 11:45:07,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2019-10-02 11:45:07,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1152 transitions. [2019-10-02 11:45:07,049 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1152 transitions. Word has length 124 [2019-10-02 11:45:07,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:07,049 INFO L475 AbstractCegarLoop]: Abstraction has 736 states and 1152 transitions. [2019-10-02 11:45:07,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:45:07,049 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1152 transitions. [2019-10-02 11:45:07,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-02 11:45:07,052 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:07,052 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:45:07,052 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:07,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:07,053 INFO L82 PathProgramCache]: Analyzing trace with hash -820149515, now seen corresponding path program 1 times [2019-10-02 11:45:07,053 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:07,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:07,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:07,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:07,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:07,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:07,279 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 11:45:07,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:45:07,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:45:07,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:45:07,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:45:07,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:45:07,281 INFO L87 Difference]: Start difference. First operand 736 states and 1152 transitions. Second operand 9 states. [2019-10-02 11:45:07,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:07,550 INFO L93 Difference]: Finished difference Result 1377 states and 2156 transitions. [2019-10-02 11:45:07,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 11:45:07,551 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 125 [2019-10-02 11:45:07,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:07,558 INFO L225 Difference]: With dead ends: 1377 [2019-10-02 11:45:07,559 INFO L226 Difference]: Without dead ends: 742 [2019-10-02 11:45:07,564 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:45:07,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2019-10-02 11:45:07,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 736. [2019-10-02 11:45:07,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2019-10-02 11:45:07,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1152 transitions. [2019-10-02 11:45:07,644 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1152 transitions. Word has length 125 [2019-10-02 11:45:07,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:07,645 INFO L475 AbstractCegarLoop]: Abstraction has 736 states and 1152 transitions. [2019-10-02 11:45:07,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:45:07,645 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1152 transitions. [2019-10-02 11:45:07,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-02 11:45:07,648 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:07,648 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:45:07,648 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:07,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:07,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1004398071, now seen corresponding path program 1 times [2019-10-02 11:45:07,649 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:07,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:07,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:07,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:07,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:07,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:07,768 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-02 11:45:07,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:45:07,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:45:07,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:45:07,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:45:07,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:45:07,770 INFO L87 Difference]: Start difference. First operand 736 states and 1152 transitions. Second operand 4 states. [2019-10-02 11:45:07,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:07,833 INFO L93 Difference]: Finished difference Result 1419 states and 2241 transitions. [2019-10-02 11:45:07,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:45:07,833 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2019-10-02 11:45:07,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:07,838 INFO L225 Difference]: With dead ends: 1419 [2019-10-02 11:45:07,838 INFO L226 Difference]: Without dead ends: 713 [2019-10-02 11:45:07,843 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:45:07,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2019-10-02 11:45:07,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 713. [2019-10-02 11:45:07,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2019-10-02 11:45:07,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1104 transitions. [2019-10-02 11:45:07,883 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1104 transitions. Word has length 125 [2019-10-02 11:45:07,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:07,885 INFO L475 AbstractCegarLoop]: Abstraction has 713 states and 1104 transitions. [2019-10-02 11:45:07,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:45:07,885 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1104 transitions. [2019-10-02 11:45:07,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-02 11:45:07,892 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:07,893 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:45:07,893 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:07,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:07,894 INFO L82 PathProgramCache]: Analyzing trace with hash 2039845598, now seen corresponding path program 1 times [2019-10-02 11:45:07,894 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:07,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:07,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:07,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:07,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:07,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:08,056 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 11:45:08,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:45:08,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:45:08,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:45:08,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:45:08,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:45:08,058 INFO L87 Difference]: Start difference. First operand 713 states and 1104 transitions. Second operand 6 states. [2019-10-02 11:45:08,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:08,265 INFO L93 Difference]: Finished difference Result 1413 states and 2212 transitions. [2019-10-02 11:45:08,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:45:08,266 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 126 [2019-10-02 11:45:08,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:08,272 INFO L225 Difference]: With dead ends: 1413 [2019-10-02 11:45:08,272 INFO L226 Difference]: Without dead ends: 723 [2019-10-02 11:45:08,278 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:45:08,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2019-10-02 11:45:08,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 720. [2019-10-02 11:45:08,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-10-02 11:45:08,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1108 transitions. [2019-10-02 11:45:08,308 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1108 transitions. Word has length 126 [2019-10-02 11:45:08,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:08,308 INFO L475 AbstractCegarLoop]: Abstraction has 720 states and 1108 transitions. [2019-10-02 11:45:08,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:45:08,309 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1108 transitions. [2019-10-02 11:45:08,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-02 11:45:08,312 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:08,312 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:45:08,312 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:08,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:08,313 INFO L82 PathProgramCache]: Analyzing trace with hash -748962532, now seen corresponding path program 1 times [2019-10-02 11:45:08,313 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:08,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:08,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:08,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:08,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:08,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:08,444 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-02 11:45:08,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:45:08,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 11:45:08,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:45:08,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:45:08,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:45:08,446 INFO L87 Difference]: Start difference. First operand 720 states and 1108 transitions. Second operand 7 states. [2019-10-02 11:45:08,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:08,547 INFO L93 Difference]: Finished difference Result 1359 states and 2109 transitions. [2019-10-02 11:45:08,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:45:08,548 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 126 [2019-10-02 11:45:08,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:08,553 INFO L225 Difference]: With dead ends: 1359 [2019-10-02 11:45:08,553 INFO L226 Difference]: Without dead ends: 706 [2019-10-02 11:45:08,557 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:45:08,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2019-10-02 11:45:08,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 704. [2019-10-02 11:45:08,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2019-10-02 11:45:08,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 1075 transitions. [2019-10-02 11:45:08,581 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 1075 transitions. Word has length 126 [2019-10-02 11:45:08,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:08,581 INFO L475 AbstractCegarLoop]: Abstraction has 704 states and 1075 transitions. [2019-10-02 11:45:08,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:45:08,581 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 1075 transitions. [2019-10-02 11:45:08,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-02 11:45:08,584 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:08,584 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:45:08,584 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:08,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:08,585 INFO L82 PathProgramCache]: Analyzing trace with hash 354277167, now seen corresponding path program 1 times [2019-10-02 11:45:08,585 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:08,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:08,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:08,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:08,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:08,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:08,774 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 11:45:08,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:45:08,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 11:45:08,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 11:45:08,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 11:45:08,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:45:08,777 INFO L87 Difference]: Start difference. First operand 704 states and 1075 transitions. Second operand 11 states. [2019-10-02 11:45:09,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:09,063 INFO L93 Difference]: Finished difference Result 1337 states and 2071 transitions. [2019-10-02 11:45:09,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 11:45:09,064 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 127 [2019-10-02 11:45:09,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:09,069 INFO L225 Difference]: With dead ends: 1337 [2019-10-02 11:45:09,069 INFO L226 Difference]: Without dead ends: 700 [2019-10-02 11:45:09,072 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 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-10-02 11:45:09,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2019-10-02 11:45:09,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 698. [2019-10-02 11:45:09,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 698 states. [2019-10-02 11:45:09,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1065 transitions. [2019-10-02 11:45:09,095 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 1065 transitions. Word has length 127 [2019-10-02 11:45:09,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:09,096 INFO L475 AbstractCegarLoop]: Abstraction has 698 states and 1065 transitions. [2019-10-02 11:45:09,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 11:45:09,096 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1065 transitions. [2019-10-02 11:45:09,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-02 11:45:09,098 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:09,098 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:45:09,099 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:09,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:09,099 INFO L82 PathProgramCache]: Analyzing trace with hash -2029888428, now seen corresponding path program 1 times [2019-10-02 11:45:09,099 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:09,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:09,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:09,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:09,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:09,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:09,240 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 11:45:09,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:45:09,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:45:09,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:45:09,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:45:09,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:45:09,241 INFO L87 Difference]: Start difference. First operand 698 states and 1065 transitions. Second operand 3 states. [2019-10-02 11:45:09,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:09,422 INFO L93 Difference]: Finished difference Result 1944 states and 3042 transitions. [2019-10-02 11:45:09,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:45:09,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-10-02 11:45:09,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:09,430 INFO L225 Difference]: With dead ends: 1944 [2019-10-02 11:45:09,431 INFO L226 Difference]: Without dead ends: 1319 [2019-10-02 11:45:09,434 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:45:09,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2019-10-02 11:45:09,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1248. [2019-10-02 11:45:09,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1248 states. [2019-10-02 11:45:09,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1248 states and 1942 transitions. [2019-10-02 11:45:09,486 INFO L78 Accepts]: Start accepts. Automaton has 1248 states and 1942 transitions. Word has length 129 [2019-10-02 11:45:09,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:09,487 INFO L475 AbstractCegarLoop]: Abstraction has 1248 states and 1942 transitions. [2019-10-02 11:45:09,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:45:09,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 1942 transitions. [2019-10-02 11:45:09,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-10-02 11:45:09,493 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:09,494 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:45:09,494 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:09,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:09,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1720671671, now seen corresponding path program 1 times [2019-10-02 11:45:09,495 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:09,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:09,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:09,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:09,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:09,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:09,680 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 11:45:09,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:45:09,681 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:45:09,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:10,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:10,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 3275 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 11:45:10,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:45:10,305 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 11:45:10,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:45:10,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-10-02 11:45:10,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:45:10,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:45:10,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:45:10,314 INFO L87 Difference]: Start difference. First operand 1248 states and 1942 transitions. Second operand 9 states. [2019-10-02 11:45:11,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:11,666 INFO L93 Difference]: Finished difference Result 2431 states and 3885 transitions. [2019-10-02 11:45:11,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:45:11,667 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 188 [2019-10-02 11:45:11,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:11,677 INFO L225 Difference]: With dead ends: 2431 [2019-10-02 11:45:11,677 INFO L226 Difference]: Without dead ends: 1256 [2019-10-02 11:45:11,685 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 186 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-10-02 11:45:11,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2019-10-02 11:45:11,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 1256. [2019-10-02 11:45:11,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2019-10-02 11:45:11,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1950 transitions. [2019-10-02 11:45:11,746 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1950 transitions. Word has length 188 [2019-10-02 11:45:11,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:11,747 INFO L475 AbstractCegarLoop]: Abstraction has 1256 states and 1950 transitions. [2019-10-02 11:45:11,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:45:11,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1950 transitions. [2019-10-02 11:45:11,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-10-02 11:45:11,754 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:11,754 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:45:11,755 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:11,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:11,755 INFO L82 PathProgramCache]: Analyzing trace with hash 368189729, now seen corresponding path program 1 times [2019-10-02 11:45:11,755 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:11,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:11,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:11,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:11,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:11,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:12,031 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 11:45:12,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:45:12,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 11:45:12,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 11:45:12,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 11:45:12,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:45:12,033 INFO L87 Difference]: Start difference. First operand 1256 states and 1950 transitions. Second operand 10 states. [2019-10-02 11:45:13,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:13,245 INFO L93 Difference]: Finished difference Result 2938 states and 4566 transitions. [2019-10-02 11:45:13,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 11:45:13,246 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 189 [2019-10-02 11:45:13,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:13,260 INFO L225 Difference]: With dead ends: 2938 [2019-10-02 11:45:13,260 INFO L226 Difference]: Without dead ends: 1755 [2019-10-02 11:45:13,271 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-10-02 11:45:13,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1755 states. [2019-10-02 11:45:13,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1755 to 1751. [2019-10-02 11:45:13,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1751 states. [2019-10-02 11:45:13,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1751 states to 1751 states and 2676 transitions. [2019-10-02 11:45:13,347 INFO L78 Accepts]: Start accepts. Automaton has 1751 states and 2676 transitions. Word has length 189 [2019-10-02 11:45:13,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:13,348 INFO L475 AbstractCegarLoop]: Abstraction has 1751 states and 2676 transitions. [2019-10-02 11:45:13,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 11:45:13,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1751 states and 2676 transitions. [2019-10-02 11:45:13,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-10-02 11:45:13,360 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:13,361 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:45:13,361 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:13,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:13,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1215795039, now seen corresponding path program 1 times [2019-10-02 11:45:13,361 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:13,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:13,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:13,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:13,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:13,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:13,525 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 11:45:13,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:45:13,526 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:45:13,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:14,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:14,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 3277 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 11:45:14,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:45:14,216 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (12)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:45:14,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:45:14,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-10-02 11:45:14,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:45:14,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:45:14,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:45:14,238 INFO L87 Difference]: Start difference. First operand 1751 states and 2676 transitions. Second operand 9 states. [2019-10-02 11:45:15,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:15,746 INFO L93 Difference]: Finished difference Result 3449 states and 5436 transitions. [2019-10-02 11:45:15,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:45:15,747 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 190 [2019-10-02 11:45:15,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:15,761 INFO L225 Difference]: With dead ends: 3449 [2019-10-02 11:45:15,761 INFO L226 Difference]: Without dead ends: 1771 [2019-10-02 11:45:15,772 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 189 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-10-02 11:45:15,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1771 states. [2019-10-02 11:45:15,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1771 to 1771. [2019-10-02 11:45:15,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1771 states. [2019-10-02 11:45:15,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 2696 transitions. [2019-10-02 11:45:15,840 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 2696 transitions. Word has length 190 [2019-10-02 11:45:15,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:15,840 INFO L475 AbstractCegarLoop]: Abstraction has 1771 states and 2696 transitions. [2019-10-02 11:45:15,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:45:15,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2696 transitions. [2019-10-02 11:45:15,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-02 11:45:15,847 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:15,847 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:45:15,848 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:15,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:15,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1509516855, now seen corresponding path program 1 times [2019-10-02 11:45:15,848 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:15,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:15,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:15,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:15,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:15,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:16,000 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 11:45:16,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:45:16,000 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:45:16,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:16,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:16,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 3279 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 11:45:16,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:45:16,680 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (13)] Exception during sending of exit command (exit): Stream closed [2019-10-02 11:45:16,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:45:16,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-10-02 11:45:16,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:45:16,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:45:16,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:45:16,691 INFO L87 Difference]: Start difference. First operand 1771 states and 2696 transitions. Second operand 9 states. [2019-10-02 11:45:18,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:18,188 INFO L93 Difference]: Finished difference Result 3493 states and 5476 transitions. [2019-10-02 11:45:18,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:45:18,188 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 192 [2019-10-02 11:45:18,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:18,198 INFO L225 Difference]: With dead ends: 3493 [2019-10-02 11:45:18,198 INFO L226 Difference]: Without dead ends: 1795 [2019-10-02 11:45:18,207 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 191 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-10-02 11:45:18,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1795 states. [2019-10-02 11:45:18,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1795 to 1795. [2019-10-02 11:45:18,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1795 states. [2019-10-02 11:45:18,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 2720 transitions. [2019-10-02 11:45:18,281 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 2720 transitions. Word has length 192 [2019-10-02 11:45:18,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:18,282 INFO L475 AbstractCegarLoop]: Abstraction has 1795 states and 2720 transitions. [2019-10-02 11:45:18,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:45:18,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 2720 transitions. [2019-10-02 11:45:18,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-10-02 11:45:18,289 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:18,289 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:45:18,290 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:18,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:18,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1820459735, now seen corresponding path program 1 times [2019-10-02 11:45:18,290 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:18,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:18,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:18,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:18,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:18,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:18,518 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 11:45:18,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:45:18,518 INFO L224 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-10-02 11:45:18,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:19,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:19,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 3281 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 11:45:19,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:45:19,160 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (14)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:45:19,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:45:19,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-10-02 11:45:19,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:45:19,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:45:19,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:45:19,171 INFO L87 Difference]: Start difference. First operand 1795 states and 2720 transitions. Second operand 9 states. [2019-10-02 11:45:20,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:20,825 INFO L93 Difference]: Finished difference Result 3545 states and 5524 transitions. [2019-10-02 11:45:20,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:45:20,826 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 194 [2019-10-02 11:45:20,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:20,838 INFO L225 Difference]: With dead ends: 3545 [2019-10-02 11:45:20,839 INFO L226 Difference]: Without dead ends: 1823 [2019-10-02 11:45:20,850 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 193 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-10-02 11:45:20,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1823 states. [2019-10-02 11:45:20,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1823 to 1823. [2019-10-02 11:45:20,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1823 states. [2019-10-02 11:45:20,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1823 states to 1823 states and 2748 transitions. [2019-10-02 11:45:20,934 INFO L78 Accepts]: Start accepts. Automaton has 1823 states and 2748 transitions. Word has length 194 [2019-10-02 11:45:20,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:20,935 INFO L475 AbstractCegarLoop]: Abstraction has 1823 states and 2748 transitions. [2019-10-02 11:45:20,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:45:20,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1823 states and 2748 transitions. [2019-10-02 11:45:20,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-10-02 11:45:20,941 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:20,942 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:45:20,942 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:20,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:20,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1832558775, now seen corresponding path program 1 times [2019-10-02 11:45:20,942 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:20,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:20,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:20,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:20,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:20,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:21,132 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 11:45:21,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:45:21,133 INFO L224 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-10-02 11:45:21,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:21,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:21,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 3283 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-02 11:45:21,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:45:21,877 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 11:45:21,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:45:21,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2019-10-02 11:45:21,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 11:45:21,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 11:45:21,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-10-02 11:45:21,888 INFO L87 Difference]: Start difference. First operand 1823 states and 2748 transitions. Second operand 16 states. [2019-10-02 11:46:00,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:46:00,947 INFO L93 Difference]: Finished difference Result 13308 states and 21587 transitions. [2019-10-02 11:46:00,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-10-02 11:46:00,950 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 196 [2019-10-02 11:46:00,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:46:01,017 INFO L225 Difference]: With dead ends: 13308 [2019-10-02 11:46:01,018 INFO L226 Difference]: Without dead ends: 11558 [2019-10-02 11:46:01,033 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3031 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=926, Invalid=8194, Unknown=0, NotChecked=0, Total=9120 [2019-10-02 11:46:01,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11558 states. [2019-10-02 11:46:01,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11558 to 10766. [2019-10-02 11:46:01,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10766 states. [2019-10-02 11:46:01,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10766 states to 10766 states and 16843 transitions. [2019-10-02 11:46:01,542 INFO L78 Accepts]: Start accepts. Automaton has 10766 states and 16843 transitions. Word has length 196 [2019-10-02 11:46:01,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:46:01,542 INFO L475 AbstractCegarLoop]: Abstraction has 10766 states and 16843 transitions. [2019-10-02 11:46:01,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 11:46:01,543 INFO L276 IsEmpty]: Start isEmpty. Operand 10766 states and 16843 transitions. [2019-10-02 11:46:01,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-10-02 11:46:01,556 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:46:01,558 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:46:01,558 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:46:01,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:46:01,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1251517462, now seen corresponding path program 1 times [2019-10-02 11:46:01,559 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:46:01,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:46:01,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:46:01,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:46:01,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:46:01,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:46:01,719 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 11:46:01,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:46:01,720 INFO L224 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) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:46:01,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:46:02,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:46:02,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 3300 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 11:46:02,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:46:02,471 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (16)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:46:02,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:46:02,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2019-10-02 11:46:02,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 11:46:02,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 11:46:02,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:46:02,483 INFO L87 Difference]: Start difference. First operand 10766 states and 16843 transitions. Second operand 12 states. [2019-10-02 11:46:03,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:46:03,053 INFO L93 Difference]: Finished difference Result 21137 states and 33079 transitions. [2019-10-02 11:46:03,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 11:46:03,054 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 202 [2019-10-02 11:46:03,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:46:03,116 INFO L225 Difference]: With dead ends: 21137 [2019-10-02 11:46:03,116 INFO L226 Difference]: Without dead ends: 10412 [2019-10-02 11:46:03,150 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2019-10-02 11:46:03,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10412 states. [2019-10-02 11:46:03,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10412 to 10380. [2019-10-02 11:46:03,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10380 states. [2019-10-02 11:46:03,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10380 states to 10380 states and 16143 transitions. [2019-10-02 11:46:03,585 INFO L78 Accepts]: Start accepts. Automaton has 10380 states and 16143 transitions. Word has length 202 [2019-10-02 11:46:03,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:46:03,586 INFO L475 AbstractCegarLoop]: Abstraction has 10380 states and 16143 transitions. [2019-10-02 11:46:03,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 11:46:03,586 INFO L276 IsEmpty]: Start isEmpty. Operand 10380 states and 16143 transitions. [2019-10-02 11:46:03,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-10-02 11:46:03,593 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:46:03,593 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:46:03,593 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:46:03,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:46:03,594 INFO L82 PathProgramCache]: Analyzing trace with hash 349124867, now seen corresponding path program 1 times [2019-10-02 11:46:03,594 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:46:03,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:46:03,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:46:03,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:46:03,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:46:03,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:46:03,833 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 11:46:03,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:46:03,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 11:46:03,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 11:46:03,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 11:46:03,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:46:03,834 INFO L87 Difference]: Start difference. First operand 10380 states and 16143 transitions. Second operand 11 states. [2019-10-02 11:46:13,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:46:13,641 INFO L93 Difference]: Finished difference Result 20871 states and 33038 transitions. [2019-10-02 11:46:13,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 11:46:13,642 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 212 [2019-10-02 11:46:13,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:46:13,691 INFO L225 Difference]: With dead ends: 20871 [2019-10-02 11:46:13,691 INFO L226 Difference]: Without dead ends: 10566 [2019-10-02 11:46:13,719 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2019-10-02 11:46:13,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10566 states. [2019-10-02 11:46:14,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10566 to 10380. [2019-10-02 11:46:14,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10380 states. [2019-10-02 11:46:14,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10380 states to 10380 states and 16131 transitions. [2019-10-02 11:46:14,133 INFO L78 Accepts]: Start accepts. Automaton has 10380 states and 16131 transitions. Word has length 212 [2019-10-02 11:46:14,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:46:14,133 INFO L475 AbstractCegarLoop]: Abstraction has 10380 states and 16131 transitions. [2019-10-02 11:46:14,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 11:46:14,134 INFO L276 IsEmpty]: Start isEmpty. Operand 10380 states and 16131 transitions. [2019-10-02 11:46:14,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-10-02 11:46:14,144 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:46:14,144 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:46:14,145 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:46:14,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:46:14,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1958866784, now seen corresponding path program 1 times [2019-10-02 11:46:14,145 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:46:14,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:46:14,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:46:14,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:46:14,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:46:14,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:46:14,310 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 11:46:14,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:46:14,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:46:14,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:46:14,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:46:14,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:46:14,312 INFO L87 Difference]: Start difference. First operand 10380 states and 16131 transitions. Second operand 6 states. [2019-10-02 11:46:19,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:46:19,899 INFO L93 Difference]: Finished difference Result 27557 states and 45688 transitions. [2019-10-02 11:46:19,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:46:19,899 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 226 [2019-10-02 11:46:19,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:46:20,006 INFO L225 Difference]: With dead ends: 27557 [2019-10-02 11:46:20,006 INFO L226 Difference]: Without dead ends: 17250 [2019-10-02 11:46:20,059 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 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-10-02 11:46:20,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17250 states. [2019-10-02 11:46:20,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17250 to 16078. [2019-10-02 11:46:20,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16078 states. [2019-10-02 11:46:20,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16078 states to 16078 states and 25119 transitions. [2019-10-02 11:46:20,972 INFO L78 Accepts]: Start accepts. Automaton has 16078 states and 25119 transitions. Word has length 226 [2019-10-02 11:46:20,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:46:20,973 INFO L475 AbstractCegarLoop]: Abstraction has 16078 states and 25119 transitions. [2019-10-02 11:46:20,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:46:20,973 INFO L276 IsEmpty]: Start isEmpty. Operand 16078 states and 25119 transitions. [2019-10-02 11:46:20,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-10-02 11:46:20,981 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:46:20,982 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:46:20,982 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:46:20,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:46:20,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1882376623, now seen corresponding path program 1 times [2019-10-02 11:46:20,983 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:46:20,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:46:20,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:46:20,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:46:20,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:46:21,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:46:21,194 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 11:46:21,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:46:21,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:46:21,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:46:21,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:46:21,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:46:21,196 INFO L87 Difference]: Start difference. First operand 16078 states and 25119 transitions. Second operand 6 states. [2019-10-02 11:46:26,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:46:26,712 INFO L93 Difference]: Finished difference Result 47484 states and 81186 transitions. [2019-10-02 11:46:26,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:46:26,713 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 227 [2019-10-02 11:46:26,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:46:26,958 INFO L225 Difference]: With dead ends: 47484 [2019-10-02 11:46:26,958 INFO L226 Difference]: Without dead ends: 31479 [2019-10-02 11:46:27,324 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 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-10-02 11:46:27,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31479 states. [2019-10-02 11:46:28,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31479 to 28680. [2019-10-02 11:46:28,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28680 states. [2019-10-02 11:46:28,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28680 states to 28680 states and 45479 transitions. [2019-10-02 11:46:28,883 INFO L78 Accepts]: Start accepts. Automaton has 28680 states and 45479 transitions. Word has length 227 [2019-10-02 11:46:28,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:46:28,884 INFO L475 AbstractCegarLoop]: Abstraction has 28680 states and 45479 transitions. [2019-10-02 11:46:28,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:46:28,884 INFO L276 IsEmpty]: Start isEmpty. Operand 28680 states and 45479 transitions. [2019-10-02 11:46:28,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-10-02 11:46:28,892 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:46:28,893 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:46:28,893 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:46:28,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:46:28,893 INFO L82 PathProgramCache]: Analyzing trace with hash -345974844, now seen corresponding path program 1 times [2019-10-02 11:46:28,894 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:46:28,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:46:28,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:46:28,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:46:28,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:46:28,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:46:29,121 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 11:46:29,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:46:29,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:46:29,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:46:29,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:46:29,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:46:29,122 INFO L87 Difference]: Start difference. First operand 28680 states and 45479 transitions. Second operand 6 states. [2019-10-02 11:46:36,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:46:36,965 INFO L93 Difference]: Finished difference Result 92978 states and 166787 transitions. [2019-10-02 11:46:36,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:46:36,966 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 228 [2019-10-02 11:46:36,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:46:37,381 INFO L225 Difference]: With dead ends: 92978 [2019-10-02 11:46:37,381 INFO L226 Difference]: Without dead ends: 64371 [2019-10-02 11:46:37,532 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 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-10-02 11:46:37,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64371 states. [2019-10-02 11:46:40,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64371 to 57316. [2019-10-02 11:46:40,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57316 states. [2019-10-02 11:46:40,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57316 states to 57316 states and 93191 transitions. [2019-10-02 11:46:40,808 INFO L78 Accepts]: Start accepts. Automaton has 57316 states and 93191 transitions. Word has length 228 [2019-10-02 11:46:40,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:46:40,808 INFO L475 AbstractCegarLoop]: Abstraction has 57316 states and 93191 transitions. [2019-10-02 11:46:40,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:46:40,809 INFO L276 IsEmpty]: Start isEmpty. Operand 57316 states and 93191 transitions. [2019-10-02 11:46:40,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-10-02 11:46:40,817 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:46:40,817 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:46:40,817 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:46:40,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:46:40,818 INFO L82 PathProgramCache]: Analyzing trace with hash -796953163, now seen corresponding path program 1 times [2019-10-02 11:46:40,818 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:46:40,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:46:40,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:46:40,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:46:40,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:46:40,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:46:41,004 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 11:46:41,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:46:41,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:46:41,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:46:41,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:46:41,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:46:41,005 INFO L87 Difference]: Start difference. First operand 57316 states and 93191 transitions. Second operand 6 states. [2019-10-02 11:46:53,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:46:53,484 INFO L93 Difference]: Finished difference Result 200454 states and 382916 transitions. [2019-10-02 11:46:53,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:46:53,485 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 229 [2019-10-02 11:46:53,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:46:57,994 INFO L225 Difference]: With dead ends: 200454 [2019-10-02 11:46:57,995 INFO L226 Difference]: Without dead ends: 143211 [2019-10-02 11:46:58,277 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 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-10-02 11:46:58,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143211 states. [2019-10-02 11:47:04,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143211 to 124650. [2019-10-02 11:47:04,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124650 states. [2019-10-02 11:47:05,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124650 states to 124650 states and 209699 transitions. [2019-10-02 11:47:05,946 INFO L78 Accepts]: Start accepts. Automaton has 124650 states and 209699 transitions. Word has length 229 [2019-10-02 11:47:05,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:47:05,947 INFO L475 AbstractCegarLoop]: Abstraction has 124650 states and 209699 transitions. [2019-10-02 11:47:05,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:47:05,947 INFO L276 IsEmpty]: Start isEmpty. Operand 124650 states and 209699 transitions. [2019-10-02 11:47:05,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-02 11:47:05,958 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:47:05,959 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:47:05,959 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:47:05,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:47:05,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1567794920, now seen corresponding path program 1 times [2019-10-02 11:47:05,959 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:47:05,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:47:05,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:47:05,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:47:05,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:47:06,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:47:06,125 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 11:47:06,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:47:06,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:47:06,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:47:06,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:47:06,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:47:06,126 INFO L87 Difference]: Start difference. First operand 124650 states and 209699 transitions. Second operand 6 states. [2019-10-02 11:47:36,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:47:36,016 INFO L93 Difference]: Finished difference Result 464270 states and 954329 transitions. [2019-10-02 11:47:36,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:47:36,021 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 230 [2019-10-02 11:47:36,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:47:38,106 INFO L225 Difference]: With dead ends: 464270 [2019-10-02 11:47:38,106 INFO L226 Difference]: Without dead ends: 339693 [2019-10-02 11:47:38,976 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 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-10-02 11:47:39,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339693 states. [2019-10-02 11:48:10,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339693 to 289210. [2019-10-02 11:48:10,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289210 states. [2019-10-02 11:48:14,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289210 states to 289210 states and 506813 transitions. [2019-10-02 11:48:14,498 INFO L78 Accepts]: Start accepts. Automaton has 289210 states and 506813 transitions. Word has length 230 [2019-10-02 11:48:14,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:48:14,499 INFO L475 AbstractCegarLoop]: Abstraction has 289210 states and 506813 transitions. [2019-10-02 11:48:14,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:48:14,499 INFO L276 IsEmpty]: Start isEmpty. Operand 289210 states and 506813 transitions. [2019-10-02 11:48:14,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-02 11:48:14,506 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:48:14,507 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:48:14,507 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:48:14,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:48:14,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1359096617, now seen corresponding path program 1 times [2019-10-02 11:48:14,507 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:48:14,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:48:14,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:14,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:48:14,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:14,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:48:14,697 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 11:48:14,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:48:14,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 11:48:14,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 11:48:14,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 11:48:14,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:48:14,699 INFO L87 Difference]: Start difference. First operand 289210 states and 506813 transitions. Second operand 11 states. [2019-10-02 11:49:00,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:49:00,721 INFO L93 Difference]: Finished difference Result 617851 states and 1101761 transitions. [2019-10-02 11:49:00,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 11:49:00,722 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 230 [2019-10-02 11:49:00,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:49:02,592 INFO L225 Difference]: With dead ends: 617851 [2019-10-02 11:49:02,592 INFO L226 Difference]: Without dead ends: 328747 [2019-10-02 11:49:04,836 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=829, Unknown=0, NotChecked=0, Total=992 [2019-10-02 11:49:05,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328747 states. [2019-10-02 11:49:32,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328747 to 317984. [2019-10-02 11:49:32,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317984 states. [2019-10-02 11:49:36,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317984 states to 317984 states and 547531 transitions. [2019-10-02 11:49:36,861 INFO L78 Accepts]: Start accepts. Automaton has 317984 states and 547531 transitions. Word has length 230 [2019-10-02 11:49:36,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:49:36,861 INFO L475 AbstractCegarLoop]: Abstraction has 317984 states and 547531 transitions. [2019-10-02 11:49:36,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 11:49:36,861 INFO L276 IsEmpty]: Start isEmpty. Operand 317984 states and 547531 transitions. [2019-10-02 11:49:36,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-10-02 11:49:36,871 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:49:36,871 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:49:36,871 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:49:36,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:49:36,871 INFO L82 PathProgramCache]: Analyzing trace with hash 889861334, now seen corresponding path program 1 times [2019-10-02 11:49:36,872 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:49:36,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:49:36,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:36,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:49:36,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:36,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:49:47,155 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-10-02 11:49:47,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:49:47,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:49:47,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:49:47,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:49:47,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:49:47,159 INFO L87 Difference]: Start difference. First operand 317984 states and 547531 transitions. Second operand 9 states. [2019-10-02 11:50:12,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:50:12,940 INFO L93 Difference]: Finished difference Result 641538 states and 1109639 transitions. [2019-10-02 11:50:12,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:50:12,940 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 236 [2019-10-02 11:50:12,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:50:15,623 INFO L225 Difference]: With dead ends: 641538 [2019-10-02 11:50:15,623 INFO L226 Difference]: Without dead ends: 323660 [2019-10-02 11:50:18,081 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:50:18,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323660 states. [2019-10-02 11:50:48,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323660 to 321284. [2019-10-02 11:50:48,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321284 states. [2019-10-02 11:50:53,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321284 states to 321284 states and 551821 transitions. [2019-10-02 11:50:53,837 INFO L78 Accepts]: Start accepts. Automaton has 321284 states and 551821 transitions. Word has length 236 [2019-10-02 11:50:53,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:50:53,837 INFO L475 AbstractCegarLoop]: Abstraction has 321284 states and 551821 transitions. [2019-10-02 11:50:53,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:50:53,837 INFO L276 IsEmpty]: Start isEmpty. Operand 321284 states and 551821 transitions. [2019-10-02 11:50:53,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-10-02 11:50:53,844 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:50:53,845 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:50:53,845 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:50:53,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:50:53,845 INFO L82 PathProgramCache]: Analyzing trace with hash 784920216, now seen corresponding path program 1 times [2019-10-02 11:50:53,845 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:50:53,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:50:53,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:53,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:50:53,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:53,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:50:53,983 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-10-02 11:50:53,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:50:53,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:50:53,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:50:53,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:50:53,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:50:53,984 INFO L87 Difference]: Start difference. First operand 321284 states and 551821 transitions. Second operand 5 states. [2019-10-02 11:51:30,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:51:30,718 INFO L93 Difference]: Finished difference Result 643340 states and 1101153 transitions. [2019-10-02 11:51:30,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:51:30,719 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 236 [2019-10-02 11:51:30,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:51:32,549 INFO L225 Difference]: With dead ends: 643340 [2019-10-02 11:51:32,549 INFO L226 Difference]: Without dead ends: 322224 [2019-10-02 11:51:35,256 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:51:35,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322224 states. [2019-10-02 11:52:08,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322224 to 321232. [2019-10-02 11:52:08,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321232 states. [2019-10-02 11:52:11,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321232 states to 321232 states and 551697 transitions. [2019-10-02 11:52:11,987 INFO L78 Accepts]: Start accepts. Automaton has 321232 states and 551697 transitions. Word has length 236 [2019-10-02 11:52:11,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:52:11,988 INFO L475 AbstractCegarLoop]: Abstraction has 321232 states and 551697 transitions. [2019-10-02 11:52:11,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:52:11,988 INFO L276 IsEmpty]: Start isEmpty. Operand 321232 states and 551697 transitions. [2019-10-02 11:52:11,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-10-02 11:52:11,994 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:52:11,994 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:52:11,994 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:52:11,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:52:11,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1921583309, now seen corresponding path program 1 times [2019-10-02 11:52:11,995 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:52:11,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:52:11,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:11,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:52:11,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:12,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:52:12,178 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-10-02 11:52:12,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:52:12,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:52:12,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:52:12,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:52:12,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:52:12,180 INFO L87 Difference]: Start difference. First operand 321232 states and 551697 transitions. Second operand 9 states. [2019-10-02 11:52:44,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:52:44,300 INFO L93 Difference]: Finished difference Result 647374 states and 1116639 transitions. [2019-10-02 11:52:44,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:52:44,300 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 235 [2019-10-02 11:52:44,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:52:46,154 INFO L225 Difference]: With dead ends: 647374 [2019-10-02 11:52:46,154 INFO L226 Difference]: Without dead ends: 326248 [2019-10-02 11:52:49,134 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:52:49,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326248 states. [2019-10-02 11:53:20,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326248 to 321562. [2019-10-02 11:53:20,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321562 states. [2019-10-02 11:53:25,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321562 states to 321562 states and 552027 transitions. [2019-10-02 11:53:26,031 INFO L78 Accepts]: Start accepts. Automaton has 321562 states and 552027 transitions. Word has length 235 [2019-10-02 11:53:26,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:53:26,031 INFO L475 AbstractCegarLoop]: Abstraction has 321562 states and 552027 transitions. [2019-10-02 11:53:26,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:53:26,032 INFO L276 IsEmpty]: Start isEmpty. Operand 321562 states and 552027 transitions. [2019-10-02 11:53:26,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-10-02 11:53:26,038 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:53:26,039 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 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] [2019-10-02 11:53:26,039 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:53:26,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:53:26,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1863540891, now seen corresponding path program 1 times [2019-10-02 11:53:26,039 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:53:26,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:53:26,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:53:26,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:53:26,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:53:26,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:53:26,194 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-10-02 11:53:26,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:53:26,194 INFO L224 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) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:53:26,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:53:26,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:53:26,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 3638 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 11:53:26,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:53:26,859 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-02 11:53:26,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:53:26,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2019-10-02 11:53:26,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:53:26,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:53:26,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:53:26,867 INFO L87 Difference]: Start difference. First operand 321562 states and 552027 transitions. Second operand 9 states. [2019-10-02 11:54:02,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:54:02,355 INFO L93 Difference]: Finished difference Result 645821 states and 1180140 transitions. [2019-10-02 11:54:02,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:54:02,356 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 240 [2019-10-02 11:54:02,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:54:04,830 INFO L225 Difference]: With dead ends: 645821 [2019-10-02 11:54:04,831 INFO L226 Difference]: Without dead ends: 324334 [2019-10-02 11:54:18,514 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:54:18,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324334 states. [2019-10-02 11:54:36,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324334 to 324334. [2019-10-02 11:54:36,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324334 states. [2019-10-02 11:54:40,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324334 states to 324334 states and 555591 transitions. [2019-10-02 11:54:40,241 INFO L78 Accepts]: Start accepts. Automaton has 324334 states and 555591 transitions. Word has length 240 [2019-10-02 11:54:40,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:54:40,241 INFO L475 AbstractCegarLoop]: Abstraction has 324334 states and 555591 transitions. [2019-10-02 11:54:40,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:54:40,241 INFO L276 IsEmpty]: Start isEmpty. Operand 324334 states and 555591 transitions. [2019-10-02 11:54:40,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-10-02 11:54:40,251 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:54:40,251 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:54:40,251 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:54:40,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:54:40,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1189836973, now seen corresponding path program 1 times [2019-10-02 11:54:40,252 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:54:40,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:54:40,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:40,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:40,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:40,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:42,005 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-10-02 11:54:42,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:54:42,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:54:42,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:54:42,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:54:42,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:54:42,007 INFO L87 Difference]: Start difference. First operand 324334 states and 555591 transitions. Second operand 6 states.